{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"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":"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":"_LabelsPainter.paint (cyclomatic 79): _LabelsPainter.paint has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_cartographic_layer.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71f777952977a2a797e4e965d11d4f1b85eae5c23b2469d47f0339298bd1b30"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleChangePresentation.fromChange (cyclomatic 73): ScheduleChangePresentation.fromChange has cyclomatic complexity 73 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/widgets/schedule_change_presentation.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a94e4caa803ee6b45c1223af9ed573edfb933e4cd093ab0ce4334c6255984ca"}},{"ruleId":"D1","level":"warning","message":{"text":"_VolumeLabelsPainter.paint (cyclomatic 61): _VolumeLabelsPainter.paint has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0906dee697af99017d495c5ebbc689fc5ccd825f29e13258e231f3a435791ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapPlaceDetailsSheetState.build (cyclomatic 58): _MapPlaceDetailsSheetState.build has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_details_sheet.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2a6c09ea40acc80d91c4b4ec5e625ff030e4030c2cab916f792871c1e75c47"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleDayView.build (cyclomatic 58): ScheduleDayView.build has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_day_view.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"504d9c9295da16842e7d36ea366fa4a4eb3393ba811033892b52a76e90b13421"}},{"ruleId":"D1","level":"warning","message":{"text":"index.createNotificationHandler.\u003Creturned closure\u003E (cyclomatic 53): index.createNotificationHandler.\u003Creturned closure\u003E has cyclomatic complexity 53 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. 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":"supabase/functions/miniapp-notify/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dc4d802d9fb5c8b259dd32f7a891b6170acb8d2542b848c6258533d0c27505"}},{"ruleId":"D1","level":"warning","message":{"text":"app_store_screenshots.update_screenshots (cyclomatic 49): app_store_screenshots.update_screenshots has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_screenshots.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac99aac0f410044cc35269b743a5d22c2981bb4930f8cddb1b501eb5041116e"}},{"ruleId":"D1","level":"warning","message":{"text":"release_manifest.validate_manifest (cyclomatic 45): release_manifest.validate_manifest has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/release_manifest.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f63c46a0ff7811251abf741d469888f9227261f7ec5d27b69312f090f95f5e6"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsLocationService.start (cyclomatic 44): FriendsLocationService.start has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/services/friends_location_service.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"09586a31ad3f3730bb1ae9c240f892d402ad70a293da800f48c2eee5bf94925b"}},{"ruleId":"D1","level":"warning","message":{"text":"push_webhook.createPushWebhook.\u003Creturned closure\u003E (cyclomatic 44): push_webhook.createPushWebhook.\u003Creturned closure\u003E has cyclomatic complexity 44 (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":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1032a075718fab2e29d05cdd52411437823ba383f059d36a9fb9da4130bfd518"}},{"ruleId":"D1","level":"warning","message":{"text":"PollCard.build (cyclomatic 43): PollCard.build has cyclomatic complexity 43 (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/polls/widgets/poll_card.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"136e68a7aaf0b76cc4739e9e29f4d4133ca9199dabd01cafcb52b3d28b65422d"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapViewState._buildMap (cyclomatic 42): _MapViewState._buildMap has cyclomatic complexity 42 (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/map/view/map_view.dart"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a76fad23af6044cf52e3825debcf726fed9ff3647d48cde5e30de487fad905"}},{"ruleId":"D1","level":"warning","message":{"text":"NinjaLessonRow.build (cyclomatic 42): NinjaLessonRow.build has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d48e824eae9aa88e645c92c098f873458fbf876e4dfe4ceaaf7dfabecfae632"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsMapCubit._applyGeoSettings (cyclomatic 41): FriendsMapCubit._applyGeoSettings has cyclomatic complexity 41 (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/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"509f6333f5108d10e6117cc01a3a0734d9a154a4c4c099304e5eb90b110aa1e2"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeDashboardContent.build (cyclomatic 40): HomeDashboardContent.build has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/home_dashboard_content.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4da335163fdbc875fa095a30d8e1bf8ec630b8f8cf94abde4956c49cfeac573"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleWeekView.build (cyclomatic 40): ScheduleWeekView.build has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_week_view.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"71271913bc2dd66aedfd41941b1637250194cdde96078f0628aaed545b15194d"}},{"ruleId":"D1","level":"warning","message":{"text":"ci_plan.plan_changes (cyclomatic 39): ci_plan.plan_changes 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":"tool/ci_plan.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2b723071def4e2391c953506faccbeaec85521402693e22acbae40db8ac331"}},{"ruleId":"D1","level":"warning","message":{"text":"AppGlassStyle.surface (cyclomatic 38): AppGlassStyle.surface has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/glass/app_glass_style.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"696239c9b9ff195a200ab44d05c923e93f78f25e5c64e7e46bd70ce34dc981ca"}},{"ruleId":"D1","level":"warning","message":{"text":"community.validateCommunityPayload.observations (cyclomatic 38): community.validateCommunityPayload.observations has cyclomatic complexity 38 (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":"supabase/functions/ingest/community.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9297c898f9fb2f2ce3ced884ef9e4bdd5a53113d1cba923245ff97871194bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"_SvgInteractiveMapState._selectRoom (cyclomatic 36): _SvgInteractiveMapState._selectRoom has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5fcae6b36337839bd9705d9bfdd68f9b8f5e0978f770d1bbaf3408c580703f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.Deno.serve() (cyclomatic 35): index.Deno.serve() 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":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bf69291a6adae0bdaa91273cd017da6744f4393b1e9016ce2e9455355dfac1"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleExporterRepository.exportScheduleToCalendar (cyclomatic 34): ScheduleExporterRepository.exportScheduleToCalendar 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":"packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafe06f36da24f8038f10deed24b378cd2528b9c0e49940eb5faeb84c993be1b"}},{"ruleId":"D1","level":"warning","message":{"text":"OnboardingFlowCubit._restore (cyclomatic 33): OnboardingFlowCubit._restore has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/onboarding/bloc/onboarding_flow_cubit.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d234a817e3f5461dc19e9ba9b3b6b3eb5005116ab1a1a7ec34a7a4eea2cda1"}},{"ruleId":"D1","level":"warning","message":{"text":"MapBloc._onMapInitialized (cyclomatic 32): MapBloc._onMapInitialized has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c13c57d8ba4ccb5f688c669be65df5360b555461ae6befb45d0128f92cab727"}},{"ruleId":"D1","level":"warning","message":{"text":"StacNetworkRequestActionParser.onCall (cyclomatic 32): StacNetworkRequestActionParser.onCall has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40377ed01ccde3de7c15e407135c00692f3bb64e8133100ddd29b0f7c055cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"ios_artifact_check.verify_ipa (cyclomatic 32): ios_artifact_check.verify_ipa has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ios_artifact_check.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"175b2aaf1166305bbf92ea8e8255d1dd6547ed9eb13b9de0f63497fd000a460c"}},{"ruleId":"D1","level":"warning","message":{"text":"MapBloc._onFloorSelected (cyclomatic 31): MapBloc._onFloorSelected has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6200fa3a6d529c8c9631b5c03608e3794d2985c28736c1cb9a8d93a8ed667c1"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapContributionFormState._buildPatch (cyclomatic 31): _MapContributionFormState._buildPatch has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_contribution_form.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abcc6b77d69b012c2e5402b3da2cd1519a767725a3e40ff3b6cc813fbe342b2"}},{"ruleId":"D1","level":"warning","message":{"text":"_ScheduleBodyState.build (cyclomatic 30): _ScheduleBodyState.build has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_body.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f99125e56ab6ca7608fbfe3ee36696379139d5bc37a69daaf8171bed493670f"}},{"ruleId":"D1","level":"warning","message":{"text":"_ScheduleShareSheetState.build (cyclomatic 30): _ScheduleShareSheetState.build has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ded80e4b74db23dd2c2ddb0d8bd024775be3e2397fd47492d294e59b49e1ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"AppWeekGridCell.build (cyclomatic 30): AppWeekGridCell.build has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_week_grid_cell.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ffb31b293261282f1038124bf102ba0438317fbe9dc31d6df820852441114"}},{"ruleId":"D1","level":"warning","message":{"text":"app_store_submit.should_submit (cyclomatic 30): app_store_submit.should_submit 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":"tool/app_store_submit.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f7a50cbb2a71e00c713e4bdf5a3536b54aa2ef1f582979cba23d6998d97b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"NoteEditorCubit._restoreLocalDraft (cyclomatic 29): NoteEditorCubit._restoreLocalDraft has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e067d75a924f8ef1c76ddf9c8dab8565d020325aff8965a0b340d84c5587920a"}},{"ruleId":"D1","level":"warning","message":{"text":"_FriendsMapViewState.build (cyclomatic 29): _FriendsMapViewState.build has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/view/friends_map_view.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d478c8e600a2a539b53930a9e6133db02082ec00bd5badb1579ee94fb7779dc"}},{"ruleId":"D1","level":"warning","message":{"text":"NinjaGeoSharingSheet.build (cyclomatic 29): NinjaGeoSharingSheet.build has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/widgets/ninja_geo_sharing_sheet.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2d46f8e4f371218568ade683af06b96794cc6a576c88ec395334d5d3bcc302"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsMapCubit._maybePublish (cyclomatic 28): FriendsMapCubit._maybePublish has cyclomatic complexity 28 (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/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a98ca3f68fff3123449703f242e3b42a2d39e18e9d561c2ab7fe2545fff97a"}},{"ruleId":"D1","level":"warning","message":{"text":"TelegramFetcher._convert_media (cyclomatic 28): TelegramFetcher._convert_media 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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8953b0af38993f18aa01ffc43e88793eac8c1f07627c24beba8de42eade87e"}},{"ruleId":"D1","level":"warning","message":{"text":"app_store_submit.pending_review_submission (cyclomatic 28): app_store_submit.pending_review_submission 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":"tool/app_store_submit.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c33625dfa9cdf86cdd44483dc7e5c55e2eb61914d85459101ec19bb7abedd73"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_shorebird_patch.verify_worktree (cyclomatic 28): prepare_shorebird_patch.verify_worktree 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":"tool/prepare_shorebird_patch.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8418292aed9c9e30974cde1928b98a47a5a8c3c1063796327530539708206d"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapViewState._focusPending (cyclomatic 27): _MapViewState._focusPending has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd455809793f8dfb52022c379eed8e3bcbb90ea9a139ce8ebf6585d1319107"}},{"ruleId":"D1","level":"warning","message":{"text":"MiniAppContent._safeForeground (cyclomatic 27): MiniAppContent._safeForeground has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_content.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"446f4beaa41b8491ba36d4e5ac56da971fcc41021e8f976a582aeba53468e3ed"}},{"ruleId":"D1","level":"warning","message":{"text":"AppLessonCard.build (cyclomatic 27): AppLessonCard.build has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_lesson_card.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"50584ebd085790a6c4528184423cf144a8279efbaf968a23144c3079f786cfaf"}},{"ruleId":"D1","level":"warning","message":{"text":"MapBloc._onRefreshRequested (cyclomatic 26): MapBloc._onRefreshRequested has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00658ea7e4cddd7eba047132a6b9b0faca831040670de227549b3a5779faca2"}},{"ruleId":"D1","level":"warning","message":{"text":"IndoorNavigationGraph.IndoorNavigationGraph (cyclomatic 26): IndoorNavigationGraph.IndoorNavigationGraph has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/navigation/indoor_navigation_graph.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"021fa91135e80ca96cc45400302ce7588b2e75d6ba0425d8893d5c1e3d0156f5"}},{"ruleId":"D1","level":"warning","message":{"text":"MapVolumeMesh.fromLayers (cyclomatic 26): MapVolumeMesh.fromLayers has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/services/map_volume_mesh.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a471ecaa4d05c1f71511f0dfee30837131a20d50e93973ad550e0a3fdf38a53d"}},{"ruleId":"D1","level":"warning","message":{"text":"_RoutePainter.paint (cyclomatic 26): _RoutePainter.paint has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_layer.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cea04f400a182914c7972bbc3fe97e9a9a1cba033a267369579d677fa92723"}},{"ruleId":"D1","level":"warning","message":{"text":"AppButton.build (cyclomatic 26): AppButton.build has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/buttons/app_button.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad59f56012f358d00f3bd3f1d67c1fbf0a874f9a26c316f4ca99786ea9496ca"}},{"ruleId":"D1","level":"warning","message":{"text":"_KitImagePickerState.build (cyclomatic 26): _KitImagePickerState.build has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f82a899bcfcce27eb4063ca41074487e1ec8542545693c534beb6613ddf1d4"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthSessionObserver._inspect (cyclomatic 26): OAuthSessionObserver._inspect has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22de80ad6e74df062c111815e376c3cfcd7466d7e96085bc23350bc37ffe0e6"}},{"ruleId":"D1","level":"warning","message":{"text":"TelegramToNewsBlocksAdapter.adapt_post_data (cyclomatic 26): TelegramToNewsBlocksAdapter.adapt_post_data has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa04923854ddb5c4736f09232be3225f65646584dc3699f8d27ac4afcab5d400"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsMapCubit._updateGeoSettings (cyclomatic 25): FriendsMapCubit._updateGeoSettings has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c4b43f3695fffb0a84eb706ababdc9797f59b57273e9162e46ca15cafffc99"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapViewState._openNavigationLandmark (cyclomatic 25): _MapViewState._openNavigationLandmark 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/map/view/map_view.dart"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ccd3d66add197c764ecfcc218245362210d6699dcaec297b96b91e62bebcc9"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapRouteTimelineState.build (cyclomatic 25): _MapRouteTimelineState.build has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_timeline.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1aca6664be07a7c8001124c32b77139691aee1f339f6203a380687420281b3"}},{"ruleId":"D1","level":"warning","message":{"text":"GeoSharingCubit.setSharing (cyclomatic 25): GeoSharingCubit.setSharing 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/profile/cubit/geo_sharing_cubit.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4766005acbd87501e7e7ae39e47ae2d360759cd0d64c053af63c2be498ad06"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleTimelineLesson.build (cyclomatic 25): ScheduleTimelineLesson.build has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_day_view.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1adb99ae1d776ca4214efdce28c8b5fca4c4f6e2be24042313a3ba4d48400a"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServicesNfcCardState.build (cyclomatic 25): _ServicesNfcCardState.build has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/view/widgets/services_nfc_card.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9d496da22e40e5a57d7e9ac4b6d5b336569121e50a0fecb0bb470a80fa518a"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppSliderState.build (cyclomatic 25): _AppSliderState.build has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_slider.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef1657b534a771667dad6e36237981747856b58a5aa90ec475698ec2e7e9704"}},{"ruleId":"D1","level":"warning","message":{"text":"_MentorProfileSheetState._buildContent (cyclomatic 24): _MentorProfileSheetState._buildContent has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/mentorship/mentor_profile_sheet.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d92b4c4a10f5840c7cf305b9e779a26a9578b84b38bdb82e4d828212131f724"}},{"ruleId":"D1","level":"warning","message":{"text":"_GroupSpaceViewState._content (cyclomatic 24): _GroupSpaceViewState._content has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/view/group_space_view.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5b526a9c21942c2f3c9676cb58348fc41a062b6082cb0a484b48bb301512b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ProfileCubit.load (cyclomatic 24): ProfileCubit.load has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/cubit/profile_cubit.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b03deef6a2139e02bc086b30cfb2247ab45d89d669a3569c2feb60c219117da"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleBloc.restoreSelectedScheduleFromRemote (cyclomatic 24): ScheduleBloc.restoreSelectedScheduleFromRemote has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"101d7ca6b5d9b65579737e3cdec59ceb0d990dac00d89850dd163c37384c5677"}},{"ruleId":"D1","level":"warning","message":{"text":"google_play_screenshots.update_screenshots (cyclomatic 24): google_play_screenshots.update_screenshots has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/google_play_screenshots.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e225e63370be1307ab549daf70e69b647fe8a718b67c984b9cee0fb1280b6"}},{"ruleId":"D1","level":"warning","message":{"text":"_CreateTeamSheetState._buildContent (cyclomatic 23): _CreateTeamSheetState._buildContent has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/team_finder/create_team_sheet.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a213f96f02b1e7e09e626ce24547772aba0785ea7071d033c4955bf733e1c0"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsMapCubit.refineViaWifi (cyclomatic 23): FriendsMapCubit.refineViaWifi has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7904b9146b8c55f888b84b5d3cc100447a810e2b52575a28086087e4f75b01"}},{"ruleId":"D1","level":"warning","message":{"text":"_MaterialUploadSheetState.build (cyclomatic 23): _MaterialUploadSheetState.build has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_upload_sheet.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7d33da1cb148b3b34a39e90c3d2994ff0b261d5bf2259225a706f8d7e4b0c9"}},{"ruleId":"D1","level":"warning","message":{"text":"_PasswordResetView.build (cyclomatic 23): _PasswordResetView.build has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/password_reset_page.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"082bc692681e13d33897a499efc88359daad556f9f8d6e277ecd1e58eb8c5c20"}},{"ruleId":"D1","level":"warning","message":{"text":"MapBloc._parseFloor (cyclomatic 23): MapBloc._parseFloor has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39e9d3c99e65609f2a77799828f4c36c51c58545d6a0c78ba26983cbcafdcf6"}},{"ruleId":"D1","level":"warning","message":{"text":"_EdgeDialogState._save (cyclomatic 23): _EdgeDialogState._save has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_graph_editor_page.dart"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"22365fa9cdab9c7ec5b73504b1d975a630826cc98d673570bb94ea1b93b16161"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapRouteSheetState.build (cyclomatic 23): _MapRouteSheetState.build has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_sheet.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3761f815b75169faf96f093f742db2838eec10a13b5c867e0798551c1b57a993"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchBloc._onSearchQueryChanged (cyclomatic 23): SearchBloc._onSearchQueryChanged 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/search/bloc/search_bloc.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d7938686ccce7fcc10c52c5375ae5536b75253a209bbdd452276baa90afd85"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppControlSurfaceState.build (cyclomatic 23): _AppControlSurfaceState.build has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_control_surface.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e9cd43d9f6c5f27d7de4b961a97ba3172f679588846f0cce0d74fae5dd1b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"AppChip.build (cyclomatic 23): AppChip.build has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_filter_chip.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c782043991b49d3de3db79b7946cd1fe91cc50f11af03e2f832e3665c44cdf69"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppPressStateState.build (cyclomatic 23): _AppPressStateState.build has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_press_state.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee8558cdda5e4f7a76cdd546c5f7e66c00df677e1ed2e2b60f901b7058908ff"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapRenderProbeState._prepare (cyclomatic 22): _MapRenderProbeState._prepare has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/map_render_probe.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d55a7c0d3b7fb590b731ef2c1cf3c65324b2ac67dcf8afcd45bb0837c4b368"}},{"ruleId":"D1","level":"warning","message":{"text":"NoteEditorCubit._saveTitleLoop (cyclomatic 22): NoteEditorCubit._saveTitleLoop has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f31a68b78912935ed697adb0540c65f2294ede17012e86bec50835904b9208"}},{"ruleId":"D1","level":"warning","message":{"text":"NoteEditorCubit._saveDocumentLoop (cyclomatic 22): NoteEditorCubit._saveDocumentLoop has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d0a354e92b89e2d36bb377c6ea0dfb755016311ae7ab9ab6108ebe198995f4"}},{"ruleId":"D1","level":"warning","message":{"text":"_MaterialBatchUploadSheetState._buildContent (cyclomatic 22): _MaterialBatchUploadSheetState._buildContent has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a23fe2bec560e67b4c4c960b018fc3f4440978b0babe7dc28fa9bfd22509a9"}},{"ruleId":"D1","level":"warning","message":{"text":"MapBloc._revalidateCachedStartup (cyclomatic 22): MapBloc._revalidateCachedStartup has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a1c22c3b503546b88daa787b53a84677d13e64bb6b4374c0d1f07d5a15c1f8"}},{"ruleId":"D1","level":"warning","message":{"text":"MapDataRepository.validateSvg (cyclomatic 22): MapDataRepository.validateSvg has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d2ef3f5b9e1a27a94e52d094fd6c13ca35332cb9dfd64d0d7ece64b2b142ee"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapContributionFormState.build (cyclomatic 22): _MapContributionFormState.build has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_contribution_form.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a0840632ca1c68314d72b898e14c6b823ab10b9180736840ca9ba42bcb6c2a"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapPlaceEditorPageState._review (cyclomatic 22): _MapPlaceEditorPageState._review has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_editor_page.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abb53937b81e35ad9687cbeabe0046ee70122d2e72e675df3e6da7fde74b07c"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleBloc._onSelectedScheduleRefreshRequested (cyclomatic 22): ScheduleBloc._onSelectedScheduleRefreshRequested has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc4e66e2d86a9e8dd1335bc292d20de6b3dafd240c088192f80e52f454bd116"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleWeekView._cell (cyclomatic 22): ScheduleWeekView._cell has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_week_view.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"62445711747705ed9ed07d47e73a5bcd5226e74c85a3718ad91bf1622dc60859"}},{"ruleId":"D1","level":"warning","message":{"text":"_LessonRemindSheetState.build (cyclomatic 22): _LessonRemindSheetState.build has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2df1d118c1632a30af8a5a40e0324bf5e4043f741ebacfe7b06adbb4d953b3"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServicesViewState.build (cyclomatic 22): _ServicesViewState.build has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/view/services_view.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4258c02fe0464b16f94586fd89a87c9a71e81812f62a128aa69d55869a72e95"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountPersonaCubit._drain (cyclomatic 22): AccountPersonaCubit._drain has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/cubit/account_persona_cubit.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d640cf63c7c4fe85758fb1256c16893c06b017a2751c363cad69cf24e29b0d87"}},{"ruleId":"D1","level":"warning","message":{"text":"auth.requireIngestKey (cyclomatic 22): auth.requireIngestKey has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"653a8836f123e902c499fc1cb6a8c6ed2493a59e032ca5714f0d660df3637d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.Deno.serve() (cyclomatic 22): index.Deno.serve() has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/index.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"11069949e3f194a602cd3e98f69193cc6472e0780fcf82f882d8d613535cfd57"}},{"ruleId":"D1","level":"warning","message":{"text":"_NoteDrawingEmbedState._reopen (cyclomatic 21): _NoteDrawingEmbedState._reopen has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/note_drawing_embed_builder.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f8ec536dffb2752533774c4eff58a86bd77732a123e5ad7239dfed0b49a426"}},{"ruleId":"D1","level":"warning","message":{"text":"_PreviewServicesPageState.build (cyclomatic 21): _PreviewServicesPageState.build has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design_preview/pages/preview_services_page.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfa3336c739d55fc93ee74263259a86bff3ca7c3766a0cdefc6a2a4da026b81"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsMapCubit._syncTracking (cyclomatic 21): FriendsMapCubit._syncTracking has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c3b1c6a9ae8f5f4b174b823fc2bd2abe928240f650c42d2c8aff33439cdd22"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsMapCubit.load (cyclomatic 21): FriendsMapCubit.load has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f03d4fc2687a1619fb1198f2f2d625d6c811ae2d32372c4e172a63bc27a09c"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterialRow.build (cyclomatic 21): MaterialRow.build has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_row.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab18bc3af822b24a26aa2acf7c1a3a847183523cdafcd2345aebd0b24476d63"}},{"ruleId":"D1","level":"warning","message":{"text":"IndoorRoutePlanner._buildRoute (cyclomatic 21): IndoorRoutePlanner._buildRoute has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/navigation/indoor_route_planner.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde7d6d9b3553de92bdc4ca3755b30004b7263e195fab24a54793de0fa550059"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapViewState._openPlace (cyclomatic 21): _MapViewState._openPlace has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"262478e25cdae46dec72a1aadd49380fa62d93ea7e3b345088fe6d6180a9ba13"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapRouteNodePickerState._content (cyclomatic 21): _MapRouteNodePickerState._content has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_node_picker.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00644e5bcc5a1279f67b9789e42c83ef3eae799662f00e444bbbc227936bd42"}},{"ruleId":"D1","level":"warning","message":{"text":"PromoSectionView.build (cyclomatic 21): PromoSectionView.build has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/promo/view/widgets/promo_section_view.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d27a47c719890e62730be2e2a61f40c4198423cfe588541d9c797be9f4284a"}},{"ruleId":"D1","level":"warning","message":{"text":"NinjaDayPill.build (cyclomatic 21): NinjaDayPill.build has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f2dafd1d64a77103c30e4d20efb3ea5198328c1b26243ac135ef84f395ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"CampusRepository.createPublicMaterial (cyclomatic 21): CampusRepository.createPublicMaterial has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a594e85043464b546ae7d6c69f714468ea6445928545e40c6b32fe514c24432"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountPersonaCubit.fromJson (cyclomatic 21): AccountPersonaCubit.fromJson has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/cubit/account_persona_cubit.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88987f37aee548f1ba3665a22a9b38dbecd24ceb3c55086385d5caa44efe181"}},{"ruleId":"D1","level":"warning","message":{"text":"TelegramFetcher._convert_message (cyclomatic 21): TelegramFetcher._convert_message has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"288802ca5e9ee21100cc4559b86771e8fe0f1bec1eb73712f91af2f9d0f4f75e"}},{"ruleId":"D1","level":"warning","message":{"text":"payload.validatePayload (cyclomatic 21): payload.validatePayload has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/payload.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77ccdc04005130d7b644e75c79e6324f0446fe4fe6b2f98aaea8ba6fb4470bd"}},{"ruleId":"D1","level":"warning","message":{"text":"CommunityCatalogContent.build (cyclomatic 20): CommunityCatalogContent.build has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/communities/widgets/community_catalog_content.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf7b170ce5e7f33158b2fbde89fcbf9230cc9dbd50c686c9e279ce4c6955547"}},{"ruleId":"D1","level":"warning","message":{"text":"IndoorRoutePlanner.findRouteBetween (cyclomatic 20): IndoorRoutePlanner.findRouteBetween has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/navigation/indoor_route_planner.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a86d0ce0c3abbb351d9383196c779577c329ec3c63ba3a159fe92c8f20a7f51"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapViewState._geographic (cyclomatic 20): _MapViewState._geographic has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a32d6939f980b5f6adcf93ba948eea48dbffbc45c046494dd9a6123c5117d86"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapFloorAlignmentPageState.build (cyclomatic 20): _MapFloorAlignmentPageState.build has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_floor_alignment_page.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5cf04d352185b149f79f997be3ec6d78904a89c0c0ab0b285a58ff92535505"}},{"ruleId":"D1","level":"warning","message":{"text":"MapFreeRoomsPanel.build (cyclomatic 20): MapFreeRoomsPanel.build has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_free_rooms_panel.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad70fe995d0dc2781c0f16441834719207c120429470c7e17fb8c1d0c37b745"}},{"ruleId":"D1","level":"warning","message":{"text":"_PollCreatorSheetState._buildContent (cyclomatic 20): _PollCreatorSheetState._buildContent has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_creator_sheet.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"708c50c252d6fa2cee3bb9db20e0864915ecd8ed1e52e324d87ccb9784a41917"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleLessonCard.build (cyclomatic 20): ScheduleLessonCard.build has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/lib/schedule/view/schedule_lesson_card.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d706788be1f24ca2930a2bcfaad625bc12ff09e9a81702c4f5119dd5c82456"}},{"ruleId":"D1","level":"warning","message":{"text":"AppFeatureCard.build (cyclomatic 20): AppFeatureCard.build has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_feature_card.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7ff6f7f1f07e886ef8a8136d1aba86a925cff103e097664e676dfd521e7779"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppZoomableImageState._end (cyclomatic 20): _AppZoomableImageState._end has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_zoomable_image.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dab6aa4dfe6a2f463d16d2581378f22930775d4ad258ad38aec7f43d3c4f932"}},{"ruleId":"D1","level":"warning","message":{"text":"StacFetchActionParser.onCall (cyclomatic 20): StacFetchActionParser.onCall has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/actions/stac_fetch_action_parser.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"da195a406cb13f24adc156a211389013876545cc7002bb16a5af5e303680bf44"}},{"ruleId":"D1","level":"warning","message":{"text":"TeacherLessonTile.build (cyclomatic 20): TeacherLessonTile.build has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_lesson_tile.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3607eaaf6d42abc7739a15b6e985aeadad8b0adcd4e1e91f2435b2c5e80f3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"OfficialNewsToNewsBlocksAdapter.adapt_post_data (cyclomatic 20): OfficialNewsToNewsBlocksAdapter.adapt_post_data has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/news_blocks/adapters/official_news_adapter.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7206574b968c576c5b8272c579529bb8b390b2e9360e632c5c034e2446ca07f"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_shorebird_patch.projection (cyclomatic 20): prepare_shorebird_patch.projection has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/prepare_shorebird_patch.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"122683744acfcb485d07549adc27c10f66aa96efa79193fa046c43842d849aef"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeLessonRow.build (cyclomatic 19): HomeLessonRow.build has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/widgets/home_lessons_group.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"761d9cc9bffcd76649b30a45ffab1c84f45925ba031845122df21d0a77d8baee"}},{"ruleId":"D1","level":"warning","message":{"text":"MapDataRepository._loadCampus (cyclomatic 19): MapDataRepository._loadCampus has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8e726d84cb7bd4200ba593434beaa219cc46ca0ba8d9bd1c21fb7b0a595778"}},{"ruleId":"D1","level":"warning","message":{"text":"IndoorRoutePlanner._maneuver (cyclomatic 19): IndoorRoutePlanner._maneuver has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/navigation/indoor_route_planner.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f88018279452fb24def9fd3d67a72047654100eaf9660b791e1f802d6c94734"}},{"ruleId":"D1","level":"warning","message":{"text":"_GraphNodeLabels.title (cyclomatic 19): _GraphNodeLabels.title has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_graph_editor_page.dart"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"26984537b63ed371d637c270faf94b397789530a476077c83e1ceb93201da09a"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapRouteGuidanceState.build (cyclomatic 19): _MapRouteGuidanceState.build has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_guidance.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9a027189e473239add6eeb3cc2e18cef64e2c2be0a70601fede5edf1708ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapVolumeLayerState.didUpdateWidget (cyclomatic 19): _MapVolumeLayerState.didUpdateWidget has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe5c99a92a6bb169828d8a25b7253e7b284ab06327580bfef0535ce7c1bbec0"}},{"ruleId":"D1","level":"warning","message":{"text":"_MarketSellSheetState.build (cyclomatic 19): _MarketSellSheetState.build has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/market_sell_sheet.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f564982ad629e507416d04acb7d4e10c632f3076418cec67c884d0bd281b48a6"}},{"ruleId":"D1","level":"warning","message":{"text":"_CustomLessonEditorViewState._save (cyclomatic 19): _CustomLessonEditorViewState._save has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/custom_lesson_editor_view.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8beeb7b11148fb77097210140c8e096d2b78de962760ed7ec9bdd78d9a68f74"}},{"ruleId":"D1","level":"warning","message":{"text":"_TeacherProfilePageState._content (cyclomatic 19): _TeacherProfilePageState._content has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/teacher_profile_page.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0738b0ad330c4209a6e7a4d8fa1374bf884b3d9845e449d537f7c28b99829a81"}},{"ruleId":"D1","level":"warning","message":{"text":"AppColors.== (cyclomatic 19): AppColors.== has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/colors/colors.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b16f83c79c010e4233d73164de3264b56ab4b5170e39e7060a74da79419f25"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppChipRowState._scheduleReveal (cyclomatic 19): _AppChipRowState._scheduleReveal has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/mobile/app_chip_row.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b838722ba4490234317c39d4839b51d97629a3f9c6bacb811f8abad4af21c76e"}},{"ruleId":"D1","level":"warning","message":{"text":"AppTourController._show (cyclomatic 19): AppTourController._show has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tour/app_tour_controller.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ae9ee8b108261174e5ae592649135e8f14f62ab18ece0127ba9578bd6fdf4a"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppTourLayerState._buildLayer (cyclomatic 19): _AppTourLayerState._buildLayer has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tour/view/app_tour_overlay.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b9df7664fb6dfe94e32a16e2c07203933c4e49386b8476c893bf24b72eb5fc"}},{"ruleId":"D1","level":"warning","message":{"text":"UniversityDeploymentConfig.fromJsonString (cyclomatic 18): UniversityDeploymentConfig.fromJsonString 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":"tool/src/university_deployment_config.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1942d5e2dc383838e8f665ad9d1ef70b3fc13d10bfde820328f185e3e2825b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleSearchPager.fetch (cyclomatic 18): ScheduleSearchPager.fetch 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":"tools/schedule_fetcher/lib/schedule_search_pager.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c7520e97064f2b02b5668af4813c2ca49dbb8a8230632f136f23046a8b4146"}},{"ruleId":"D1","level":"warning","message":{"text":"ArticleContentModel.fromBlocks (cyclomatic 18): ArticleContentModel.fromBlocks 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/article/widgets/article_content_model.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd68a4f8e397305aeebd6abafc7e2a08ded6909ebfe379fb1fa7e2fdfe134052"}},{"ruleId":"D1","level":"warning","message":{"text":"NoteEditorCubit._resynchronize (cyclomatic 18): NoteEditorCubit._resynchronize 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/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"8110b136342af9770666ecbedd2a11b88e08f868a782c12477c91348233835d5"}},{"ruleId":"D1","level":"warning","message":{"text":"_CollabNoteEditorViewState._insertKeyboardImage (cyclomatic 18): _CollabNoteEditorViewState._insertKeyboardImage 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/community/view/collab_note_editor_view.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37356adb369e4a1eed5622d0430a102160d3060a0b1225bb2259ae61d9a402e"}},{"ruleId":"D1","level":"warning","message":{"text":"TeamCard._actions (cyclomatic 18): TeamCard._actions 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/community/widgets/team_finder/team_card.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1725a684bc46f1ce6d05dcac7da01d77639307be97b0f4e1342dfb258bc5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"FriendsMapCubit._initialize (cyclomatic 18): FriendsMapCubit._initialize 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/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4be0b3ddfcdc2f1e3aebee5062d047c45823154bcc31d04f7b1a2498c46a35"}},{"ruleId":"D1","level":"warning","message":{"text":"MapBloc._onCampusSelected (cyclomatic 18): MapBloc._onCampusSelected 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/map/bloc/map_bloc.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3335e6196ec168c3e3875bb1709bffd9c484104351a0a9e8aa62be736d155896"}},{"ruleId":"D1","level":"warning","message":{"text":"MapStructureLayers._split (cyclomatic 18): MapStructureLayers._split 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/map/widgets/map_structure_layer.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a935f6a9a83479ac415c78ba4dfe795f68ef42995e0353a97fb7d318210bc77"}},{"ruleId":"D1","level":"warning","message":{"text":"_PeoplePageState._handleLocations (cyclomatic 18): _PeoplePageState._handleLocations 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/people/view/people_page.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a2ed8e579d427ea885d2723f9021f2377a340d1ee05025f4eb69feddc4022b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleBloc._onScheduleDeleteRequested (cyclomatic 18): ScheduleBloc._onScheduleDeleteRequested 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/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e759a143208155cff418dfe00c0902dd447679161b8884090fc79e956eb2d31"}},{"ruleId":"D1","level":"warning","message":{"text":"_ComparePageState.build (cyclomatic 18): _ComparePageState.build has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/compare_page.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8181eb549517a7bf08556f03b6cfb99eaee20a580232652c193589a3305693f"}},{"ruleId":"D1","level":"warning","message":{"text":"_ScheduleOverlapSwitcherState.build (cyclomatic 18): _ScheduleOverlapSwitcherState.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_overlap_switcher.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"118a45f156b59cbccb0c4e3291376b2e797fcd986bf711853b2ac1fb699ae3c5"}},{"ruleId":"D1","level":"warning","message":{"text":"_HubBody.build (cyclomatic 18): _HubBody.build has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/hub_body.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be1a759e289e1c7cd8363fdb8f5fd8eb44b8e8bd75c7dda32d5d59e382e68d6"}},{"ruleId":"D1","level":"warning","message":{"text":"SupabaseAuthenticationClient.verifyPasswordResetCode (cyclomatic 18): SupabaseAuthenticationClient.verifyPasswordResetCode has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c532bd3f49cfaa6ad359b3020726d3e51e79ce384bdc8ecef8dc036e6bd13a"}},{"ruleId":"D1","level":"warning","message":{"text":"_KitImagePickerState._pick (cyclomatic 18): _KitImagePickerState._pick 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":"packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c95c72f61c67f571636b18ffdb86b941955849ba2a7105a1138949c758c23a"}},{"ruleId":"D1","level":"warning","message":{"text":"TeacherDashboardIdentitySection.build (cyclomatic 18): TeacherDashboardIdentitySection.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_dashboard_identity_section.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f9f07fcba1132f3b2ba6cbdc2b86ffe1382baa2bddaa65ce6196cc833a18f6"}},{"ruleId":"D1","level":"warning","message":{"text":"app_store_screenshots.replace_set (cyclomatic 18): app_store_screenshots.replace_set 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":"tool/app_store_screenshots.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de4c22267a3045741862a8d8a6f0c0ba04f1f45892650362a27b63fd4ff1d03"}},{"ruleId":"D1","level":"warning","message":{"text":"app_store_submit.ensure_app_store_version (cyclomatic 18): app_store_submit.ensure_app_store_version 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":"tool/app_store_submit.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"462541756cebdfd6f9c4524323d69716cafc5fbe09f80ae0eebcfa2ed5f7e35a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.Deno.serve() (cyclomatic 18): index.Deno.serve() 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":"supabase/functions/miniapp-deploy/index.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"defd4f685007148e4ddc23a88f27b95153a73cb35d25108321e4be9157441bb8"}},{"ruleId":"D1","level":"warning","message":{"text":"TelegramImageMirror.mirror (cyclomatic 18): TelegramImageMirror.mirror 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":"supabase/functions/sync-telegram-feed/media.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba214f8768d909bf0972cc2c7bc8eaa124caf519362c42dbe6a42a8aca3a6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"UniversityProviderConfigurator.configure (cyclomatic 17): UniversityProviderConfigurator.configure has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/university_provider_configurator.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd4994bad0828a017c3a8e0aff8436622346b09c68810414018eb144e545768"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleSourceProbe._calendarUri (cyclomatic 17): ScheduleSourceProbe._calendarUri 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":"tools/schedule_fetcher/lib/schedule_source_probe.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c7865941003e20dc255d1e9cf1ba88780c925360ed5a33bcdcde41f990f5f0"}},{"ruleId":"D1","level":"warning","message":{"text":"MentorRequestCard._actions (cyclomatic 17): MentorRequestCard._actions 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/community/widgets/mentorship/mentor_request_card.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"883d824895706de60e883bd7dbadab65c48ad8b23cd73783de26385e643b9608"}},{"ruleId":"D1","level":"warning","message":{"text":"NewsFeedContent.build (cyclomatic 17): NewsFeedContent.build has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/view/news_feed_content.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff37fb0d6ad15d156444a618b7c3157cd14451235bb149bd2848b8c40bdaf8af"}},{"ruleId":"D1","level":"warning","message":{"text":"_FeedImageState.build (cyclomatic 17): _FeedImageState.build has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/widgets/feed_image.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0d3a575c35a80835c68b06900d90da8ae40ec25544e247dbd3036f3e936713"}},{"ruleId":"D1","level":"warning","message":{"text":"_MaterialUploadSheetState._pickFile (cyclomatic 17): _MaterialUploadSheetState._pickFile 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/knowledge_bank/widgets/material_upload_sheet.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5be41b0dabd6d891d2380570e2e808d1572cabf631ba9a5a6600ddf955eeb"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapProposalReviewState.build (cyclomatic 17): _MapProposalReviewState.build has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_community_sheet.dart"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b684179c89fdb024f5c14a7248f258faba7ad3fa39cc4263f6a216906058d676"}},{"ruleId":"D1","level":"warning","message":{"text":"_VolumePainter.paint (cyclomatic 17): _VolumePainter.paint 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/map/widgets/map_volume_layer.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a604deadf14d36b2e55a2a389ecfd42f21c55d7f549c4e7ec46439774f2203c"}},{"ruleId":"D1","level":"warning","message":{"text":"_SvgInteractiveMapState.build (cyclomatic 17): _SvgInteractiveMapState.build has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69f6d6715baad48230a64d2bc50198a31d0262c7329a29dd1df0244636658d0"}},{"ruleId":"D1","level":"warning","message":{"text":"_PushHistoryListenerState._record (cyclomatic 17): _PushHistoryListenerState._record has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/view/push_history_listener.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb48c287eef7d5648cb0f09f504a6d241fe6a1d1cf0351504afdb627c0e669a"}},{"ruleId":"D1","level":"warning","message":{"text":"_PollRunnerSheetState.build (cyclomatic 17): _PollRunnerSheetState.build has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_runner_sheet.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6669fae94aca44622c426985e5393b5a09ad2c5bdc4a85380642022fb339cd32"}},{"ruleId":"D1","level":"warning","message":{"text":"PromoDismissalsCubit._synchronize (cyclomatic 17): PromoDismissalsCubit._synchronize 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/promo/cubit/promo_dismissals_cubit.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9831f244484792e9ed2a8784e9fc6785a0031ec0de86d15888a511c07b7510"}},{"ruleId":"D1","level":"warning","message":{"text":"ComparisonDayDetails.build (cyclomatic 17): ComparisonDayDetails.build has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/widgets/comparison_day_details.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5f589705dac301afdd9f7fc4eef513024215b7942c2471f128ca34d2cb99df"}},{"ruleId":"D1","level":"warning","message":{"text":"_ScheduleDatePagerState.build (cyclomatic 17): _ScheduleDatePagerState.build has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_date_pager.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f12e628f8c0d69537534b6a3988480d180a107911cea01b56a30a7714db2847"}},{"ruleId":"D1","level":"warning","message":{"text":"NinjaBanner.build (cyclomatic 17): NinjaBanner.build has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"af967079e18ed9864bdffb5ad1d17e6a36e14c2edf38eac394fae88e331693aa"}},{"ruleId":"D1","level":"warning","message":{"text":"AppListRow.build (cyclomatic 17): AppListRow.build has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_list_row.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ad330b7f5c21808cdfe100bef87cea4dac8e01a44b17339de3896294371e03"}},{"ruleId":"D1","level":"warning","message":{"text":"TelegramFetcher.get_channel_messages_with_groups (cyclomatic 17): TelegramFetcher.get_channel_messages_with_groups 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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7edfcdd9c4edd1665a5689f453c3fd32efac45464dfc15e2a2edbbada9629d"}},{"ruleId":"D1","level":"warning","message":{"text":"community_metadata.parse_community_page (cyclomatic 17): community_metadata.parse_community_page 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":"tools/social_media_fetcher/src/community_metadata.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51f7ab037ff825d6f29c401c683e184bdf2652594b1e29c3a65880fcab8e103"}},{"ruleId":"D1","level":"warning","message":{"text":"release_manifest.build_manifest (cyclomatic 17): release_manifest.build_manifest has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/release_manifest.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddba0d59f1a2bd227466fcd0b54ec068db6086a21af000338370e88679e1df2"}},{"ruleId":"D1","level":"warning","message":{"text":"shorebird_provider_patch.verify_receipt (cyclomatic 17): shorebird_provider_patch.verify_receipt has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/shorebird_provider_patch.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95f4c82339a2deefd368fe114c0d9fde4d2636f5ec1999150a4426f8302351d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own 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/firebase-messaging-sw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42aa02ce5025e3905bbc70dba01d4ba367d58e8bed12f66990a299aa5fc298dd"}},{"ruleId":"D1","level":"warning","message":{"text":"_NoteTextToolsSheetState.build (cyclomatic 16): _NoteTextToolsSheetState.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/note_text_tools_sheet.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa81413640f7385358baeecdfd8862be097806199c1dff38cfbddb69c562628"}},{"ruleId":"D1","level":"warning","message":{"text":"_NoteToolbarState._addImage (cyclomatic 16): _NoteToolbarState._addImage 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/community/widgets/collab_notes/editor/note_toolbar.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"950c704515a8e4a747a5b603efa049fda1465824ce327661edc84b0f6c9d0c17"}},{"ruleId":"D1","level":"warning","message":{"text":"KnowledgeBankList.build (cyclomatic 16): KnowledgeBankList.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_list.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4090493504105f09ebc93bfd8982476870329bfa1a871b82ef63ef4bfabb656f"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterialGridCard.build (cyclomatic 16): MaterialGridCard.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_grid_card.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f71888703c200e9c2c68847a0024f439c16c361ce04c90253d8637960e7844"}},{"ruleId":"D1","level":"warning","message":{"text":"LostFoundItemSheet.build (cyclomatic 16): LostFoundItemSheet.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lost_and_found/widgets/lost_found_item_sheet.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7158e8934669d064b4ee5130ae163dd802420a951108c246920725a5d7e2574c"}},{"ruleId":"D1","level":"warning","message":{"text":"MapBloc._onCampusIndexRequested (cyclomatic 16): MapBloc._onCampusIndexRequested 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/map/bloc/map_bloc.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f68042f3a44d9ae8b0c67ca958dfdf61ca54406e03924d769fa9a368ecd5c0"}},{"ruleId":"D1","level":"warning","message":{"text":"_MiniAppSecretSheetState.build (cyclomatic 16): _MiniAppSecretSheetState.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_secret_sheet.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5b3f552d03d9087db4eef76c94385ac6c5339c3498d4207977476cbaf52934"}},{"ruleId":"D1","level":"warning","message":{"text":"NfcPassCubit.bindPass (cyclomatic 16): NfcPassCubit.bindPass 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/nfc_pass/bloc/nfc_pass_cubit.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8fec4ee3e050cc0aa0c822145b58b8b15b44a538c2d0d64e88e4c88fb53d6c"}},{"ruleId":"D1","level":"warning","message":{"text":"InboxNotificationTracker.observe (cyclomatic 16): InboxNotificationTracker.observe has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/view/inbox_notification_tracker.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3af80206c27eabb48f7c01318798f2884e960af7eeb8b62da089ceaf65c7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"_GroupLinkSheetState.build (cyclomatic 16): _GroupLinkSheetState.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/group_space/group_link_sheet.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca2fbcd937276bbb65cb6b3a869c4bc3599f4b273fb29cd6d954482f88110d3"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuestionCard.build (cyclomatic 16): _QuestionCard.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/creator_questions_step.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb295230f779888ad72b37ad811f6518ee0a35764127df95ea0984531faf895"}},{"ruleId":"D1","level":"warning","message":{"text":"_PollRunnerSheetState._submit (cyclomatic 16): _PollRunnerSheetState._submit 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/polls/widgets/poll_runner_sheet.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d6bbe6fa6e1cba8f12459dfe673757ad19ff4b8d76d8498a2f87f24364efa2"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleBloc._pushSelectedSchedule (cyclomatic 16): ScheduleBloc._pushSelectedSchedule 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/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6022bc72e9645a495897163f9c04d8364ec1c0aa5a09ea62139df96d4e8e39f"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduleBloc._runLoad (cyclomatic 16): ScheduleBloc._runLoad has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"116fc3e8d0e68f59603072354f59d2dbd811f6023d7f5d262616174906a1c73e"}},{"ruleId":"D1","level":"warning","message":{"text":"_LessonRemindSheetState._save (cyclomatic 16): _LessonRemindSheetState._save has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5294fc8cfd2dae26e4a703925eab16eca4ca47d143ece53ddb226315dba53d16"}},{"ruleId":"D1","level":"warning","message":{"text":"ServicesDirectory.sections (cyclomatic 16): ServicesDirectory.sections 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/services/data/services_directory.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"42314db7eb5d1efb5e64bdce1b0df56ed57e2f2b342ac341301e87c9f0e351ad"}},{"ruleId":"D1","level":"warning","message":{"text":"AppScreenHeader.build (cyclomatic 16): AppScreenHeader.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_screen_header.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b45016dba57d2c0a2096d9eb5b51a76bee0afef55907e63c803d4a8e9a256a"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppInputFieldState._build (cyclomatic 16): _AppInputFieldState._build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/forms/app_input_field.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef1c0e02665c23f346da4ff734145469f5e3c73287e435194ce2c221b5f0917"}},{"ruleId":"D1","level":"warning","message":{"text":"NfcPassRepository._bindPass (cyclomatic 16): NfcPassRepository._bindPass has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/nfc_pass_repository/lib/src/nfc_pass_repository.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5969adfff294314cf48df80d469ba556af57956fe750c65280b76df42b45344e"}},{"ruleId":"D1","level":"warning","message":{"text":"NfcPassStore.synchronizeSessionAccount (cyclomatic 16): NfcPassStore.synchronizeSessionAccount has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/nfc_pass_repository/lib/src/storage/nfc_pass_store.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca9f4e133bf8af493c16443cd2e99722384c2491e2af0636a0328fa947faba3"}},{"ruleId":"D1","level":"warning","message":{"text":"_TeacherPickerState.build (cyclomatic 16): _TeacherPickerState.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/teacher_picker.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2a6981cd33ea807bd38c2211b5625f934912ee43454f6ecbbb4959daeeb9a3"}},{"ruleId":"D1","level":"warning","message":{"text":"TelegramFetcher._convert_document_media (cyclomatic 16): TelegramFetcher._convert_document_media has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"070e022b4786f9d3c48f85de051fde039cbd3ad4af5289fa13c5f0a05067020d"}},{"ruleId":"D1","level":"warning","message":{"text":"app_store_submit.set_release_notes (cyclomatic 16): app_store_submit.set_release_notes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_submit.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a668b5c9dfa58b1821a2caac4db4551c53323c031afb09cff6422def8794f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"build_web.public_config (cyclomatic 16): build_web.public_config has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/build_web.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e342fd666c3be864861f907817275cabd594c44b241d0a9bb141e1afa7127d26"}},{"ruleId":"D1","level":"warning","message":{"text":"configure_firebase.release_config (cyclomatic 16): configure_firebase.release_config has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/configure_firebase.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"50178b892d3812efdd93623618421e0a7dbb777e2ec48f2dec4ac835a3f56a53"}},{"ruleId":"D2","level":"warning","message":{"text":"_LabelsPainter.paint (cognitive 130): _LabelsPainter.paint has cognitive complexity 130 (threshold 15). Drivers by points: ternaries 21 (52 pts), if/else 17 (37 pts), boolean chains 36, loops 4 (5 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_cartographic_layer.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0143ef355b712c297ed15daaeb54ebe532f8d6fc7ebfc7bb71a31d20ef4c7b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapPlaceDetailsSheetState.build (cognitive 107): _MapPlaceDetailsSheetState.build has cognitive complexity 107 (threshold 15). Drivers by points: if/else 32 (62 pts), ternaries 18 (28 pts), boolean chains 9, loops 2 (7 pts), match/switch 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_details_sheet.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"614f69f020df5bafbbe4fa63aac430c8f0d75619e2cdad358ecb43c95533b034"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleDayView.build (cognitive 96): ScheduleDayView.build has cognitive complexity 96 (threshold 15). Drivers by points: ternaries 14 (28 pts), if/else 12 (27 pts), boolean chains 23, loops 9 (18 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_day_view.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69395cad62b1ba8a7b34ccd2de08fde309ba15539caa854d1afdc332224fde9"}},{"ruleId":"D2","level":"warning","message":{"text":"_VolumeLabelsPainter.paint (cognitive 95): _VolumeLabelsPainter.paint has cognitive complexity 95 (threshold 15). Drivers by points: if/else 15 (32 pts), ternaries 15 (32 pts), boolean chains 25, loops 5 (6 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ed8ea0f2d731c1b292a2502f816ce5e937d19cde8714595f53929d7af897ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleExporterRepository.exportScheduleToCalendar (cognitive 78): ScheduleExporterRepository.exportScheduleToCalendar has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (45 pts), loops 6 (15 pts), boolean chains 9, ternaries 2 (8 pts), error handling 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a213c52a98dca01693802fa9d6e6e30dca4013d7cb07e0c34417edbbbde32428"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_screenshots.update_screenshots (cognitive 71): app_store_screenshots.update_screenshots has cognitive complexity 71 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 15, ternaries 4 (8 pts), loops 5 (7 pts), error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_screenshots.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef406cdf429d0340130812ace58fdf8279bb56ebba51469ead9eb0fe51ffa28b"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsLocationService.start (cognitive 66): FriendsLocationService.start has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 19, error handling 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/services/friends_location_service.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd82d3c00157ac1a5276282e45763a1952c281841548e80df3b7ea511b4ddc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleChangePresentation.fromChange (cognitive 66): ScheduleChangePresentation.fromChange has cognitive complexity 66 (threshold 15). Drivers by points: boolean chains 28, if/else 14 (19 pts), ternaries 11 (16 pts), match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/widgets/schedule_change_presentation.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8c8fdcfe4f9918e0fbc43eddcc98a83ff4dac5a87386ccd450da35b94f6341"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapContributionFormState.build (cognitive 64): _MapContributionFormState.build has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 8 (34 pts), if/else 13 (22 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_contribution_form.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6021c55726a2a63d70befb544e7d519211e4bec0800c1a83b89eff8a1da2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"MapBloc._onMapInitialized (cognitive 59): MapBloc._onMapInitialized has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 10, ternaries 4 (10 pts), error handling 3 (6 pts), loops 3 (6 pts) (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/map/bloc/map_bloc.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d1795db9c017329d08f819874f149cc81f706ad74ffaf3254b07bc3957300e"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeDashboardContent.build (cognitive 57): HomeDashboardContent.build has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 11 (15 pts), boolean chains 7, loops 5 (6 pts), match/switch 1 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/home_dashboard_content.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88d0f4a04176053cdaf416eaacd6f79f49744109427f23385284199f434e832"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit._applyGeoSettings (cognitive 56): FriendsMapCubit._applyGeoSettings has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 28, if/else 13 (28 pts) (nesting depth added 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/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e39d5f0345805c10478650558ddaea4bc94c4fa943e87fb13d04814e6bf2738"}},{"ruleId":"D2","level":"warning","message":{"text":"MapVolumeMesh.fromLayers (cognitive 54): MapVolumeMesh.fromLayers has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 8 (16 pts), boolean chains 5, ternaries 1 (3 pts) (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/map/services/map_volume_mesh.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"44297dd2aae63239c33ac4db3f06b6e0e03fc4b0cdaaec2d7cd94cca66eb814b"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountPersonaCubit._drain (cognitive 54): AccountPersonaCubit._drain has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (37 pts), error handling 3 (7 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/cubit/account_persona_cubit.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadcebd6adb5633979a556ea087560bb89bac5e862f73d4b8c13ce94ffeefe92"}},{"ruleId":"D2","level":"warning","message":{"text":"_SvgInteractiveMapState._selectRoom (cognitive 53): _SvgInteractiveMapState._selectRoom has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 10, loops 4 (7 pts), ternaries 3 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8438da51f8b8452b56e4f6fb08682e1eef576b4e00b99bd59a788dd5937e3862"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleWeekView.build (cognitive 52): ScheduleWeekView.build has cognitive complexity 52 (threshold 15). Drivers by points: loops 15 (22 pts), boolean chains 13, ternaries 8 (11 pts), if/else 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_week_view.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cabcbf560b556dce66bae8ffabad5a5bf44d7f0fa58b0695eb0043ac847142c"}},{"ruleId":"D2","level":"warning","message":{"text":"release_manifest.validate_manifest (cognitive 52): release_manifest.validate_manifest has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 14, loops 6 (7 pts), ternaries 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":"tool/release_manifest.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"22db7ac6e24c84ff9945d7a6769d026f55cdb4282b53e062171853293386645f"}},{"ruleId":"D2","level":"warning","message":{"text":"StacNetworkRequestActionParser.onCall (cognitive 51): StacNetworkRequestActionParser.onCall has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 11, ternaries 6 (11 pts), error handling 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"897b62276d02af60437b56458d9cdc2a8add6231043df8ab637bc5e7a23a0803"}},{"ruleId":"D2","level":"warning","message":{"text":"OnboardingFlowCubit._restore (cognitive 49): OnboardingFlowCubit._restore has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 17, if/else 9 (17 pts), ternaries 5 (14 pts), error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/onboarding/bloc/onboarding_flow_cubit.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e7d9af186d3abd25ce5179f0fb077bc212428a38cd87379c1e47c960bd0538"}},{"ruleId":"D2","level":"warning","message":{"text":"index.createNotificationHandler.\u003Creturned closure\u003E (cognitive 49): index.createNotificationHandler.\u003Creturned closure\u003E has cognitive complexity 49 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 9, ternaries 4 (6 pts), error handling 4, loops 1 (nesting depth added 8). Of this number, 40 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. 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":"supabase/functions/miniapp-notify/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ae98879011e36e997f896d38395801f2ba672be9cc8a84fbfea67ddd671ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapContributionFormState._buildPatch (cognitive 47): _MapContributionFormState._buildPatch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 10, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_contribution_form.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"56830b9a5db28a0a951ac8806c4feb26e647c74a1817893974af0db80f4c421c"}},{"ruleId":"D2","level":"warning","message":{"text":"ci_plan.plan_changes (cognitive 47): ci_plan.plan_changes has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 14, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ci_plan.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f083e2845a2917f78c902130d5c79ce96654062ddc49531d9c598a5719e130"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapRenderProbeState._prepare (cognitive 45): _MapRenderProbeState._prepare has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 7, ternaries 2 (6 pts), loops 2 (5 pts), error handling 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/map_render_probe.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cb9ba96d966498de96f8a3ca42bc12ab132bd8d601997ef75491cca056f0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"NoteEditorCubit._saveDocumentLoop (cognitive 45): NoteEditorCubit._saveDocumentLoop has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (25 pts), ternaries 3 (9 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db8ad32e59f156214406eafda97953b3b8d0be5f211181fe9cf9e953c87715f"}},{"ruleId":"D2","level":"warning","message":{"text":"MapBloc._onRefreshRequested (cognitive 45): MapBloc._onRefreshRequested has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 10, loops 4 (9 pts), error handling 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56af8ae78be70ade6ac04877a437a380ed74c4ba3b149b964906afeeebd3c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapViewState._buildMap (cognitive 44): _MapViewState._buildMap has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 18 (20 pts), boolean chains 13, if/else 10 (11 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e52a65e87842aa323a6d65dc75ecd9873fd119802196ac7983f1ce0232b7685"}},{"ruleId":"D2","level":"warning","message":{"text":"PollCard.build (cognitive 44): PollCard.build has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 17, ternaries 13 (14 pts), if/else 12 (13 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_card.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e572c1b06f152b6895b6a02ff5d9b523e1c6c3371ffede0feb1cd3591ccbc2cc"}},{"ruleId":"D2","level":"warning","message":{"text":"AppGlassStyle.surface (cognitive 44): AppGlassStyle.surface has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 22 (38 pts), boolean chains 3, match/switch 3 (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":"packages/app_ui/lib/src/glass/app_glass_style.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"360e820e94c0595a73f9537ffabd7da55a36e009e4854e47f6c193ea613766a0"}},{"ruleId":"D2","level":"warning","message":{"text":"NoteEditorCubit._restoreLocalDraft (cognitive 43): NoteEditorCubit._restoreLocalDraft has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 13, if/else 7 (13 pts), error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac9c03a1721b4b2843136a720ba573aed21568d63f012ffdbb66ebecdad12ba"}},{"ruleId":"D2","level":"warning","message":{"text":"_GroupSpaceViewState._content (cognitive 43): _GroupSpaceViewState._content has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 4 (9 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/view/group_space_view.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5b2b1c445c43bc058ba46f1f3f51c61bdfac1c852cfae81ab5d4e03130701a"}},{"ruleId":"D2","level":"warning","message":{"text":"_LessonRemindSheetState.build (cognitive 43): _LessonRemindSheetState.build has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 12 (32 pts), if/else 4 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef1de6f3aa381bbc00c15e39cf078ed34f50c1b71bcc632e025272f55f6d6db"}},{"ruleId":"D2","level":"warning","message":{"text":"NinjaLessonRow.build (cognitive 43): NinjaLessonRow.build has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 12 (15 pts), boolean chains 5, match/switch 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd23c226486d0512c91772a5da76759f207e9512e324f718e42376a28ef120f"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramFetcher._convert_media (cognitive 43): TelegramFetcher._convert_media has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 21). 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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5bee5273252f6c18efea2d81fe20e12b5f885cdc98f1ac1bc1643fac69d629"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramToNewsBlocksAdapter.adapt_post_data (cognitive 41): TelegramToNewsBlocksAdapter.adapt_post_data has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 5 (10 pts), boolean chains 6 (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":"tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed70b1dec3059b066a5605fe9c5b29373eed7dfe8e8086753181375c9ae03ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_shorebird_patch.verify_worktree (cognitive 41): prepare_shorebird_patch.verify_worktree has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/prepare_shorebird_patch.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a063b03aa7ead259b6ab9766cdf0aa719f8bfd5afb40c46d0fc0ca08142e2985"}},{"ruleId":"D2","level":"warning","message":{"text":"MapBloc._revalidateCachedStartup (cognitive 40): MapBloc._revalidateCachedStartup has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (9 pts), boolean chains 8, error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a4397af1380413b31848d29d07728547fa3bcb6382eb0bcd42604061891b92"}},{"ruleId":"D2","level":"warning","message":{"text":"MapBloc._onFloorSelected (cognitive 40): MapBloc._onFloorSelected has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 18, if/else 7 (13 pts), ternaries 4 (8 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"845a3571086c16daabaabf1816d7631f43c6fcabd2a75c0a82a999556f87f81e"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniAppContent._safeForeground (cognitive 40): MiniAppContent._safeForeground has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_content.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f049629d83455d2095a1cab227070c0aba969cfc7fe7377becef71e967b6e32"}},{"ruleId":"D2","level":"warning","message":{"text":"index.Deno.serve() (cognitive 40): index.Deno.serve() has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (20 pts), ternaries 7 (12 pts), boolean chains 6, error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e475bb97d018202aac187cb81315c81adfbc3c4dd1a00686fc5d4c2bd8d478"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRepository._loadCampus (cognitive 38): MapDataRepository._loadCampus has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 3 (8 pts), boolean chains 5, ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"094827574e90e92309025113080959d884141aa07ce6e8595dd36f8878acd1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"GeoSharingCubit.setSharing (cognitive 38): GeoSharingCubit.setSharing has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, ternaries 4 (6 pts), error handling 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/cubit/geo_sharing_cubit.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc33f5d6333c068bb723080e00da42d270dea90784a7428472982acb1b715c37"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleWeekView._cell (cognitive 38): ScheduleWeekView._cell has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 10 (16 pts), loops 5 (13 pts), match/switch 1 (4 pts), if/else 2 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_week_view.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"204a96d019b0fd07ddafc053436e13a19c3b931a9e6a09bcd06bdbac6ce7e967"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_submit.should_submit (cognitive 38): app_store_submit.should_submit has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 10, 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":"tool/app_store_submit.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f590b08777013fa1ba601f9bb6942321404b14cd121e9f074b6a2785a89795"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapViewState._openNavigationLandmark (cognitive 37): _MapViewState._openNavigationLandmark has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 11, loops 2 (3 pts), ternaries 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5b3ec3b1070f7aecbca2c9b206886c4de41f1bd2ed886eca16a29b4ca0b702"}},{"ruleId":"D2","level":"warning","message":{"text":"_TeacherPickerState.build (cognitive 37): _TeacherPickerState.build has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 2 (7 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/teacher_picker.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"844e0e999f666eca4a2a96e343a7a4a0163a486e2518429e08e3069045a93d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_submit.pending_review_submission (cognitive 37): app_store_submit.pending_review_submission has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 13, loops 1 (2 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_submit.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e35faf925f6e6315c8081134bd790f71f19d8de4a97c904f1119b4f541e888d"}},{"ruleId":"D2","level":"warning","message":{"text":"ios_artifact_check.verify_ipa (cognitive 37): ios_artifact_check.verify_ipa has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 10, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ios_artifact_check.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8677b038ff8bc0452b98e37b125351530ce992fca1b2fdb232ed913489496fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapViewState._focusPending (cognitive 36): _MapViewState._focusPending has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 8, ternaries 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"880301c607044992bc51c21cfcc2227c216add3b77a70d26adb8fdce87ed38c1"}},{"ruleId":"D2","level":"warning","message":{"text":"_PeoplePageState._handleLocations (cognitive 36): _PeoplePageState._handleLocations has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/view/people_page.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034cefa6a4a1abb96711f4812242fbe511dd92c7c62c0b53d74c6932f33f1b5"}},{"ruleId":"D2","level":"warning","message":{"text":"PromoDismissalsCubit._synchronize (cognitive 36): PromoDismissalsCubit._synchronize has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/promo/cubit/promo_dismissals_cubit.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6af46a416e9206ecc19a5b871d81b7fbb0c0c9f12589b68b4ff4b52f6061394"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapCommunitySheetState.build (cognitive 35): _MapCommunitySheetState.build has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (7 pts), ternaries 3 (7 pts) (nesting depth added 20). 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/map/widgets/map_community_sheet.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e73ca85f6bc52e61867fd0649dd4c051f96a2a846c0e06f80a8bcc7f69ce4e"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit._updateGeoSettings (cognitive 34): FriendsMapCubit._updateGeoSettings has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 14, error handling 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c60523444ac42f6dfd43abfb20cce765b1c7cc80de2e58a00d7390143309b2"}},{"ruleId":"D2","level":"warning","message":{"text":"IndoorNavigationGraph.IndoorNavigationGraph (cognitive 34): IndoorNavigationGraph.IndoorNavigationGraph has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 14, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/navigation/indoor_navigation_graph.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"756b1c4129f67637920f8925db7a0b466e4086cd6393f232f8d2ecfbd085aec2"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapViewState._geographic (cognitive 34): _MapViewState._geographic has cognitive complexity 34 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 7 (12 pts), boolean chains 5, error handling 2 (3 pts), ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"817901a9ea07b2466e321763731ecb7edb2eb2eca0ba83bd9a97a80eb93d6de2"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapPlaceEditorPageState._review (cognitive 34): _MapPlaceEditorPageState._review has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 4 (8 pts), boolean chains 6, error handling 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_editor_page.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98fee9a9267446c1a7fe7c74193d3268f8ad490230dc7d225f7a0598c178c35"}},{"ruleId":"D2","level":"warning","message":{"text":"_KitImagePickerState.build (cognitive 34): _KitImagePickerState.build has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 8 (11 pts), boolean chains 7, 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":"packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f6b9954beb969c04f42a89dc362008503eded5b54d8e9b64eb5b89466519d7"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthSessionObserver._inspect (cognitive 34): OAuthSessionObserver._inspect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 12, loops 2 (3 pts), error handling 1 (2 pts), ternaries 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":"packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd76e36e757f2b549e4c252f8c1606927f0d575bf9c2d6eef32c55451c9c04f"}},{"ruleId":"D2","level":"warning","message":{"text":"push_webhook.createPushWebhook.\u003Creturned closure\u003E (cognitive 34): push_webhook.createPushWebhook.\u003Creturned closure\u003E has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 7, ternaries 2 (3 pts), error handling 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef191a0783c641c45fd1e0ecaf457b664643e048bf57d01356b9c41e58849023"}},{"ruleId":"D2","level":"warning","message":{"text":"NoteEditorCubit._saveTitleLoop (cognitive 33): NoteEditorCubit._saveTitleLoop has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 12, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a653a288ad5dc4a9c9f476db068582d8e149fc2acf64aebc3547723591297f40"}},{"ruleId":"D2","level":"warning","message":{"text":"_RoutePainter.paint (cognitive 33): _RoutePainter.paint has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (10 pts), loops 5 (8 pts), ternaries 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_layer.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ff22488967feaf343a6b98cc78856a668936dce3eff11883c2dd772d569e90"}},{"ruleId":"D2","level":"warning","message":{"text":"community.validateCommunityPayload.observations (cognitive 33): community.validateCommunityPayload.observations has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 15, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/community.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cf7f472a8c708d920e41998459aef90e5c514a1ad227cc2f9c2091ccefad4e"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramFetcher.get_channel_messages_with_groups (cognitive 32): TelegramFetcher.get_channel_messages_with_groups has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts), boolean chains 3, error handling 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f78ade7b3cf7cf7df7b4cd6808a2d8a7f9f39ee98dbf980b06c7408852594c"}},{"ruleId":"D2","level":"warning","message":{"text":"_ComparePageState.build (cognitive 31): _ComparePageState.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 6, boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/compare_page.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"133652980d20c431cd9ec7c803a0d022c75ef09b79a809b91db96d0e2523aa8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ComparisonDayDetails.build (cognitive 31): ComparisonDayDetails.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, loops 2 (6 pts), ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/widgets/comparison_day_details.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e315b7a613a0a13f6ef5809915ea5c4512133d051751e5f62fdb4578d43d6c62"}},{"ruleId":"D2","level":"warning","message":{"text":"AppLessonCard.build (cognitive 31): AppLessonCard.build has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 13 (15 pts), if/else 7 (10 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_lesson_card.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae176dc5c1a839ad49e87a524cb00b27340367b767afc3b1793013015596142"}},{"ruleId":"D2","level":"warning","message":{"text":"CommunityCatalogContent.build (cognitive 30): CommunityCatalogContent.build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 6 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/communities/widgets/community_catalog_content.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e1d657eebb6a795a0eace572107ca7ab5eb9d8a763b3b8bc9c339893a20d60"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit._maybePublish (cognitive 30): FriendsMapCubit._maybePublish has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, if/else 6 (9 pts), ternaries 2 (4 pts), error handling 1, match/switch 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a3a6e4663d9745671397b287371679082b3c28da01cb75144d66341872075b"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeBankList.build (cognitive 30): KnowledgeBankList.build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (8 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_list.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a70ae3bb77bb06abd408ee6bbfb0ae273e5d3bf31f69fad130806594967d8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRepository.validateSvg (cognitive 30): MapDataRepository.validateSvg has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1012770368c025bd740a5383f1f4c7c0f80cc182d5c4ec04407b77d09b24a56"}},{"ruleId":"D2","level":"warning","message":{"text":"_ScheduleShareSheetState.build (cognitive 30): _ScheduleShareSheetState.build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 8 (11 pts), boolean chains 7, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fed6fe7165fd8a0c0e146bcb329d3648f7113e11f23a509961e265408c6e651"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchBloc._onSearchQueryChanged (cognitive 30): SearchBloc._onSearchQueryChanged has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 11, ternaries 5 (10 pts), if/else 5 (8 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/search/bloc/search_bloc.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"90405bc323abc798df893ef895d46d6091a1d1ce9a71019bde71cf10a8591076"}},{"ruleId":"D2","level":"warning","message":{"text":"StacFetchActionParser.onCall (cognitive 30): StacFetchActionParser.onCall has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, ternaries 2 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/actions/stac_fetch_action_parser.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"24892aa8bf05c566712f7cd12ad56930a670282799e0993d3fdb01a8c8d2bbfd"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountPersonaCubit.fromJson (cognitive 30): AccountPersonaCubit.fromJson has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (10 pts), ternaries 2 (6 pts), match/switch 1 (3 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/cubit/account_persona_cubit.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fe3ffbc50eb9af5efc64a97295d8cde20c9c6742942396a36310c35b296baa"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramFetcher._convert_message (cognitive 30): TelegramFetcher._convert_message has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d196310b60f730c65b12b1b6c7fa3d88589b3aa56c2a79be6a5fb480dedcdcb"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleSearchPager.fetch (cognitive 29): ScheduleSearchPager.fetch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_fetcher/lib/schedule_search_pager.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b44f83352ea8b83e9667dac9af23d7282095f94c2993aee8f4d63288759472"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapRouteNodePickerState._content (cognitive 29): _MapRouteNodePickerState._content has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 9 (15 pts), if/else 6 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_node_picker.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a5702f4849288aae6cbee8b616d4499ce0b7d0a2c0047a99a51fb0cb17c939"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapRouteSheetState.build (cognitive 29): _MapRouteSheetState.build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 5 (10 pts), boolean chains 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_sheet.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a7187482d34bf86561c703eefeb66a60207d06c2e3376c4647ba5f3f8364bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleTimelineLesson.build (cognitive 29): ScheduleTimelineLesson.build has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 16, if/else 6 (9 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_day_view.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4506937cf5fb3b5d4419e2e0c7fc665a636a098ac73bc9bf27a8bbf6521a4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"OfficialNewsToNewsBlocksAdapter.adapt_post_data (cognitive 29): OfficialNewsToNewsBlocksAdapter.adapt_post_data has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 3 (5 pts), error handling 2 (3 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/news_blocks/adapters/official_news_adapter.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b67eee7a3364309935c84bcb094a7e821e60184839d236970583919e934941"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_screenshots.replace_set (cognitive 29): app_store_screenshots.replace_set has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (8 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_screenshots.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5306d356d699221d57f4b4e93e41ae2f81918daa9439e535e7c38116d8b7dfd9"}},{"ruleId":"D2","level":"warning","message":{"text":"google_play_screenshots.update_screenshots (cognitive 29): google_play_screenshots.update_screenshots has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts), error handling 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/google_play_screenshots.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd420d4197a8a128f281b1c5c1f28b897c9c02a038de3d50325c9965c9d72ba"}},{"ruleId":"D2","level":"warning","message":{"text":"MentorRequestCard._actions (cognitive 28): MentorRequestCard._actions has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 6 (9 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/mentorship/mentor_request_card.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6fca85d3c25e04b8fc317e818e9f1b58b4a37fde3af1679710bf442ad3ee34"}},{"ruleId":"D2","level":"warning","message":{"text":"TeamCard._actions (cognitive 28): TeamCard._actions has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 11 (20 pts), if/else 5 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/team_finder/team_card.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d843b568909ac00605f80fc2d35271fbe7de00ef77a66fb5506d6e0404054cce"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit.refineViaWifi (cognitive 28): FriendsMapCubit.refineViaWifi has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (13 pts), error handling 1 (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2280c7951ee8126ec1c8d24326eceb237817e6b9a0ddadbdc4b8fcf19a95ed6b"}},{"ruleId":"D2","level":"warning","message":{"text":"MapBloc._onCampusIndexRequested (cognitive 28): MapBloc._onCampusIndexRequested has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433ad513d2b9395a5632ee0794eaeec7f77cd7b7173a82b78b14d9c6a813e31"}},{"ruleId":"D2","level":"warning","message":{"text":"IndoorRoutePlanner.findRouteBetween (cognitive 28): IndoorRoutePlanner.findRouteBetween has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 4 (5 pts), ternaries 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/map/navigation/indoor_route_planner.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2532b1b3443f152eca67e90aa5cb217a16deb83b2abca0993532b6a1f82156"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapGeographicViewState.build (cognitive 28): _MapGeographicViewState.build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (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":"lib/map/widgets/map_geographic_view.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6000425e48904ac64f3fbd6d62da756a6a13133ee506822a853822ca861adf"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServicesViewState.build (cognitive 28): _ServicesViewState.build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 5 (7 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/view/services_view.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a63d4286bdea9c303804d0209305a1e0ed8b6f33354933e9cb4f9e5dcf429ae"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_shorebird_patch.projection (cognitive 28): prepare_shorebird_patch.projection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, loops 2, 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":"tool/prepare_shorebird_patch.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9600809b55a53b4a7863a4623cf211ecfd848f2f496b1afc9fd1ae1fe1d287e0"}},{"ruleId":"D2","level":"warning","message":{"text":"_MentorProfileSheetState._buildContent (cognitive 27): _MentorProfileSheetState._buildContent has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 8, if/else 5 (7 pts), loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/mentorship/mentor_profile_sheet.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea180eba2cb1a21f8aa76871cbcea11a4a49a604773d442bf5653c33de513a8"}},{"ruleId":"D2","level":"warning","message":{"text":"_MaterialUploadSheetState._pickFile (cognitive 27): _MaterialUploadSheetState._pickFile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 2 (5 pts), boolean chains 4, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_upload_sheet.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"db26cc8ef0503276f80fd6acae33b7579df89f4ad67f82fdfe42132e3515e643"}},{"ruleId":"D2","level":"warning","message":{"text":"_MaterialUploadSheetState.build (cognitive 27): _MaterialUploadSheetState.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (9 pts), if/else 7 (8 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_upload_sheet.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"840462bbe54e4c8c820d643a6b1c784b88056fad81ae79431e3041d9a158d51f"}},{"ruleId":"D2","level":"warning","message":{"text":"_TeacherProfilePageState._content (cognitive 27): _TeacherProfilePageState._content has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (7 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/teacher_profile_page.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc9d7836ff483f2005ccb71bb678264b7e35aae3de8d7e634168290e0489d1"}},{"ruleId":"D2","level":"warning","message":{"text":"AppWeekGridCell.build (cognitive 27): AppWeekGridCell.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 11 (13 pts), if/else 7, boolean chains 5, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_week_grid_cell.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5489f0d38756ebd01084af5f4faeacb24a18074c8a47c356a66c5533e6b1f92"}},{"ruleId":"D2","level":"warning","message":{"text":"_KitImagePickerState._pick (cognitive 27): _KitImagePickerState._pick has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, ternaries 2 (6 pts), error handling 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4510bbf878449919a682130fb614badf9c678d075fc64934b93045762411ff"}},{"ruleId":"D2","level":"warning","message":{"text":"AppTourController._show (cognitive 27): AppTourController._show has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (9 pts), boolean chains 7, 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/tour/app_tour_controller.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c5ae1bab58c61fbd16b88a1d6787838de86ead13b93c73a39b755193dffe42"}},{"ruleId":"D2","level":"warning","message":{"text":"_NoteTextToolsSheetState.build (cognitive 26): _NoteTextToolsSheetState.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (10 pts), boolean chains 4, 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/community/widgets/collab_notes/editor/note_text_tools_sheet.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6297813ea7576275ae6a775aee6445709d03c873d584c549dcd7a78ea79701"}},{"ruleId":"D2","level":"warning","message":{"text":"_CreateTeamSheetState._buildContent (cognitive 26): _CreateTeamSheetState._buildContent has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (13 pts), if/else 5 (6 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/team_finder/create_team_sheet.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64ce44582754b571543041b87ad44a26edcdac09e60e6080213b5f2fea0d16"}},{"ruleId":"D2","level":"warning","message":{"text":"_PreviewServicesPageState.build (cognitive 26): _PreviewServicesPageState.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (9 pts), loops 3 (4 pts), boolean chains 1, match/switch 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/design_preview/pages/preview_services_page.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1469ba1a724889141b60c9d31b819c13d394f2292d0d7ed9366f084bf3af12ed"}},{"ruleId":"D2","level":"warning","message":{"text":"_MaterialBatchUploadSheetState._buildContent (cognitive 26): _MaterialBatchUploadSheetState._buildContent has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 6 (7 pts), loops 3 (5 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71dd6095953311fa2f4c8cb4ca440d067cef9b818d3f0c0f1cbd3fcc8adba29"}},{"ruleId":"D2","level":"warning","message":{"text":"_MaterialSubjectPickerState.build (cognitive 26): _MaterialSubjectPickerState.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (5 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_subject_picker.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"39daf3043e9250edd5d308a22f118c0ad8523db18187825f29110c0b3edcae72"}},{"ruleId":"D2","level":"warning","message":{"text":"IndoorRoutePlanner._buildRoute (cognitive 26): IndoorRoutePlanner._buildRoute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, ternaries 3 (5 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/navigation/indoor_route_planner.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c508ade0aaba22f0e5b43a1a240f18aeff14a3374e21bf0226cee50eaa1c67"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapRouteTimelineState.build (cognitive 26): _MapRouteTimelineState.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 6 (7 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_timeline.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b61187970ae42c35255c852c084066795adaceb1a9d71eb3d4da79342eb946e"}},{"ruleId":"D2","level":"warning","message":{"text":"_MiniAppTokensSheetState.build (cognitive 26): _MiniAppTokensSheetState.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 4 (13 pts), if/else 5 (6 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_tokens_sheet.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7839a19c9ac68be64506201844fecfd16e499e9e4020a4827dbafc1334de80d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleBloc._onSelectedScheduleRefreshRequested (cognitive 26): ScheduleBloc._onSelectedScheduleRefreshRequested has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 12, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a8d6773a91f9bfbf634046b11731c4fa3864fcb3c113de5e663cdebffcec68"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppSliderState.build (cognitive 26): _AppSliderState.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 16 (18 pts), if/else 5, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_slider.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d55ffa0d0c15c9f7270ca1e9ca483cd1c33bf1a08a9e761fd2a299719863e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleGlanceAppWidget.ModernMinimalWidget (cognitive 26): ScheduleGlanceAppWidget.ModernMinimalWidget has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), error handling 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/ninja/mirea/mireaapp/glance/ScheduleGlanceAppWidget.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a55d2a5a4e88b89efa8a8c9e892e6b9bc8569021ae4879534782b46d4856e93"}},{"ruleId":"D2","level":"warning","message":{"text":"auth.requireIngestKey (cognitive 26): auth.requireIngestKey has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, loops 2 (5 pts), error handling 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea80731ae26791e207c0f5d3c54f8d43e24391cd8772a87f3b8dcb2658ca5b95"}},{"ruleId":"D2","level":"warning","message":{"text":"index.Deno.serve() (cognitive 26): index.Deno.serve() has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 4 (7 pts), boolean chains 4, error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/index.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5269b8d2b502acebab1d798bd42aa884369cbf3a4e8e89c299e602e3793567c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleSourceProbe._calendarUri (cognitive 25): ScheduleSourceProbe._calendarUri has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 9, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_fetcher/lib/schedule_source_probe.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6227bfc30ba0a02b068ed9471ab9b7a6487a2d2b3b64ebce2312f8c81c8669"}},{"ruleId":"D2","level":"warning","message":{"text":"_NoteDrawingEmbedState._reopen (cognitive 25): _NoteDrawingEmbedState._reopen has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (12 pts), error handling 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/note_drawing_embed_builder.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b000a30a0e69e594028e90dd4a6ce1fa68ed59603ba114e8d6700e7d2bfd2962"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit.load (cognitive 25): FriendsMapCubit.load has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (11 pts), error handling 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d199599bfbf68351fe4cd70e7edc689c02ae0a071270646b8165e18c29ba82"}},{"ruleId":"D2","level":"warning","message":{"text":"_FriendsMapViewState.build (cognitive 25): _FriendsMapViewState.build has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, ternaries 10, if/else 3, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/view/friends_map_view.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbee424858f9e2aa563f2e92041fc16bda5062a3a32741a68efedcf9adbde6c"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeDeadlinesGroup.build (cognitive 25): HomeDeadlinesGroup.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), ternaries 1 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/widgets/home_deadlines_group.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"550fa6a9257ee3ae4c7715833e4dbe3ddb48460dbbe35fae2cfbfcb85e0a3712"}},{"ruleId":"D2","level":"warning","message":{"text":"NfcPassCubit.bindPass (cognitive 25): NfcPassCubit.bindPass has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (8 pts), match/switch 2 (4 pts), boolean chains 1, error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/nfc_pass/bloc/nfc_pass_cubit.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7069fc0a206cb294d1a09ef61b444959dba8dee61d2de6d0607972fb811feb2d"}},{"ruleId":"D2","level":"warning","message":{"text":"_GroupSpaceViewState._showInitialPost (cognitive 25): _GroupSpaceViewState._showInitialPost has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/view/group_space_view.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"977a9cd97156c9ab6855b8ec585af2ddc7343463efc01b7aaa5505a7a4dbd957"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleBloc.restoreSelectedScheduleFromRemote (cognitive 25): ScheduleBloc.restoreSelectedScheduleFromRemote has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (11 pts), match/switch 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab24126270d22b85072dc7e447157139eb9cad28dfd7cc39972c06dea5e9ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleBloc._cacheRefreshedSchedule (cognitive 25): ScheduleBloc._cacheRefreshedSchedule has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"10574c1e7b42d83a22b53fc973008d7c2230cb90201187140667fcceb65d5be3"}},{"ruleId":"D2","level":"warning","message":{"text":"_ScheduleBodyState.build (cognitive 25): _ScheduleBodyState.build has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 6 (7 pts), match/switch 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_body.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f08130c556c807cd6755ad9fe41164c1cc11892bd76e0a023d0ee372d1144fc"}},{"ruleId":"D2","level":"warning","message":{"text":"_LessonRemindSheetState._save (cognitive 25): _LessonRemindSheetState._save has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"82da8e72b1991ce49fb0211746d73fec0ac5349e8bfafc8cf51bb8b4b9fc0f18"}},{"ruleId":"D2","level":"warning","message":{"text":"_HubBody.build (cognitive 25): _HubBody.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 6 (9 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/hub_body.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc8d6876aa99be83ec2b6c2b627cab12379ddb5cd320dcced259c7d849238b3"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServicesNfcCardState.build (cognitive 25): _ServicesNfcCardState.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 15, boolean chains 7, if/else 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/view/widgets/services_nfc_card.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca211c85ff048d02ead39672ecece1ba79ef3f466a96c476683edd661a9c93c"}},{"ruleId":"D2","level":"warning","message":{"text":"NinjaWeekStrip.build (cognitive 25): NinjaWeekStrip.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (13 pts), loops 3 (6 pts), boolean chains 3, if/else 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fa5b6d3080156c6ec0f54ac3da33a693f8d88e208e5a77c15db3ff3bc42eed"}},{"ruleId":"D2","level":"warning","message":{"text":"NinjaDayPill.build (cognitive 25): NinjaDayPill.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 14 (18 pts), boolean chains 3, if/else 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"412042f314847a4c9c5ec645213c81bf5cc441d9b1e872b81be047dbab9fb204"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppPressStateState.build (cognitive 25): _AppPressStateState.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (13 pts), boolean chains 8, if/else 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_press_state.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcfe6f4dec61015cd9dc1165e34a3284b08aaca524329fbb65e8643f9626abe"}},{"ruleId":"D2","level":"warning","message":{"text":"CampusRepository.createPublicMaterial (cognitive 25): CampusRepository.createPublicMaterial has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1af69f710a0019f905dfe0189c751d2038da3f44f3d19dc39bc6cb552becc26"}},{"ruleId":"D2","level":"warning","message":{"text":"community_metadata.parse_community_page (cognitive 25): community_metadata.parse_community_page has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 7 (10 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/community_metadata.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9ece9e78b496941321b2d9357dd7e62de2328441657fc378c761927d12251d"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_screenshots.remove_other_phone_assets (cognitive 25): app_store_screenshots.remove_other_phone_assets has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 pts), error handling 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_screenshots.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a6abd674a459fe718c4992b7c1ffd6e6e237997d055cb6a04352767635e356"}},{"ruleId":"D2","level":"warning","message":{"text":"MapBloc._parseFloor (cognitive 24): MapBloc._parseFloor has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 5 (7 pts), loops 3, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2a064c43cbaee4ad50cd6f60914a19910c7dd771f987f9c697bb8d60106d98"}},{"ruleId":"D2","level":"warning","message":{"text":"_VolumePainter.paint (cognitive 24): _VolumePainter.paint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 4 (8 pts), loops 4, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"09619a4e118fad613a28d7e44c8b76592664798c80e364a09ef3940776f6d180"}},{"ruleId":"D2","level":"warning","message":{"text":"_SvgInteractiveMapState.build (cognitive 24): _SvgInteractiveMapState.build has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 8 (9 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a634281542aeda2cf5bcfed1c9f17fc02ed5e3f8bd1ab57cc5281fdf50b11a"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuestionCard.build (cognitive 24): _QuestionCard.build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/creator_questions_step.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b494bd796ba73359bd10843fe8bb367ac7b9635358e3204b5771eddb238b3b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProfileCubit.load (cognitive 24): ProfileCubit.load has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 6, ternaries 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/cubit/profile_cubit.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30c9306fd7fa03ebb5b8cbeaffc03827778239f6dcf8b7af3eeda6bb6895b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleBloc._onScheduleDeleteRequested (cognitive 24): ScheduleBloc._onScheduleDeleteRequested has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (7 pts), match/switch 2, boolean chains 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d406c59f2c2be2961c33ed0a4e63f26d9c97cb86298836c09f6f9508a5528789"}},{"ruleId":"D2","level":"warning","message":{"text":"ServicesDirectory.sections (cognitive 24): ServicesDirectory.sections has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (9 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/data/services_directory.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"83756de829745f1008058cca11823b9d4b99c7e493fe193ec63b2601d5ffa095"}},{"ruleId":"D2","level":"warning","message":{"text":"AppChip.build (cognitive 24): AppChip.build has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 16 (18 pts), if/else 5, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_filter_chip.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f478b6ea13cbebce57f53ba3d36994e3f8348d9403d39ad43223f192426604c"}},{"ruleId":"D2","level":"warning","message":{"text":"AppButton.build (cognitive 24): AppButton.build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 8, boolean chains 7, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/buttons/app_button.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db6a0f9b1025f22a47daf736cfec4bb9332bb3d8f4693f5c9a3b4fe3f78413f"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalNotificationsRepository.syncLessonReminders (cognitive 24): LocalNotificationsRepository.syncLessonReminders has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (9 pts), boolean chains 5, 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":"packages/local_notifications_repository/lib/src/local_notifications_repository.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c40e262a426aa87bb5c359348cbceae3cce16e073abf62ef63a7070e0d0a31c"}},{"ruleId":"D2","level":"warning","message":{"text":"UniversityDeploymentConfig.fromJsonString (cognitive 23): UniversityDeploymentConfig.fromJsonString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/university_deployment_config.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed4fbcad4c66c6865b083d9d5cc3da4b5445b1f16e446552c49bc9880b9e6db"}},{"ruleId":"D2","level":"warning","message":{"text":"NoteEditorCubit._resynchronize (cognitive 23): NoteEditorCubit._resynchronize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 9, ternaries 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9508f16d251928ab278e111b44d6d9b3136ef59900ec7ad15ddb126a992439f3"}},{"ruleId":"D2","level":"warning","message":{"text":"LostFoundItemSheet.build (cognitive 23): LostFoundItemSheet.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4 (8 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lost_and_found/widgets/lost_found_item_sheet.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02164595cb14c1f71347e887431bd4868b9ef0a8b980c85fd43296ef2e38d79"}},{"ruleId":"D2","level":"warning","message":{"text":"MapBloc._onCampusSelected (cognitive 23): MapBloc._onCampusSelected has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (9 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff49a7e345260eb61691a9ccf4d13ccb2964dff36a4a37a0cbc4750fe8743ca"}},{"ruleId":"D2","level":"warning","message":{"text":"MapFreeRoomsPanel.build (cognitive 23): MapFreeRoomsPanel.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9, ternaries 5 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_free_rooms_panel.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd70d822b24c19a70dd959bc2768003c50021fc427b0fa410fd53cdc931e55a"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapSavedPlacesSheetState.build (cognitive 23): _MapSavedPlacesSheetState.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, loops 1 (4 pts), ternaries 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_saved_places_sheet.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a8b2eb79b8d7755b21a1bb7a392bb09eac85988c5f9818be31498ca7147f97"}},{"ruleId":"D2","level":"warning","message":{"text":"_MiniAppSecretSheetState.build (cognitive 23): _MiniAppSecretSheetState.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 6 (7 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_secret_sheet.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ac7a68ad5ab7772549f8b72e88cbab0be8822630feba4811033a47cd36ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleWidgetUpdater._prepareOptimizedScheduleData (cognitive 23): ScheduleWidgetUpdater._prepareOptimizedScheduleData has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (14 pts), ternaries 2 (8 pts), loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/utils/schedule_widget_updater.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03e826430ddd44d8e6c22112c3cf223e155b68a8db5512ebfca467846ba8a09"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleLessonCard.build (cognitive 23): ScheduleLessonCard.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 5 (7 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/lib/schedule/view/schedule_lesson_card.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c37d97ad8e4fbab6a10479d20f69fd7c2d1469c40d0532d44008d5750a1274d"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppControlSurfaceState.build (cognitive 23): _AppControlSurfaceState.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 11, boolean chains 8, if/else 3 (4 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_control_surface.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"36234093dc5dcc4cbe00c642fc1c2909406f9b506334e10484d7f45837abc1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"AppFeatureCard.build (cognitive 23): AppFeatureCard.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (14 pts), boolean chains 5, if/else 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_feature_card.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad23428a9b43d2a73ff8ea70d8ce8a6732f9a105782ffc96a3a1ea87c07c960c"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppZoomableImageState._end (cognitive 23): _AppZoomableImageState._end has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_zoomable_image.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9966833edbf932810f37cadc919c8f00ea3872bf13d380fbad86b7f8e2ef38d5"}},{"ruleId":"D2","level":"warning","message":{"text":"NfcPassRepository._bindPass (cognitive 23): NfcPassRepository._bindPass has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 4 (7 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/nfc_pass_repository/lib/src/nfc_pass_repository.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d0529c792e57bec8f365910c55e7aa88c0f3ec496ea7ac2d3d608f082f2b36"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramFetcher.fetch_raw_data (cognitive 23): TelegramFetcher.fetch_raw_data has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 3 (6 pts), loops 2 (3 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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21fe4849f48590568764a53fb2e6660e3b7fda2d7a646260934844004acc0da"}},{"ruleId":"D2","level":"warning","message":{"text":"release_manifest.build_manifest (cognitive 23): release_manifest.build_manifest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/release_manifest.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4654eaeaf9cef08203122f8634d213e939f35f7992d6eaf4aa439baa95013920"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramImageMirror.mirror (cognitive 23): TelegramImageMirror.mirror has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 6, loops 2 (3 pts), if/else 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/media.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4295118c5a60936446c54e11610ec6527f47af5e5da3de226e8c05900ba8c1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"UniversityConfigurator._writeAtomically (cognitive 22): UniversityConfigurator._writeAtomically has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/university_configurator.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4978120ea32561498e7d12463d8cfa2e312345ea1718e36ad2154f3763550ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"_CollabNoteEditorViewState._insertKeyboardImage (cognitive 22): _CollabNoteEditorViewState._insertKeyboardImage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, ternaries 2 (3 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/collab_note_editor_view.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b4bcec547dac67acf143a2be75e40103d77b2701c5aa23cb31effa06f098fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit._initialize (cognitive 22): FriendsMapCubit._initialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 10, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f961076596724490ab3ba971f02b2b75e8fc313216658edeab4b0ec32b53d50"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRepository._completeCampusDocument (cognitive 22): MapDataRepository._completeCampusDocument has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 3 (7 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fbc205b6a6ee6966270d21755ccdeafd37774450107c8f0a3cdfb6192cab11"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapCanvasControlsState.build (cognitive 22): _MapCanvasControlsState.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (19 pts), if/else 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_canvas_controls.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c1c9b63c7b3de39d0f8cfa2172ddcd213ac34a4dccd5ed7ef7d546c27409f4"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapProposalReviewState.build (cognitive 22): _MapProposalReviewState.build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_community_sheet.dart"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b0cdfe47f03901d30d17a5e02c020efe57f2557c65e3d91cdbc2a0a7ef27b1"}},{"ruleId":"D2","level":"warning","message":{"text":"_EdgeDialogState._save (cognitive 22): _EdgeDialogState._save has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 7, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_graph_editor_page.dart"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"37124b078730e9757c7455a3839dc17812c15195ccad1fb57aa3b84c0334db58"}},{"ruleId":"D2","level":"warning","message":{"text":"_PollRunnerSheetState._submit (cognitive 22): _PollRunnerSheetState._submit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_runner_sheet.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"714190afb030bfc0053a639b8e94a2be8aed134bda21420035d47b85a3518372"}},{"ruleId":"D2","level":"warning","message":{"text":"_CustomLessonEditorViewState._save (cognitive 22): _CustomLessonEditorViewState._save has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, error handling 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/custom_lesson_editor_view.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fcd1af9715aafc07dd87c59130bc3f4f2244571d66cb051671a4d213c35239"}},{"ruleId":"D2","level":"warning","message":{"text":"_SessionViewState.build (cognitive 22): _SessionViewState.build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 1 (4 pts), ternaries 1 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/session/session_page.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d1f61ec8f2c8d80a54b9f56da64f0636ee9187b5a51da1046d1cdd8b5299b"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_submit.replace_pending_build (cognitive 22): app_store_submit.replace_pending_build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, 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":"tool/app_store_submit.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c0aca675ea68d653fb91a8d25de766d432f5e01cc60e0dc949b64321557132"}},{"ruleId":"D2","level":"warning","message":{"text":"import_shorebird_release.verify_automatic_checkouts (cognitive 22): import_shorebird_release.verify_automatic_checkouts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/import_shorebird_release.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"397914d7e42b21be258bf3e00114ad520081be955c1f1de9db6488a02aea0bee"}},{"ruleId":"D2","level":"warning","message":{"text":"shorebird_provider_patch.verify_receipt (cognitive 22): shorebird_provider_patch.verify_receipt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/shorebird_provider_patch.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"147aad2ef0edd524a28404faa83663fb8741616951aa6813094df9b47e43bef6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigureUniversity.run (cognitive 21): ConfigureUniversity.run has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), error handling 2, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/configure_university.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b34323a811e5a2fcca012ad1c811dbf3588d8aeca1d45b44301a0caa210a44"}},{"ruleId":"D2","level":"warning","message":{"text":"_NoteToolbarState._addImage (cognitive 21): _NoteToolbarState._addImage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/note_toolbar.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6160327400ae87056b3d41e0417e24d3544c048f60ad3e5a99f2f103f6214f39"}},{"ruleId":"D2","level":"warning","message":{"text":"NinjaGeoSharingSheet.build (cognitive 21): NinjaGeoSharingSheet.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 5, if/else 3, match/switch 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/widgets/ninja_geo_sharing_sheet.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fb768f18a99a81054b8032c78ad85cf7ba2be5e896f53d0b7babc4ba620c71"}},{"ruleId":"D2","level":"warning","message":{"text":"LostFoundCubit.toggleItemStatus (cognitive 21): LostFoundCubit.toggleItemStatus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 1, error handling 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lost_and_found/cubit/lost_found_cubit.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc5c6fe72820b798f2b671eeb5cba2be35bdc6e9f8208ede37e0d02bebc60cb"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRepository.loadCachedCampus (cognitive 21): MapDataRepository.loadCachedCampus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b8f573785cfe20519e2cbf27df830a5dffaafd8caacb39339b35e29b4bf436"}},{"ruleId":"D2","level":"warning","message":{"text":"IndoorRoutePlanner._reachableLabels (cognitive 21): IndoorRoutePlanner._reachableLabels has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/navigation/indoor_route_planner.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c456b232f9a1b1d64e8311105d4191c4f9f61f7de99e813f3e1ab636ac34d6"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapViewState._openPlace (cognitive 21): _MapViewState._openPlace has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, ternaries 8, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"666badb87ccfba37c6ac8690b1dd3d135715acaf316dfe62a2d3c876c6438c51"}},{"ruleId":"D2","level":"warning","message":{"text":"MapStructureLayers._split (cognitive 21): MapStructureLayers._split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_structure_layer.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab599b0c475c27893d32506d4c453dbe78c5394aa765f19489261e8c7c923d05"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppTourLayerState._buildLayer (cognitive 21): _AppTourLayerState._buildLayer has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 15 (17 pts), boolean chains 2, if/else 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/tour/view/app_tour_overlay.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbde0ec9509539771f8430103e3bcccedfc8e616739ce1e9a09f27c4068a110"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_submit.ensure_app_store_version (cognitive 21): app_store_submit.ensure_app_store_version has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_submit.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae82f48d44ff6f655913667c134787acec1409bc927a92af1e60d036cce10f3"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit._syncTracking (cognitive 20): FriendsMapCubit._syncTracking has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"57da9fd499c8056a77b2e78a943b4aa1e365dc8cdb10e0552fe507e419ee13ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FindFriendsDiscovery._people (cognitive 20): FindFriendsDiscovery._people has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/view/find_friends_discovery.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"349c33b9c759ec19ac60519a88623a0450c489dc02955c6f01d1ca824f3c1d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialRow.build (cognitive 20): MaterialRow.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 6 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_row.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9000a4443bf56054c0adc8dde0fdfe042200681dc4ebedc9850d672063c16767"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapFloorAlignmentPageState.build (cognitive 20): _MapFloorAlignmentPageState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8, boolean chains 6, if/else 4 (5 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_floor_alignment_page.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0eb788a198ca85038ca09cdde789d5391302aefecdff070986d0a4a45d37b1"}},{"ruleId":"D2","level":"warning","message":{"text":"_GraphPainter.paint (cognitive 20): _GraphPainter.paint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 3, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_graph_editor_page.dart"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc74267fcd700690eeb5714e2078cefc4621036b0f779875c49708c039238fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PollsCubit.createPoll (cognitive 20): PollsCubit.createPoll has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 8, error handling 1 (nesting depth added 6). 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/polls/cubit/polls_cubit.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e352d4c693cb7ebee1ea69e2e2eb04c9bc1685914aee70d8bee102de49bc81e6"}},{"ruleId":"D2","level":"warning","message":{"text":"_CreatorPreviewStep.build (cognitive 20): _CreatorPreviewStep.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), ternaries 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/creator_preview_step.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1206d181ee22b7b10fa1701425cd687245239b5ce3678817b0108e0704bc22c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleMonthView._markers (cognitive 20): ScheduleMonthView._markers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 1 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_month_view.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b88666555f15639d4a75d5387e03fffff5c3198ae44e4c7920940f301723ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"ExamTopicsCubit.fromJson (cognitive 20): ExamTopicsCubit.fromJson has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/session/exam_topics_cubit.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f04512e5f606bb472ffc1f0c74e50bec0b5d86451becb78607e801d4ea62b64"}},{"ruleId":"D2","level":"warning","message":{"text":"ExamTopics.build (cognitive 20): ExamTopics.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 4, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/session/widgets/exam_topics.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb848502c70b8723d5b88ea9cc19d0caaf5073d3680bdf37bde1479238bd1793"}},{"ruleId":"D2","level":"warning","message":{"text":"_SearchSheetState._hits (cognitive 20): _SearchSheetState._hits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 7 (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/search/view/search_sheet.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"919bee7e83583984425117fe788dd12784dbbc05b2a1695319268f0659bf1835"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniAppTreeResolver._deferWidget (cognitive 20): MiniAppTreeResolver._deferWidget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/expression/mini_app_tree_resolver.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f7c37f884b24807cc3a183ce4c330b142984149fe9c1332927c27023e38123"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountPersonaCubit._restorePersona (cognitive 20): AccountPersonaCubit._restorePersona has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), boolean chains 3, 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/teacher_account/cubit/account_persona_cubit.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"407dc8dbd6979071ce58b13d0f49993911f2f34cd7f8e5f2f9578a5c213ea9ff"}},{"ruleId":"D2","level":"warning","message":{"text":"_DeadlinesViewState.build (cognitive 19): _DeadlinesViewState.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 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/community/view/deadlines_view.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"255833cae438f5fe064cb29fcdb80e3d90dcbc8515e781c5634b93987202de17"}},{"ruleId":"D2","level":"warning","message":{"text":"FreeRoomsList.build (cognitive 19): FreeRoomsList.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/free_rooms/widgets/free_rooms_list.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"85878c4c730542cea82d2635af86d79af4038963fca5861fdb83569f7e9377fe"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeLessonRow.build (cognitive 19): HomeLessonRow.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13, if/else 4, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/widgets/home_lessons_group.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d61db463ba2c9ea90e6f0ac0334de1eb9c3cdc72afdcba3df3909a13a51319"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialGridCard.build (cognitive 19): MaterialGridCard.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 6, boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_grid_card.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d514a891ae82e8ebf0e5e4145262897a75a6abd2e85ba252111a2036528f96"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapViewState._mapInformation (cognitive 19): _MapViewState._mapInformation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, error handling 1 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e83b5b66fc799cd05869b749183b145d3943b4bb20832b2cbd1e5b21c48ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"_MarketplaceBodyState._result (cognitive 19): _MarketplaceBodyState._result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/marketplace_body.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"413347dffd51a1e1cf7262a89759f9e5fae28e972db9e30c4d09c20239e78975"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniAppSubmitCubit.submit (cognitive 19): MiniAppSubmitCubit.submit has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 4, if/else 4, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/cubit/mini_app_submit_cubit.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc122e00832b16f3f4f952ec2b052955e808c5f5b1f7a426a6383c7622a1865"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationsSheet.build (cognitive 19): NotificationsSheet.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/view/notifications_sheet.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34d733b021c9e3b81990e6c86ee68f39a14a1295dadd2d88ec92ef7ec67dbd8"}},{"ruleId":"D2","level":"warning","message":{"text":"OnboardingFlowCubit.prepareFinish (cognitive 19): OnboardingFlowCubit.prepareFinish has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (6 pts), boolean chains 3, 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/onboarding/bloc/onboarding_flow_cubit.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8093cda82de5562dc8b5d5e364958fbf3a6274125a5385768b67f8609216c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleBloc._pushSelectedSchedule (cognitive 19): ScheduleBloc._pushSelectedSchedule has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2658ad8c407545769c10eaaaec73093b77b7dab6109f1de23d5e042277baa0"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleBloc._runLoad (cognitive 19): ScheduleBloc._runLoad has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (8 pts), error handling 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d725003c1856d5f7be991fa87518f8931b3f305df08aa823ff6710cacf1e47"}},{"ruleId":"D2","level":"warning","message":{"text":"_ChangesPageState._toggleAlerts (cognitive 19): _ChangesPageState._toggleAlerts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/changes/changes_page.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef9d584664d5a37b848006ed36134fa548e0b24f32d4b0ce66ef9bac9bc3c5"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppInputFieldState._buildTrailing (cognitive 19): _AppInputFieldState._buildTrailing has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 4, if/else 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/forms/app_input_field.dart"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"755c2aa9a83eeff17f44c478bc9db5516c692506c7f8a7b0a3247856921b68fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ArticleRepository.getArticle (cognitive 19): ArticleRepository.getArticle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/article_repository/lib/src/article_repository.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e266fd50a0e4e6c9243211b46fd96a7fa4e923ffeb6643be3e7edb597f06e0"}},{"ruleId":"D2","level":"warning","message":{"text":"SupabaseAuthenticationClient.verifyPasswordResetCode (cognitive 19): SupabaseAuthenticationClient.verifyPasswordResetCode has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 14, if/else 2 (4 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05a2324134f873cda4cb9547b5a63f6d663213cd4a461cc57a340fff23f1e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniAppTreeResolver._resolve (cognitive 19): MiniAppTreeResolver._resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/expression/mini_app_tree_resolver.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"149ceb802d757e8d2b8787af48615d39a8213fdbbe14dc8a2640953f92478153"}},{"ruleId":"D2","level":"warning","message":{"text":"TeacherDashboardIdentitySection.build (cognitive 19): TeacherDashboardIdentitySection.build has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, ternaries 7 (8 pts), if/else 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_dashboard_identity_section.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a6343236af83a77fc36be38d77f638c931fdb094742324be32325d0b359023"}},{"ruleId":"D2","level":"warning","message":{"text":"TeacherLessonTile.build (cognitive 19): TeacherLessonTile.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10, if/else 5, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_lesson_tile.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908426206c265f72ef052ccac12140486f7fe63592c730e1e6881e417b6fe19"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_build_status.wait_for_build (cognitive 19): app_store_build_status.wait_for_build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_build_status.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"851b0ce346296d69ef53066747e4390b72686ee2d55a0e1fd1effb9c43e6e641"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_submit.set_release_notes (cognitive 19): app_store_submit.set_release_notes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_submit.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d58655e5d74a76176a83d6a63043176eda9ec4fd5a91641cae0c2991e6a053e"}},{"ruleId":"D2","level":"warning","message":{"text":"ci_plan.local_dependencies (cognitive 19): ci_plan.local_dependencies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), error handling 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ci_plan.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b7bb170eebcc21257c42302a483a4127296d4c84c1d2ad7f87fbee1fadcb35"}},{"ruleId":"D2","level":"warning","message":{"text":"google_play_screenshots.validate_screenshot (cognitive 19): google_play_screenshots.validate_screenshot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/google_play_screenshots.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"099a5ce2c687d10bba12ec8f20b461c9d51bd1d3c4a098c33bafa6b5f8fa4f76"}},{"ruleId":"D2","level":"warning","message":{"text":"payload.validatePayload (cognitive 19): payload.validatePayload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. 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":"supabase/functions/ingest/payload.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cf25418a8f0b33a5d0d024ea368262215ad014404db3909b9b07f3db3d8f14"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 5 (6 pts), boolean chains 3, error handling 1 (2 pts), other 2 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 8 belong to 3 function literals 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/firebase-messaging-sw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"557640fdec4b59427633c13454bd1eb26e8285efba1734a60cfe2a8594f919db"}},{"ruleId":"D2","level":"warning","message":{"text":"createUpstreamProxy (cognitive 19): createUpstreamProxy has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 4 (6 pts), boolean chains 2, other 2, error handling 1, loops 1 (nesting depth added 6). None of this is in the body itself: all 19 points belong to 3 function items inside it that branch (a function literal at line 8, (anonymous)::abort, a function literal at line 10). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_relay/upstream_proxy.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0da6c8ee76a5ec387c5442d81862148f7bc6353bede2da9ec53dd88e5b43f8"}},{"ruleId":"D2","level":"warning","message":{"text":"RetryingSourceClient.get (cognitive 18): RetryingSourceClient.get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_fetcher/lib/retrying_source_client.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"befa675c66a728f1f701000179d5cd1fa1601b28d5974219f024550c12af0765"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceTokenSyncController._activate (cognitive 18): DeviceTokenSyncController._activate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 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/app/services/device_token_sync_controller.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae6ecd5651b0a017a54d139fd0bde689039516a50db24d21a1cfbbc85a43b01"}},{"ruleId":"D2","level":"warning","message":{"text":"_AddAbsenceSheetState.build (cognitive 18): _AddAbsenceSheetState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3, loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/attendance/widgets/add_absence_sheet.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7546a253d3d1ce1858e73f28be79f4c2e1528219f20462a8e53417e21d063ec"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawingStroke.fromJson (cognitive 18): DrawingStroke.fromJson has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (6 pts), match/switch 2 (5 pts), if/else 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/drawing_stroke.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a5ecc110cf3148ce82517afde293798973430c7a9601c641f524db0e3ebaf3"}},{"ruleId":"D2","level":"warning","message":{"text":"NewsFeedContent.build (cognitive 18): NewsFeedContent.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 6, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/view/news_feed_content.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e2e40c614dded3b6d3d4bd0994f3a1411338dbf7e751c8e6e0e2edfdbf46f7"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeTrendingGroup.build (cognitive 18): HomeTrendingGroup.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/widgets/home_trending_group.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7806f2ad7a18cf409cf05998e2f904f1bbb003ea386e5db6259742de326927c"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRepository._parseCampus (cognitive 18): MapDataRepository._parseCampus has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d47fd6ad2358c1e9e6440b88a087fae6c460b75f4acc831ac53a7abe65b7bce"}},{"ruleId":"D2","level":"warning","message":{"text":"_RoomsPainter.paint (cognitive 18): _RoomsPainter.paint has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_cartographic_layer.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cfcfd07aed2af0ebbe4ede0c786d761fb3e956f58c8c5ed2f2b890edae70ff"}},{"ruleId":"D2","level":"warning","message":{"text":"_GraphNodeLabels.title (cognitive 18): _GraphNodeLabels.title has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (6 pts), boolean chains 3, match/switch 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_graph_editor_page.dart"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"6841dc5f1ad948fc3f264f8583eac5984045cdcae5b444f5883e3a71d4c87531"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapRouteGuidanceState.build (cognitive 18): _MapRouteGuidanceState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 12, if/else 5, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_guidance.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da15ced663d48edb5bfddfb13a321583078f1cd18c87d144a1c32e980f2dc61"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapVolumeLayerState.didUpdateWidget (cognitive 18): _MapVolumeLayerState.didUpdateWidget has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e694d71ccbb711bb73c18db040fdb70f05cfecf87279cc4dc824bdf7bef5e75"}},{"ruleId":"D2","level":"warning","message":{"text":"_MarketSellSheetState.build (cognitive 18): _MarketSellSheetState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 14, boolean chains 2, if/else 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/market_sell_sheet.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"787a74530c0a1dac3ad6fe40566f0f40565169f450842ca38f895c6b856fa751"}},{"ruleId":"D2","level":"warning","message":{"text":"InboxNotificationTracker.observe (cognitive 18): InboxNotificationTracker.observe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/view/inbox_notification_tracker.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7d9700e465b6d429aab5a927622071150a78b6fafdaf6d16c976c2af8cd2f1"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingSettingsStepState._togglePush (cognitive 18): _OnboardingSettingsStepState._togglePush has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/onboarding/widgets/onboarding_settings_step.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a608a241dfe95e0335b3deef3ea88313a044e8d1ded9c596ab4d394a059c61d"}},{"ruleId":"D2","level":"warning","message":{"text":"_GuestUpgradeSheetState._submit (cognitive 18): _GuestUpgradeSheetState._submit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/widgets/guest_upgrade_sheet.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8598eaaca131a1e6eaec849d50f3b95e55f72e45fb4d79b3e36bf903f5b685f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_ScheduleDatePagerState.build (cognitive 18): _ScheduleDatePagerState.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_date_pager.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"054f344e141c8e6d441ea9349f0433d3883917be88f53ed09b42c194ccb43782"}},{"ruleId":"D2","level":"warning","message":{"text":"_TeacherProfilePageState._buildReviews (cognitive 18): _TeacherProfilePageState._buildReviews has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (7 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/teacher_profile_page.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3c4a3bcd941c0fabd3a2de787a1e67e6ac242a19ea2a8dd170f0ef1a48d081"}},{"ruleId":"D2","level":"warning","message":{"text":"AppColors.== (cognitive 18): AppColors.== has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/colors/colors.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ff4d90e5012992257deb9e0aab5d2cfbbfd60d4835235833769bbc8ba2fb92"}},{"ruleId":"D2","level":"warning","message":{"text":"AppActivityHeatmap.build (cognitive 18): AppActivityHeatmap.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), ternaries 3, 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":"packages/app_ui/lib/src/widgets/app_activity_heatmap.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a840bfb5e4bcc0a11ee04726fda3c4007a04178c22c3b2f42d3534498d48d4"}},{"ruleId":"D2","level":"warning","message":{"text":"AppServiceTile.build (cognitive 18): AppServiceTile.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11 (14 pts), if/else 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_service_tile.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"94894ba889c778d6f8457ab1de642edad267f1d9f0f0099e544581efa2da3f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"StacPickImageActionParser.onCall (cognitive 18): StacPickImageActionParser.onCall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/actions/stac_pick_image_action_parser.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c12e0c9df6a578feff73089dddf13e2ede3dd5f5cfb811367e426c4839c74d"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniAppTreeResolver._resolveSwitch (cognitive 18): MiniAppTreeResolver._resolveSwitch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 3 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/expression/mini_app_tree_resolver.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6698bf1a9921d6a95e6165e567f0773d369ce8777085036b5ef8b9bee10dad5"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_screenshots.jpeg_dimensions (cognitive 18): app_store_screenshots.jpeg_dimensions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_screenshots.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe6b7b99072ce8481d85c38ff6365261121f4024104c75d21481e83f592b724"}},{"ruleId":"D2","level":"warning","message":{"text":"build_web.build (cognitive 18): build_web.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/build_web.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2bbd092460fb3d90cf9fea2a7105d21e72f683049add881979ba8ba5b06188"}},{"ruleId":"D2","level":"warning","message":{"text":"import_shorebird_release.find_artifact (cognitive 18): import_shorebird_release.find_artifact has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/import_shorebird_release.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d7c557bb9b601e1949d34b4ee55234aba8fe74e3c79e28eda7e30ef93659f8"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_shorebird_patch.main (cognitive 18): prepare_shorebird_patch.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/prepare_shorebird_patch.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed9b1cc0049e4b32a67a9a39c389d438e66d99914a8b0b7c86884c01bebd57e"}},{"ruleId":"D2","level":"warning","message":{"text":"release_manifest.resolve (cognitive 18): release_manifest.resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/release_manifest.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c522f2662a11b21c3c9c3fa0d24f2260d7de7ea859e04771b0dcfa9100a47a06"}},{"ruleId":"D2","level":"warning","message":{"text":"auth.resolveIngestKey (cognitive 18): auth.resolveIngestKey has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"598b85dfdc37aea2a3d5e05deac188e33ffb17468f465b7429616b527d074a42"}},{"ruleId":"D2","level":"warning","message":{"text":"upstream_proxy.createUpstreamProxy.\u003Creturned closure\u003E (cognitive 18): upstream_proxy.createUpstreamProxy.\u003Creturned closure\u003E has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 4 (6 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_relay/upstream_proxy.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa60d8e1ba048e72c90114e7a7be6af1e3fa93d8d3af27610f0dbc45955962a8"}},{"ruleId":"D2","level":"warning","message":{"text":"firebase-messaging-sw.self.addEventListener(\u0022notificationclick\u0022) (cognitive 18): firebase-messaging-sw.self.addEventListener(\u0022notificationclick\u0022) has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 4 (6 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 5). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/firebase-messaging-sw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5960450d28631f364b593ad4d50203c55f34eb495304b68a5e535c11cd7a8f17"}},{"ruleId":"D2","level":"warning","message":{"text":"ArticleBody.build (cognitive 17): ArticleBody.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/article/widgets/article_body.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef0b2d675aafe4b252093a443d12afd984da22c627431b50e11592cf783165f"}},{"ruleId":"D2","level":"warning","message":{"text":"NoteEditorCubit._applyRemoteChange (cognitive 17): NoteEditorCubit._applyRemoteChange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da77ba3182ca8a954332907c41ae77d3d857bfabdfeb7a2b964fe4c4e74be1b"}},{"ruleId":"D2","level":"warning","message":{"text":"_CollabNoteEditorViewState._onImageTap (cognitive 17): _CollabNoteEditorViewState._onImageTap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 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/community/view/collab_note_editor_view.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed2a39819c5cfbf4d8c75a58c9392ab1003d57b9fcb999c9f45446c0f727ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"_AddDeadlineSheetState._save (cognitive 17): _AddDeadlineSheetState._save has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 6, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/deadlines/add_deadline_sheet.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"360249c5e7fb2eca88868fdb57b08d014bbb3b5cb64a39f76a8bad0e0e2e3d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"_DeadlinesCalendar.build (cognitive 17): _DeadlinesCalendar.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (5 pts), ternaries 1 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/deadlines_view.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eee4aff0f5e4b2f2e013790b79a43856fe1028e1cf2ddae6945087e724fb52"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawingToolbar.build (cognitive 17): DrawingToolbar.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (12 pts), loops 2, match/switch 1 (2 pts), if/else 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/community/widgets/collab_notes/editor/drawing_toolbar.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa86d8ab382ffb7bc816a94c5bdfd939797641295672918fd220ea542d6c2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadlineGroup.build (cognitive 17): DeadlineGroup.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (13 pts), loops 1 (2 pts), boolean chains 1, if/else 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/community/widgets/deadlines/deadline_group.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a850b6f3752da5d6fe609ab1aa11dfc916de9655e2f2b4be11e937708bfb16df"}},{"ruleId":"D2","level":"warning","message":{"text":"_FeedImageState.build (cognitive 17): _FeedImageState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 6, if/else 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/widgets/feed_image.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9689a614426d3934043a2135b07caf589103571504bcfe3103a164e0aafaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"FriendsMapCubit._loadGeoSettings (cognitive 17): FriendsMapCubit._loadGeoSettings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (6 pts), boolean chains 4, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c39d0edc71e23e117be63ff994d594b4399ba664f14c7989f621a3aaffa410d"}},{"ruleId":"D2","level":"warning","message":{"text":"NinjaFriendsPanel.build (cognitive 17): NinjaFriendsPanel.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/widgets/ninja_friends_panel.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"466d83d7fd694ef34ac69231afead2325431b38aafb8d505e939cf730a5c3f29"}},{"ruleId":"D2","level":"warning","message":{"text":"MarketListingCard.build (cognitive 17): MarketListingCard.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (14 pts), if/else 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/market_listing_card.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7361c4173c14c72b8e875beb109bdc9b6a2b26f395ec01477cdf7217324326"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniAppsCatalogCubit.load (cognitive 17): MiniAppsCatalogCubit.load has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 3 (5 pts), boolean chains 3, match/switch 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/cubit/mini_apps_catalog_cubit.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc16453e14e51db908fda6296ac4c3d4f4bb43b40f5ff5712710b69c0c34fca"}},{"ruleId":"D2","level":"warning","message":{"text":"PollsCubit.load (cognitive 17): PollsCubit.load has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), ternaries 3 (4 pts), loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/cubit/polls_cubit.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"761d6cd8b590840f3a757506a3467d42053239de14003750f175a5b8ee371066"}},{"ruleId":"D2","level":"warning","message":{"text":"_PollCreatorSheetState._buildContent (cognitive 17): _PollCreatorSheetState._buildContent has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 4 (5 pts), match/switch 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_creator_sheet.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec94fda1aaedbacc384368286ef9dc51bd7c65bee6af28f7da7c5428a8738fe"}},{"ruleId":"D2","level":"warning","message":{"text":"PromoSectionView.build (cognitive 17): PromoSectionView.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), loops 2 (4 pts), match/switch 2, if/else 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/promo/view/widgets/promo_section_view.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d139c9e1e5fb494f2191d6621898943c547c6c02badbc5de9ddc5599154e6f2"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyticsStats.fromLessons (cognitive 17): AnalyticsStats.fromLessons has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 2 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/analytics/analytics_stats.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68491f41cf3d34632e5255aa13a230f92e0ca3ad9491a12bb69cab4c3da8714"}},{"ruleId":"D2","level":"warning","message":{"text":"_ScheduleOverlapSwitcherState.build (cognitive 17): _ScheduleOverlapSwitcherState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, if/else 5, boolean chains 1, loops 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/schedule/view/schedule_page/schedule_overlap_switcher.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7d000ea68a0ad64e2101c5e40c61b06fe446a152799fe8d7de618f71c5ec68"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleWeekDayData.ScheduleWeekDayData (cognitive 17): ScheduleWeekDayData.ScheduleWeekDayData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_week_day_data.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffbcafb5046c5e0635386e39586742fd51aa9090ca5c17662e4dcfd6ef6d061"}},{"ruleId":"D2","level":"warning","message":{"text":"LessonFieldChangeChip._buildChangeContent (cognitive 17): LessonFieldChangeChip._buildChangeContent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_diff/widgets/lesson_field_change_chip.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"904023fcfff4cc85b2ace0f103733bcf9671b98a1fadb3bd4e8b76d0f1f71092"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServicesNfcCardState._activate (cognitive 17): _ServicesNfcCardState._activate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/view/widgets/services_nfc_card.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff9e3e21d0b998e0ed608a31ddc181f72649248b0ade14e9fc1fc7e357ce13b"}},{"ruleId":"D2","level":"warning","message":{"text":"AppScreenHeader.build (cognitive 17): AppScreenHeader.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, ternaries 5 (7 pts), loops 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_screen_header.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c423de4f44a816e9dd1b08ca5c6780178ab6a6314a94344022dfec54e7a258f"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppInputFieldState._build (cognitive 17): _AppInputFieldState._build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, if/else 4 (5 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/forms/app_input_field.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba4d918ea0138dae137ae77249bdb474ed0591dfd5b71063dbb0fe0f46adfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"_GalleryImageItemState._openImage (cognitive 17): _GalleryImageItemState._openImage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (6 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/images_horizontal_slider.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcf71ea6aa56f9b0a5207970548608b5efd7447dc27953ef5b3b3e6c9ffcdc3"}},{"ruleId":"D2","level":"warning","message":{"text":"NinjaStudyGroupMemberRow.build (cognitive 17): NinjaStudyGroupMemberRow.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (8 pts) (nesting depth added 9). 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/study_group/view/ninja_study_group_member_row.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18a123b9c10b822b5e04750c916ed5374b875b68eb089cb1a2aa8968946be42"}},{"ruleId":"D2","level":"warning","message":{"text":"TeacherDayContent.build (cognitive 17): TeacherDayContent.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_day_content.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"15868f3a48227f9089cfa4bd28dcc34511b05653c8441a9d1fa6d89f0830278f"}},{"ruleId":"D2","level":"warning","message":{"text":"sync_communities.run (cognitive 17): sync_communities.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/sync_communities.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d8036e443e1486561017d6bacf4fb1122690da325251bb3ccb76884e335077"}},{"ruleId":"D2","level":"warning","message":{"text":"app_store_build_status.get_release_status (cognitive 17): app_store_build_status.get_release_status has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_build_status.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"73800c55722e5724d6171a470a31a3a80234c94808f4453a784cfc359797deae"}},{"ruleId":"D2","level":"warning","message":{"text":"build_web.public_config (cognitive 17): build_web.public_config has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/build_web.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ac3286279d65fa0669de41dadc8a9cef747ab741648e0b71d0fb5ccf0769d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ci_plan.workspace_graph (cognitive 17): ci_plan.workspace_graph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 5 (7 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ci_plan.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a54de98bfaa77ef5ebb4dfb77f859a8cd85a4db12716dc9e7aea329461a1543"}},{"ruleId":"D2","level":"warning","message":{"text":"configure_firebase.release_config (cognitive 17): configure_firebase.release_config has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/configure_firebase.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7c2691cab27ee938a7f65d42784f59f87d8a3925623755a2be8be6331f4f25"}},{"ruleId":"D2","level":"warning","message":{"text":"import_shorebird_release.binary_identity (cognitive 17): import_shorebird_release.binary_identity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"tool/import_shorebird_release.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed063e026d05159ad77e60b137d23061cde86a1a0accecf8043d2e2def53a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"UniversityProviderConfigurator.configure (cognitive 16): UniversityProviderConfigurator.configure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, ternaries 4, boolean chains 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/university_provider_configurator.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2124b0819e7756df9bd9d8361edc3fdda01c3dc2f11ca043ba14763df79379"}},{"ruleId":"D2","level":"warning","message":{"text":"UniversityProviderSource.parse (cognitive 16): UniversityProviderSource.parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/university_provider_source.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e5667adad9f4b1144fa83bb83c1db186392b7cb03d61e5cf2a18c6bea17243"}},{"ruleId":"D2","level":"warning","message":{"text":"_ThemePreferencesSyncState._restore (cognitive 16): _ThemePreferencesSyncState._restore has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), error handling 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/app/widgets/theme_preferences_sync.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fd26604c9f0a450fde1a5722d84d29579a026ef22b836e566ec9e387bb8d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"RemotePreferenceSync._performRemoteRestore (cognitive 16): RemotePreferenceSync._performRemoteRestore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/common/bloc/remote_preference_sync.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"51aa9938829b8d770d6807749c9f604427136f67fe8fdbd264555bc5cfdf37b3"}},{"ruleId":"D2","level":"warning","message":{"text":"NoteEditorCubit.persistLocalDraft (cognitive 16): NoteEditorCubit.persistLocalDraft has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bed3d9c0082af47979bf193174df3c56c8a64a581f16f91602cba4d3ac44508"}},{"ruleId":"D2","level":"warning","message":{"text":"EventsBody._content (cognitive 16): EventsBody._content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/events/events_body.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e1c205c2d6c8f5b69194bf50995e92eafe06c34ec10d6af6e3edc47997f282"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawingCanvasState._down (cognitive 16): DrawingCanvasState._down has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/drawing_canvas.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb6040c88a0e439513b3a4335a15424417ff5c6a108b4400c14d04bfb42ee1b"}},{"ruleId":"D2","level":"warning","message":{"text":"FeedHeroPost.build (cognitive 16): FeedHeroPost.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/widgets/feed_hero_post.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feda793dc0807b17ec3540398ce57ef90525177aa0c720e0a36f4fc3a2c9839"}},{"ruleId":"D2","level":"warning","message":{"text":"_KnowledgeBankViewState._download (cognitive 16): _KnowledgeBankViewState._download has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_view.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"803b4aaee610232dddd8df6f47f6e388b8a686368f37fbcff690641cd34fc6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferencesMapDataCache._write (cognitive 16): PreferencesMapDataCache._write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_cache.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eecca40c891bb6ecb8f7c235dcc4e1ef5c60218782bc5f53ab788487c20b67"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRepository.loadCatalog (cognitive 16): MapDataRepository.loadCatalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1797035e88cb2822c78609654daaf909cbd78e9f55b1cf6fdd71d1fd458bb0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRepository.loadSvg (cognitive 16): MapDataRepository.loadSvg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"730eb4d5876e329b99b588e0f14de89e79867b4d4f93907a2c3053370d5598dc"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapProposalReviewState._review (cognitive 16): _MapProposalReviewState._review has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (6 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_community_sheet.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c69f52083edc3752024eb944274a4022338528668e4c7a60c6a44a7b805696"}},{"ruleId":"D2","level":"warning","message":{"text":"MapPlacesIndex.select (cognitive 16): MapPlacesIndex.select has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_places_index.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c41894aa97308a123f9a9e97a89b9fdd36502bf176dc61188a0c6003e7d261"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniAppRunnerCubit._refreshScreen (cognitive 16): MiniAppRunnerCubit._refreshScreen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/cubit/mini_app_runner_cubit.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8522c29bfe8d177669339e260ce050da689983a64b339597265c3f68a5cd90f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppActionsSheet.build (cognitive 16): _AppActionsSheet.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/view/app_actions_sheet.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c424e4443092d028f804b5d3a3c78bbf98eb8b5f17cd8f91bab706d790e204e"}},{"ruleId":"D2","level":"warning","message":{"text":"NfcPassCubit.confirmBinding (cognitive 16): NfcPassCubit.confirmBinding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (4 pts), error handling 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/nfc_pass/bloc/nfc_pass_cubit.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85d19608d2c9e3e57034b91e316ac0622415a74eb54d18210badb161b1fa9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationsState.fromJson (cognitive 16): NotificationsState.fromJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/cubit/notifications_cubit.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb135e91d5766a4d85296bd36ea02a6f3d6f0db6e3717708de5c3bf84d5cbfe1"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationInboxSnapshot.fromJson (cognitive 16): NotificationInboxSnapshot.fromJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/data/notification_inbox_repository.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c138aa06f839f44889921584bc6c3aba46be3847771b4cc4d889d9d0016797"}},{"ruleId":"D2","level":"warning","message":{"text":"_PushHistoryListenerState._record (cognitive 16): _PushHistoryListenerState._record has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 3, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/view/push_history_listener.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a87767b044d64165e017ae3a0b6ab4dd57bde59cbe934e636a9d843c574c38"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingSettingsStepState.build (cognitive 16): _OnboardingSettingsStepState.build has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, ternaries 5 (6 pts), if/else 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/onboarding/widgets/onboarding_settings_step.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"20331c48b60c11852b553156e9504018e3cd4c86e93ab0ddf6649fa8e9c2497c"}},{"ruleId":"D2","level":"warning","message":{"text":"_GroupLinkSheetState.build (cognitive 16): _GroupLinkSheetState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 9, if/else 3, boolean chains 2, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/group_space/group_link_sheet.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e244c527861062b56da8b0efef7ffe5ef161eb161e791cd8c3f92e7edf9697c3"}},{"ruleId":"D2","level":"warning","message":{"text":"_ChangesPageState.build (cognitive 16): _ChangesPageState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (6 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/changes/changes_page.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"20488ad5280fec30bd663d2b3c3100cfaf035b8d31ce85cff24d51f90c30734b"}},{"ruleId":"D2","level":"warning","message":{"text":"_GroupPickerSheetState.build (cognitive 16): _GroupPickerSheetState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/widgets/group_picker_sheet.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41300159d6f519fd966a15bc463cdc1ee8ddac8b116f5a9d61b281278bd910d"}},{"ruleId":"D2","level":"warning","message":{"text":"_LessonMaterialUploadSheetState._pickImage (cognitive 16): _LessonMaterialUploadSheetState._pickImage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_details_page/lesson_material_upload_sheet.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"272e3bd07f8d3997d4c26f24504c22936eed43ad63f2e898f5d60d1ee5223a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"_AddScheduleResults.build (cognitive 16): _AddScheduleResults.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (7 pts), match/switch 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/add_schedule_results.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda1d3e1c31cbc11f2c325f5228b436ee74c48ba39f204af83d82109aa254d65"}},{"ruleId":"D2","level":"warning","message":{"text":"_SearchSheetState.build (cognitive 16): _SearchSheetState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/search/view/search_sheet.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c481158ed298846b0f5f393426919454c5399446e4b9b6d76a95da9ebaea186f"}},{"ruleId":"D2","level":"warning","message":{"text":"_BannerAdContentState.build (cognitive 16): _BannerAdContentState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ads_ui/lib/src/widgets/banner_ad_content.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"127860fc3db1d9f56e1eabb8cd712f6b25b1820b2ec7aeccc8e3d578fe0e71e0"}},{"ruleId":"D2","level":"warning","message":{"text":"AppGlassLiteMesh.build (cognitive 16): AppGlassLiteMesh.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 2). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/glass/app_glass_lite_mesh.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d441f6ba341d5a52a1be72e2253c32b2a726d1e8179b8f5c2b30a82ec3590e"}},{"ruleId":"D2","level":"warning","message":{"text":"NinjaBanner.build (cognitive 16): NinjaBanner.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 4, ternaries 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e334e18c0820059937d82cfb94d20c80f5e2016f1a5cb57efaae04af01454"}},{"ruleId":"D2","level":"warning","message":{"text":"AppListRow.build (cognitive 16): AppListRow.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 5, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_list_row.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b758f34364865c60735e20a4411a530cd61e7f4231bdec0f450bde411034a"}},{"ruleId":"D2","level":"warning","message":{"text":"SupabaseCollabNoteRealtimeSession._subscribe (cognitive 16): SupabaseCollabNoteRealtimeSession._subscribe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/supabase_collab_note_realtime_session.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee1b32dc6dd5c3b9a8c08c6f19634025d019691ce68277da017961e5424fec0"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkLocationClient.geolocate (cognitive 16): NetworkLocationClient.geolocate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/network_location_client/lib/src/network_location_client.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c24b15634018fe85adcef6450f64859ef8f3f4c30c35a92c57c3a7384bd67e"}},{"ruleId":"D2","level":"warning","message":{"text":"TeacherDashboardScheduleSection.build (cognitive 16): TeacherDashboardScheduleSection.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_dashboard_schedule_section.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6d478bf6ba66269bb3d08a9eb80d1aed8cb3644d91dabb169d2242f4b69621"}},{"ruleId":"D2","level":"warning","message":{"text":"TopTopicsContent._content (cognitive 16): TopTopicsContent._content has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 5, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/top_discussions/view/top_topics_content.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea79028590249322ad93f5d7690d8c5e243e70527aedd7c780b0ba31cba3d040"}},{"ruleId":"D2","level":"warning","message":{"text":"TelegramFetcher._convert_message_group_to_raw_data (cognitive 16): TelegramFetcher._convert_message_group_to_raw_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (3 pts), ternaries 3, boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68023b7ffb16d689e09286574fa99a00947d52e476e176eed00c171ab356709"}},{"ruleId":"D2","level":"warning","message":{"text":"ci_packages.run_packages (cognitive 16): ci_packages.run_packages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ci_packages.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e156877465ac363fd90368c4aaeed742bbc677e345d7dfed4f74e6ab680405fd"}},{"ruleId":"D2","level":"warning","message":{"text":"shorebird_provider_patch.prepare (cognitive 16): shorebird_provider_patch.prepare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/shorebird_provider_patch.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"320e9ba431ce689e036bf22f5d3e7366e06151932aef60ef84acc4fa2f847bed"}},{"ruleId":"D2","level":"warning","message":{"text":"verify_campus_map_api._read_response (cognitive 16): verify_campus_map_api._read_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/verify_campus_map_api.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f606f2bdfe3cf05cb9ab89c55194121094c27f39a37f49f9104d1f22f2596f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduleWidgetEntryView.body (cognitive 16): ScheduleWidgetEntryView.body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/HomeWidget/ScheduleWidget.swift"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b607a81ddb964205332d121ff50310d1b19b98a8168b2427c98d505f966e21de"}},{"ruleId":"D2","level":"warning","message":{"text":"index.Deno.serve() (cognitive 16): index.Deno.serve() has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-deploy/index.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66267c7cc7b50ef7309f465ff1864ef02031d0d609f547b89b869894fa63de7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppTheme._buildTheme: MethodTooLong \u2014 _buildTheme runs 320 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 220 over it, 3.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":"packages/app_ui/lib/src/theme/theme.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace1132aee64e9762530d3d7151ac8e3a97f70c4a4da9f9a7cfe3be07a46917f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapPlaceDetailsSheetState.build: MethodTooLong \u2014 build runs 319 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 219 over it, 3.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_details_sheet.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4b883bc783e9f6fa145c5ba323896a3be7182be7839777faad71014223a210"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CampusRepository: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b566d6a8d8adbbaf5d0ef099efdbffcacf678ed1737e207b72d0dc1871464325"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScheduleWeekView.build: MethodTooLong \u2014 build runs 274 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 174 over it, 2.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_week_view.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"db41d089ad004d526181274c7344efd8f301f49adf3a4dfb2a5ab4b067b9a996"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MapViewState: ClassTooLong \u2014 1087 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 687 over it, 2.72\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed621794fdf50c6b347d08e8786cd82ffef1b1e946850ac9544d52c9a5c04ea9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeDashboardContent.build: MethodTooLong \u2014 build runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/home_dashboard_content.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"291ff070bab196d15f5497071be4b80cd8f8470bbca8c7ae2dc7750b4d2c14fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ScheduleBodyState.build: MethodTooLong \u2014 build runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_body.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da9db2555a964fbb19c7e34dafcd0f0ef73563e9e4c1cd18cf85fc4c387030f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScheduleDayView.build: MethodTooLong \u2014 build runs 247 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_day_view.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37c7e4344d4f38ae83115a3313457e707a4c15f4c039f7d40d136e894c3afd1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CampusRepository: ClassTooLong \u2014 942 significant lines (blank, comment-only and punctuation-only lines excluded), 87 methods. The bar is 400 significant lines; this is 542 over it, 2.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33244887e53e2ef2989c56064689f5009c88586f8b0d95bb7b79c3f666a25bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapViewState._buildMap: MethodTooLong \u2014 _buildMap runs 232 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd23433f0e74a20e37e9755ffd2311eff10e05a356432dcff2da7e44d074f34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/map_graph_editor_page.dart: FileTooLong \u2014 1158 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 658 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_graph_editor_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7700a09a519977aa7dae1111303a7b7f028a162657d332d6d9576c3054467077"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/map_view.dart: FileTooLong \u2014 1133 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: _MapViewState (54-1460). The bar is 500 significant lines; this is 633 over it, 2.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"442277cc5ff83039d4b2a6e62d44b380d38f4dd11a11d29932f8f42e1a3492ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/build_showcase_seed.mjs: FileTooLong \u2014 1052 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 552 over it, 2.10\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":"scripts/build_showcase_seed.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"981399171606c7b52d4f009f0748e33304b24caed0f6f326df3ef7141dbecade"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MapDataRepository: ClassTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 414 over it, 2.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cd47fc5396edd7dd22fca5ac33b8d17a8231a8e5960066c7c5bdcea1229d61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NinjaLessonRow.build: MethodTooLong \u2014 build runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd8f23b7882984967dcaf5848c7afb527dd7c92bc64ab104b6170bb0c8a5325"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ScheduleShareSheetState.build: MethodTooLong \u2014 build runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb493b7feaaef03f1a0912dc3cdce697a97acb145f689a6bd129f0476748d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LabelsPainter.paint: MethodTooLong \u2014 paint 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/map/widgets/map_cartographic_layer.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4386b63ce12323da6828eda7d3f5a3c200025890b561cd0bc5c799c56331834f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/campus_repository.dart: FileTooLong \u2014 963 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: CampusRepository (18-1299). The bar is 500 significant lines; this is 463 over it, 1.93\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca43402da6c4d5412899bb7e46277297b62a76b1eb1addc84c754ccef3b5d7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FriendsListViewState._buildContent: MethodTooLong \u2014 _buildContent runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/view/friends_page.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c022baa0aea9e6ceefbc2f81eb771bb2703f0a775dc3ccf7cb7fabdae08c5f70"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppColors: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/colors/colors.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db24de63ea3dff92d6d45ca746e4c03858c6acc5ea712eded23dd7625d7b492"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NoteEditorCubit: ClassTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 305 over it, 1.76\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bbcb0745e2c131abf88b07bd38cfd0ae0170e682356c217a1eb05e633f43f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapFloorAlignmentPageState.build: MethodTooLong \u2014 build runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_floor_alignment_page.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc87d5b1de692e7ff6f9d58781d3708c7cf519b1f7e4580fa61ac4481e471e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GroupSpaceViewState._content: MethodTooLong \u2014 _content runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/view/group_space_view.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81fa6aaa9fa31975f2a78b92b19f1eff77f8d2612bc36970226595ecd4e7118"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ServicesViewState.build: MethodTooLong \u2014 build runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/view/services_view.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0836cd05e9ad8421664c31805eb6d01f743564bb0517636be643924715a98c12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/map_data_repository.dart: FileTooLong \u2014 863 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: MapDataRepository (69-1130). The bar is 500 significant lines; this is 363 over it, 1.73\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/map/data/map_data_repository.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316dbc288d5b043f20502feb09831dd4eba05c892f215e1ef06272154e714c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MaterialUploadSheetState.build: MethodTooLong \u2014 build runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_upload_sheet.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cc0749e0fbb1c30ce8f13154ea90e513901c1debd59306d865b8d0c60825ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.createNotificationHandler: FunctionTooLong \u2014 createNotificationHandler runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08ece9e26645e1e2c90817ab3cb5fa58c0c823863842ab458cf4e4b4d0d9f41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _KitImagePickerState.build: MethodTooLong \u2014 build runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d0f506af8348ea5562d1b04629f462f1ac97196f740d577a81860f65174981"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.createNotificationHandler.\u003Creturned closure\u003E: FunctionTooLong \u2014 createNotificationHandler.\u003Creturned closure\u003E runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c91d029f2a41d3c1958d190f38131d9f0edf1be79348ff5ad3cbc196ed63b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SvgInteractiveMapState: ClassTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded), 30 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/map/widgets/svg_interactive_map.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"47291d5ec0608625f0a468b48fcff5586338617fa40e1d8be323eb5889ea52a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MapDataRepository: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc59bf6dee27d44eb582618d378fab777cb1b900eff9a34ee6f25fab1706bb35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScheduleChangePresentation.fromChange: MethodTooLong \u2014 fromChange runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/widgets/schedule_change_presentation.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8879b36bbf582614c37980943dc59d03dfdf387749a3b00410ec6cab796deaa6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ComparePageState.build: MethodTooLong \u2014 build runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/compare_page.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"915237af8b083852697df3ace6b030a1e2eabe6012ca33e78fd4d8f89f723630"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FriendsMapCubit: ClassTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 221 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d4588afc4e72af449af47162e62ef3a64784a9f7e622a10ecaecff900d047f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MapFreeRoomsPanel.build: MethodTooLong \u2014 build runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_free_rooms_panel.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b17f535b599919f4d3c9cb6bc31cf06bea8cd8c1efea270b976581088da0f22"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MiniAppsRepository: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mini_apps_repository/lib/src/mini_apps_repository.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a3829022354f06f9b170eecad934e11ae2978c60d94a6f54216001cddc87b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.build: MethodTooLong \u2014 build runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/app/view/app.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"029bf327daa58a5d2a1d01e3ec3c6f117d238ebe225d0ebaf5a5c9b022ba6f00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PollCard.build: MethodTooLong \u2014 build runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_card.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c919fa54f85751fa894940a4745205cb3427757ef7207d2391910bc14831b113"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScheduleBloc: ClassTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 194 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"48903d267f7e43a4d19b7cc37675740fe411ad7ee08282318f487bfde42f3d9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EditSchedulePageState.build: MethodTooLong \u2014 build runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/editor/edit_schedule_page.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9cb5e6637edde508d4c49ba767d4f941a0ac8d80ff9ce1740561132c47d49d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: buttons/app_button.dart: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 225 over it, 1.45\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":"packages/app_ui/lib/src/widgets/buttons/app_button.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc61f329176b05c61ac83bdd6a21142afb562a2e36bf3e64daa91a4ac5b09c70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _VolumeLabelsPainter.paint: MethodTooLong \u2014 paint runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"152351d5efa9b865adcd8feddc8b060ae0710dbb4340ed18d4569eb8c72cd893"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/svg_interactive_map.dart: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: _SvgInteractiveMapState (71-872). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db255974a60915a0d96c4bc8d8197a18b2979798212424992579a0ead6ca9bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: note_editor/note_editor_cubit.dart: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: NoteEditorCubit (20-909). The bar is 500 significant lines; this is 221 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee92b3081bdb56d6fc20f2b5c429643b98398aa862fa81ade584298b48426df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NoteToolbarState._buildToolbar: MethodTooLong \u2014 _buildToolbar 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/community/widgets/collab_notes/editor/note_toolbar.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"56169b053540c4f02d01b98767eb4e42ffd8baadb7fb7ced2968f79d0b2e7dd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NoteEditorCubit: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0f139784433d9777dd445d492795429cc29ed94a7042e343a88f89d522fecd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MapBloc: ClassTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 172 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71a85f5a7e38d6df03933b96e4b2bdd6d20d16cd21d579042b37ec09f3b677e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PollsViewState.build: MethodTooLong \u2014 build runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/view/polls_view.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"973eb59d903581d8a46cbb027d1865104d83a57901cb7da2804ace58696a4fdd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _KnowledgeBankViewState.build: MethodTooLong \u2014 build runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_view.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7db1874affa716f9c48b6560f798e13d50a78ceaee4e8217b838ca698c60a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SvgInteractiveMapState.build: MethodTooLong \u2014 build runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"07af94bc1672b347ed1cde24df20eff7c07bb6e600e1bc36b6f611c05accb30f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScheduleExporterRepository.exportScheduleToCalendar: MethodTooLong \u2014 exportScheduleToCalendar runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a4da8128917ee60160f0d590970b759b4fa81e5c85362a6adeb024750045c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UniversityConfig.fromEnvironment: MethodTooLong \u2014 fromEnvironment runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/config/university_config.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"780524cfbec3ea2e78690dc4194bdc0cb1e1ebba6f97a5423f036486097cd01f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NinjaGeoSharingSheet.build: MethodTooLong \u2014 build runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/widgets/ninja_geo_sharing_sheet.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07a09311baabee4e9243eefd6dd344dd7c43358cdfad3b76e8fe739f8394f51"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppPromoCard.build: MethodTooLong \u2014 build runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_promo_card.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"89745b15d2bdb3bf4f44fba5844fe614ec60bd29899889070961643a1d0cb712"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MiniAppsRepository: ClassTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 145 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mini_apps_repository/lib/src/mini_apps_repository.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b378fad252bae1dda08f38620e84dfa9fa20e07105ecf283f2e8ce4e3042bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapRouteTimelineState.build: MethodTooLong \u2014 build runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_timeline.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebc8340af80aa6cdcc3db9ba76d24e48a7806feefe86191c8ad48e97cc770dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppScreenHeader.build: MethodTooLong \u2014 build runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_screen_header.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"597ef27fb605984c720fb9cf617331944677a1d09708951f1ca485cd179bf726"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UniversityDeploymentConfig.fromJsonString: MethodTooLong \u2014 fromJsonString runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/university_deployment_config.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d01c15d5c263593620d6d5e50c8f0ea3bc3a1a92f1ef9a333093474fac8521"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapGraphEditorPageState.build: MethodTooLong \u2014 build runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_graph_editor_page.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f607f427445bbea1472763942c2b42f5db02553f53d0af40f2eb72a31989de6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapRouteNodePickerState._content: MethodTooLong \u2014 _content runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_node_picker.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1e9024ea8b3233fc550bfc4c206bfaf84032d37dd1268f4f630be5dec3cdd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CreateTeamSheetState._buildContent: MethodTooLong \u2014 _buildContent runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/team_finder/create_team_sheet.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"601118091a4557a633c4a972ae1a534b07ee7ec9b13af2c639d7881974efd06c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppLessonCard.build: MethodTooLong \u2014 build runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_lesson_card.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce1a6698ae83055efa6b2306f37b5a489f60d15d1c0cf54424928f3b689bc13"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _MapViewState: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/view/map_view.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1653d5671496576576fcaa02cffa5f9c95c00bee84ee1cbdaedea843d970465d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: story_viewer/story_viewer_page.dart: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/view/story_viewer/story_viewer_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd4a1776340bc8a22d6d26ac18890da1bd656f942fc070799c4a82a065ec594"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PreviewServicesPageState.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design_preview/pages/preview_services_page.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"926a0eb6814845932bdb040fc348d6ede806d98547d432e4bce6e05bfb2eb399"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PollCreatorSheetState._buildContent: MethodTooLong \u2014 _buildContent runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_creator_sheet.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a42e8ebcbec82fc710d6eba03099e30b709660c080ac65d6258d5726105c34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScheduleMonthView.build: MethodTooLong \u2014 build runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_month_view.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c582cac0a6495aa72018fafe1c0396bcedbfeb4e52eba33101d5678c359ab07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cubit/friends_map_cubit.dart: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: FriendsMapCubit (21-832). The bar is 500 significant lines; this is 137 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f300baf295e52f48205ecfaf9cdec1bd5f1ec6a7872bf9a454f02ceb15cdf90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaterialRow.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/knowledge_bank/widgets/material_row.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f610ede632da726700743b8b9675f88695cfa86a00ba456903d93edbd8464ad2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TeacherProfilePageState._content: MethodTooLong \u2014 _content runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/teacher_profile_page.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"93282f459a3baf933d0cf96bcfc83394e2a289e37dd8d835f3e6c372578ad2e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapPlaceEditorPageState.build: MethodTooLong \u2014 build runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_editor_page.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b35ad34311f6f16756605f67955323ce8616d210bbc330c3dcacee2f35a551"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CustomLessonEditorViewState.build: MethodTooLong \u2014 build runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/custom_lesson_editor_view.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"be130d12cffbf9d716055ec0cc349645a29f0285caa47a58ff94079ac685a022"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/routes.dart: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/navigation/routes/routes.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe72f3f62fa411fe509c16bfe47ce4154b3c66cd5830f63c3195fcf8ad5b946"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StorySlide.build: MethodTooLong \u2014 build runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/view/story_viewer/story_slide.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e7a09709274d21294e0a86f041a9242d1178af1ee45c91bbadcae72ee24d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MarketSellSheetState.build: MethodTooLong \u2014 build runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/market_sell_sheet.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff9381ed0b1409ee9cb8d790325e4f2e9d5c3c61c99409cdb33510e369445f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bloc/schedule_bloc.dart: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: ScheduleBloc (26-811). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aed8d8451fc5caa937508c3ecd1e9c729c0eaf2a9e3a30b38c89e3ba1f4a684"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CollabNoteEditorViewState.build: MethodTooLong \u2014 build runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/collab_note_editor_view.dart"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b80a0c7a44918cb961929199704b828081b633332ab997cebfb0b37923e5b84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppSectionTitle.build: MethodTooLong \u2014 build runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_section_title.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74d32b736588941ead6990a4bec8541a8c6a467cb7ffd7b80dac480a552a3ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AppSliderState.build: MethodTooLong \u2014 build runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_slider.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aa31f1c4e46dc45c68c01f885fd21b5aa55c776af757e85f60169035611905"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MapPlaceDetailsSheetState: ClassTooLong \u2014 485 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 85 over it, 1.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_details_sheet.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41d56cc64279f11eb5b414865219c63836393a5bc241cfa8d9c1b63b2c5aa6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DesignPreviewAppState.build: MethodTooLong \u2014 build runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design_preview/design_preview_app.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c7737ec08ecce5ffe1e735bed001dcd75196c0ff26ddec3a5e0f8177be91d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NinjaGroupNoteCard.build: MethodTooLong \u2014 build runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/group_space/ninja_group_note_card.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6909f2a372d68d525695d5effb17ba48a994ab004f2f0d22a13a30a60356d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: push_webhook.createPushWebhook: FunctionTooLong \u2014 createPushWebhook 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":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea14af37de43320e57138114054f2bdc33d696da6aef36081e59f25e7232a87"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FriendsMapCubit: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6211b758ed44e16f72fee4db12becd67ca205c2b0b5c7715dc245a03e6ff031e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScheduleGlanceAppWidget.ModernMinimalWidget: MethodTooLong \u2014 ModernMinimalWidget runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/ninja/mirea/mireaapp/glance/ScheduleGlanceAppWidget.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b4c6bb141450b3354ccc0dff5ea2dde82dd944dc243219e565e8dcb9b95d47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _QuestionCard.build: MethodTooLong \u2014 build runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/creator_questions_step.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2fb120e04ed372e5e6daabccd6ad7434efe9890c85ab3cc9cbeaf7982494f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MaterialBatchUploadSheetState._buildContent: MethodTooLong \u2014 _buildContent runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c1b1c587846de8a236d3e481562e80e67ac5a670ecea0d768f8ecd9862e152"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RoutePainter.paint: MethodTooLong \u2014 paint runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_layer.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"48260d5852e3c50ce2ec8c6df63042dbeae61cc23d95525351c7f49d9833ee91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DeadlinesViewState.build: MethodTooLong \u2014 build runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/deadlines_view.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f657fb9c7c57d76a3e5fb7b4fa1458c9b7d63efd37fe01f4d2ae9c11f6762ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComparisonDayDetails.build: MethodTooLong \u2014 build runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/widgets/comparison_day_details.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f8c83f6581ae90718c1fdc083b2c58ac78c5e52fe01214fec678ac397170ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: push_webhook.createPushWebhook.\u003Creturned closure\u003E: FunctionTooLong \u2014 createPushWebhook.\u003Creturned closure\u003E runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a5d0ef042b62c33f32063425f86c6525b8ec121a412baa0e92434b11fa266c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bloc/map_bloc.dart: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: MapBloc (19-715). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"139c66c7a5ce42b2ead83fe4d6205e9eb2ecba55af667695d5fc186678f0f65a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MentorProfileSheetState._buildContent: MethodTooLong \u2014 _buildContent runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/mentorship/mentor_profile_sheet.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fe332a8d0246859923a61af1d6016b21afdb3c0567157e32f5dac1d7bafee2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommunityDetailPage.build: MethodTooLong \u2014 build runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/communities/view/community_detail_page.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97440307dd8887e1c62f3d239309055235c4ebe5c4d3d0cf605dd46190d5380"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FriendsMapViewState.build: MethodTooLong \u2014 build runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/view/friends_map_view.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1917dc28bf0e15dbb356f7ece0237b5217f6709ab1ba2d3b8758a5563f4b850"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UniversityConfig: ClassTooLong \u2014 457 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 57 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/config/university_config.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb93b753ed7aaafdedc935781487cb9183d6233c2b68ec77729158b68f68de76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeTopRow.build: MethodTooLong \u2014 build runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/widgets/home_top_row.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde16732d19fd5ba50f2f9d9ac7fb53ae68191764fbeb80030c36249fba0c3bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: telegram/client.py: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 over it, 1.14\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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b718d829d7e77e34324be10afbf1fc720ad48599a69e3ee4080109607486df6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CreateEventSheetState._buildContent: MethodTooLong \u2014 _buildContent runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/create_event_sheet.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2276e3427ca1bd9ff4054f529579337119e559c17e7fae575e331541b3cfee76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SignUpViewState.build: MethodTooLong \u2014 build runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/sign_up_page.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac3575fd5fba82169461fd2f0deae8f9ce4cae24367e1bb222d980c44a7a4a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool/app_store_submit.py: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_submit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b97b022b0188a159ed7a8d18366e8f906522feec8567ab550f957ca43b279b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/map_place_details_sheet.dart: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: _MapPlaceDetailsSheetState (44-674). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_details_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d135a46fd91a1bea33d9dd035b2118f25a724cef2d99ef89cb11ebc00347bbd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LostFoundItemSheet.build: MethodTooLong \u2014 build runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lost_and_found/widgets/lost_found_item_sheet.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a086f2d84edce46757c26e6029d38c24c0a42f5bf76ab1d5455eab7eaa89c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mini_apps_repository.dart: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: MiniAppsRepository (20-812). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mini_apps_repository/lib/src/mini_apps_repository.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"febbbed3dfd0b7bc0840acb2ff6d451e69e30dc58576c2e86a78d20b433cdd23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/map_volume_layer.dart: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f324c441a0237de744815d6fb57963a2cc99bcfdbed7f941949df47e3d22911"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppInnerHeader.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":"packages/app_ui/lib/src/widgets/app_inner_header.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c339495e66d54fc57a0c7915c1b0e2975db71d220ce044b0a15558a333306"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppNinjaRankHero.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":"packages/app_ui/lib/src/widgets/gamification/app_ninja_rank_hero.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3531480fb2c6d5809b5bcdd2470cb93958f49fad748527f40f0843a20284959a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AddDeadlineSheetState._buildContent: MethodTooLong \u2014 _buildContent runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/deadlines/add_deadline_sheet.dart"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"886c121872ad2f6a13d82e868836161b158f904954fc753ec960c551a2381347"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppWeekGridCell.build: MethodTooLong \u2014 build runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_week_grid_cell.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9388c4068b9fb5e6d412c1d01e9382c76909ea41fefe99da208587e50b3dd53a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _GroupSpaceViewState: ClassTooLong \u2014 431 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 31 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/view/group_space_view.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"935725f4f44a2ab4d4fa9372be920dbdfcace1ae22cb7b87c89414964aa7130e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PollRunnerSheetState.build: MethodTooLong \u2014 build runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_runner_sheet.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1ec31f407329cb676f9ae448d0e8616991ba18a9c26cc0e057b6c9a589bd7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScheduleRepository: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/schedule_repository/lib/src/schedule_repository.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76bdb4b0ff2440b25e681d6c239c449e18ce000d23719ad9f39c4cdc13ba555"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sheets/schedule_share_sheet.dart: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: _ScheduleShareSheetState (98-594). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b7b78e7885dc32f1d3f37628e90ef22f42130b56581276782538822e86e3e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapRouteGuidanceState.build: MethodTooLong \u2014 build runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_guidance.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09f0f358740d82f8f1fb4f3848b55456002d33435a8b93671b0bb6aa451709f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExamTopics.build: MethodTooLong \u2014 build runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/session/widgets/exam_topics.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8d9e5ea3e0d09c3bd862f61b91aa42cdf1107ec76e2fdff6f59b47cd97b88d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _CollabNoteEditorViewState: ClassTooLong \u2014 420 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 20 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/collab_note_editor_view.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc84e59da8f434be0ebbc997f520cab86ece260346ab7623560bc65ce0f73a3c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScheduleWeekView: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 19 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_week_view.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1618341f7e72797521d5dca4de93db4e8df41e836ab708352d4e455bdff88d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/map_floor_alignment_page.dart: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: _MapFloorAlignmentPageState (122-629). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_floor_alignment_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"315fb4a47aa7b0454d88a9fdb0cd6f579527cafca78675cb189faf285dbb99f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AppTourLayerState._buildLayer: MethodTooLong \u2014 _buildLayer runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tour/view/app_tour_overlay.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6179fc6b266de12680fe9bda409d0500b3ef5489b2b33caed2e9bc08de686a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.Deno.serve(): FunctionTooLong \u2014 Deno.serve() runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"84652e791401755ad4d014019ac7312e7e8dea1ba008305c4e18f2a2468457bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScheduleBloc: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"19efca46b5d80dbb942d457dc10d92b5118e17d877fef83a79e25b4f19ea0152"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FriendsRepository: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/friends_repository/lib/src/friends_repository.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3ae077c4c30286ea29844ad5d6c60e93c61c8cf6db59bfa185cd53daa84d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KnowledgeBankList.build: MethodTooLong \u2014 build runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_list.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f82990d78604c772d5df58f405c7f3be5f0438168e785e089e2c38f6e130d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NinjaGroupSpaceHero.build: MethodTooLong \u2014 build runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/group_space/ninja_group_space_hero.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c87657f7e81b8483138c1aa2ed4d60fc5f1bd7773deb4a01e488930ac87d900"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ScheduleOverlapSwitcherState.build: MethodTooLong \u2014 build runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_overlap_switcher.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f71d8b6538bf675c554ad38295d3e18528719603291afae6722b043f799e262"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SessionViewState.build: MethodTooLong \u2014 build runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/session/session_page.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"50584fd2580cfa8001b5a9ed03c8f90100a46ed1dc330421cccd1ec5a485a378"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _StoryViewerPageState.build: MethodTooLong \u2014 build runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/view/story_viewer/story_viewer_page.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac38f386c3783ac91687451332dd82b6c674b1d2db6c5852dba773b0d1a50433"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaterialGridCard.build: MethodTooLong \u2014 build runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_grid_card.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8d511c5d57e11e8821c24cb956a69c7c5a34e33936bb63e81c5a7770e52438"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ProfileContentState.build: MethodTooLong \u2014 build runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/view/profile_content.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e8166d7a335beebaa7568cc4bbe9a02941286b830c434494ee2056e3dda62a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeLessonRow.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/home/view/widgets/home_lessons_group.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d852156ec037e70dea7cfae00fca79d8eb434887fef91bda05de89dbd4c1cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapViewState._geographic: MethodTooLong \u2014 _geographic 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/map/view/map_view.dart"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca05817ea046488935672f53eadbe0079e2085bcc7d9dd5486bb38e3c363d96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarketListingCard.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/marketplace/widgets/market_listing_card.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ff62f805b385df562f446aa33e229f85066cffedc5276ddc8fadd466b1bcb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MiniAppSubmitViewState.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/mini_apps/view/mini_app_submit_view.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fcfad87409f7e4f0f98b39e6132d817d2f02f817ab02a67fb5163c18976185"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TeacherDashboardScheduleSection.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/teacher_account/widgets/dashboard/teacher_dashboard_schedule_section.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7019eec3e40b91ece18b34da11fbf44a63a1373095002cbc3ea2f3b1911884"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScheduleLessonCard.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":"wear/lib/schedule/view/schedule_lesson_card.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b18249f2998b45b6acf5c74a69dbddc3028bf90ab444464155e5f21efac745"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (39 shared lines): lib/schedule/view/schedule_page/schedule_month_view.dart:322-410 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:191-264 \u2014 These two members are variants of one another: 39 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_month_view.dart"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b3b3bfa8ec2ac24648ffc4bae6ca9bcaa1f5f1155380589e8daffacc14cd84"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): packages/app_ui/lib/src/ninja/surfaces/ninja_list_cell.dart:106-176 | packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart:33-98 | packages/app_ui/lib/src/widgets/gamification/app_settings_toggle_row.dart:28-80 | packages/app_ui/lib/src/widgets/gamification/app_sheet_action_row.dart:28-88 | packages/app_ui/lib/src/widgets/gamification/app_sheet_toggle_row.dart:24-67 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_list_cell.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a437328224a3915dca5d004aa69f035567d0aa344c1b2b55860dbfe2ed19648c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/community/cubit/collab_notes/collab_notes_cubit.dart:22-36 | lib/community/cubit/team_applications/team_applications_cubit.dart:18-32 | lib/community/cubit/team_finder/team_finder_cubit.dart:16-30 | lib/marketplace/cubit/marketplace_cubit.dart:19-38 \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/community/cubit/collab_notes/collab_notes_cubit.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70ed9973088b286c660d49c21ce3367177bf986b4160415d7a916ec6f25e638"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/discourse_post_overview/view/post_overview_comment_tile.dart:21-100 | lib/nfc_pass/widgets/nfc_how_it_works_step.dart:14-61 | lib/search/widgets/search_coach_callout.dart:16-48 | lib/wallet/widgets/wallet_coming_later_note.dart:8-24 \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/discourse_post_overview/view/post_overview_comment_tile.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcbf0085cb14da15a6886f58f8e6a1b287525685a05eac403912ae1e1a3f12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): wear/lib/schedule/view/schedule_empty_view.dart:9-59 | wear/lib/schedule/view/schedule_error_view.dart:13-93 | wear/lib/schedule/view/schedule_loading_view.dart:41-124 | wear/lib/schedule/view/schedule_not_paired_view.dart:9-64 \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":"wear/lib/schedule/view/schedule_empty_view.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a88554ec7a2b1751a03f3b60d2eaf5609170a3c6e2116f982adcf3acd1b6b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): lib/schedule_management/view/add_schedule_row_skeleton.dart:6-38 | lib/schedule_management/view/hub_row_skeleton.dart:6-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/add_schedule_row_skeleton.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf7704848057daf7aacc1d7db588cec208ff8edea217422ec4a613435be8943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart:58-88 | packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart:108-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b627f29b37f6fb638a8f5297ebfb4cd7a7314e97777c281985a0a8e5de68b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): lib/friends/view/find_friend_card_skeleton.dart:6-36 | lib/friends/widgets/friend_row_skeleton.dart:6-36 \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/friends/view/find_friend_card_skeleton.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad180c340cb0a9a354a98e1e7b456a156b2bb43662a9e5690714ce4f91734829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): packages/app_ui/lib/src/widgets/gamification/app_settings_toggle_row.dart:50-80 | packages/app_ui/lib/src/widgets/gamification/app_sheet_toggle_row.dart:37-67 \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":"packages/app_ui/lib/src/widgets/gamification/app_settings_toggle_row.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb8711112140b37cf2ad8022644316b60d2d09ab0e79eba5edd57a10ffe465f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/people/widgets/people/ninja_friends_tab_skeleton.dart:32-60 | lib/people/widgets/people/ninja_group_tab_skeleton.dart:56-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/people/ninja_friends_tab_skeleton.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba87f78c219189f448976d9a363f2c50afeb0a7dc545403519ccf3d9139ff56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/marketplace/cubit/marketplace_cubit.dart:191-213 | lib/marketplace/cubit/marketplace_cubit.dart:223-245 \u2014 both copies are in the same file, so extract the block 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/marketplace/cubit/marketplace_cubit.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f53b72335f1a7edb9d4a65aa4436ea01a3c8adae6ca92c058ea3497e34ddb5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): packages/stac_bridge/lib/src/widgets/kit/stac_app_select_field_parser.dart:49-71 | packages/stac_bridge/lib/src/widgets/kit/stac_dropdown_menu_kit_parser.dart:54-76 \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":"packages/stac_bridge/lib/src/widgets/kit/stac_app_select_field_parser.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b712c1edb9359b2a8133c2e6c828159d9d760536fe8cf6a732db1eb16d3181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): lib/profile/widgets/edit_identity_sheet.dart:94-115 | lib/profile/widgets/edit_profile_sheet.dart:110-131 \u2014 before extracting anything, compare \u0060lib/profile/widgets/edit_identity_sheet.dart\u0060 and \u0060lib/profile/widgets/edit_profile_sheet.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/widgets/edit_identity_sheet.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6321d7b1ca63d7b5f466cb79a2bf2f814404a021f495cf31bcf8bc499aa1306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/marketplace/cubit/marketplace_cubit.dart:95-115 | lib/marketplace/cubit/marketplace_cubit.dart:140-160 \u2014 both copies are in the same file, so extract the block 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/marketplace/cubit/marketplace_cubit.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2e56dbc463bc82d48b0d3916b99f034c894665a43f85f4ecf2644d48a380a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/marketplace/cubit/marketplace_cubit.dart:117-137 | lib/marketplace/cubit/marketplace_cubit.dart:162-182 \u2014 both copies are in the same file, so extract the block 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/marketplace/cubit/marketplace_cubit.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b147734b5ba01741770981d0c6401c8e9a4b68b8189389ecf287a5352855652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/people/widgets/people/ninja_people_group_member_card.dart:59-79 | lib/people/widgets/people/study_group_invite_card.dart:84-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/people/ninja_people_group_member_card.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6c8577782304890a0e494f9c64d228749769b1e30aa75193eeaf3907e5c663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): lib/design_preview/pages/preview_services_page.dart:265-283 | lib/services/view/services_view.dart:281-300 \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/design_preview/pages/preview_services_page.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfbb38be3a08331ffe7a8224009320f816fe3eae54ecc6048de81b648ce77aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/friends/widgets/ninja_geo_sharing_toggle_row.dart:56-75 | lib/people/widgets/people/study_group_action_card.dart:46-65 \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/friends/widgets/ninja_geo_sharing_toggle_row.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"34704bab095d7632362b378b20675681d2859799c215469c52ff225e25ba8cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): wear/lib/schedule/view/schedule_empty_view.dart:33-51 | wear/lib/schedule/view/schedule_error_view.dart:43-61 | wear/lib/schedule/view/schedule_not_paired_view.dart:39-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/lib/schedule/view/schedule_empty_view.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5ef1b88ffc829f90522dad6bf2ba6192003c9ef25a212243300fd8424fcb12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/search/view/search_empty_state.dart:51-69 | lib/search/view/search_results.dart:219-237 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/search/view/search_empty_state.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c932f31c9fa489fc3ff404bb795399372f757354a6da181caf7aa209033f8dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/watch/bloc/watch_connectivity_cubit.dart:82-100 | lib/watch/bloc/watch_connectivity_cubit.dart:135-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/watch/bloc/watch_connectivity_cubit.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"25715d5e6e0ac8e6a4f358defc6636837d1c0675dfbad58d4b44a1c072124a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): packages/app_ui/lib/src/ninja/surfaces/ninja_display_header.dart:52-69 | packages/app_ui/lib/src/widgets/app_screen_header.dart:119-137 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_display_header.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1f5ece381268c9eac5c9c61f840eb0f05207277e3ab5c5fbcd45eca17f6195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart:47-65 | packages/app_ui/lib/src/ninja/widgets/app_radio.dart:41-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d251c40c6875ff86ba71fafa14e609b6ddbc5d8b5e74abdb6448430bd2fd0fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart:61-79 | packages/app_ui/lib/src/widgets/gamification/app_sheet_action_row.dart:56-74 \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":"packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e3b5f16a26a33dd7dbbb046167a7e8f4e8e5b1a5f9a0f54daa60dbe1cc4f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/schedule/view/schedule_page/schedule_month_view.dart:393-410 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:247-264 \u2014 before extracting anything, compare \u0060lib/schedule/view/schedule_page/schedule_month_view.dart\u0060 and \u0060packages/app_ui/lib/src/widgets/app_calendar_month.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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/schedule/view/schedule_page/schedule_month_view.dart"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"627cea9832e85749fdb4867d75d540aa5212d6a81de466c96c9e20cd64788c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/schedule_management/view/empty_schedule_results.dart:8-25 | lib/schedule_management/view/schedule_zero_state.dart:8-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/empty_schedule_results.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f370f863db43a2d51792e93b9392275591b69cf042a833830ac49fcf9179134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart:71-87 | packages/app_ui/lib/src/ninja/widgets/app_radio.dart:85-102 \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":"packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caebdf97dc8ae5f604891e7d67c245c55c9111e2ced3dfe410cf6cfbe5b74fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): lib/map/widgets/svg_interactive_map.dart:328-342 | lib/map/widgets/svg_interactive_map.dart:371-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0489982720349f1b23016ca7e4979cd6c45b7580324b52d45f2d8ee235162af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/people/widgets/group_space/ninja_group_note_card.dart:25-41 | lib/study_group/view/ninja_discover_study_group_card.dart:18-34 \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/people/widgets/group_space/ninja_group_note_card.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa619bf5b6874c6e62a33a29f2906a16c8ca763dc8e00d89b0718991e536011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/schedule_management/view/create_schedule_row.dart:51-67 | lib/schedule_management/widgets/schedule_hub_row.dart:79-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/create_schedule_row.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb07526efedab2d426468077930628a0fa8dce51386e7c6fb19520db34866437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): wear/lib/schedule/view/schedule_empty_view.dart:9-24 | wear/lib/schedule/view/schedule_error_view.dart:13-28 | wear/lib/schedule/view/schedule_not_paired_view.dart:9-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/lib/schedule/view/schedule_empty_view.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bc71009e5ffe96c9192c86bd89e3c26f4824bc1b4a35c16a68d6d37aceaf72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/community/widgets/mentorship/mentorship_skeleton.dart:13-28 | lib/community/widgets/team_finder/team_list_skeleton.dart:16-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/mentorship/mentorship_skeleton.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e995cb3820ba2e06123783b91f1dd9cdb2a202ede73245d47621f00ca67ea329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/people/view/people_page.dart:165-180 | lib/study_group/view/study_group_view.dart:38-53 \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/people/view/people_page.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc7501501df8478e7984a4ddf0fde2e869a7a961ccc138fba7425a4c5503d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/schedule/cubit/schedule_changes/schedule_changes_cubit.dart:41-56 | lib/schedule/cubit/user_activities/user_activities_cubit.dart:23-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/cubit/schedule_changes/schedule_changes_cubit.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afa4a4187c2d012fa84b97c601a6c157821067593da57eaaf4f54aa8d5c9b25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/study_group/view/ninja_study_group_member_row.dart:77-92 | lib/study_group/view/ninja_study_group_request_card.dart:41-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/study_group/view/ninja_study_group_member_row.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57101e9655d718e962d8689b72b299a3f58052ad82175ceef77a09e6dbd8139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packages/app_ui/lib/src/colors/colors.dart:248-263 | packages/app_ui/lib/src/ninja/ninja_colors.dart:198-213 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/colors/colors.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb5159a166396263b42ef5501cddf17518e86a5c01cdc5bad89b5ac25fc1658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/community/widgets/mentorship/mentor_profile_sheet.dart:273-287 | lib/community/widgets/mentorship/mentor_request_sheet.dart:136-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/mentorship/mentor_profile_sheet.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c02a31dbb13f127acb883307b3e5e37a52d4d48e0038d3c4356a1a81711da28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/design_preview/pages/preview_home_page.dart:95-109 | lib/design_preview/pages/preview_schedule_page.dart:48-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design_preview/pages/preview_home_page.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc24cf2fd4523d3f2c69974a0646e5ee35894d8e7b06fb9a9639c349eb31c93c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/map/bloc/map_bloc.dart:195-209 | lib/map/bloc/map_bloc.dart:350-364 \u2014 both copies are in the same file, so extract the block 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/map/bloc/map_bloc.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a865667ba804095b1ef2b88c21d49235c43c6b58b9f8bfff73a0c34f9e6b4257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): lib/people/widgets/people/ninja_friends_tab.dart:111-125 | lib/people/widgets/people/ninja_study_group_tab.dart:129-141 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/people/ninja_friends_tab.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"53627388d9fe4f7b85aaf2c0a51a4086aa81bb6fdf866cc01b38da8e3fac2afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/profile/widgets/ninja_path/ninja_path_skeleton.dart:41-55 | lib/profile/widgets/ninja_path/ninja_path_skeleton.dart:95-109 \u2014 both copies are in the same file, so extract the block 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/profile/widgets/ninja_path/ninja_path_skeleton.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"007109d4f34a4973c304c2532c98a702c2e7b328460bae4256e8a9ca1ee3b7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/schedule_management/view/edit_row.dart:25-39 | lib/schedule_management/widgets/schedule_hub_row.dart:39-53 \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/schedule_management/view/edit_row.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a338f44c1d025ee62525b700a2a6c13eb7fcda077a08a048b9510162b0f8d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/search/view/trending_row.dart:21-35 | lib/search/widgets/search_result_item.dart:38-52 \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/search/view/trending_row.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1091f6bf7e445d4a6973a86caa5cd95f33eac2f695ae28d709f9be6a7ffa215d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): packages/app_ui/lib/src/widgets/gamification/app_leaderboard_row.dart:54-67 | packages/app_ui/lib/src/widgets/profile/app_leaderboard_preview_card.dart:61-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/gamification/app_leaderboard_row.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a396f6ec699dc31ab1c84ff8c6065a42b788355fe9ddba6ca7e9ffd991a93c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): packages/community_catalog_repository/lib/src/client/community_catalog_client.dart:10-24 | packages/service_catalog_repository/lib/src/client/service_catalog_client.dart:10-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/community_catalog_repository/lib/src/client/community_catalog_client.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77b6d203b18a6e2cd701b35ab49300f39d754f43092ac619ad40d35b1002785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): packages/lost_and_found_repository/lib/src/lost_found_repository.dart:318-332 | packages/lost_and_found_repository/lib/src/lost_found_repository.dart:335-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/lost_and_found_repository/lib/src/lost_found_repository.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c6d95eae10d32b3db2a64b32cf41f1c4d82d4539fc6f1722ce7b4e817ec768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/communities/widgets/community_catalog_skeleton.dart:45-58 | lib/communities/widgets/community_catalog_skeleton.dart:92-105 \u2014 both copies are in the same file, so extract the block 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/communities/widgets/community_catalog_skeleton.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b39b8726b2d5433229164c06c693f791580acbfb905a65777d643b455545f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/community/widgets/events/event_card.dart:62-75 | lib/community/widgets/events/event_detail_sheet.dart:67-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/events/event_card.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1f321d818701786772d8c417b6433a54a6d1fee9c63fc3daae4604aea4b8bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/marketplace/widgets/listing_media.dart:47-60 | lib/marketplace/widgets/market_media_thumbnail.dart:46-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/listing_media.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d19fc6c681f8c1ef8c80ca210f8765a389cd5955384cc267dcbad3813ca013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/navigation/routes/routes.dart:850-863 | lib/navigation/routes/routes.dart:874-887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/navigation/routes/routes.dart"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c7e1aca18e8e7de108c66176e7115401f5a701e8288a8bc4e41990a5584c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/people/widgets/people/people_map_banner.dart:18-31 | lib/people/widgets/people/study_group_action_card.dart:23-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/people/people_map_banner.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c66c9b10a50cefeb14ae0a76d4bf04e885576af546bfe579ec750fb7c617e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/schedule_management/view/edit_body.dart:11-24 | lib/schedule_management/view/hub_body.dart:28-41 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/edit_body.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcc3438cfd9f6d874b205f02794df3bccec76ccc37332595ba4e450d6e2fa75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/app_ui/lib/src/widgets/app_empty_state.dart:58-71 | packages/app_ui/lib/src/widgets/app_error_state.dart:64-77 \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":"packages/app_ui/lib/src/widgets/app_empty_state.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e5887f3938f51cd02c2b64f115791942c109f1c6bf6fc15e2e68234b7111a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart:54-67 | packages/app_ui/lib/src/widgets/gamification/app_settings_toggle_row.dart:43-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67e714ca96c160b9160c4d28d3a1c0ae1521772576dade39be3aeec87a5180d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/study_groups_repository/lib/src/study_groups_repository.dart:32-45 | packages/study_groups_repository/lib/src/study_groups_repository.dart:55-68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/study_groups_repository/lib/src/study_groups_repository.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3630f0070a498b65dd31b7cc5b1bb89f907668d8a64355f894b2c5b3254513ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): wear/lib/schedule/view/schedule_loading_view.dart:63-76 | wear/lib/schedule/view/schedule_not_paired_view.dart:14-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/lib/schedule/view/schedule_loading_view.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dc349bc43abded5827fe3a60156e80edb8ce4f93f6dd4c9be3fab871e9ee04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/community/cubit/mentorship/mentorship_cubit.dart:73-85 | lib/community/cubit/mentorship/mentorship_cubit.dart:92-103 \u2014 both copies are in the same file, so extract the block 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/community/cubit/mentorship/mentorship_cubit.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af03f52c070fb897d0d069836cdfc71d8750543577258f4981d42a1e208d3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/mini_apps/widgets/mini_app_secret_sheet.dart:146-158 | lib/mini_apps/widgets/mini_app_tokens_sheet.dart:140-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_secret_sheet.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"034aea3b123196032dcb6af76009cf496d4840f51bbe6226d047b9d98f5f99b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/people/widgets/group_space/ninja_group_announcement_card.dart:24-36 | lib/people/widgets/group_space/ninja_group_space_hero.dart:42-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/group_space/ninja_group_announcement_card.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e68e2496b728b0aee954b168ef0c69e29d3d4675155a8e6aa954c28b2c97ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): lib/schedule/view/schedule_page/schedule_month_view.dart:361-373 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:224-234 \u2014 before extracting anything, compare \u0060lib/schedule/view/schedule_page/schedule_month_view.dart\u0060 and \u0060packages/app_ui/lib/src/widgets/app_calendar_month.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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/schedule/view/schedule_page/schedule_month_view.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8b54d55f74b8b9fdbef58f0cf587a00f81639b8bde89e15b5550156ea7b24c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): packages/app_ui/lib/src/ninja/surfaces/ninja_empty_state.dart:115-127 | packages/app_ui/lib/src/ninja/surfaces/ninja_error_state.dart:74-85 \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":"packages/app_ui/lib/src/ninja/surfaces/ninja_empty_state.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58c80f4d16eb0b5b2966cf08e60b12b94f8a1c6d3f5490decfdcb41fcd16ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/app_ui/lib/src/widgets/app_list_row.dart:97-109 | packages/app_ui/lib/src/widgets/app_list_row.dart:276-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_list_row.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcf8af526669581899d0954e0a067d630a5805e9a10d2c096b9d87c0e406f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/app_ui/lib/src/widgets/app_spinner.dart:32-44 | packages/app_ui/lib/src/widgets/buttons/app_button.dart:511-523 \u2014 before extracting anything, compare \u0060packages/app_ui/lib/src/widgets/app_spinner.dart\u0060 and \u0060packages/app_ui/lib/src/widgets/buttons/app_button.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"packages/app_ui/lib/src/widgets/app_spinner.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f50361ba1e514ebdc4cac08f441bcc462309c203e07313c8e4b94a3dba7d08f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/lost_and_found_repository/lib/src/lost_found_repository.dart:400-412 | packages/lost_and_found_repository/lib/src/lost_found_repository.dart:418-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/lost_and_found_repository/lib/src/lost_found_repository.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b38d917f622be17c5cafe0f485c46f6eaf35360d6bc3ecdf4354bd3b667fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): lib/community/cubit/deadlines/deadlines_cubit.dart:96-107 | lib/community/cubit/deadlines/deadlines_cubit.dart:131-142 | lib/community/cubit/events/events_cubit.dart:82-93 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/deadlines/deadlines_cubit.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c790292b72e11ba60358fa23f8b22e345d45550f593cd7b941f9275483f8d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/community/widgets/team_finder/team_applications_skeleton.dart:15-25 | lib/community/widgets/team_finder/team_list_skeleton.dart:21-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/team_finder/team_applications_skeleton.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2878fe7c19a1ec15f61832e4680f2dee0b15d9ef293708590a9a5d0a4e24e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:358-369 | lib/knowledge_bank/widgets/material_upload_sheet.dart:290-301 \u2014 before extracting anything, compare \u0060lib/knowledge_bank/widgets/material_batch_upload_sheet.dart\u0060 and \u0060lib/knowledge_bank/widgets/material_upload_sheet.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b4d6e55047fa27515a250adf4aba335c00b9a9d401f4e3148e946ff244996f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:376-387 | lib/knowledge_bank/widgets/material_upload_sheet.dart:348-359 \u2014 before extracting anything, compare \u0060lib/knowledge_bank/widgets/material_batch_upload_sheet.dart\u0060 and \u0060lib/knowledge_bank/widgets/material_upload_sheet.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e7f62b3a658983df4942590f0833a37c978465cf92443421fcb106235d22f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/study_group/widgets/create_group_sheet.dart:49-60 | lib/study_group/widgets/join_by_code_sheet.dart:34-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/study_group/widgets/create_group_sheet.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"318bc4ea831bd31e688004d957a81e605a7dfbe2739df43df9ffa90003639604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/teacher_account/widgets/dashboard/teacher_dashboard_rating_section.dart:42-53 | lib/teacher_account/widgets/dashboard/teacher_schedule_status.dart:34-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_dashboard_rating_section.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e67e027d843cee02bd673e6b4f84f99b215ce2c760b0217df4c71f0d1a3eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): packages/app_ui/lib/src/ninja/surfaces/ninja_list_cell.dart:136-147 | packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart:69-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_list_cell.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"076613c36ebc91af2e09f94edcdaba121f15c6dca71b3f71756da014c1890340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): packages/app_ui/lib/src/widgets/app_spinner.dart:86-97 | packages/app_ui/lib/src/widgets/buttons/app_button.dart:563-574 \u2014 before extracting anything, compare \u0060packages/app_ui/lib/src/widgets/app_spinner.dart\u0060 and \u0060packages/app_ui/lib/src/widgets/buttons/app_button.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"packages/app_ui/lib/src/widgets/app_spinner.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ccbcc840deefadef25d27b89a57824c43d7d44cca8cd8b4b5f5318b1f64c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 3): lib/article/cubit/followed_sources_cubit.dart:14-24 | lib/article/cubit/saved_articles_cubit.dart:14-20 | lib/marketplace/cubit/market_favorites_cubit.dart:12-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/article/cubit/followed_sources_cubit.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"308f75fed7aaabbe09b049fc9026e1a78b701dec28c81219fd776857b9535285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/feed/widgets/feed_hero_post.dart:83-93 | lib/feed/widgets/feed_post_row.dart:54-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/widgets/feed_hero_post.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc127a97293107df5c90a88a7fa1f86881b585581967dd22aa15c8078f4530a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/friends/view/corner.dart:20-30 | lib/friends/view/corner.dart:31-41 \u2014 both copies are in the same file, so extract the block 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/friends/view/corner.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfbf86be3df6319cec16ec4e9bc7386d8c903d97781ac76560a0fc390a10cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/knowledge_bank/view/knowledge_bank_view.dart:234-243 | lib/knowledge_bank/view/knowledge_bank_view.dart:272-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_view.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08ccf6f1f22b3ec03711feadf41176914aa1c300d5829105c8c841379421a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:334-344 | lib/knowledge_bank/widgets/material_upload_sheet.dart:256-266 \u2014 before extracting anything, compare \u0060lib/knowledge_bank/widgets/material_batch_upload_sheet.dart\u0060 and \u0060lib/knowledge_bank/widgets/material_upload_sheet.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd0be78883f0b34dccb544bfec365c2447d924e706af4688b4568b853c05368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/mini_apps/view/stats_content.dart:19-29 | lib/people/view/group_space_view.dart:136-146 \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/mini_apps/view/stats_content.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0551f090d276e2165c35ddcbaf3f8cd733719a3ade4013859a25e3d88ba76986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/news_blocks_ui/lib/src/text_lead_paragraph.dart:15-25 | packages/news_blocks_ui/lib/src/text_paragraph.dart:15-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/news_blocks_ui/lib/src/text_lead_paragraph.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"03812846c88ad5914440442ca25871146886fcc052ef6d91a66be864231eb9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): lib/community/cubit/collab_notes/collab_notes_cubit.dart:27-36 | lib/community/cubit/team_applications/team_applications_cubit.dart:23-32 | lib/community/cubit/team_finder/team_finder_cubit.dart:21-30 | lib/marketplace/cubit/marketplace_cubit.dart:29-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/collab_notes/collab_notes_cubit.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"feabbceea68646a4d6a9714cf3ee4a011a4178be62ad457923a47652d5e3168c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): lib/discourse_post_overview/view/post_overview_comment_tile.dart:21-30 | lib/nfc_pass/widgets/nfc_how_it_works_step.dart:14-23 | lib/search/widgets/search_coach_callout.dart:16-25 | lib/wallet/widgets/wallet_coming_later_note.dart:8-17 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/discourse_post_overview/view/post_overview_comment_tile.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0247ef900f11e40ab6dc50dc54ee667a98594cd646997d0bafeed2ff84a56a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/attendance/widgets/attendance_skeleton.dart:33-42 | lib/grades/widgets/grades_skeleton.dart:19-28 \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/attendance/widgets/attendance_skeleton.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b53616b1c97e00df34f1033652e6c5ccdf3c8b89650d697ea752db7f6d3fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/community/widgets/collab_notes/collab_note_card.dart:96-105 | lib/community/widgets/collab_notes/note_save_status.dart:64-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/collab_note_card.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4af2974cd9fbe66655f296594b10b3c49334cfe23d2934e0dc1e4a4ff0393e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/friends/cubit/friends_map_cubit.dart:769-778 | lib/people/cubit/people_cubit.dart:143-152 \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/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f992f2b122b81202805122717019c4df5865a4dad3a931602765ff315a98f9e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/friends/widgets/ninja_geo_sharing_toggle_row.dart:34-47 | lib/people/widgets/people/study_group_action_card.dart:30-39 \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/friends/widgets/ninja_geo_sharing_toggle_row.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d21dd24aca7a385f9229725b20c0afcdf289bdd180c24c1c1ebe49f081c2cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/map/bloc/map_bloc.dart:285-294 | lib/map/bloc/map_bloc.dart:469-478 \u2014 both copies are in the same file, so extract the block 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/map/bloc/map_bloc.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf6f133cd58b3a4482f7efca2d19a4271ce471eeea0e0fdd24d3f74b7f46019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/profile/widgets/edit_identity_sheet.dart:169-178 | lib/profile/widgets/edit_profile_sheet.dart:186-194 \u2014 before extracting anything, compare \u0060lib/profile/widgets/edit_identity_sheet.dart\u0060 and \u0060lib/profile/widgets/edit_profile_sheet.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/widgets/edit_identity_sheet.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d8f72785e8e81ae4970ae712e52b5718d634e37eec19ceab0a1aac5a4b8a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/profile/widgets/ninja_path/leaderboard_list.dart:10-19 | lib/profile/widgets/ninja_path/ninja_path_skeleton.dart:149-158 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/widgets/ninja_path/leaderboard_list.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"541ee982e9da354be50f5d9c7f21a8f775c833c8e2c997602b78c39acb7d4fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/schedule/view/schedule_page/schedule_month_view.dart:162-171 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:132-141 \u2014 before extracting anything, compare \u0060lib/schedule/view/schedule_page/schedule_month_view.dart\u0060 and \u0060packages/app_ui/lib/src/widgets/app_calendar_month.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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/schedule/view/schedule_page/schedule_month_view.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"78687bfa9465a1d38cdcf5cee4e83cb1852ca605ee0fc885d18b273b4b52cee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/schedule/view/schedule_page/schedule_month_view.dart:376-386 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:236-245 \u2014 before extracting anything, compare \u0060lib/schedule/view/schedule_page/schedule_month_view.dart\u0060 and \u0060packages/app_ui/lib/src/widgets/app_calendar_month.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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/schedule/view/schedule_page/schedule_month_view.dart"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4405a429526de8f2c01bd7f73017003d7b16ecbde2450f159c08683b01a926ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/app_ui/lib/src/theme/theme.dart:192-201 | packages/app_ui/lib/src/theme/theme.dart:218-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/theme/theme.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e167d71b8435b6ce95e19b3859aa890a40c5aba0fe1ef2ad57fc8ea2236b0b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/campus_repository/lib/src/campus_repository.dart:369-378 | packages/campus_repository/lib/src/campus_repository.dart:1260-1269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b36c2f987e1a54f12bca741f11f7112a3001e94163b5b7ff6ff76227492748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/study_groups_repository/lib/src/study_groups_repository.dart:115-124 | packages/study_groups_repository/lib/src/study_groups_repository.dart:153-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/study_groups_repository/lib/src/study_groups_repository.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc90c8c39326ea5754f193db531fb61b68094095f06ff411a00888ac085e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): lib/map/bloc/map_bloc.dart:136-143 | lib/map/bloc/map_bloc.dart:284-291 | lib/map/bloc/map_bloc.dart:467-475 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49e9d8533aea131581f9dab6dc6880b86afbba052bc1b8af6a51895822f1d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/community/cubit/deadlines/deadlines_cubit.dart:38-46 | lib/community/cubit/events/events_cubit.dart:32-40 \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/community/cubit/deadlines/deadlines_cubit.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e5c6820f9168d7cb1aa049266af5314703b2727f085e7ab50baa4643a23012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/community/widgets/events/events_skeleton.dart:9-17 | lib/polls/view/polls_skeleton.dart:8-16 \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/community/widgets/events/events_skeleton.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e49be6c847693de6813459053ce5393ad07df4c9c3bfed423edbd32c20209f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/knowledge_bank/view/knowledge_bank_view.dart:221-229 | lib/knowledge_bank/view/knowledge_bank_view.dart:246-254 \u2014 both copies are in the same file, so extract the block 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/knowledge_bank/view/knowledge_bank_view.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ad75d4da88d71a1e3ec16be973acb5f2208a18828b49224f6ede4d2130b2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/mini_apps/widgets/mini_app_tokens_skeleton.dart:15-23 | lib/mini_apps/widgets/revisions_skeleton.dart:16-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_tokens_skeleton.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac20bf33edbe01026163675fa8885720b33d35745e7ed9191b558105b81a96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/app_ui/lib/src/colors/colors.dart:274-282 | packages/app_ui/lib/src/ninja/ninja_colors.dart:237-245 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/colors/colors.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa119b2cba3e847f348b22676f51531a82faa3fdae7b524f51d127cbc1f8b614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): packages/app_ui/lib/src/widgets/mobile/app_chip_row.dart:152-160 | packages/app_ui/lib/src/widgets/mobile/app_chip_row.dart:162-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/mobile/app_chip_row.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b23aa1ed0aebbaef97b2519add11c6bfd2e3dd36881b76705474d3eff711689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/community_repository/lib/src/community_failure.dart:116-124 | packages/community_repository/lib/src/community_failure.dart:139-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/community_repository/lib/src/community_failure.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5e2807e9b946260dba1b81f5dd022cc706112ec02efec94cacb1872c594205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:119-126 | lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:138-145 | lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:156-163 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"672aed547d995376f9417114ab9e0c5078165fc4f054b19c653f07ed59a7553b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/knowledge_bank/view/knowledge_bank_list.dart:132-139 | lib/knowledge_bank/view/knowledge_bank_list.dart:177-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_list.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdc666976323e8edb7100414e540d6c78b3dc39f13ee59b7cf7495f2725accb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/login/view/login_page_form.dart:54-61 | lib/login/view/sign_up_page.dart:110-117 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/login_page_form.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed399700ecca1c396467cd90035f5b7a665406f16cd67fedb73edb7ff8cc0f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/map/bloc/map_bloc.dart:140-147 | lib/map/bloc/map_bloc.dart:406-413 \u2014 both copies are in the same file, so extract the block 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/map/bloc/map_bloc.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c7f5483f42d31da93d19d58aa67387290a353ccab6bc4687e0f99f19123e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/map/widgets/map_cartographic_layer.dart:276-283 | lib/map/widgets/map_volume_layer.dart:309-316 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_cartographic_layer.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e17082925b682ac1b6dd68bf5b190dd9cce570547b720c4d5c636a6a91bf7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/teacher_account/widgets/dashboard/teacher_rating_card.dart:18-25 | lib/teacher_account/widgets/dashboard/teacher_rating_shortcut.dart:18-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/teacher_account/widgets/dashboard/teacher_rating_card.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0797f16f51b23b91cdfe52d3d5a32382f3cbf182342a462b99f565bea3fcab6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/app_ui/lib/src/widgets/forms/app_search_bar.dart:133-141 | packages/app_ui/lib/src/widgets/forms/app_search_field.dart:201-208 \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":"packages/app_ui/lib/src/widgets/forms/app_search_bar.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7847508cfac05a2fac8480f4c52be41582e208c594d9c609841402568783e58d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/stac_bridge/lib/src/actions/stac_fetch_action_parser.dart:72-79 | packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart:99-106 \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":"packages/stac_bridge/lib/src/actions/stac_fetch_action_parser.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f682a25629d72ffdb44d0d5676c140578486353e775baea36b5a3d5b7f0c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/stac_bridge/lib/src/widgets/kit/kit_bool_control_view.dart:49-59 | packages/stac_bridge/lib/src/widgets/kit/stac_slider_kit_parser.dart:57-64 \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":"packages/stac_bridge/lib/src/widgets/kit/kit_bool_control_view.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f6aec3a6c5afcc9ae40b21dbb46637f43cc641de26d591deb173f0c288ebcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/communities/widgets/community_catalog_skeleton.dart:16-22 | lib/mini_apps/view/mini_app_runner_skeleton.dart:47-53 \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/communities/widgets/community_catalog_skeleton.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"70115128da2df06c758975c2ac439a8e8ff3f6eecaf8147ad711043fcdeec3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/free_rooms/widgets/room_photo_gallery.dart:205-211 | lib/marketplace/utils/marketplace_media_intake.dart:68-74 \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/free_rooms/widgets/room_photo_gallery.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"479d1da0afc006f0fbf85287c2b686b4830dd8f20e54ca334cc7d4ecce189289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/friends/widgets/friends_map_attribution.dart:13-19 | lib/friends/widgets/friends_map_controls.dart:23-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/widgets/friends_map_attribution.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ed7abc437a97ed841f6124ee7e295f597326a189274b9c4ffd13f0538ec8ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/login/view/login_page_form.dart:29-35 | lib/login/view/sign_up_page.dart:84-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/login_page_form.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0e6d50356f27b436cfa26d44516b6ff8f64b82a50adced55ff6fc998f973bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/profile/widgets/edit_identity_sheet.dart:117-123 | lib/profile/widgets/edit_profile_sheet.dart:133-139 \u2014 before extracting anything, compare \u0060lib/profile/widgets/edit_identity_sheet.dart\u0060 and \u0060lib/profile/widgets/edit_profile_sheet.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/widgets/edit_identity_sheet.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9987b8cd1a5fd7b5dde07b23bb6031fd9bde17f6114b2cd30f63a2ff20fb8db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): wear/lib/schedule/cubit/schedule_cubit.dart:72-78 | wear/lib/schedule/cubit/schedule_cubit.dart:123-129 \u2014 both copies are in the same file, so extract the block 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":"wear/lib/schedule/cubit/schedule_cubit.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"563d7aa2d6f9ecb76917b996ff6c14d0081e38d9afdfca617aae9ca593326d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart:34-42 | packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart:72-77 | packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart:123-128 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ac168c08bcfebe334faf89558b1e60bbdef63c3103db2bf5d38f29d5ef36e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/community/cubit/collab_notes/collab_notes_cubit.dart:88-93 | lib/community/cubit/collab_notes/collab_notes_cubit.dart:109-114 \u2014 both copies are in the same file, so extract the block 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/community/cubit/collab_notes/collab_notes_cubit.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3277accd89ee468ea00c015b07896a4550af83cbbd765bc5eb18f41c23315e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:171-180 | lib/knowledge_bank/widgets/material_upload_sheet.dart:161-170 \u2014 before extracting anything, compare \u0060lib/knowledge_bank/widgets/material_batch_upload_sheet.dart\u0060 and \u0060lib/knowledge_bank/widgets/material_upload_sheet.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd3beb90da116434764e58b1eb7715b614f2c71f64f68301f08a433f32d3a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/marketplace/widgets/listing_media.dart:75-79 | lib/marketplace/widgets/market_media_thumbnail.dart:131-135 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/listing_media.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef7df0e807f9d949a32a0948176ca8076200bee2555ac3aca8f728c121329d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/mini_apps/view/mini_app_runner_page.dart:69-75 | lib/mini_apps/view/mini_app_runner_view.dart:74-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/view/mini_app_runner_page.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f76a4a906c32212c67496a7e91eac7d2cd4b9f527a0bb3963fc69e4fcf19806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/onboarding/widgets/onboarding_identity_step.dart:285-298 | lib/profile/widgets/edit_profile_sheet.dart:277-290 \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/onboarding/widgets/onboarding_identity_step.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3ef9ca6d7ea8541955ee092f28e819945a393b0236411605582da3bab2b31b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/people/cubit/people_cubit.dart:235-239 | lib/profile/cubit/profile_cubit.dart:290-294 \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/people/cubit/people_cubit.dart"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3f14744fe4a4cf3493987b8df6776066873a5f33f9ab0bf0c43b2dfb49cccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/profile/view/notifications_settings_page.dart:14-24 | lib/profile/view/profile_settings_page.dart:102-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/view/notifications_settings_page.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1905737004f0484102d9eef1352ce52113b0d7159be76fde2a57ade58c688e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/campus_repository/lib/src/supabase_collab_note_presence_session.dart:51-57 | packages/campus_repository/lib/src/supabase_collab_note_realtime_session.dart:74-80 \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":"packages/campus_repository/lib/src/supabase_collab_note_presence_session.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"462ca8ea1d798e4f49829600cc2a430fb0d1a48350c95e270b92a79b09f0886b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/stac_bridge/lib/src/widgets/kit/kit_bool_control_view.dart:29-35 | packages/stac_bridge/lib/src/widgets/kit/stac_slider_kit_parser.dart:38-44 \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":"packages/stac_bridge/lib/src/widgets/kit/kit_bool_control_view.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"db636b0958f9dee792311779cfff34558a631ac5d1dff46a9bd25f49232619ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/ads/bloc/ads_bloc.dart:17-24 | lib/home/cubit/home_cubit.dart:25-32 \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/ads/bloc/ads_bloc.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eae267574ca7b1f1576977d8a580de83104abbf9360e7f7fc9435dd90aa4859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/article/cubit/followed_sources_cubit.dart:8-12 | lib/article/cubit/saved_articles_cubit.dart:8-12 | lib/communities/cubit/joined_communities_cubit.dart:8-12 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/article/cubit/followed_sources_cubit.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e541d72098b01f9e3b5195b6eaef471f1850d4970c66737c98679395a13103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): lib/community/cubit/deadlines/deadlines_cubit.dart:256-262 | lib/community/cubit/events/events_cubit.dart:171-177 | lib/community/cubit/mentorship/mentorship_cubit.dart:176-182 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/deadlines/deadlines_cubit.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d60acf1e1d6f7c4e8c7ef14519eeadbb2aecd298072d519b86366a7a4a0a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): lib/community/view/deadlines/add_deadline_sheet.dart:247-251 | lib/community/widgets/collab_notes/editor/note_toolbar.dart:271-275 | lib/community/widgets/create_event_sheet.dart:179-183 | lib/map/widgets/map_room_finder.dart:24-28 | lib/map/widgets/map_route_node_picker.dart:82-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/deadlines/add_deadline_sheet.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0645f5847b21df08eb0885864c6b975d2c7dd01d6e8714cbaef67b1524f36077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/community/view/deadlines/add_deadline_sheet.dart:399-405 | lib/schedule_management/widgets/updated_chip.dart:8-14 \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/community/view/deadlines/add_deadline_sheet.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b3ddf9150a3877ae16bfde1e5e8920c2f84219f77a0284068d174accc6fa93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): lib/community/view/deadlines_page.dart:11-21 | lib/community/view/events_page.dart:11-21 | lib/community/view/mentorship_page.dart:11-21 | lib/free_rooms/view/free_rooms_page.dart:11-21 | lib/polls/view/polls_page.dart:11-21 | lib/study_group/view/study_group_page.dart:31-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/deadlines_page.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b86df8c5b45528fc5a0ae6ee1e1d446ad7a7aa92b1c8c36b65973dbf48871d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/login/view/login_page.dart:18-26 | lib/login/view/sign_up_page.dart:15-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/login_page.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729527d8bfe4d294d6f79d6186024006b4e47b006014ecc39dac79f46f6d704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): lib/lost_and_found/view/lost_found_page.dart:11-23 | lib/mini_apps/view/mini_apps_moderation_page.dart:24-36 | lib/mini_apps/view/mini_apps_page.dart:21-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lost_and_found/view/lost_found_page.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7ffb3f6b701f63e73666f2f638e7db3dc91694c3868241a4e8504dcd361e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/mini_apps/widgets/mini_app_secret_sheet.dart:94-100 | lib/mini_apps/widgets/mini_app_tokens_sheet.dart:89-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_secret_sheet.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8a1dfc55f3eed95c66a0410ea04d15097187eeb4b56f718cd56e34b713e520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/profile/cubit/profile_extras_cubit.dart:36-44 | lib/profile/cubit/ui_preferences_cubit.dart:43-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/cubit/profile_extras_cubit.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"369be35e63610495812571bd5973e5c9cb05b3366370b994e3aec49ae14e00b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/schedule/view/schedule_page/schedule_clock_ticker.dart:24-30 | lib/teacher_account/widgets/dashboard/teacher_dashboard_lifecycle.dart:21-27 \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/schedule/view/schedule_page/schedule_clock_ticker.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"02550eddd7bb8c308d647e3c6d68e16a4d6ff2e58c6e3ee4217178a622e96aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/schedule/widgets/custom_lesson_editor/lesson_editor_section_label.dart:9-13 | lib/study_group/view/ninja_study_group_section_header.dart:6-10 \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/schedule/widgets/custom_lesson_editor/lesson_editor_section_label.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4818aad1265b52662ea394d330e8fa99647a96cf5b71d3b9130517514b4a277d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/app_ui/lib/src/widgets/app_badge.dart:131-140 | packages/app_ui/lib/src/widgets/app_tag.dart:76-85 \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":"packages/app_ui/lib/src/widgets/app_badge.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd1e7cc63795350f64f4bc6be229f9b3b31712e3a1a5daf2ab42bd0bdffdf06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): packages/app_ui/lib/src/widgets/app_progress_ring.dart:132-137 | packages/app_ui/lib/src/widgets/app_spinner.dart:110-115 | packages/app_ui/lib/src/widgets/buttons/app_button.dart:587-592 \u2014 before extracting anything, compare \u0060packages/app_ui/lib/src/widgets/app_spinner.dart\u0060 and \u0060packages/app_ui/lib/src/widgets/buttons/app_button.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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":"packages/app_ui/lib/src/widgets/app_progress_ring.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75cbb90681f76915951fe872ae15e865050f9605bc09dede1e62b66c5540c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/campus_repository/lib/src/campus_repository.dart:239-244 | packages/schedule_repository/lib/src/data/user_activities_data_source.dart:53-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef6aee357d3eb6f602f27937b10fc03b2b0edf276f68dd9057fef4e7a0b26d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/stac_bridge/lib/src/widgets/kit/stac_app_checkbox_parser.dart:16-21 | packages/stac_bridge/lib/src/widgets/kit/stac_app_toggle_parser.dart:16-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/widgets/kit/stac_app_checkbox_parser.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1139eb813a4c96a611d2d120622c2841ba21b34b98265340b1e628306ed62b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/stac_bridge/lib/src/widgets/kit/stac_app_chip_row_parser.dart:70-74 | packages/stac_bridge/lib/src/widgets/kit/stac_app_stepper_parser.dart:45-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/widgets/kit/stac_app_chip_row_parser.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfdcd40c64d487810a9a10f839192a545db190e8b3ffca1eb34a09316bc3a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/stac_bridge/lib/src/widgets/material/stac_check_box_kit_parser.dart:15-20 | packages/stac_bridge/lib/src/widgets/material/stac_switch_kit_parser.dart:15-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/widgets/material/stac_check_box_kit_parser.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"468b417b7c49148825a40e89d8a28a3f06f9bc78898d602fdaf0e8ea1c9479b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/lost_and_found/config/lost_found_categories.dart:13-18 | lib/marketplace/config/marketplace_category.dart:31-36 \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/lost_and_found/config/lost_found_categories.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cee7b426bfda3a732e124bcb5312a36e6e704f126a66560507ed8682becfb21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): wear/android/app/src/main/kotlin/com/example/verygoodcore/MainActivity.kt:15-28 | wear/android/app/src/main/kotlin/ninja/mirea/mireaapp/MainActivity.kt:15-28 \u2014 before extracting anything, compare \u0060wear/android/app/src/main/kotlin/com/example/verygoodcore/MainActivity.kt\u0060 and \u0060wear/android/app/src/main/kotlin/ninja/mirea/mireaapp/MainActivity.kt\u0060 as WHOLE FILES: 95% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/android/app/src/main/kotlin/com/example/verygoodcore/MainActivity.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"82699e5b13f197cd70b470c45862403592b12a30b3d40780ad9e97510bdcf510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 3): tools/social_media_fetcher/src/ingest_client.py:137-151 | tools/social_media_fetcher/src/ingest_client.py:166-184 | tools/social_media_fetcher/src/ingest_client.py:197-213 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/ingest_client.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c18aee3acbbf6d92ccd00ddd2df58877665af7f0ba0213f8f7b94f48fd391a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tool/app_store_build_status.py:74-88 | tool/google_play_store_icon.py:60-75 \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 \u0060tool/app_store_build_status.py:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_build_status.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d791563c83b461522110dfbf693def0f6fa21d5d20144b796b4ba97a3aff04b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): tool/app_store_build_status.py:272-281 | tool/app_store_submit.py:90-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 \u0060tool/app_store_build_status.py:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060app_id\u0060 to \u0060submission_id) or attributes.get(\u0022platform\u0022) != \u0022IOS\u0022 or app.get(\u0022id\u0022) !=\u0060 in one and \u0060candidate_id) or candidate_attributes.get(\u0022state\u0022) != \u0022READY_FOR_REVIEW\u0022 or candidate_attributes.get(\u0022platform\u0022) != \u0022IOS\u0022 or candidate_app.get(\u0022id\u0022) !=\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":"tool/app_store_build_status.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecb689be2d9dde008a85d0882294928c63e0d334c92562dbe471fc0838a2502"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tool/app_store_screenshots.py:88-95 | tool/google_play_screenshots.py:86-93 \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":"tool/app_store_screenshots.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c72187f88f442790747395118b9d76ad9270e2bc0606aa9f73b4cfac1bd4f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tool/app_store_build_status.py:298-304 | tool/app_store_submit.py:624-630 \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":"tool/app_store_build_status.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfa0a4ef18c225fba3d68d2dd93eaad1d5717d3e0c59f4e041e2f1189841b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tool/app_store_submit.py:332-337 | tool/app_store_submit.py:464-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_submit.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a575c671df358e4ca9c771cf9f8424685829d2700d22338910d30b549e1241b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ios/HomeWidget/HomeWidget.swift:189-205 | ios/HomeWidget/HomeWidget.swift:207-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"ios/HomeWidget/HomeWidget.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4a81dd45895e89e61b95733672a59dd4a11aad6f4ebaf4a08a8608ae3cff9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ios/HomeWidget/ScheduleWidget.swift:246-252 | ios/HomeWidget/ScheduleWidget.swift:260-266 \u2014 both copies are in the same file, so extract the block 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 \u0060ios/HomeWidget/ScheduleWidget.swift:246\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":"ios/HomeWidget/ScheduleWidget.swift"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6fb1fbdd27f9dfccef9f8ef9ab931fd51d7653cca2de84377aa5d437d36a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): macos/Runner/MainFlutterWindow.swift:5-14 | packages/web_oauth_interceptor_client/example/macos/Runner/MainFlutterWindow.swift:5-14 \u2014 before extracting anything, compare \u0060macos/Runner/MainFlutterWindow.swift\u0060 and \u0060packages/web_oauth_interceptor_client/example/macos/Runner/MainFlutterWindow.swift\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macos/Runner/MainFlutterWindow.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1bccdb4923e171b52f6cf2d696d802d8fab0c593e9da7c18beb75f927c1b5c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: connectivity_client: connectivity_client: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fa3bbf461e7731ada2bea1bfc272cf54eb2f9706c8b1c3be6660f9fef3ba0083"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: deep_link_client: deep_link_client: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"359c0ce7c057deb5899a377627cbcbd6036fca518178d09743d6f224a67c4133"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: package_info_client: package_info_client: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f47a45d228252c94af26271becab9a4cfe215eac62bed30b77d74b947e1e6eb9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: permission_client: permission_client: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f066902a88345bc8c9e8780ebf00f65f3f4e3e7bcbb8efae3dd3c45d7fecb607"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: share_launcher: share_launcher: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eebc89ec56a1699b3b0cc79e4629521f47ef28b8006dd57f522d9bc053358f31"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: web_oauth_interceptor_client: web_oauth_interceptor_client: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"df7b38ed766c6f5c9b643242ec87d1b42aa8e6cd0b7ed01e4576dc440de15384"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: app_ui: app_ui: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9cc424f74f6f1473aba253e83a472ef87189206325e95b4e28b05acd2240cd43"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: nfc_pass_client: nfc_pass_client: abstractness 0.18, instability 0.00, distance 0.82 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c0c42cc85b431831e89589ffa93f2f662ee02a0dd4465969d18f5845466d7a2a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: analytics_repository: analytics_repository: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"082b5072b3ef86e91ee5f4a9f1968e8e21348c30f7285ba93e1bf5af25dd1fd1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: preferences_repository: preferences_repository: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"baaca0d85551fc97a61c2969c3925390c5a28992964c1f1f1f0888519274b113"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: auth_client: auth_client: abstractness 0.23, instability 0.00, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9b395c152aab60ba50ed77d3d2eef0a97d686aaeb2a207d930239b6f173d01cc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: github: github: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a3adbe86aae1941930f8460720662d936dd82f3d25d7fb929f450ab7d6421259"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AppScopeContainer (LCOM4 22): AppScopeContainer\u0027s methods fall into 22 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/di/app_scope.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"96074b494250c442d8914981ff8ff31cdd06ebc720c580d66314cd120daa5097"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CustomLessonEditorCubit (LCOM4 10): CustomLessonEditorCubit\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/cubit/custom_lesson_editor/custom_lesson_editor_cubit.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef3d513fa3d9367c03e566d4050965c29410df88b6f60299bc03aac4c29cf46"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProfileExtrasCubit (LCOM4 9): ProfileExtrasCubit\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/cubit/profile_extras_cubit.dart"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b446dfcd99dc27d02b9ec5aa2505ae031f29a95bc9ec49d35ebb70a97f0072d3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SchedulePreferencesCubit (LCOM4 9): SchedulePreferencesCubit\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/cubit/schedule_preferences/schedule_preferences_cubit.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"15aaf77b767e114ed1ea9861615baabf14b1f772d9654a2c4581b39b7cdcad07"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CustomScheduleCubit (LCOM4 8): CustomScheduleCubit\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/cubit/custom_schedule/custom_schedule_cubit.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"25877f473e134967f59667439f17c1b2adb3d68037717f626e701d7563f8161e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LessonCommentsCubit (LCOM4 8): LessonCommentsCubit\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/cubit/lesson_comments/lesson_comments_cubit.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b1b064cac51ec5f094bcd01b670e4207c35a94b1e91d8e4ce01a893f7551f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ThemeCubit (LCOM4 6): ThemeCubit\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/app/theme/cubit/theme_cubit.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f1289ad2241aa5d71ca2d11c91a42ac5c69d8dbced352bff42ca5a8193834b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FullScreenAdsBloc (LCOM4 5): FullScreenAdsBloc\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/ads/bloc/full_screen_ads_bloc.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db04f35b6ed8eb69a1af571289e988ddd4a915ebe92918ddcd8071ee3209686"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArticleBloc (LCOM4 5): ArticleBloc\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/article/bloc/article_bloc.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5226be042dc9405119bfb4a74e9b9caa67f8a94dd43d0b6508e99ad43ea35ef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _CollabNoteEditorViewState (LCOM4 5): _CollabNoteEditorViewState\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/community/view/collab_note_editor_view.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e757dcd80f70e40f1b7352d96a2b31f74ff6ca45f7d8625dffc3616aa2af9e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NfcPassCubit (LCOM4 5): NfcPassCubit\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/nfc_pass/bloc/nfc_pass_cubit.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de30a65e642fa6fdd96665793dbd9077835a3881b39d005c90c4c528ac7a073"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PromoDismissalsCubit (LCOM4 5): PromoDismissalsCubit\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/promo/cubit/promo_dismissals_cubit.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1555982b0c1bee1f19e9639c33e4ad2137a0635f417c3f6f65a29af38e8545af"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _ScheduleShareSheetState (LCOM4 5): _ScheduleShareSheetState\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/schedule/view/schedule_page/sheets/schedule_share_sheet.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6f2ea797246be4808dd7e4e03c113fe48bf45c5c49e1b9b05c864ca87d49e1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ScheduleCubit (LCOM4 5): ScheduleCubit\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":"wear/lib/schedule/cubit/schedule_cubit.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90a852b492a78eb20b6888c4d34109e9287d97c22edb4044a78cdc910893853"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AppPopoverRoute (LCOM4 5): _AppPopoverRoute\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":"packages/app_ui/lib/src/widgets/app_popover.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5daf2cd8db21520e9558cf4614bfdd84a6d1ead89939eecd64450a34f43cff3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _KitImagePickerState (LCOM4 5): _KitImagePickerState\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":"packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"870f7eb66c33123c498cc807f7c5d39a3e8d22a77aa4205d24ab172e4d276023"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AccountPersonaFormCubit (LCOM4 5): AccountPersonaFormCubit\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/teacher_account/bloc/account_persona_form_cubit.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db590ff5ec7a0b936083a50c305b83a29e86b3d2e7e70a2400ff64a7687dadd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AppScheduleRefreshState (LCOM4 4): _AppScheduleRefreshState\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/app/view/app_schedule_refresh.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71cbe7cee9767dceed923c7a78fc2115e8b1ab6082809f28ade08ca05b7d7b2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AttendanceState (LCOM4 4): AttendanceState\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/attendance/cubit/attendance_state.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff278a6541acb9bff8383e70d8f4a2e8a0bb18cba4118c166c748e66e32f5fc6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FreeRoomViewModel (LCOM4 4): FreeRoomViewModel\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/free_rooms/widgets/free_room_view_model.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd2ccd67187485a6e9ea15be30c206a3d8458a475df159ce2532e18976a8bcf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PasswordResetBloc (LCOM4 4): PasswordResetBloc\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/login/bloc/password_reset_bloc.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61503ac40e62c654a8311db743b8519ec26d48c75210119b83d3db9955f17cd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _MapViewState (LCOM4 4): _MapViewState\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/map/view/map_view.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af07fb66771c623264456429799dbc7915290ebc030cd120dc6a851f77fe0aa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _RunnerHost (LCOM4 4): _RunnerHost\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/mini_apps/view/mini_app_runner_view.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397a1324b9106f5954ebfd65e42f2e2fa4cbdecd8164ad80068a379f9ca2d6d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NotificationsCubit (LCOM4 4): NotificationsCubit\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/notifications/cubit/notifications_cubit.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bcea15739cd61cf14e715f403c2ac5d0f92f5db85a867e65c08b12ed62b34f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _PushHistoryListenerState (LCOM4 4): _PushHistoryListenerState\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/notifications/view/push_history_listener.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf48405b015488e6e7646e5fe4e5217e67a81d8350745c1195d68b61882ebae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StartupScreenCubit (LCOM4 4): StartupScreenCubit\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/profile/cubit/startup_screen_cubit.dart"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1bf664e17bd4b388047d94672af2d2d71c4d6e95136c834c7a9fcb07f4dff9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ScheduleBloc (LCOM4 4): ScheduleBloc\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/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5176c43674693f69b9f501e3667f76cda09f77550f779f76cafab6bfc8466bdb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ComparisonSlot (LCOM4 4): ComparisonSlot\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/schedule/view/compare/comparison_slot.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb67e42928a50c9b3df283c8e71c049808f984dc18aa04ad65177a766b7bb1b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _BannerAdContentState (LCOM4 4): _BannerAdContentState\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ads_ui/lib/src/widgets/banner_ad_content.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"118d2d731f0fb7a0c535e2a86b50bfeaa6dbdae481506f4f88a56c66e732237d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _NinjaInviteSheetState (LCOM4 4): _NinjaInviteSheetState\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/study_group/widgets/ninja_invite_sheet.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"74602edde1e9c62927f390b518497b5add945001fb5dce09f59cb743810eeb75"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TeacherDashboardBloc (LCOM4 4): TeacherDashboardBloc\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/teacher_account/bloc/teacher_dashboard_bloc.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5f97a2f0a088920d5897f89cff8e15aa4dee9f80443e6cd05c8f3b02a03b85"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AccountPersonaCubit (LCOM4 4): AccountPersonaCubit\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/teacher_account/cubit/account_persona_cubit.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20f891af1e4928a229efd565264871eda9a2fea511cdae9411d3396f3d2bf32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/view/map_view.dart: lib/map/view/map_view.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in _MapViewState._buildMap at line 1174. 3 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/view/map_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/map/view/map_view.dart"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e997ff19666b8d982d5b21ebcde4c5a52e3bf409e20029577696dd19603800bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/view/schedule_page/schedule_day_view.dart: lib/schedule/view/schedule_page/schedule_day_view.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in ScheduleDayView.build at line 44. 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-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_day_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/schedule/view/schedule_page/schedule_day_view.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40b9a0188477016f3594c41d5a3d8a307212f9d57d1473279d1b12872e413e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/svg_interactive_map.dart: lib/map/widgets/svg_interactive_map.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in _SvgInteractiveMapState._selectRoom at line 398. 1 of those changes was a fix/bug commit, 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-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/svg_interactive_map.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/svg_interactive_map.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca9006fe569fcd07353d5e2c0aba197bcce1db3b0a8718b2946f5b54f86ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/home/view/home_dashboard_content.dart: lib/home/view/home_dashboard_content.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in HomeDashboardContent.build at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/home/view/home_dashboard_content.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/home_dashboard_content.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d86ebafcd6330902a4a6747f3b0f5d794521daeb4919ce309f5e5300943568"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tool/prepare_shorebird_patch.py: tool/prepare_shorebird_patch.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in prepare_shorebird_patch.verify_worktree at line 236. 2 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- tool/prepare_shorebird_patch.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/prepare_shorebird_patch.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc63a1da7ad337960ee3853edeb23b92b51ea02a39eadac8743b6534090f65f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/view/schedule_page/schedule_week_view.dart: lib/schedule/view/schedule_page/schedule_week_view.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ScheduleWeekView.build at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_week_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/schedule/view/schedule_page/schedule_week_view.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a861e050fd6b54087c4eccfcdd028b7bfa112f9b0bf7457481387ec9fd747c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/view/schedule_page/schedule_body.dart: lib/schedule/view/schedule_page/schedule_body.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _ScheduleBodyState.build at line 162. 1 of those changes was a fix/bug commit, 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-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_body.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_body.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f8859897b17c7885e05e097aef40041db4fb2989b76479b7f81f49f8692c61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tool/app_store_submit.py: tool/app_store_submit.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in app_store_submit.should_submit at line 254. 2 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- tool/app_store_submit.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/app_store_submit.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd6f4103e144343c22772e5ed0c3b0b50adb0c42a683fb326ad3cd4a620a394"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_cartographic_layer.dart: lib/map/widgets/map_cartographic_layer.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in _LabelsPainter.paint at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_cartographic_layer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_cartographic_layer.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4860e4ad3600cfd63234836cd783383607223c2b74839212179582e010f0377"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/friends/view/friends_map_view.dart: lib/friends/view/friends_map_view.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in _FriendsMapViewState.build at line 73. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/friends/view/friends_map_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/friends/view/friends_map_view.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b88e8519194abf4c9b810180967e278aeeb2fd2788c05b1111b9f233f1f0658"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/friends/widgets/ninja_geo_sharing_sheet.dart: lib/friends/widgets/ninja_geo_sharing_sheet.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in NinjaGeoSharingSheet.build at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/friends/widgets/ninja_geo_sharing_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/widgets/ninja_geo_sharing_sheet.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8771ecbb65d094ab6904f0c3113e5bdef2453186e0ee3fdf4d4b2340b79912"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/bloc/map_bloc.dart: lib/map/bloc/map_bloc.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in MapBloc._onMapInitialized at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/bloc/map_bloc.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/bloc/map_bloc.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"099d4aaa353608d1aa3aa33dff9277cc9f1b946858a66a9a81fdc7c7fdfd300d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_place_details_sheet.dart: lib/map/widgets/map_place_details_sheet.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in _MapPlaceDetailsSheetState.build at line 267. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_place_details_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_details_sheet.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfbebadf0c1ab6e0b8a01971d657b794fc0c5a10056d09324b6843cdc7b22bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart: packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in NinjaLessonRow.build at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f206b93d3ac61cb315058d7bf060ee2afb470992f50a09b9e9fcbac91d6965"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/glass/app_glass_style.dart: packages/app_ui/lib/src/glass/app_glass_style.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in AppGlassStyle.surface at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/glass/app_glass_style.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/glass/app_glass_style.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fef077bb2d4330a8384c616e7272348be12804d0c1fe33875b8188633ee8b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/polls/widgets/poll_card.dart: lib/polls/widgets/poll_card.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in PollCard.build at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/polls/widgets/poll_card.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_card.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeddfdf76c7cfb583d434371be46a026b7dc54abf2146cae6aeae9a9f8d1e88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_free_rooms_panel.dart: lib/map/widgets/map_free_rooms_panel.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MapFreeRoomsPanel.build at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_free_rooms_panel.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_free_rooms_panel.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a997f3b8ab7d45bdef7e1f72ce01c3eed86b5d04da4cf61f29fb2f039d1cd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/bloc/schedule_bloc.dart: lib/schedule/bloc/schedule_bloc.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ScheduleBloc.restoreSelectedScheduleFromRemote at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/bloc/schedule_bloc.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/bloc/schedule_bloc.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14ab7ff9cba6d51ca4adcca24f1098bb17e8600f099799a30fe701129308675"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/data/map_data_repository.dart: lib/map/data/map_data_repository.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MapDataRepository._loadCampus at line 355. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/data/map_data_repository.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/data/map_data_repository.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c03e58a5648ea43727d3bf186958970a9c25f9e973d7ea8d5566ddbb30f1f43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/view/services_view.dart: lib/services/view/services_view.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _ServicesViewState.build at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/services/view/services_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/services/view/services_view.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce804a1a296af956a470870c5c5ea091214eae6012655095cbf9c509e1bb7a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart: packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SupabaseAuthenticationClient.verifyPasswordResetCode at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c278900d1c101a774052dee15579db3b37a213d2773889b04a6e5f9e86daa227"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: supabase/functions/miniapp-notify/index.ts: supabase/functions/miniapp-notify/index.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in index.createNotificationHandler.\u003Creturned closure\u003E at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- supabase/functions/miniapp-notify/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"660a470a4cde4577c98f15c775508933967eb26a5e9c59955ebe2bed67ac5fc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/campus_repository/lib/src/campus_repository.dart: packages/campus_repository/lib/src/campus_repository.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CampusRepository.createPublicMaterial at line 825. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/campus_repository/lib/src/campus_repository.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/campus_repository/lib/src/campus_repository.dart"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"027926a83b083834b1b4a6ee6b226b67021be534416b21fb12f2da2ced976b33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/knowledge_bank/widgets/material_row.dart: lib/knowledge_bank/widgets/material_row.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MaterialRow.build at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/knowledge_bank/widgets/material_row.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_row.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85ba27a6493c9b7eff541158b53008c82fd17c7d5c942620a143d3067ad562b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart: packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ScheduleExporterRepository.exportScheduleToCalendar at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"355c6f48a290cc2b13f3013f83720f77abaf28d8f548f4a75e6256b8b04852a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/friends/cubit/friends_map_cubit.dart: lib/friends/cubit/friends_map_cubit.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in FriendsMapCubit._updateGeoSettings at line 579. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/friends/cubit/friends_map_cubit.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbea6db925487561b4d6704a4485512b8ca65d52c45717f8d5e6397ca5ccdb94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/community/widgets/mentorship/mentor_profile_sheet.dart: lib/community/widgets/mentorship/mentor_profile_sheet.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _MentorProfileSheetState._buildContent at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/community/widgets/mentorship/mentor_profile_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/mentorship/mentor_profile_sheet.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0ed97a8d15e412398718ede115f4ca0415924b56b263f68daed6a356811a27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/view/teacher_profile_page.dart: lib/schedule/view/teacher_profile_page.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _TeacherProfilePageState._content at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/view/teacher_profile_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/teacher_profile_page.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2cd59b5b43ff15bb91d1448c4f2eaeb37881b7f5014adbb6adbb00cc39287e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/knowledge_bank/widgets/material_upload_sheet.dart: lib/knowledge_bank/widgets/material_upload_sheet.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _MaterialUploadSheetState.build at line 172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/knowledge_bank/widgets/material_upload_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_upload_sheet.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbac4ee0cd7217907308bea57a84168dbd7a4b480294e496cb71df5468dd011"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/login/view/password_reset_page.dart: lib/login/view/password_reset_page.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _PasswordResetView.build at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/login/view/password_reset_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/password_reset_page.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"db05ab4cddf33c59e611ac26fe9976497b1c0736a6de401fdf540d6f3ff9d936"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/knowledge_bank/view/knowledge_bank_list.dart: lib/knowledge_bank/view/knowledge_bank_list.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in KnowledgeBankList.build at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/knowledge_bank/view/knowledge_bank_list.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/view/knowledge_bank_list.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"007f3c8af3cdf1d06019558c3b71cf11066c4484cb8f563392c04a9ed631de4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/nfc_pass/bloc/nfc_pass_cubit.dart: lib/nfc_pass/bloc/nfc_pass_cubit.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NfcPassCubit.bindPass at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/nfc_pass/bloc/nfc_pass_cubit.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/nfc_pass/bloc/nfc_pass_cubit.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bc1c7c8c56a96aa58b4a8c152d355944c2ce27b083950339b9ffd5b9e7f96b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/polls/widgets/poll_creator_sheet.dart: lib/polls/widgets/poll_creator_sheet.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _PollCreatorSheetState._buildContent at line 364. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/polls/widgets/poll_creator_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_creator_sheet.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"789430a5896f1b620e2b4b79182cac6975e19d967333c0d356f96b28f7c1a2e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/widgets/buttons/app_button.dart: packages/app_ui/lib/src/widgets/buttons/app_button.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AppButton.build at line 367. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/widgets/buttons/app_button.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/buttons/app_button.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"810f85b52bfe24ee913c5f54c756412dd7a084ebe0fafa86a540837ef3c99e64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/people/view/group_space_view.dart: lib/people/view/group_space_view.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _GroupSpaceViewState._content at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/people/view/group_space_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/people/view/group_space_view.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4724e855e098a68a6b84b2b098f256a49ab1de5c03a7e5624b94906347cb9086"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule_management/view/hub_body.dart: lib/schedule_management/view/hub_body.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _HubBody.build at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule_management/view/hub_body.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/hub_body.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e962e516595dcdf7918f5ffacdc4ab9cf9005e6539a3d0aca4ca54a9154417"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/community/widgets/team_finder/create_team_sheet.dart: lib/community/widgets/team_finder/create_team_sheet.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _CreateTeamSheetState._buildContent at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/community/widgets/team_finder/create_team_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/team_finder/create_team_sheet.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceabedd0bd2fee8a1e79466f9b00e74e717a4d2b36c9a6843262f85b530b4a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/notifications/view/push_history_listener.dart: lib/notifications/view/push_history_listener.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _PushHistoryListenerState._record at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/notifications/view/push_history_listener.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/view/push_history_listener.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f3f3069e9843363748307de855e0d6134d4652fa90c798575232a816f54104"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_place_editor_page.dart: lib/map/widgets/map_place_editor_page.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _MapPlaceEditorPageState._review at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_place_editor_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_place_editor_page.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcb5194199a0d893db0996abff6d1d6dc11acee9afc3cbd1c42c77d58907fdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/community/cubit/note_editor/note_editor_cubit.dart: lib/community/cubit/note_editor/note_editor_cubit.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NoteEditorCubit._saveTitleLoop at line 398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/community/cubit/note_editor/note_editor_cubit.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/cubit/note_editor/note_editor_cubit.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a69237293ff880f153fe737f8e9897ea028e23c9ee8f755a40ebe304021fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/widgets/forms/app_input_field.dart: packages/app_ui/lib/src/widgets/forms/app_input_field.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _AppInputFieldState._build at line 218. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/widgets/forms/app_input_field.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/forms/app_input_field.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b592f6e1ff737b0547135c4f87b7b1ca9e296421b690653b161c6dd25d0b82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart: packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in NinjaDayPill.build at line 182. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"68add552dd893c790a9524e1bc3cf9f9518185cef914273cdffa748c4a5b2fa9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_floor_alignment_page.dart: lib/map/widgets/map_floor_alignment_page.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _MapFloorAlignmentPageState.build at line 395. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_floor_alignment_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_floor_alignment_page.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3ca33a4643b248d8fe5bd6df6cef49c911161c0d7e8b7fd763e6e035eb8a61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_route_guidance.dart: lib/map/widgets/map_route_guidance.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _MapRouteGuidanceState.build at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_route_guidance.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_guidance.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c9cf7b91784059c753695f0fa250b9bf13dd482061c67205fe419a84e0ba70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/marketplace/widgets/market_sell_sheet.dart: lib/marketplace/widgets/market_sell_sheet.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _MarketSellSheetState.build at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/marketplace/widgets/market_sell_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/widgets/market_sell_sheet.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2820d0a10bd72a51b0d17076e4f2993f82476c2408321d164919393790f59d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/view/schedule_page/schedule_overlap_switcher.dart: lib/schedule/view/schedule_page/schedule_overlap_switcher.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _ScheduleOverlapSwitcherState.build at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_overlap_switcher.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_overlap_switcher.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2171fd522983514205d2045dbcadfee0eb5e914f036b0166eff83474412b362f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart: packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in OAuthSessionObserver._inspect at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11ad526e35c66aaa1abc633a4a0882089fcfd422c715ec4ee722743b62768f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py: tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in TelegramToNewsBlocksAdapter.adapt_post_data at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc21b87824c3ec3298dc6cc1dc3d3cbb29ff85115b0a9c6cc5c4a03c6b44116"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/view/schedule_page/schedule_date_pager.dart: lib/schedule/view/schedule_page/schedule_date_pager.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _ScheduleDatePagerState.build at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_date_pager.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_page/schedule_date_pager.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"15028831080ae85a394cee61eb4874d3dff1b9385da624fa2da4432266844165"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/widgets/app_list_row.dart: packages/app_ui/lib/src/widgets/app_list_row.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AppListRow.build at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/widgets/app_list_row.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_list_row.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b32bd59d2f0b04bfb3775f8804091856872622b9decd935e4469fac77a269dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_route_timeline.dart: lib/map/widgets/map_route_timeline.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _MapRouteTimelineState.build at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_route_timeline.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_route_timeline.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eeaaf66068a1be1945797f1dcdd60a2f16440647abf591d4bb496479289a57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/profile/cubit/geo_sharing_cubit.dart: lib/profile/cubit/geo_sharing_cubit.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in GeoSharingCubit.setSharing at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/profile/cubit/geo_sharing_cubit.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/cubit/geo_sharing_cubit.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c715c96790e6f43ce59efc63af3e129324a007d397c704387e4556ace49a4d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/widgets/app_slider.dart: packages/app_ui/lib/src/widgets/app_slider.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _AppSliderState.build at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/widgets/app_slider.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_slider.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0606350b4da56b2388b5feb30f97965d732215434311761d90b5d5366a980241"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/widgets/app_screen_header.dart: packages/app_ui/lib/src/widgets/app_screen_header.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AppScreenHeader.build at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/widgets/app_screen_header.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_screen_header.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f87cdbac5e16b016198893bc747a2c1864247f1dad2d7d67a319ad1dc6e8bfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/profile/cubit/profile_cubit.dart: lib/profile/cubit/profile_cubit.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ProfileCubit.load at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/profile/cubit/profile_cubit.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/cubit/profile_cubit.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68a2dddf3ead8592d6c432746a369c31f6577785cf2280714c08c1faa1b7817"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/widgets/app_filter_chip.dart: packages/app_ui/lib/src/widgets/app_filter_chip.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in AppChip.build at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/widgets/app_filter_chip.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_filter_chip.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e192233278378d6d1f44beaae33dbc4a2b4c50c1c51b4f4973ccb73d97086f24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/search/bloc/search_bloc.dart: lib/search/bloc/search_bloc.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SearchBloc._onSearchQueryChanged at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/search/bloc/search_bloc.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/search/bloc/search_bloc.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0ff4bc213a5729a80c720003998763e73703196a163dd538053f979f93617d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/free_rooms/widgets/free_rooms_list.dart: lib/free_rooms/widgets/free_rooms_list.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in FreeRoomsList.build at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/free_rooms/widgets/free_rooms_list.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/free_rooms/widgets/free_rooms_list.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"880c70ad180d18362177b8c15f61b118b1cd5392ce47c15aba5c95a7b1627489"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/local_notifications_repository/lib/src/local_notifications_repository.dart: packages/local_notifications_repository/lib/src/local_notifications_repository.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in LocalNotificationsRepository.syncLessonReminders at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/local_notifications_repository/lib/src/local_notifications_repository.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/local_notifications_repository/lib/src/local_notifications_repository.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b36ff0416c437b63c6ff5e8f5a8639864b197d07b0800557e506c137d6728bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/login/view/sign_up_page.dart: lib/login/view/sign_up_page.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _SignUpViewState.build at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/login/view/sign_up_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/sign_up_page.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de74e6ac816086c97b37d65db78133d913c16507ea736a8bcfdb5f7fbeea87e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: supabase/functions/ingest/auth.ts: supabase/functions/ingest/auth.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in auth.requireIngestKey at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- supabase/functions/ingest/auth.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f373bdbe4105cf5a20a85f69e8c60a1f3771df3e54ad5ec7fe785d4876b40f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: supabase/functions/ingest/index.ts: supabase/functions/ingest/index.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in index.Deno.serve() at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- supabase/functions/ingest/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/index.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"438c79779a96752c8de61dee20fe1c17db86323c9078b903bf38c452b0fa4ce8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: supabase/functions/ingest/payload.ts: supabase/functions/ingest/payload.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in payload.validatePayload at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- supabase/functions/ingest/payload.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/payload.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9e85eb818072236271638b83d1e94bcb949cd0f986609190b8c81c125e371d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_volume_layer.dart: lib/map/widgets/map_volume_layer.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _MapVolumeLayerState.didUpdateWidget at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_volume_layer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_volume_layer.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db843944f0c59934d927eba69091e9d37d8099966915b8149285e494381f79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/article/widgets/article_content_model.dart: lib/article/widgets/article_content_model.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ArticleContentModel.fromBlocks at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/article/widgets/article_content_model.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/article/widgets/article_content_model.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c2a6f381b62d2c1fe9460e9e7ae617f6a046407cce27f8c213334fb70f60e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule/view/compare/compare_page.dart: lib/schedule/view/compare/compare_page.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _ComparePageState.build at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule/view/compare/compare_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/compare/compare_page.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaf299a6c69ff3e6dd6940754d4a4855fedd9288d92b3f83943840b1805ddba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/feed/widgets/feed_image.dart: lib/feed/widgets/feed_image.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _FeedImageState.build at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/feed/widgets/feed_image.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/widgets/feed_image.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d595766a96f5202c6ebfe9654efc82dbadb0fce8fb17c82a73ce8b30cce92e63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/polls/widgets/poll_runner_sheet.dart: lib/polls/widgets/poll_runner_sheet.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _PollRunnerSheetState.build at line 219. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/polls/widgets/poll_runner_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/polls/widgets/poll_runner_sheet.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"de21a4c2d474831798718cf86a6c4b1be6a6f9f91d6084a69450f3ef51bf51dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/promo/cubit/promo_dismissals_cubit.dart: lib/promo/cubit/promo_dismissals_cubit.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PromoDismissalsCubit._synchronize at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/promo/cubit/promo_dismissals_cubit.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/promo/cubit/promo_dismissals_cubit.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b2f57cd16e313f2b782ec94f511c37bdc2885dfbc07db70b69bcd5341f484b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart: packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NinjaBanner.build at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dc882932b5e791a7bfada7b2c0c4e42c1f2e91964173c89925d07cf0f5e43a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/knowledge_bank/widgets/material_grid_card.dart: lib/knowledge_bank/widgets/material_grid_card.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MaterialGridCard.build at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/knowledge_bank/widgets/material_grid_card.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_grid_card.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e40afe2ed1bd2341fb65a161a3e31378af39be7d08be78360bef976be953531"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/lost_and_found/widgets/lost_found_item_sheet.dart: lib/lost_and_found/widgets/lost_found_item_sheet.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LostFoundItemSheet.build at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/lost_and_found/widgets/lost_found_item_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lost_and_found/widgets/lost_found_item_sheet.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6f25a3d7084abe5b4afed6efe56930e4db970d8813e378a7328ef4a5b19018"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/people/widgets/group_space/group_link_sheet.dart: lib/people/widgets/group_space/group_link_sheet.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _GroupLinkSheetState.build at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/people/widgets/group_space/group_link_sheet.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/widgets/group_space/group_link_sheet.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cec6a782dee9034c0ee9bdcfd9025f0c5202cb409b691321dea3be5a8756b51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/map/widgets/map_geographic_view.dart: lib/map/widgets/map_geographic_view.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _MapGeographicViewState.build at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/map/widgets/map_geographic_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/map/widgets/map_geographic_view.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4f451920b29106a8a873dce8393afe456e97b632749dee8c9a1654e61adbcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/schedule_management/view/add_schedule_result_row.dart: lib/schedule_management/view/add_schedule_result_row.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _AddScheduleResultRowState.build at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/schedule_management/view/add_schedule_result_row.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule_management/view/add_schedule_result_row.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"060c163584503aba439414daa69d2cf5f5e2f4975725389d699605c9c4e41a67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/community/widgets/collab_notes/editor/note_toolbar.dart: lib/community/widgets/collab_notes/editor/note_toolbar.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _NoteToolbarState._buildToolbar at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/community/widgets/collab_notes/editor/note_toolbar.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/note_toolbar.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"187fb0c1371a137332b604227bf93bcdd64a6c530c0804015e345ade64af8618"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/profile/widgets/profile_activity_card.dart: lib/profile/widgets/profile_activity_card.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ProfileActivityCard.build at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/profile/widgets/profile_activity_card.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/widgets/profile_activity_card.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"717df19aa2205a980a4fa8b4e79975b1cfe4439596a34de9b99b9f72b1073f16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/app_ui/lib/src/widgets/app_service_tile.dart: packages/app_ui/lib/src/widgets/app_service_tile.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in AppServiceTile.build at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/app_ui/lib/src/widgets/app_service_tile.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_service_tile.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af1f4b3a223a852e98aa25d0e9fd9121a2f5b124e8c79c4571b284538d58c7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/community/view/events/events_body.dart: lib/community/view/events/events_body.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in EventsBody._content at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/community/view/events/events_body.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/view/events/events_body.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7338fab44253a340bc54cea8e5d59939dd3d75b77ac4b59784cfc78be9c60b95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/top_discussions/view/top_topics_content.dart: lib/top_discussions/view/top_topics_content.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in TopTopicsContent._content at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- lib/top_discussions/view/top_topics_content.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/top_discussions/view/top_topics_content.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3bc98d7350f65bcbafb945982177bfabf5a4522a1496c065a462ace93d9dd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/web_oauth_interceptor_client/lib/src/web_oauth_interceptor_client.dart: packages/web_oauth_interceptor_client/lib/src/web_oauth_interceptor_client.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is WebOAuthInterceptorClient._tryAutoFillForm at line 152), 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 startup recovery and campus authentication\u201D; \u201CFix Pulse and NFC login returning to the app (#615)\u201D; \u201CFix mobile services and iOS release workflows (#482)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-04..2026-11-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-04 19:10:00 \u002B03:00\u0027 --until=\u00272026-11-02 19:10:00 \u002B03:00\u0027 --full-history --no-merges -- packages/web_oauth_interceptor_client/lib/src/web_oauth_interceptor_client.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/web_oauth_interceptor_client/lib/src/web_oauth_interceptor_client.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6b18cfd1fcc1fead4f3fd78b2ffcb0677d28fc0236db3e2421082f9a67376d"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 61 project(s) overshoot their size bounds, lowering Project Cohesion to 9.1/10. The most over is \u0060(repository root)\u0060 (140515 LoC, 1500 module-visible types across 239 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"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":"12d740673561eaafe7e41145b87f8d3815062012a4dfbb7f21a515c619489f20"},"properties":{"commitSha":"3c7f6df5c412ec3c88c1e3f773bcf0aa0e12c091"}},{"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":"7e5dd789858d7fe4ca3b9a6c4e57caa21fab1328bf8d5bc0247655471653d8be"},"properties":{"commitSha":"8d48f4a4ec0de375b6aa19ed729c8d44ce68f0d3"}},{"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":"09e8c6a1a9bcade1be140b74c33141e66dc336e1b3fac5270142cb9f71a73b58"},"properties":{"commitSha":"8d48f4a4ec0de375b6aa19ed729c8d44ce68f0d3"}},{"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":"37c4ac322b0bf34ad4cad920f6c5e9e042ca2548bebf535c70282201eff9b579"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f06f66fc9c003ca6fafe45e93c7d4029d8b615cac86864a7a4ea88a95488658d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"61a6940bf73e139a31b26b66b235639d224314f018d5f22e0ba0106c21cd2150"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d551a9eaac27cd312cdf326fb315ccd7d36a5e167b90d3c652ea76bcfce2b7f"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"8001b11e646a4835e508c1a827f2951fb732844d0bd6b950650d65c83afeb298"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"26bc9bbeefe85f8fa1ec0089ea260853c1119e82b945a46c633384604d01b4c7"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"6f130f1ff4e0e07e98a92054d94d8d16f92d1e12d599c4668b9d3d2abdb6ec2e"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"212b81ac05dc671d13cde4abfc5dde06cd544219a0cf4b8a42972329be980a95"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"2e6f1af29e8e69da12874cd48a6f6c34eb9992a5afb37115a9f4471fa4254f5a"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"1ebad1c5a00d99a55a8bdbabfcef5b5dcbc185dd0bd84cd5e05a9f10733bc467"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"8ab6a5b68982b319f3cebe3a96711863622835f85ad71bec84d7c109f29413d8"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"80b23fbaaa55392ba04936eee0bc7f4a6830b5ab469b51a6748cf4f6e4f157e4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"78a7b54d0b6e0517d9383bd7af8b55160d89789121a232dd977f0918934f28de"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6927cdfe30b0793a82127e2f4bdd282880312fdd02e0fc831e4f7d7acf17bf72"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dde4526ccf970065004d9768e0fafb77782341a01758c53c2814964e0ccabb65"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"700dbd1fee789b9f052a2b6ee7da10eee500494d3da6fd1b0ce26c1b932d7c68"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7324b9714fbf2d0151812fb6eaf3593977e597dd6232c2d9f2baace2363d4b5b"},"taxa":[{"id":"CWE-290","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"268a4de54835a37c30fa1f4b18398acfc3bb3283c70618de7212e90d354bb114"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"41c73bbf5d0e482152890843aec93302de8ee6cf36e5fdc7ddaa3627361d0922"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ee278b011facce5728dcb6b154d00bc06ec6a4dad76ac3890df3cfd736bd0245"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"09c691fcc263464fe9ce334d339f3b0957be9391032556fa3e8e2dea78a99e2d"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1a8fcea5fc3d223bf0bcbe49fb77ed3b939df343c7a9d13539c819ba6d48739a"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"958eb86520e75a3522b64b680fae1c600312de92762fdfa27b503b35617f07ac"},"properties":{"dependency":{"package":"pillow","version":"11.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-25990","BIT-pillow-2026-40192","BIT-pillow-2026-42308","BIT-pillow-2026-42309","BIT-pillow-2026-42310","BIT-pillow-2026-42311","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-165","PYSEC-2026-2249","PYSEC-2026-2250","PYSEC-2026-2251","PYSEC-2026-2252","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-2874","PYSEC-2026-3451","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343"],"reachability":{"kind":"unknown"}}}},{"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":"ecb705248cdc428fa3260bec683bc922c5263572e3e9f5fc44abdf749ea6d672"},"properties":{"dependency":{"package":"anyio","version":"4.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4023","PYSEC-2026-4024","PYSEC-2026-4025"],"reachability":{"kind":"not-imported"}}}},{"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":"434c73b035edcfec0c18c00aad4c186121b412c5d1019239f598995c217929da"},"properties":{"dependency":{"package":"certifi","version":"2026.6.17","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"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":"3bc10c070830c3951330fbc8c20b1d718c6fcd94970d947011a5be16105b3969"},"properties":{"dependency":{"package":"pyasn1","version":"0.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"c93385bd0c0173c554037d2db65a396eff649450144db71f911a4d109c19842e"},"properties":{"dependency":{"package":"aiohttp","version":"3.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3545","PYSEC-2026-3546","PYSEC-2026-3547"],"reachability":{"kind":"production","file":"tools/social_media_fetcher/src/clients/official_news/client.py","line":7}}}},{"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":"47eda37a82327bc6d0af23b096b526edd54ea1ad70b867783d25a50a53a11ef2"},"properties":{"dependency":{"package":"multidict","version":"6.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"reachability":{"kind":"not-imported"}}}},{"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":"9c10008a2d62fba84aa7253637b57ea146f14dfdfd26e22ecbec291c04cb011a"},"properties":{"dependency":{"package":"pytest","version":"8.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"reachability":{"kind":"test-or-tooling","file":"tools/social_media_fetcher/tests/test_community_metadata.py","line":2}}}},{"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":"75ed26e93f2b5232b19ef0649c8ca26252b8502791f5190ccba79d553945e227"},"properties":{"dependency":{"package":"soupsieve","version":"2.8.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4170","PYSEC-2026-4171"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"2f886932ff6e7fb6fc2fddbdc8792270600bc04f32190c1b4305ee30b6cf9935"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"5c2b8cbad3510c6bab7b7f2a7b5cf8467c54c062085fe39372c9893e264c1e74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"2429585586707a585756fc1df2fa325cce56c85754985bf189083d86d866f0e1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 844 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; 844 of the 2681 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: ios/HomeWidget/HomeWidget.swift. 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":"ios/HomeWidget/HomeWidget.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d5fc1750b6372ea13c23e304062bb40f49b404c71598b76281d61464a25b52"}},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"094951ea77b7940f35199b8a2448b21aeed6a2eab638ee029bc59978999e026c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"586768cc4a42c3ff42dd1204c2e5ebd0606d777df1d77a8e14c07a128690a14b"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/index.html"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"531fc4a7c4b416d0d56618ce3fa5033014c41239c7fed30cca9a19701a65ae67"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit\u0027s own accessibility assertion to the test suite (Flutter \u0060meetsGuideline\u0060, Espresso \u0060AccessibilityChecks\u0060, XCTest \u0060performAccessibilityAudit\u0060), then gate that test in the pipeline. What was searched, so you can tell an absence from a miss: the 4 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"AX4","level":"error","message":{"text":"Dependency-rule violation: rtu_mirea_app (Application) \u2192 ads_ui (Web): \u0060rtu_mirea_app\u0060 is a Application project but references \u0060ads_ui\u0060, a Web project. The clean-architecture rule is that dependencies point INWARD \u2014 the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"082933d6fe3e1f3cff7746f081b0bbb4595dc8604e03a8ed1c8e0717316adc5c"}},{"ruleId":"AX4","level":"error","message":{"text":"Dependency-rule violation: rtu_mirea_app (Application) \u2192 app_ui (Web): \u0060rtu_mirea_app\u0060 is a Application project but references \u0060app_ui\u0060, a Web project. The clean-architecture rule is that dependencies point INWARD \u2014 the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aee969d503b5bcb89442e42e39ff61cb35ed6e915624a375f2242d76ad4aa1bf"}},{"ruleId":"AX4","level":"error","message":{"text":"Dependency-rule violation: rtu_mirea_app (Application) \u2192 news_blocks_ui (Web): \u0060rtu_mirea_app\u0060 is a Application project but references \u0060news_blocks_ui\u0060, a Web project. The clean-architecture rule is that dependencies point INWARD \u2014 the domain/application core must not depend on outer layers (infrastructure/web). Invert it: define the abstraction in the inner layer and implement it in the outer one."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c18cec072bbffd889656bc7d7816aca2943971bb2b2d3bd123d680e5fe4809db"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/9 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060ios\u0060, \u0060macos\u0060, \u0060packages/web_oauth_interceptor_client/example\u0060, \u0060packages/web_oauth_interceptor_client/example/ios\u0060 and 2 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add the Dart analyzer\u0027s security lints plus \u0060semgrep --config=auto\u0060 as a CI step. What was searched, so you can tell an absence from a miss: the 160752 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ios-startup-check.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (10 clone groups): 10 duplicated blocks under supabase/functions/ have copies in at least two of the sibling directories _shared, ingest, miniapp-deploy, miniapp-notify, miniapp-proxy, sync-telegram-feed \u2014 8 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcc957484526ceb266e15c17affa0d477cdd31413d970d959bbd416999fd852"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): supabase/functions/miniapp-svc-free-rooms/screens.ts:52 \u00B7 supabase/functions/miniapp-svc-free-rooms/screens.ts:94 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-svc-free-rooms/screens.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65bc14cd3c55a22fc36f17fa78bf8ba0d62cd631297dea13e2b991828952ec0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): supabase/functions/_shared/push_webhook.ts:40 \u00B7 supabase/functions/miniapp-notify/index.ts:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 118 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85e7f3efd89cdcc245ba5b1fb4f76818f3334070b680447c4a4a0bb7934fff0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): supabase/functions/miniapp-proxy/index.ts:404 \u00B7 supabase/functions/sync-telegram-feed/media.ts:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b2cba9392727d7bf2ce98a0dbb19e65bc94a5cf00f3736c15759023e32a4da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): supabase/functions/_shared/push_delivery_test.ts:108 \u00B7 supabase/functions/_shared/push_delivery_test.ts:148 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_delivery_test.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dcd4b56ffa3827d1a0a2f734dab334d29b342b6f07279d9133a0fb3e096393"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): supabase/functions/_shared/push_webhook.ts:142 \u00B7 supabase/functions/miniapp-notify/index.ts:200 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d2993fae5553edc5f9e72d22644ae70247fb47c3750d61a57a7025803bc424"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): supabase/functions/ingest/auth.ts:127 \u00B7 supabase/functions/ingest/auth_test.ts:63 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a4ee9254c6cd436109dc537d7248e391379e22700123b5aacf30b7615bfeab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): supabase/functions/miniapp-notify/index_test.ts:287 \u00B7 supabase/functions/miniapp-notify/index_test.ts:435 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index_test.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87f06563b7a0cc22ea2fa1de79a9b7b4d2f954ddf59f48effd989a9698b1ab3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): supabase/functions/_shared/cns.ts:251 \u00B7 supabase/functions/miniapp-proxy/index.ts:380 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/cns.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c208870231d2a35d2694a9f68638066f9c2013d5026d50600d1d53aba536f301"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): supabase/functions/ingest/index.ts:161 \u00B7 supabase/functions/sync-telegram-feed/index.ts:222 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/index.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b66d83f6c0a6f7986196f3795bb8c22f12cae5eb0e6ce77665420e4a3dabe44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): supabase/functions/miniapp-deploy/index.ts:35 \u00B7 supabase/functions/miniapp-proxy/index.ts:70 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-deploy/index.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"084d02f9ae0334a95dfd1e67febd5e494b708494a840f2e7d4c702558a198afb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): supabase/functions/miniapp-notify/index_test.ts:134 \u00B7 supabase/functions/miniapp-notify/index_test.ts:153 \u00B7 supabase/functions/miniapp-notify/index_test.ts:313 \u00B7 supabase/functions/miniapp-notify/index_test.ts:332 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index_test.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ba957040dcd5375be1042fffe2e0291fe3129a2367d639ecb08b79ea622a7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): supabase/functions/_shared/push_delivery.ts:84 \u00B7 supabase/functions/miniapp-notify/index.ts:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 102 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_delivery.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"385c132e4c18224d36709f66f9afc20e3ff9de66e3ce3210fa367df002eb7fec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): supabase/functions/miniapp-proxy/index.ts:189 \u00B7 supabase/functions/miniapp-proxy/index.ts:235 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf9837c7f01908e3532daa8cc94510512cf4cb6b372ad41818e9aefcc901ef4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): supabase/functions/miniapp-deploy/index.ts:83 \u00B7 supabase/functions/miniapp-notify/index.ts:290 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-deploy/index.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc4f045e8ff9d87afa8605c39c740d3c5ac5b5ac763f41edf6aaf78719a3ae5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): supabase/functions/miniapp-notify/index_test.ts:346 \u00B7 supabase/functions/miniapp-notify/index_test.ts:416 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index_test.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2b0946065532820fecfa19b690e5d6769fbbffa8f869bfa8d30e9c0ab1a342"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 50, cognitive 47): (anonymous) has cyclomatic complexity 50 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e91ece31a716ce1a6bdeb48cf9d372c5c8c941a3f740ee4e2264be9631c6999"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 47, cognitive 50): (anonymous) has cyclomatic complexity 47 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de862b0dba82f2abbaafdb84c9b0970c2c11c3305e8b8e5cd377d9d4554c313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 45, cognitive 51): (anonymous) has cyclomatic complexity 45 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73f39a4fa1f221209f60bdaf8b061e5fc10a36f4aa414c56888f4399dd31493"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 34): (anonymous) has cyclomatic complexity 38 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/community.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b49e498f6a97ce755b1690c42e082aea333ac134635568bbc6379d5ac41bfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requireIngestKey (cyclomatic 24, cognitive 28): requireIngestKey has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d6b6e53d27245516369ef4948dbbde9bbfa6f8f9629e225b29bda1792da683"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 25): (anonymous) has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/index.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff2cd02992268f8e528e6e948f4404234aea81e4b70ae99f54c1a2b7076b2a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePayload (cyclomatic 21, cognitive 20): validatePayload has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/payload.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42eadb4ed4f80c2f813b63f7159ca7a4b5a7ac74b8ea1e54aeaa017a7e566a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-deploy/index.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfddbc22bb5ea042f8a92f447ebeacfa716b75d87b56f8f54b5d5e0b266e52f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mirror (cyclomatic 18, cognitive 24): mirror has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/media.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ec1e8e75d3dce9b5b58246deac8d0d9571593114023b2763a2b87cbce1d351"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/moderate-content/index.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6eedd3c582eaba9a4442b6e3df9e63ad756268e24b6f03319987a7d848480d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveIngestKey (cyclomatic 15, cognitive 19): resolveIngestKey has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2317481a42342bc26e0d817059f4a5d6c1d7a346a03a767f7440099a751a143e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function identityHeaders (cyclomatic 14, cognitive 15): identityHeaders has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73dd51eb27d9e445fcb5e9706365bd1981e8500385e6256986eebde4fac34d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectPosts (cyclomatic 14, cognitive 15): collectPosts has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/collect.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd59ec95f82aba69407d9cfbcf0fc200a0f5761be59500bf6156defbe6a9c7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/index.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"db99ede6f627d94ed44b9e42eac1dd0ff4d512071dd02c0e6cab088b1cb5df8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 14, cognitive 12): download has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/media.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"93456d07ef2680b7bd0818b320ca57c97e029789e3dcd36e22fde87e109f1379"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_relay/upstream_proxy.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3b794c46bd9c2165f94a922a2bc577ec41821be15748d93f03ccba1c03b87d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncChannel (cyclomatic 12, cognitive 16): syncChannel has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/index.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc4ee8db8048310d4da37d8c592c7b44ede53861cd2c4b0f8b658b036f9564b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/firebase-messaging-sw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1579fdb494697d60429185ac3a62c6e061f32518183885c7a7f6f0a23459a911"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedJson (cyclomatic 11, cognitive 14): readBoundedJson has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/request_body.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0453beaa540989149c0760c87bf26d8b0d65f120883784e187ce54f61af23b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ingestAuthScope (cyclomatic 11, cognitive 12): ingestAuthScope has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2bb23c0e4b9464cd0c3b5d310070ce45dd66c73c9def469248045068b549fa"}},{"ruleId":"R3","level":"warning","message":{"text":"supabase/functions/miniapp-notify/index_test.ts: 422 lines of code: supabase/functions/miniapp-notify/index_test.ts has 422 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"036609575ad1b0ffb642c78be2433f68af4a0d207fd95458f1321c318d426d3d"}},{"ruleId":"R3","level":"warning","message":{"text":"supabase/functions/miniapp-proxy/index.ts: 406 lines of code: supabase/functions/miniapp-proxy/index.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1055a92ea0f2b1674411049514b7dfb20a4b97134d52b9ec3355e004bab22c7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36d77a3d3c41c66d44b82098c34b37c30d35eb90f483b71c618b66b0580ed7a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-proxy/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f335b6df95eeca232338e3c7506dd303fdd2a8ff9c20b37f3f241d168a724d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_delivery_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d3600190fa877f5f8e31afe559bf35a2bcc4f6b61a09311470bb0e87515958"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f0b0b6ce45bd0fefe14140c30cb0a6d49bca18a6f99020996bd4aea33b6113"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9e01a5438918ddbb49e62904906abd8a3353ddfa552f0cd457678189035e49"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/telegram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f404a6712a843b58d1bf81ff66e8fcf0c45173b8cd6de9bdfdd997a51a61facc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/cns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a68a44abf239a225b19e4a4bc7f3693f58c465e1d6123fe61466b5c14eeac3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"559e1f9def1806f12a613772247dca95d263c007a2fc296b43e180dc33f57a8d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_webhook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae7e481c2e2654d4e43ffb2311bb11b3676ed71f9956fbfe58338681edb6423"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/cns_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8a6ea753da5831185379192a45cfe56eeb54e429fd5dba866296fcd8bea3be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/media_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"299938dc820d4d4bafdafdfa7a485e72cb7b6e32e04d079c1032f0a0b5493b48"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-svc-free-rooms/screens.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacb2c45e8cccbfc797ed160e72809ff6b28182f7cdfc270925d67ce9c419894"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/moderate-content/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbe9accf8cbd16c13284c09274470075211fc12570fcc7e3820c58eb59da59f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/moderate-content/classifier.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde1375ac9e2922a675ae259f59e68a76829a2f247b261684f62779689fe6e86"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/media.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d377e9d24fe54c25271e2758a6603f2b5711473fd95605481be32dd6efeb7176"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/blocks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"391dd61242f6fdaa5735e8a8660459ed01019f051cffdcbe0265ec2cafa3859c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-deploy/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c17ede36683b508bfce8514c237d2bf47250bb204c7e9ccf7db4f429241fa5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_delivery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07dc12543e646dc430b6200f759f713037895a79f1eef1516d555294a2d3317"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/sync_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f5b503d16636c5691ecdffb8c600a8f7ccb878fb0c27156c7e731ade73163f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-svc-free-rooms/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b94dcdb250a53e3fdb45fa18027306428ff0c67817272fa81e172ceb80a3d7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/community_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f204789ffdd173a3adb8889c0850c49ba21a1c22248622706bba77b8804141"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/story_media_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4634ad70a289f712b025dbee1d2af5172a0b8d985734b06495ad015bf72110"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/request_body_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5846c481367ba742ebb0372c71649af4ee13ad925e4ed9bff1a228cf1b2c42ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-svc-free-rooms/screens_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef7f007e6b2966c3445c8b9aa84e64f5527aec9bbd885611a4dd89351c07eec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/blocks_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9152ecb30ff0a819b21483523e26b6d1fc60f17e141ca4c4acd6dffd48ce20e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/request_body.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20d6c8e60eba3560c74a970f027c0669a64a7487ce8d26854b296b98d6140bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/collect_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51338bd29efbec6320a68299bea6753781f853db98a1c2cdc4d63a93c53adc9d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/app-push/cns_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31310d2fb6591e8dfe2d28ec1277d622dc8d3606f3d0be70133738778734f2c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/collect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef182f74d06c4907ae7be181ca4f67410c43ce96fb843f676d067d55483081f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/test_assertions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a980de8bc98b4e8af6cb293509441ba20e39b0483fbca11be876934aa0b0c4e7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/telegram_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb3a8b5866d1c93e49642995f1b4cdb9dc9e81fec1450fa31c34a5b2ec65d9b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_relay/local_proxy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8b94aa7376a79c6b8a3008491786172f1d7abd9be853956074cff970daad84"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_budget.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da318260c62facaae50a1612dd452671fa61f8258de2170ba3887d48f64805aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/app-push/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed351b8549936ca1092fcb8293ceee7cd0697828c5cddaa68ceec821e4a96db1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/friends-push/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90438bfd83a75c90c8125858203417971f8b6d5801923605498a92122a89ab5b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~448 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/index_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2758bb5c87e4c8894a481409caf8aef2fc34bdb07b75fc11f5391837908a7617"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~408 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/push_delivery_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb76c20531ad79c3b036a50104c55ab8019d43739c4ee88938db933b31bcec8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~282 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/auth_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dc3a9408dba4a445355adab5abf336d7ea9a93d4677f88410e03a40134b539"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~224 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-notify/cns_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0452ff90dce47810e38bbd0973aaef856646547295c24abcde509ee76fc80e04"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~222 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/media_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"139506a37a33e236ae4509ab5ae6276a7eaf884812f6cec6b0b627f59f8f362c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~90 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/sync_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8130ff3a75060f7c98b141b31c79ec77c0bc8c6568034e00fa7b274c0799b2c5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~79 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/community_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f68f38da40d055ff98113a8048702c366d9740b51f9943c3dab186b8825a259"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~73 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/story_media_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcd2f478308c052560c05a673ed61f22eb016d1e02e375c3b67c0706848da31"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/request_body_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64246502b521a154e79c079897665580d272f271e933a957c0c8b1c6fae43d29"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/miniapp-svc-free-rooms/screens_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcd24d3f7236850fb3774aa694e3eca2c7653468fc29d15b5e832f0886a5faa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~56 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/blocks_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d031c5faca0dbff618dc2f566eb1a404a0a9a29ebad93733a635a8878079560"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/collect_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce1e41435f54f7cb21b9213582a9737dd4b3b221e380dfc6d06814797575e38"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/app-push/cns_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ba6a5c31f68142797435e6fac911ba44ca1d242000cf29ad9f0302d3657cab"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), but 8 in-repo import(s) from 8 other file(s) do name it (supabase/functions/ingest/auth_test.ts, supabase/functions/ingest/community_test.ts, supabase/functions/ingest/story_media_test.ts and 5 more) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/ingest/test_assertions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7e30671c9ac8fc205cfd107c7fb3de0eb575f3c9129b590cdb17c5cfc71206"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/sync-telegram-feed/telegram_test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3a9aa70c5048d14a1f398f526aa6d3163cbf99a7176e92a72f026954241af4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/schedule_relay/local_proxy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6316eb28a963e467e1b1b3577bde2afbd63c90a717cad846c4c1e8509d31b8ad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (11 application, 1 tooling, 3 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (supabase/functions/app-push/cns_test.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/app-push/cns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad36422feff0f66197527af9ddd6f5e8e29a319d6155d8066ca9b67f036dc58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!MediaQuery.disableAnimationsOf(context) \u0026\u0026 !MediaQuery.accessibleNavigationOf(context)\u0060 appears character-identically in 4 files \u2014 lib/feed/view/story_viewer/story_slide.dart, lib/feed/view/story_viewer/story_viewer_page.dart, lib/friends/view/friends_map_view.dart, lib/home/view/widgets/home_stories_rail.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/feed/view/story_viewer/story_slide.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa9b6e2734b1323249f0e8376998acf08d68c5ec7e1dfdd635cd43121d44617"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!MediaQuery.disableAnimationsOf(context) \u0026\u0026 !MediaQuery.accessibleNavigationOf(context) \u0026\u0026 TickerMode.valuesOf(context).enabled\u0060 appears character-identically in 2 files \u2014 packages/app_ui/lib/src/widgets/app_spinner.dart, packages/app_ui/lib/src/widgets/buttons/app_button.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/widgets/app_spinner.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af09087b15b03c7d0e77e856a0021b2991453f73e1e621922cec9cd2bd2489a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!kIsWeb \u0026\u0026 (defaultTargetPlatform == .android || defaultTargetPlatform == .iOS)\u0060 appears character-identically in 3 files \u2014 lib/app/view/app.dart, lib/navigation/routes/routes.dart, lib/watch/bloc/watch_connectivity_cubit.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/app/view/app.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"111f91b948b8ba549db906f22acec6ce5a3c8f1e8f13ebbc12de0224d2a6dac6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || !identical(_controller, controller)\u0060 appears character-identically in 2 files \u2014 lib/nfc_pass/widgets/nfc_card_background.dart, lib/nfc_pass/widgets/nfc_video_preview.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/nfc_pass/widgets/nfc_card_background.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cb6b31d6fa1b45970fa02570b440c5aa75524afe49825a607ce8edea4cc6cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || request != _request || _handle.text.trim() != handle\u0060 appears character-identically in 2 files \u2014 lib/profile/widgets/edit_identity_sheet.dart, lib/profile/widgets/edit_profile_sheet.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile/widgets/edit_identity_sheet.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ce50e4d87b1e54387d08336e546907a03dfe517535dc1d1082e7540984212d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!state.isValid || state.status.isInProgress\u0060 appears character-identically in 2 files \u2014 lib/login/bloc/login_bloc.dart, lib/login/bloc/sign_up_bloc.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/bloc/login_bloc.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc26108738fa906cffb86dd9f1401726191f554cb6965296789e90189eb7250"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027cafeteria\u0027 || \u0027cafe\u0027 || \u0027canteen\u0027 || \u0027food\u0027\u0060 appears character-identically in 2 files \u2014 lib/map/services/map_place_landmarks.dart, lib/map/widgets/map_place_kind.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/services/map_place_landmarks.dart"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"34624dbdc373a33d3bcc1d878a1f9c88da4a9fa67ccc72a2460723eb8318730d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027\u041B\u0435\u0441\u0442\u043D\u0438\u0446\u0430\u0027 || \u0027\u041B\u0438\u0444\u0442\u0027 || \u0027\u041F\u0430\u043D\u0434\u0443\u0441\u0027 || \u0027\u042D\u0441\u043A\u0430\u043B\u0430\u0442\u043E\u0440\u0027\u0060 appears character-identically in 2 files \u2014 lib/map/widgets/map_cartographic_layer.dart, lib/map/widgets/map_volume_layer.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_cartographic_layer.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cd05a829735f4b480b0f7abd89fc05fed124ff17e3b9af23e673c8812fb4c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(uri.scheme == \u0027https\u0027 || uri.scheme == \u0027http\u0027) \u0026\u0026 uri.host.isNotEmpty \u0026\u0026 uri.userInfo.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/community/widgets/collab_notes/editor/note_link_sheet.dart, packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/widgets/collab_notes/editor/note_link_sheet.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"634979a519aad4a0ed5a596700a3254a44ab8ef786ee68c25e0f93240e850062"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(uri.scheme == \u0027mailto\u0027 || uri.scheme == \u0027tel\u0027) \u0026\u0026 uri.path.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/community/services/note_pdf_export.dart, lib/community/widgets/collab_notes/editor/note_link_sheet.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/services/note_pdf_export.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6affbbb238622faff5d890b64d2f0a72a44992b7a4bf0d9ca25dda1c9bd8c76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060AppLifecycleState.inactive || AppLifecycleState.hidden || AppLifecycleState.paused || AppLifecycleState.detached\u0060 appears character-identically in 2 files \u2014 lib/notifications/view/push_history_listener.dart, lib/promo/cubit/promo_dismissals_cubit.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/view/push_history_listener.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca44644a8c8a4cbe1d97fb8139b7c84231effa07a3eb3437da571a4502765269"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060FriendsLocationStatus.permissionDenied || FriendsLocationStatus.permissionDeniedForever || FriendsLocationStatus.failure\u0060 appears character-identically in 2 files \u2014 lib/friends/view/friends_map_view.dart, lib/friends/widgets/ninja_geo_sharing_sheet.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/view/friends_map_view.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ec90f386aaa881ca9d4d0d5a342a9e8ff50593e70d6da374e7bdeb8fda54ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060MediaQuery.disableAnimationsOf(context) || MediaQuery.accessibleNavigationOf(context)\u0060 appears character-identically in 57 files \u2014 lib/common/media_viewer/media_viewer_page.dart, lib/community/view/collab_note_drawing_page.dart, lib/feed/view/story_viewer/story_viewer.dart, lib/feed/view/story_viewer/story_viewer_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/common/media_viewer/media_viewer_page.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98e9e8f7c898172db163ce26003cccac6146095aa30bb69bd78592f6aa191a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060NfcPassAvailability.isSupported \u0026\u0026 config.isEnabled(.nfcPass)\u0060 appears character-identically in 2 files \u2014 lib/services/data/services_directory.dart, lib/services/view/services_view.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/data/services_directory.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b6fb6c4c743595e831e12ff2bd01b52bf480ff55f31ad01293042388b6a2c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060TargetPlatform.fuchsia || TargetPlatform.linux || TargetPlatform.macOS || TargetPlatform.windows\u0060 appears character-identically in 2 files \u2014 lib/friends/widgets/ninja_geo_sharing_sheet.dart, packages/app_ui/lib/src/scale/app_scale.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/friends/widgets/ninja_geo_sharing_sheet.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"483b12997821f05651de1a2092f35f164ee4f75336470b1eef78f784b07d1c91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_busy || !widget.repository.isAuthenticated\u0060 appears character-identically in 2 files \u2014 lib/map/widgets/map_contribution_form.dart, lib/map/widgets/map_graph_editor_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/map/widgets/map_contribution_form.dart"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a862a29e43ffa200649b612da3fcef668229a0108c5135816c3d7f1bf0a35515"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.year == b.year \u0026\u0026 a.month == b.month \u0026\u0026 a.day == b.day\u0060 appears character-identically in 6 files \u2014 lib/community/models/events_filter.dart, lib/community/widgets/events/event_layout.dart, lib/schedule/view/schedule_details_page/helpers.dart, lib/schedule/view/schedule_page/schedule_dates.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/models/events_filter.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dd50f5882a706301a97dd11d2203220cef80a3d2630b5901d96af85618cacc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anchor != null \u0026\u0026 anchor.localName != \u0027a\u0027\u0060 appears character-identically in 2 files \u2014 lib/article/widgets/article_html.dart, lib/article/widgets/article_media.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/article/widgets/article_html.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86d880c189e1cde14b6ee1cc50923fc746c2c788192e59d8723ca81f745121f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060announcement != null \u0026\u0026 announcement.id == postId\u0060 appears character-identically in 2 files \u2014 lib/people/cubit/group_space/group_space_cubit.dart, lib/people/view/group_space_view.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/cubit/group_space/group_space_cubit.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6680c794e1cf5a46470968dcfc7341b06981cb71c479e80a720b01a73345ccd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bloc.state.isValid \u0026\u0026 !bloc.state.status.isInProgress\u0060 appears character-identically in 2 files \u2014 lib/login/view/login_page_form.dart, lib/login/view/sign_up_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/login/view/login_page_form.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff0961c91dea4c641071e5a4ba3a8c87e468defc5292e20ccfbfcbfe6ea989e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.hasNavigationAction \u0026\u0026 action != null\u0060 appears character-identically in 2 files \u2014 packages/news_blocks_ui/lib/src/post_large/post_large.dart, packages/news_blocks_ui/lib/src/post_medium/post_medium.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/news_blocks_ui/lib/src/post_large/post_large.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6283c060927cc4720c29a499aa8334d7d9d81b49958f5a7317e5e3ab824936a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.isEmpty || bytes.length \u003E _kMaxUploadBytes\u0060 appears character-identically in 2 files \u2014 lib/knowledge_bank/widgets/material_batch_upload_sheet.dart, lib/knowledge_bank/widgets/material_upload_sheet.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/widgets/material_batch_upload_sheet.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b92498a12e49a04eec81f33d1c47845c164ad95a59de3487b545b69f8222c3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060change.oldValue.start != null || change.newValue.start != null\u0060 appears character-identically in 2 files \u2014 lib/schedule/view/schedule_details_page/lesson_details_body.dart, lib/teacher_account/domain/teacher_workload_projection.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/schedule/view/schedule_details_page/lesson_details_body.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c7d2b27e0b2d2c8322fb5115722c8d6a0876600c546ddb05496d30c12685fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 280 || MediaQuery.textScalerOf(context).scale(1) \u003E 1.3\u0060 appears character-identically in 2 files \u2014 lib/home/view/widgets/hero/hero_done.dart, lib/home/view/widgets/home_lessons_group.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/home/view/widgets/hero/hero_done.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"259a4e3712d17c79a256c50f317cd09c614dbf2d525e7f3ae6afbec936f76dd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 300 || MediaQuery.textScalerOf(context).scale(1) \u003E 1.4\u0060 appears character-identically in 2 files \u2014 lib/communities/view/community_detail_page.dart, lib/schedule/view/compare/widgets/comparison_day_details.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/communities/view/community_detail_page.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a849f5fbe53f990ded7006fcb53df36db9e87ec98fbbc0a6219a2f96448901"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060jsonEquals\u0060 is public and takes \u0060Object ? a\u0060 from its caller, and it calls itself at line 9 (\u0060jsonEquals\u0060) with a piece of \u0060a\u0060 (and at line 16) \u2014 and nowhere in \u0060jsonEquals\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060jsonEquals\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/expression/json_equality.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"49de9a7e888626f0ed209ee171c88c4dc46e7f2eada19d9b1427d82a26781c04"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060runMiniAppAction\u0060 is public and takes \u0060Object ? action\u0060 from its caller, and it calls itself at line 68 (\u0060runMiniAppAction\u0060) with a piece of \u0060action\u0060 (and at line 85) \u2014 and nowhere in \u0060runMiniAppAction\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060runMiniAppAction\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/actions/action_execution.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b1e6346e0fcbb443144318b08a0964c3db5a653ec9f602e8ec14548457683a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060onCall\u0060 is public, takes a document from its caller (line 23) and hands it to \u0060_body\u0060, which calls itself at line 115 (\u0060_body\u0060) with a piece of \u0060value\u0060 (and at line 123) \u2014 and nowhere in \u0060_body\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060_body\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a552ed01bb91787cf5b5461b9f7976058580f11f37356a663b11be44c68021b0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060render\u0060 is public, takes a document from its caller (line 5) and hands it to \u0060_safeForeground\u0060, which calls itself at line 15 (\u0060_safeForeground\u0060) with a piece of \u0060node\u0060 (and at line 34, line 46) \u2014 and nowhere in \u0060_safeForeground\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060_safeForeground\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/mini_apps/widgets/mini_app_content.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f0c5d0f71ac56cc218343b3c0e7534efa4ebd11516849db125b8bc11872b60"}},{"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/firebase-messaging-sw.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"589bf564c3c6c5c276a14ce2d446f93df473adaf692ad732f84013244d334915"}},{"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":"tools/social_media_fetcher/src/news_blocks/adapters/official_news_adapter.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e81b43abf36054e6e3fcecc968f62abb7c0ecea131d528fddc424b3cd30fe5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except 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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38d6434d1c579881a16621b44397adc7a121276f76d29fe26227ee959397e38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except 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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf2ae7c25b5be0543941aee48a7b66b580bc89583d033a9105bbd8338e7a166"}},{"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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c948f46d8391249aa1f4987c1e513d5541518845ac53a7ad39ae6a054c30b4ae"}},{"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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f1660e0c8292049f0005575383b4d03a25d79124ddbbed91845e5248437c05"}},{"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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58422d8abdea7d385447a300d619da420096b00b4a62dc57cfe46f8dc92b0d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except 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":"tools/social_media_fetcher/src/clients/telegram/client.py"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"487eb8476af7430fd1cab9452f2c027dc1a0b71f079b8d995de02c8162ab559f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except 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":"tool/app_store_screenshots.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a20201cb1b70c85335752a04f69e0dff5497b5ec8d1ffbcafc4e5a4059f308"}},{"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":"supabase/functions/sync-telegram-feed/index.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"09def7f45de9d2661bfb92643a78d10752ebd8acca7b10498cda3491780f3cee"}},{"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":"supabase/functions/sync-telegram-feed/index.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"187272434b983e1dc257a4a68c23556974e4ce647e00c72d4e8c99f5e43b28f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/_shared/request_body.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"176fb26cd0c06232b70f61d71ed2bd50f522d58d13b32b3b2e3604bfbb6b3144"}},{"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":"packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c231b1c7dba0d9c30eaabf23d847c68f68c146929c0f5aa820590e1e362caa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/stac_bridge/lib/src/expression/expressions_engine.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ebc4eace4fa062222365e9841f264552d6f15988ef9039745d2fdb2fb38f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/promo_repository/lib/src/promo_repository.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"550c3e39537122b7a2ad0182c0c3a04d2098bb4529ca29cf3b12f0b9389be32c"}},{"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":"packages/mini_apps_repository/lib/src/mini_apps_repository.dart"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30bc6a1e58500701349d5c7d0f6c946b7f99a96f901770f752bac8e6b7c51a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app_ui/lib/src/glass/app_glass_gpu_capability_native.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"642aad3def0c2186165ccf235bac8c2723d8a23f2007be80e44946ff0e3c2848"}},{"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/tour/app_tour_controller.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba7ab22d16878ecc48df6f5e3db958349ce77feb64dbea6f6fd680c887aae8b"}},{"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/tour/app_tour_controller.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7eeda905d70b80a6627182de100b1cec3831a77850d13b5ae91ed52bb42a30"}},{"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/schedule/view/schedule_local_scope.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca9b51557ec10b7707c52945ab3428f0b70a91b49c3ed776abc3c1d125d3221"}},{"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/schedule/cubit/schedule_preferences/schedule_preferences_cubit.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"057c1c8b01d9ae10be84c275954956e147495849980988b83ec369bcda6c1b83"}},{"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/promo/promo_links.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0150825c4f9382105a0a6a0633fd1339092d1eaa35671fdca61c529dea16f84"}},{"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/profile/cubit/profile_cubit.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54af5a8dac7b3f861177dcb52273f12ead673cc86112771f4ccd240083dd6f"}},{"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/people/widgets/group_space/ninja_group_space_hero.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"847b16c767270e6541f4f72468adecabc031fcb1029ef631342f1c6cb75cc00e"}},{"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/people/view/group_space_view.dart"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8e71244ad84e5f03c044524dec811a79552f987379926aa64e857230589f22"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/people/cubit/group_space/group_space_cubit.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbe6e03b9738713413ba18921540f67370b28362c2edba1ff4711c57bc0142e"}},{"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/notifications/view/push_history_listener.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5f26defa63e37787e307d36a59594ecda6e769966d3665d7df8e1e7fb4213a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/notifications/cubit/notifications_cubit.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb038818a58eb61c7169b7d98311026618637c8fac0cfa3dbe0ac1f816591fa"}},{"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/notifications/cubit/notifications_cubit.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"796b9e7eb121b842965716610477bcfdf5044eeac49eabc424dc7bcc09909602"}},{"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/mini_apps/widgets/mini_app_report_sheet.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a523c2e0d9c03869423e4785e9a6e13f1510a77162b4bb5e8b5111aa117a59"}},{"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/mini_apps/view/mini_app_inner_screen.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca15d806638742330ba6e04b2f91ffdeb52507b186722c7c429817f407e5ea18"}},{"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/mini_apps/view/mini_app_runner_view.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"944f42efb9c16d20232617f2183cc18b7e5ddc0a205fe96ea2c624016aee6519"}},{"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/mini_apps/view/mini_app_runner_view.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa9980f77c84696cd52db084d5afd2325c4ddd66626b2c25323571e7d3f451b"}},{"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/mini_apps/view/mini_app_runner_view.dart"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f7e17c77cf8bad92d5bea7fcff9b6ca05ffd227097abfcac359269326a637"}},{"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/mini_apps/view/mini_app_runner_view.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4980ea3a9d122f153dd46bf1801184041d712471c262bca8120a2de6d5d39053"}},{"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/mini_apps/view/mini_app_runner_view.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631b94c6a6d19a64b33d10d540cacc7d79956427308e0e894417d5ed4e2b98c"}},{"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/mini_apps/view/mini_app_runner_view.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbda17cd321cbbae28b718adc902b972e6d6df6ae69f5c84370d8f9e5f6b8806"}},{"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/mini_apps/view/mini_app_submit_view.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0b33d3918786f893dab20672800b3d5dd8416cbd50dbf3fae862eb13b421ee"}},{"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/marketplace/view/marketplace_view.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ebfb0632880aae68ccafa58c1d2fa484d9c251abbe800dff8c826c69222a6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/marketplace/utils/marketplace_media_intake.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cec0235f138061cd4d4a304de81ba0af7ef94f8cd851b22b03b0df0a197551"}},{"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/map/data/file_map_data_cache.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09558e8de58ca130c6bb6d66c4f65b3e84633242ef488873590c8163f64420a"}},{"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/map/data/file_map_data_cache.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c8cc7447e308d4500c151db6d9eb082f84211f41181f37bfdf20ba2b11ee8d"}},{"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/map/data/map_data_repository.dart"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08852171f5fafb21d2e16f95add13739bde1edd2122e06c5540534f63ee4f70"}},{"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/map/data/map_data_repository.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b5fb13982b3cd8e7593440bc5589adcebb07847bb09a0616499c86dac297a6"}},{"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/map/data/map_data_repository.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"645a936e849907e54d8f518506b9611321af96ff10d142869344b1b215b611ff"}},{"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/map/data/map_data_repository.dart"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"338b9fcdf8f8cea7517325a8d7ed46ecee0cdb7c98826a5607b8f10479ce10f2"}},{"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/map/data/map_data_repository.dart"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"305f0f1d647c0baa01387dd672080e0b8bd9844ebfaf3b199563a7b7a46649a5"}},{"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/map/data/map_data_repository.dart"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3643af9dbd754fe91d0e8ea87c6d41f83a3b812c9303214d5ececbee7ae7da"}},{"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/lost_and_found/utils/lost_found_contact_launcher.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d3393111920992fc627279fa23836296c9c00ebcd6e29aa522d76636f255cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/knowledge_bank/utils/image_preview.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c042c6468b18ab94673a940f2baf057df4d927b3dff05074e0bd9793212fee"}},{"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/friends/services/friends_location_service.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9472ab2505ffdbdf28a5636628282220d1ecacac126263e0cbf086ea088b690f"}},{"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/friends/cubit/friends_map_cubit.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9b795c875f6da0a1a8d2100b69df2eb2a7a4c99c6add49cb703dea10e2c8c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/free_rooms/widgets/room_photo_gallery.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3744c78b2f121e9a2ddc0c9d2ac87f12c6a7cda5848c82477c5e214e0f0107c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/free_rooms/widgets/room_photo_gallery.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5517068e21f0808c67086f652ee3e5b9f1e83547a7639f2e0f5eaecdaed7dc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/data/note_draft_store.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2f0bc16df26eb6a4131bd6c18c538ad0c9c9e58e8ead44491c56e4f01809ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/community/data/note_draft_store.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"748d135aaf9087d6fa1501b9a5201e5e9edd928b9134c95d260288eceff7e5eb"}},{"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/communities/view/all_communities_view.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8a0deaab3b14985cb80bc1b21af55353be6e8f6806951efa4a1f4a1938fe61"}},{"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/communities/view/community_detail_page.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a787689419c0f0b80d95cdc1b53efa31b8cb9d98b711c4da5a1eed0d634a8c"}},{"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/article/widgets/article_html.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9014f83a6e3adefdf4e016c28a939588c10eaa2eba467146709a58813205554a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/app/widgets/local_notification_listener.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bca06490f3207dbe91c8a97007ec4a45a948593638e9dc6785d47e0415d3625"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/ninja/mirea/mireaapp/glance/ScheduleGlanceAppWidget.kt"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"337eae4b920b998bed15353179077889850e5379e8393d4e3bf6c9244778aaf1"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/news_blocks/adapters/official_news_adapter.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e946d64c359de2fb51c9304a94164ff6d29e5a22c0181e5bf7d2dbc1f440f5a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/social_media_fetcher/src/runtime_health.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"093e9b1aeabe6423f9e0ba80d514032fd158d3cc78ed64776b1a9d71acb318cf"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.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-290","guid":"379b1e66-a292-7b59-aa1e-a5bb4a6a99e9","name":"Authentication Bypass by Spoofing","shortDescription":{"text":"Authentication Bypass by Spoofing"},"helpUri":"https://cwe.mitre.org/data/definitions/290.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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":39,"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."]}]}