Public report of 0niel/university-app, published 22 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 22 October 2026, 05:55 UTC · Survey ID cd_8cc7b3dfa6b84192ad2e1e6e5a15e68e
0niel/university-app
Measured 22 October 2026, 05:45 UTC, at code version 89f8559
CAI scoreAt riskDown 4 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 201,670 lines of product code in 61 projects, tests not counted · Estimated rebuild effort: about 2.5 person-years · Weakest lens: Maturity, 40
Findings by how serious they are
24 critical1063 serious69 minor
12 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
22 October 2026, 05:45 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
83of 87 dimensions measured by tools. The other 4 are advisory notes from an AI model, which explain the code but don't count towards the score.
1130of 1156 findings point to an exact file and line, so you can open each one in the code. The other 26 concern the repository as a whole, such as missing documentation.
87dimensions across 8 lenses, read from 201,670 lines of product code in 61 projects.
0niel/university-app scores 48 out of 100, but it is rated At risk while a critical security finding is open; the score itself is unchanged.
The weakest lens counts most in the score, and here that is Maturity, which scores 40 and is rated Weak. Its Documentation accuracy dimension scores 0 out of 10, and until that reaches 4, Maturity can't be rated higher than Adequate. The first actions are to resolve the 1 No ADRs found finding(s) in ADR Quality and to reconcile the README with reality: README.md names `google-services.json`, but no file or folder `google-services.json` exists; docs/shorebird-releases.md names `release-manifest.json`, but no file or folder `release-manifest.json` exists; docs/mini-apps/guide/publishing.md links to `/reference/http-api`, but `reference/http-api` does not exist; docs/mini-apps/guide/publishing.md links to `/reference/backend`, but `reference/backend` does not exist; docs/mini-apps/guide/quickstart.md links to `/reference/state-storage`, but `reference/state-storage` does not exist, and if Maturity rose to 70, the score would rise from 48 to about 53.
24 findings are critical: 12 in Static Analysis (SAST), four in Dependency Vulnerabilities, three in Dependency direction, three in Secrets (history) and two in Page structure.
Watchdog couldn't measure 12 dimensions in this code, among them Code Coverage, Test Reliability and Dependency Hygiene, so they are left out of the score. The product code is 201,670 lines, which would take an estimated 2.5 person-years, around €360,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Maturity rose from 40 to 70, the lowest score rated Strong, the score would rise from 48 to about 53.
Code composition: what the lines of code are
Product code 58%Tests 42%
New since the last survey: 231 findings
These 231 critical or serious findings weren't in the previous survey, on 7 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 124 findings
These 124 critical or serious findings were in the previous survey, on 7 October 2026, and are gone from this one. The first 100 are listed here.
Dead Code · Dead file (~70 LoC) tools/schedule_relay/local_proxy.mjs
Rebuild cost: about €360,000 · Estimate
Cost to rebuild
€120,000 to €610,000, for 2,012 to 6,384 hours of work, about 2.5 person-years for 1 to 5 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 48. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 201,670 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 6 points · Low effort · ADR Quality
2
Reconcile the README with reality: README.md names `google-services.json`, but no file or folder `google-services.json` exists; docs/shorebird-releases.md names `release-manifest.json`, but no file or folder `release-manifest.json` exists; docs/mini-apps/guide/publishing.md links to `/reference/http-api`, but `reference/http-api` does not exist; docs/mini-apps/guide/publishing.md links to `/reference/backend`, but `reference/backend` does not exist; docs/mini-apps/guide/quickstart.md links to `/reference/state-storage`, but `reference/state-storage` does not exist.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €360,000 to build again, about 2.5 person-years of work. Its weakest lens is Maturity, at 40 (Weak). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.3 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 592,208 lines over the last 90 days, which is about 2,401,732 lines a year. At that pace, the extra work comes to an estimated 120.1 to 800.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
122 modules, with 147 dependencies between them. 3 loops run through 9 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 82 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
repository.src uses repository.analytics, so a change to repository.analytics can break repository.src, while a change to repository.src can't break repository.analytics.
Position
Below the diagonal: repository.src uses a module listed above it, which is the healthy direction.
9→28 repository.src uses repositorypart of a loop✕
Connections
6 pairs of types, where a type in repository.src uses a type in repository.
supabase.functions._shared.push_delivery uses supabase.functions._shared.cns, so a change to supabase.functions._shared.cns can break supabase.functions._shared.push_delivery, while a change to supabase.functions._shared.push_delivery can't break supabase.functions._shared.cns.
Position
Below the diagonal: supabase.functions._shared.push_delivery uses a module listed above it, which is the healthy direction.
tool uses tool.google_play_store_icon, so a change to tool.google_play_store_icon can break tool, while a change to tool can't break tool.google_play_store_icon.
Position
Below the diagonal: tool uses a module listed above it, which is the healthy direction.
tools.social_media_fetcher.src.clients.telegram.client uses tools.social_media_fetcher.src.config, so a change to tools.social_media_fetcher.src.config can break tools.social_media_fetcher.src.clients.telegram.client, while a change to tools.social_media_fetcher.src.clients.telegram.client can't break tools.social_media_fetcher.src.config.
Position
Below the diagonal: tools.social_media_fetcher.src.clients.telegram.client uses a module listed above it, which is the healthy direction.
tools.social_media_fetcher.src.pipeline uses tools.social_media_fetcher.src.config, so a change to tools.social_media_fetcher.src.config can break tools.social_media_fetcher.src.pipeline, while a change to tools.social_media_fetcher.src.pipeline can't break tools.social_media_fetcher.src.config.
Position
Below the diagonal: tools.social_media_fetcher.src.pipeline uses a module listed above it, which is the healthy direction.
tools.social_media_fetcher.src.pipeline uses tools.social_media_fetcher.src.pipeline.models, so a change to tools.social_media_fetcher.src.pipeline.models can break tools.social_media_fetcher.src.pipeline, while a change to tools.social_media_fetcher.src.pipeline can't break tools.social_media_fetcher.src.pipeline.models.
Position
Below the diagonal: tools.social_media_fetcher.src.pipeline uses a module listed above it, which is the healthy direction.
repository.article uses repository.analytics, so a change to repository.analytics can break repository.article, while a change to repository.article can't break repository.analytics.
Position
Below the diagonal: repository.article uses a module listed above it, which is the healthy direction.
repository.article uses repository.l10n, so a change to repository.l10n can break repository.article, while a change to repository.article can't break repository.l10n.
Position
Below the diagonal: repository.article uses a module listed above it, which is the healthy direction.
repository.article uses repository.src, so a change to repository.src can break repository.article, while a change to repository.article can't break repository.src.
Position
Below the diagonal: repository.article uses a module listed above it, which is the healthy direction.
repository.di uses repository.config, so a change to repository.config can break repository.di, while a change to repository.di can't break repository.config.
Position
Below the diagonal: repository.di uses a module listed above it, which is the healthy direction.
38 pairs of types, where a type in repository.di uses a type in repository.src. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
repository.free_rooms uses repository.l10n, so a change to repository.l10n can break repository.free_rooms, while a change to repository.free_rooms can't break repository.l10n.
Position
Below the diagonal: repository.free_rooms uses a module listed above it, which is the healthy direction.
repository.free_rooms uses repository.src, so a change to repository.src can break repository.free_rooms, while a change to repository.free_rooms can't break repository.src.
Position
Below the diagonal: repository.free_rooms uses a module listed above it, which is the healthy direction.
repository.friends uses repository.l10n, so a change to repository.l10n can break repository.friends, while a change to repository.friends can't break repository.l10n.
Position
Below the diagonal: repository.friends uses a module listed above it, which is the healthy direction.
repository.friends uses repository.src, so a change to repository.src can break repository.friends, while a change to repository.friends can't break repository.src.
Position
Below the diagonal: repository.friends uses a module listed above it, which is the healthy direction.
repository.knowledge_bank uses repository.l10n, so a change to repository.l10n can break repository.knowledge_bank, while a change to repository.knowledge_bank can't break repository.l10n.
Position
Below the diagonal: repository.knowledge_bank uses a module listed above it, which is the healthy direction.
repository.knowledge_bank uses repository.src, so a change to repository.src can break repository.knowledge_bank, while a change to repository.knowledge_bank can't break repository.src.
Position
Below the diagonal: repository.knowledge_bank uses a module listed above it, which is the healthy direction.
repository.lost_and_found uses repository.l10n, so a change to repository.l10n can break repository.lost_and_found, while a change to repository.lost_and_found can't break repository.l10n.
Position
Below the diagonal: repository.lost_and_found uses a module listed above it, which is the healthy direction.
repository.lost_and_found uses repository.src, so a change to repository.src can break repository.lost_and_found, while a change to repository.lost_and_found can't break repository.src.
Position
Below the diagonal: repository.lost_and_found uses a module listed above it, which is the healthy direction.
repository.nfc_pass uses repository.src, so a change to repository.src can break repository.nfc_pass, while a change to repository.nfc_pass can't break repository.src.
Position
Below the diagonal: repository.nfc_pass uses a module listed above it, which is the healthy direction.
repository.search uses repository.src, so a change to repository.src can break repository.search, while a change to repository.search can't break repository.src.
Position
Below the diagonal: repository.search uses a module listed above it, which is the healthy direction.
21→37 repository.search uses repository.schedulepart of a loop✕
Connections
1 pair of types, where a type in repository.search uses a type in repository.schedule.
repository.search uses repository.schedule, so a change to repository.schedule can break repository.search, while a change to repository.search can't break repository.schedule.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
supabase.functions._shared uses supabase.functions._shared.cns, so a change to supabase.functions._shared.cns can break supabase.functions._shared, while a change to supabase.functions._shared can't break supabase.functions._shared.cns.
Position
Below the diagonal: supabase.functions._shared uses a module listed above it, which is the healthy direction.
supabase.functions._shared uses supabase.functions._shared.push_delivery, so a change to supabase.functions._shared.push_delivery can break supabase.functions._shared, while a change to supabase.functions._shared can't break supabase.functions._shared.push_delivery.
Position
Below the diagonal: supabase.functions._shared uses a module listed above it, which is the healthy direction.
tools.social_media_fetcher uses tools.social_media_fetcher.src.config, so a change to tools.social_media_fetcher.src.config can break tools.social_media_fetcher, while a change to tools.social_media_fetcher can't break tools.social_media_fetcher.src.config.
Position
Below the diagonal: tools.social_media_fetcher uses a module listed above it, which is the healthy direction.
tools.social_media_fetcher uses tools.social_media_fetcher.src.clients.telegram.client, so a change to tools.social_media_fetcher.src.clients.telegram.client can break tools.social_media_fetcher, while a change to tools.social_media_fetcher can't break tools.social_media_fetcher.src.clients.telegram.client.
Position
Below the diagonal: tools.social_media_fetcher uses a module listed above it, which is the healthy direction.
repository.map uses repository.src, so a change to repository.src can break repository.map, while a change to repository.map can't break repository.src.
Position
Below the diagonal: repository.map uses a module listed above it, which is the healthy direction.
repository.map uses repository.free_rooms, so a change to repository.free_rooms can break repository.map, while a change to repository.map can't break repository.free_rooms.
Position
Below the diagonal: repository.map uses a module listed above it, which is the healthy direction.
repository.navigation uses repository.article, so a change to repository.article can break repository.navigation, while a change to repository.navigation can't break repository.article.
Position
Below the diagonal: repository.navigation uses a module listed above it, which is the healthy direction.
25→29 repository.navigation uses repository.apppart of a loop✕
Connections
1 pair of types, where a type in repository.navigation uses a type in repository.app.
repository.navigation uses repository.app, so a change to repository.app can break repository.navigation, while a change to repository.navigation can't break repository.app.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
repository.schedule_management uses repository.src, so a change to repository.src can break repository.schedule_management, while a change to repository.schedule_management can't break repository.src.
Position
Below the diagonal: repository.schedule_management uses a module listed above it, which is the healthy direction.
repository.schedule_management uses repository.search, so a change to repository.search can break repository.schedule_management, while a change to repository.schedule_management can't break repository.search.
Position
Below the diagonal: repository.schedule_management uses a module listed above it, which is the healthy direction.
26→37 repository.schedule_management uses repository.schedulepart of a loop✕
Connections
6 pairs of types, where a type in repository.schedule_management uses a type in repository.schedule.
repository.schedule_management uses repository.schedule, so a change to repository.schedule can break repository.schedule_management, while a change to repository.schedule_management can't break repository.schedule.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
repository.services uses repository.config, so a change to repository.config can break repository.services, while a change to repository.services can't break repository.config.
Position
Below the diagonal: repository.services uses a module listed above it, which is the healthy direction.
repository.services uses repository.src, so a change to repository.src can break repository.services, while a change to repository.services can't break repository.src.
Position
Below the diagonal: repository.services uses a module listed above it, which is the healthy direction.
repository.services uses repository.nfc_pass, so a change to repository.nfc_pass can break repository.services, while a change to repository.services can't break repository.nfc_pass.
Position
Below the diagonal: repository.services uses a module listed above it, which is the healthy direction.
repository.app uses repository.src, so a change to repository.src can break repository.app, while a change to repository.app can't break repository.src.
Position
Below the diagonal: repository.app uses a module listed above it, which is the healthy direction.
repository.app uses repository.navigation, so a change to repository.navigation can break repository.app, while a change to repository.app can't break repository.navigation.
Position
Below the diagonal: repository.app uses a module listed above it, which is the healthy direction.
repository.login uses repository.analytics, so a change to repository.analytics can break repository.login, while a change to repository.login can't break repository.analytics.
Position
Below the diagonal: repository.login uses a module listed above it, which is the healthy direction.
repository.login uses repository.src, so a change to repository.src can break repository.login, while a change to repository.login can't break repository.src.
Position
Below the diagonal: repository.login uses a module listed above it, which is the healthy direction.
repository.login uses repository.map, so a change to repository.map can break repository.login, while a change to repository.login can't break repository.map.
Position
Below the diagonal: repository.login uses a module listed above it, which is the healthy direction.
repository.common uses repository.src, so a change to repository.src can break repository.common, while a change to repository.common can't break repository.src.
Position
Below the diagonal: repository.common uses a module listed above it, which is the healthy direction.
repository.community uses repository.l10n, so a change to repository.l10n can break repository.community, while a change to repository.community can't break repository.l10n.
Position
Below the diagonal: repository.community uses a module listed above it, which is the healthy direction.
58 pairs of types, where a type in repository.community uses a type in repository.src. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
repository.community uses repository.src, so a change to repository.src can break repository.community, while a change to repository.community can't break repository.src.
Position
Below the diagonal: repository.community uses a module listed above it, which is the healthy direction.
repository.community uses repository, so a change to repository can break repository.community, while a change to repository.community can't break repository.
Position
Below the diagonal: repository.community uses a module listed above it, which is the healthy direction.
repository.university_modules uses repository.config, so a change to repository.config can break repository.university_modules, while a change to repository.university_modules can't break repository.config.
Position
Below the diagonal: repository.university_modules uses a module listed above it, which is the healthy direction.
repository.university_modules uses repository.src, so a change to repository.src can break repository.university_modules, while a change to repository.university_modules can't break repository.src.
Position
Below the diagonal: repository.university_modules uses a module listed above it, which is the healthy direction.
repository.university_modules uses repository, so a change to repository can break repository.university_modules, while a change to repository.university_modules can't break repository.
Position
Below the diagonal: repository.university_modules uses a module listed above it, which is the healthy direction.
repository.home uses repository.l10n, so a change to repository.l10n can break repository.home, while a change to repository.home can't break repository.l10n.
Position
Below the diagonal: repository.home uses a module listed above it, which is the healthy direction.
repository.home uses repository.src, so a change to repository.src can break repository.home, while a change to repository.home can't break repository.src.
Position
Below the diagonal: repository.home uses a module listed above it, which is the healthy direction.
repository.home uses repository.services, so a change to repository.services can break repository.home, while a change to repository.home can't break repository.services.
Position
Below the diagonal: repository.home uses a module listed above it, which is the healthy direction.
repository.home uses repository.community, so a change to repository.community can break repository.home, while a change to repository.home can't break repository.community.
Position
Below the diagonal: repository.home uses a module listed above it, which is the healthy direction.
repository.main uses repository.analytics, so a change to repository.analytics can break repository.main, while a change to repository.main can't break repository.analytics.
Position
Below the diagonal: repository.main uses a module listed above it, which is the healthy direction.
repository.main uses repository.config, so a change to repository.config can break repository.main, while a change to repository.main can't break repository.config.
Position
Below the diagonal: repository.main uses a module listed above it, which is the healthy direction.
repository.main uses repository.src, so a change to repository.src can break repository.main, while a change to repository.main can't break repository.src.
Position
Below the diagonal: repository.main uses a module listed above it, which is the healthy direction.
repository.main uses repository.common, so a change to repository.common can break repository.main, while a change to repository.main can't break repository.common.
Position
Below the diagonal: repository.main uses a module listed above it, which is the healthy direction.
repository.profile uses repository.l10n, so a change to repository.l10n can break repository.profile, while a change to repository.profile can't break repository.l10n.
Position
Below the diagonal: repository.profile uses a module listed above it, which is the healthy direction.
repository.profile uses repository.src, so a change to repository.src can break repository.profile, while a change to repository.profile can't break repository.src.
Position
Below the diagonal: repository.profile uses a module listed above it, which is the healthy direction.
repository.profile uses repository.friends, so a change to repository.friends can break repository.profile, while a change to repository.profile can't break repository.friends.
Position
Below the diagonal: repository.profile uses a module listed above it, which is the healthy direction.
repository.profile uses repository.app, so a change to repository.app can break repository.profile, while a change to repository.profile can't break repository.app.
Position
Below the diagonal: repository.profile uses a module listed above it, which is the healthy direction.
repository.profile uses repository.common, so a change to repository.common can break repository.profile, while a change to repository.profile can't break repository.common.
Position
Below the diagonal: repository.profile uses a module listed above it, which is the healthy direction.
repository.schedule uses repository.analytics, so a change to repository.analytics can break repository.schedule, while a change to repository.schedule can't break repository.analytics.
Position
Below the diagonal: repository.schedule uses a module listed above it, which is the healthy direction.
repository.schedule uses repository.config, so a change to repository.config can break repository.schedule, while a change to repository.schedule can't break repository.config.
Position
Below the diagonal: repository.schedule uses a module listed above it, which is the healthy direction.
repository.schedule uses repository.l10n, so a change to repository.l10n can break repository.schedule, while a change to repository.schedule can't break repository.l10n.
Position
Below the diagonal: repository.schedule uses a module listed above it, which is the healthy direction.
100 pairs of types, where a type in repository.schedule uses a type in repository.src. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
repository.schedule uses repository.src, so a change to repository.src can break repository.schedule, while a change to repository.schedule can't break repository.src.
Position
Below the diagonal: repository.schedule uses a module listed above it, which is the healthy direction.
repository.schedule uses repository.schedule_management, so a change to repository.schedule_management can break repository.schedule, while a change to repository.schedule can't break repository.schedule_management.
Position
Below the diagonal: repository.schedule uses a module listed above it, which is the healthy direction.
repository.schedule uses repository.common, so a change to repository.common can break repository.schedule, while a change to repository.schedule can't break repository.common.
Position
Below the diagonal: repository.schedule uses a module listed above it, which is the healthy direction.
repository.attendance uses repository.src, so a change to repository.src can break repository.attendance, while a change to repository.attendance can't break repository.src.
Position
Below the diagonal: repository.attendance uses a module listed above it, which is the healthy direction.
repository.attendance uses repository.schedule, so a change to repository.schedule can break repository.attendance, while a change to repository.attendance can't break repository.schedule.
Position
Below the diagonal: repository.attendance uses a module listed above it, which is the healthy direction.
repository.design_preview uses repository.l10n, so a change to repository.l10n can break repository.design_preview, while a change to repository.design_preview can't break repository.l10n.
Position
Below the diagonal: repository.design_preview uses a module listed above it, which is the healthy direction.
repository.design_preview uses repository.src, so a change to repository.src can break repository.design_preview, while a change to repository.design_preview can't break repository.src.
Position
Below the diagonal: repository.design_preview uses a module listed above it, which is the healthy direction.
repository.design_preview uses repository.map, so a change to repository.map can break repository.design_preview, while a change to repository.design_preview can't break repository.map.
Position
Below the diagonal: repository.design_preview uses a module listed above it, which is the healthy direction.
repository.design_preview uses repository.services, so a change to repository.services can break repository.design_preview, while a change to repository.design_preview can't break repository.services.
Position
Below the diagonal: repository.design_preview uses a module listed above it, which is the healthy direction.
repository.design_preview uses repository.home, so a change to repository.home can break repository.design_preview, while a change to repository.design_preview can't break repository.home.
Position
Below the diagonal: repository.design_preview uses a module listed above it, which is the healthy direction.
repository.grades uses repository.src, so a change to repository.src can break repository.grades, while a change to repository.grades can't break repository.src.
Position
Below the diagonal: repository.grades uses a module listed above it, which is the healthy direction.
repository.grades uses repository.schedule, so a change to repository.schedule can break repository.grades, while a change to repository.grades can't break repository.schedule.
Position
Below the diagonal: repository.grades uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 53% · Adequate · gated by R7 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
23
High / Critical
A03:2025 — Software Supply Chain Failures
9
High / Critical
A07:2025 — Authentication Failures
4
High / Critical
A02:2025 — Security Misconfiguration
3
Medium
Roadmap
First, eliminate dead code and unused exports to reduce maintenance overhead and rebuild times. Next, reconcile documentation with reality by fixing broken links and missing file references in the README and guides. Then, establish a robust disaster recovery strategy by codifying backups and geo-recovery in infrastructure as code, while clearly documenting recovery objectives. Finally, formalize architectural decisions by creating a structured repository of design records to ensure long-term clarity and consistency.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Reconcile the README with reality: README.md names `google-services.json`, but no file or folder `google-services.json` exists; docs/shorebird-releases.md names `release-manifest.json`, but no file or folder `release-manifest.json` exists; docs/mini-apps/guide/publishing.md links to `/reference/http-api`, but `reference/http-api` does not exist; docs/mini-apps/guide/publishing.md links to `/reference/backend`, but `reference/backend` does not exist; docs/mini-apps/guide/quickstart.md links to `/reference/state-storage`, but `reference/state-storage` does not exist.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 24
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 1063
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 69
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 12
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 83 of 87 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 87 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 1130 of 1156 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.dart, .ts, .py, .mjs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (lcov — `flutter test --coverage` (or `dart test --coverage=coverage` then `dart run coverage:format_coverage --lcov`), or lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`, or `coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `flutter test --coverage` (or `dart test --coverage=coverage` then `dart run coverage:format_coverage --lcov`), or lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`, or `coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 9 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 888 test source file(s) (.dart, .py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.dart, .ts, .py, .mjs) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 7 Maven/Gradle manifest(s) were read, stating a version for 17 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Gradle build (build.gradle/build.gradle.kts), but the licence verdict published here was taken over its pub package dependencies. Nothing was read about its Gradle dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (20 contributor(s) across 1200 commit(s) sampled, automation and bot accounts excluded). One of them holds 92% of the history; the other 19 hold 0.4% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (android/build.gradle), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `docs/mini-apps/.vitepress/theme/index.ts`, `ios/HomeWidget/HomeWidget.swift`, `tools/social_media_fetcher/src/clients/telegram/stories.py`, `tools/social_media_fetcher/src/community_metadata.py`, `tools/social_media_fetcher/worker.py` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (docker-compose.social-media.yml). compose up failed (exit 14 — a file the compose project references is missing) — env file .env.social-media not found: stat .env.social-media: no such file or directory; runtime evidence skipped.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'package:supabase_flutter' is imported (lib/debug/debug_actions.dart:19), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'package:supabase_flutter' is imported (lib/debug/debug_actions.dart:19), but this repository stands up no server and carries no migration or rules file this check reads, so who may read and write its data could not be decided.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'package:supabase_flutter' is imported (lib/debug/debug_actions.dart:19), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'package:supabase_flutter' is imported (lib/debug/debug_actions.dart:19), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'package:supabase_flutter' is imported (lib/debug/debug_actions.dart:19), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
X3 Exception handling — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 20 further occurrence(s) are not listed individually; the score already reflects all 60.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP log through no library that carries a message's values as fields (pino, winston, bunyan, tslog, LogTape, roarr; Python's logging, structlog; PHP's PSR-3 loggers), so its log calls cannot be judged, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (4): D19, D21, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
194 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was _LabelsPainter.paint at 79. A further 3 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being NewsBlock.fromJson at 24 — they are counted neither in the figure above nor in this dimension's score. 2 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: packages/news_blocks/lib/src/news_block.dart (NewsBlock.fromJson at 24), wear/lib/schedule/view/schedule_loading_view.dart (_ScheduleLoadingViewState.build at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 189 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with _LabelsPainter.paint (cyclomatic 79), ScheduleChangePresentation.fromChange (cyclomatic 73), _VolumeLabelsPainter.paint (cyclomatic 61). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cyclomatic Complexity from 6.1 to about 6.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 306 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 9 bodies over 60 down to 60 or less in Cognitive Complexity — start with _LabelsPainter.paint (cognitive 130), _MapPlaceDetailsSheetState.build (cognitive 107), ScheduleDayView.build (cognitive 96). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 9 together lifts Cognitive Complexity from 4.1 to about 5.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.5 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 86 MethodTooLong finding(s) in God Classes — start with map_view.dart (2), theme.dart, map_place_details_sheet.dart. — One of this dimension's main actionable groups (86 warning-level).
Resolve the 20 FileTooLong finding(s) in God Classes — start with map_graph_editor_page.dart, map_view.dart, build_showcase_seed.mjs. — One of this dimension's main actionable groups (20 warning-level).
Resolve the 14 ClassTooLong finding(s) in God Classes — start with map_view.dart, campus_repository.dart, map_data_repository.dart. — One of this dimension's main actionable groups (14 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
150 duplicated block group(s) detected. A further 5 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 48 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 14 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with community_catalog_skeleton.dart, room_photo_gallery.dart, friends_map_attribution.dart. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 13 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with schedule_month_view.dart (2), attendance_skeleton.dart, collab_note_card.dart. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 12 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with community_catalog_skeleton.dart, event_card.dart, listing_media.dart. — One of this dimension's main actionable groups (12 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.3 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
56 production modules (Gradle+Python+pub+Deno), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; 12 module(s) off the main sequence, with abstractness counted on 55 of the 56 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: connectivity_client · ×12
What to do
Resolve the 12 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (12 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 31 Low cohesion finding(s) in Cohesion (LCOM4) — start with app_scope.dart, custom_lesson_editor_cubit.dart, profile_extras_cubit.dart. — One of this dimension's main actionable groups (31 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
498 test methods: 498 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 9 `it`/`test` case(s) across 2 test file(s) declaring at least one beside 3 .NET test method(s); its tier split is read from package names and paths only. The Python suite contributes 486 test function(s) across 36 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 9 tests. Measured on the JavaScript/TypeScript suite only — at least 888 test source file(s) (.dart, .py) went unread, so its test quality is unmeasured and is not in these counts.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 388 resolved pub package(s) use a banned license. Licences were read from pub.dev's analysis of each package's licence file, over every package this repository's pubspec.lock resolves from pub.dev, direct and transitive, at the locked version; the 12 package(s) the lock marks direct dev are excluded, and SDK, path and git packages have no registry release to read. pub.dev analyses only recent releases, so for 105 package(s) locked at an older version the licence read is that of the package's latest analysed release, not of the locked one. 5 of them carry no licence pub.dev recognises; that is missing data, not a violation, and none of them is charged. ★ COVERAGE OF THIS VERDICT: it grades this repository's pub package dependencies and nothing else. The repository also declares a Gradle build (build.gradle/build.gradle.kts), and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 77 Hotspot finding(s) in Churn × Complexity Hotspots — start with index.ts (2), map_view.dart, schedule_day_view.dart. — One of this dimension's main actionable groups (77 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with web_oauth_interceptor_client.dart. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
0 deducted task-comment markers across 201670 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README is excellent at describing the project (University App: a Flutter wear OS platform where tenant/config and Supabase ingest are configured via .env/.json config files; technologies listed with null-safety, BLoC/hydrated_bloc, freezed/json_serializable; an overview of data flow from external source to Flutter UI), while each directory README is focused on itself (wear/README.md, academic_calendar/README.md, etc.) and the architecture/design docs are separate markdown files. The visible content is clear and complete for its scope. (10 of 25 sampled documents could not be assessed: 1 of 2 evaluation groups failed.)
Documentation: no contributor guidanceREADME.md
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
3 finding(s): 0 critical, 3 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 3 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
23 finding(s): 0 critical, 12 high, 5 medium, 6 low. semgrep hit a parse error in 4 file(s) — `docs/mini-apps/.vitepress/theme/index.ts` (lines 17–53), `tools/social_media_fetcher/src/clients/telegram/stories.py` (line 13), `tools/social_media_fetcher/src/community_metadata.py` (line 10), `tools/social_media_fetcher/worker.py` (line 14) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 6 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 9 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (9). — One of this dimension's main actionable groups (9 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 2 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Critical vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 3 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
1 of 839 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is ios/HomeWidget/HomeWidget.swift. Counted over 839 of the 2668 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Orphaned files with no living knowledge
Orphaned fileios/HomeWidget/HomeWidget.swift:1
✓ On the Gold path — maintain.
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 6 platform declaration(s) and 28 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
Do you agree with this assessment?
AC3 · Page structure3.9 / 10Weak✓ Tool-verified
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). — web/index.html:1
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — web/index.html:1
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. — web/index.html:18
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit's own accessibility assertion to the test suite (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), 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's test and CI files — 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.
What to do
Enforce accessibility in the toolchain your project already uses: assert accessibility in your UI test suite with your toolkit's own matcher (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), then gate that test in CI so a regression blocks the merge.
Other · Architecture — Whether any singleton service captures a scoped/transient dependency — a silent lifetime/threading bug.
Method: Roslyn scan: DI registrations parsed from AddSingleton/Scoped/Transient; each singleton checked for captured shorter-lifetime dependencies. Exhaustive, deterministic.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
`rtu_mirea_app` is a Application project but references `ads_ui`, a Web project. The clean-architecture rule is that dependencies point INWARD — 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.
`rtu_mirea_app` is a Application project but references `app_ui`, a Web project. The clean-architecture rule is that dependencies point INWARD — 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.
`rtu_mirea_app` is a Application project but references `news_blocks_ui`, a Web project. The clean-architecture rule is that dependencies point INWARD — 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.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Other · Domain Modelling — Whether an entity protects its own invariants — a class whose identity is derived from its fields (value equality) but whose fields are publicly mutable bypasses that invariant. Encapsulated state keeps identity-bearing fields immutable.
Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.
Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.
Other · Code Health — Unreviewed-generation residue in this repository's Dart: methods whose whole body still throws UnimplementedError or a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Dart: methods that only throw UnimplementedError or a "not implemented" exception, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 8 of 9 project(s) that lack one — worth up to 1.8 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
README.md names `google-services.json`, but no file or folder `google-services.json` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:77
docs/shorebird-releases.md names `release-manifest.json`, but no file or folder `release-manifest.json` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/shorebird-releases.md:7
docs/mini-apps/guide/publishing.md links to `/reference/http-api`, but `reference/http-api` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/guide/publishing.md:43
docs/mini-apps/guide/publishing.md links to `/reference/backend`, but `reference/backend` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/guide/publishing.md:49
docs/mini-apps/guide/quickstart.md links to `/reference/state-storage`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/guide/quickstart.md:49
docs/mini-apps/guide/quickstart.md links to `/reference/actions#openpage`, but `reference/actions` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/guide/quickstart.md:57
docs/mini-apps/guide/quickstart.md links to `/reference/widgets`, but `reference/widgets` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/guide/quickstart.md:61
docs/mini-apps/guide/quickstart.md links to `/reference/deeplinks`, but `reference/deeplinks` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/guide/quickstart.md:63
docs/mini-apps/reference/actions.md links to `/reference/deeplinks`, but `reference/deeplinks` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/actions.md:14
docs/mini-apps/reference/actions.md links to `/reference/state-storage#setstate`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/actions.md:97
docs/mini-apps/reference/actions.md links to `/reference/logic`, but `reference/logic` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/actions.md:98
docs/mini-apps/reference/actions.md links to `/reference/backend`, but `reference/backend` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/actions.md:226
docs/mini-apps/reference/backend.md links to `/reference/yandex-deploy`, but `reference/yandex-deploy` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/backend.md:8
docs/mini-apps/reference/backend.md links to `/diagrams/proxy-flow.svg`, but `diagrams/proxy-flow.svg` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/backend.md:14
docs/mini-apps/reference/backend.md links to `/guide/publishing`, but `guide/publishing` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/backend.md:43
docs/mini-apps/reference/backend.md links to `/diagrams/service-flow.svg`, but `diagrams/service-flow.svg` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/backend.md:156
docs/mini-apps/reference/deeplinks.md links to `/reference/actions#opendeeplink`, but `reference/actions` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/deeplinks.md:36
docs/mini-apps/reference/http-api.md links to `/guide/publishing#разрешения-на-данные`, but `guide/publishing` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/http-api.md:63
docs/mini-apps/reference/logic.md links to `/reference/actions#fetch`, but `reference/actions` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/logic.md:140
docs/mini-apps/reference/logic.md links to `/reference/state-storage#setstate`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/logic.md:198
docs/mini-apps/reference/state-storage.md links to `/reference/logic`, but `reference/logic` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/state-storage.md:29
docs/mini-apps/reference/widgets.md links to `/reference/http-api`, but `reference/http-api` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/widgets.md:9
docs/mini-apps/reference/widgets.md links to `/reference/state-storage#setstate`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/widgets.md:196
docs/mini-apps/reference/yandex-deploy.md links to `/reference/backend`, but `reference/backend` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/yandex-deploy.md:4
docs/mini-apps/reference/yandex-deploy.md names `spec.yaml`, but no file or folder `spec.yaml` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/yandex-deploy.md:174
docs/mini-apps/reference/yandex-deploy.md links to `/guide/publishing#разрешения-на-данные`, but `guide/publishing` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/mini-apps/reference/yandex-deploy.md:239
What to do
Reconcile the README with reality: README.md names `google-services.json`, but no file or folder `google-services.json` exists; docs/shorebird-releases.md names `release-manifest.json`, but no file or folder `release-manifest.json` exists; docs/mini-apps/guide/publishing.md links to `/reference/http-api`, but `reference/http-api` does not exist; docs/mini-apps/guide/publishing.md links to `/reference/backend`, but `reference/backend` does not exist; docs/mini-apps/guide/quickstart.md links to `/reference/state-storage`, but `reference/state-storage` does not exist.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
What to do
Keep implementation types off the public surface (Dart: a `_` name, or keep it under `lib/src/` unexported) — even for a small library, every public type is a stability contract.
Do you agree with this assessment?
P2 · Observability4.7 / 10Weak✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 2/9 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `ios`, `macos`, `packages/web_oauth_interceptor_client/example`, `packages/web_oauth_interceptor_client/example/ios` and 2 more.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Consider OpenTelemetry tracing/metrics (the opentelemetry package) and a health-check endpoint (a /health route on your shelf router) for operability.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 158129 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's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Add a SAST step to CI running what this repository's stack ships: the Dart analyzer's security lints plus `semgrep --config=auto` — so a security regression fails the build instead of landing.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Do you agree with this assessment?
P5 · DR & Backup0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
What to do
Codify backups + geo-recovery in IaC and document RTO/RPO and the restore procedure — a persistence guard alone is not disaster recovery.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.
Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. Exhaustive, deterministic.
Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.
Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.
What to do
Raise allocation-aware density on the hot paths — currently 70 use(s) across 204,043 production line(s) (~0.3/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
Dart: on hot paths, hold numbers in dart:typed_data lists (Int32List, Float64List …) instead of boxed List<int>/List<double>, read through views (sublistView, buffer.asInt32List, asByteData) instead of copying, make lists that never grow growable: false, compute in the SIMD types (Float32x4List …), and build bytes with BytesBuilder(copy: false).
Kotlin: on hot paths, use primitive arrays (IntArray, LongArray …) and @JvmInline value classes instead of boxed values, primitive collections (androidx.collection, fastutil) instead of boxed ones, and presize collections and StringBuilders.
Swift: on hot paths, reserveCapacity before appending, use ContiguousArray for class-element arrays, work in place with withUnsafeBufferPointer/withUnsafeTemporaryAllocation, and make large values ~Copyable with borrowing/consuming parameters.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety8.3 / 10Strong✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
What to do
Migrate the remaining .js/.jsx files to TypeScript.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
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 — 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's bar for an individually reported row — 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's 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 — a common library every sibling imports — 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. — supabase/functions/_shared/push_webhook.ts:40
supabase/functions/miniapp-svc-free-rooms/screens.ts:52 · supabase/functions/miniapp-svc-free-rooms/screens.ts:94 — the two spans are one implementation copied and then locally edited — 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's 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 — 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. — supabase/functions/miniapp-svc-free-rooms/screens.ts:52
supabase/functions/_shared/push_webhook.ts:40 · supabase/functions/miniapp-notify/index.ts:58 — the two spans are one implementation copied and then locally edited — 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's 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 — 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. — supabase/functions/_shared/push_webhook.ts:40
supabase/functions/miniapp-proxy/index.ts:404 · supabase/functions/sync-telegram-feed/media.ts:139 — the two spans are one implementation copied and then locally edited — 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's 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 — 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. — supabase/functions/miniapp-proxy/index.ts:404
supabase/functions/_shared/push_delivery_test.ts:108 · supabase/functions/_shared/push_delivery_test.ts:148 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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. — supabase/functions/_shared/push_delivery_test.ts:108
supabase/functions/_shared/push_webhook.ts:142 · supabase/functions/miniapp-notify/index.ts:200 — the two spans are one implementation copied and then locally edited — 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's 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 — 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. — supabase/functions/_shared/push_webhook.ts:142
supabase/functions/ingest/auth.ts:127 · supabase/functions/ingest/auth_test.ts:63 — 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. — supabase/functions/ingest/auth.ts:127
supabase/functions/miniapp-notify/index_test.ts:287 · supabase/functions/miniapp-notify/index_test.ts:435 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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. — supabase/functions/miniapp-notify/index_test.ts:287
supabase/functions/_shared/cns.ts:251 · supabase/functions/miniapp-proxy/index.ts:380 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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. — supabase/functions/_shared/cns.ts:251
supabase/functions/ingest/index.ts:161 · supabase/functions/sync-telegram-feed/index.ts:222 — 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. — supabase/functions/ingest/index.ts:161
supabase/functions/miniapp-deploy/index.ts:35 · supabase/functions/miniapp-proxy/index.ts:70 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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. — supabase/functions/miniapp-deploy/index.ts:35
supabase/functions/miniapp-notify/index_test.ts:134 · supabase/functions/miniapp-notify/index_test.ts:153 · supabase/functions/miniapp-notify/index_test.ts:313 · supabase/functions/miniapp-notify/index_test.ts:332 — all 4 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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. — supabase/functions/miniapp-notify/index_test.ts:134
supabase/functions/_shared/push_delivery.ts:84 · supabase/functions/miniapp-notify/index.ts:45 — the two spans are one implementation copied and then locally edited — 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's 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 — 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. — supabase/functions/_shared/push_delivery.ts:84
supabase/functions/miniapp-proxy/index.ts:189 · supabase/functions/miniapp-proxy/index.ts:235 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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. — supabase/functions/miniapp-proxy/index.ts:189
supabase/functions/miniapp-deploy/index.ts:83 · supabase/functions/miniapp-notify/index.ts:290 — 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. — supabase/functions/miniapp-deploy/index.ts:83
supabase/functions/miniapp-notify/index_test.ts:346 · supabase/functions/miniapp-notify/index_test.ts:416 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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. — supabase/functions/miniapp-notify/index_test.ts:346
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
(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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/miniapp-notify/index.ts:60
(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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/_shared/push_webhook.ts:42
(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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/miniapp-proxy/index.ts:50
(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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/ingest/community.ts:22
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/ingest/auth.ts:79
(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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/ingest/index.ts:131
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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/ingest/payload.ts:36
(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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/miniapp-deploy/index.ts:19
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/sync-telegram-feed/media.ts:54
(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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/moderate-content/index.ts:46
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/ingest/auth.ts:44
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/miniapp-proxy/index.ts:321
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/sync-telegram-feed/collect.ts:7
(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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/sync-telegram-feed/index.ts:209
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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/sync-telegram-feed/media.ts:121
(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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — tools/schedule_relay/upstream_proxy.mjs:8
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/sync-telegram-feed/index.ts:110
(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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — web/firebase-messaging-sw.js:1
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/_shared/request_body.ts:7
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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — supabase/functions/ingest/auth.ts:23
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files8.4 / 10Strong✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
supabase/functions/miniapp-notify/index_test.ts has 422 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — supabase/functions/miniapp-notify/index_test.ts:1
supabase/functions/miniapp-proxy/index.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — supabase/functions/miniapp-proxy/index.ts:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage2.4 / 10Critical✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
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 — if neither does, no test reaches this one. (×35) — supabase/functions/miniapp-notify/index_test.ts:1, supabase/functions/miniapp-proxy/index.ts:1, supabase/functions/_shared/push_delivery_test.ts:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code0.0 / 10Critical✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Unreachable from the 11 application, 1 tooling and 3 test entry point(s) detected in this repo. This repository declares no build, type-check or test script, so nothing here would fail on a wrong deletion — confirm by hand that nothing loads each file (including by a path built at runtime) before removing it. An undetected custom entry would make these reachable.
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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×15) — supabase/functions/miniapp-notify/index_test.ts, supabase/functions/_shared/push_delivery_test.ts, supabase/functions/ingest/auth_test.ts, …
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) — 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 — supabase/functions/ingest/test_assertions.ts
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) — 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 — supabase/functions/app-push/cns.ts
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document2.0 / 10Critical✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`render` is public, takes a document from its caller (line 5) and hands it to `_safeForeground`, which calls itself at line 15 (`_safeForeground`) with a piece of `node` (and at line 34, line 46) — and nowhere in `_safeForeground` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `_safeForeground` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/mini_apps/widgets/mini_app_content.dart:15
`onCall` is public, takes a document from its caller (line 23) and hands it to `_body`, which calls itself at line 115 (`_body`) with a piece of `value` (and at line 123) — and nowhere in `_body` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `_body` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart:115
`runMiniAppAction` is public and takes `Object ? action` from its caller, and it calls itself at line 68 (`runMiniAppAction`) with a piece of `action` (and at line 85) — and nowhere in `runMiniAppAction` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `runMiniAppAction` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/stac_bridge/lib/src/actions/action_execution.dart:68
`jsonEquals` is public and takes `Object ? a` from its caller, and it calls itself at line 9 (`jsonEquals`) with a piece of `a` (and at line 16) — and nowhere in `jsonEquals` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `jsonEquals` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/stac_bridge/lib/src/expression/json_equality.dart:9
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether functions that make a cancellable request accept or pass on an AbortSignal or a CancelToken (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen. Whether a `for … in` loop leaves the `List`, `Map` or `Set` it is walking alone — Dart's collection iterators check that the collection has not changed since the loop began, so a body that adds to or removes from the very collection the loop is walking (or the map whose `keys`, `values` or `entries` it walks) makes the next step throw `ConcurrentModificationError` and the remaining elements are never seen. Whether a `for (x in c)` or `c.forEach { … }` leaves the collection it is walking alone — a `mutableListOf`/`ArrayList`, `mutableMapOf`/`HashMap` or `mutableSetOf`/`HashSet` is a `java.util` collection on the JVM and is walked by its own fail-fast iterator, so a body that adds to or removes from the very collection the loop is walking makes the next step throw `ConcurrentModificationException` and the remaining elements are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`catch (e: Exception)` takes every exception and records none of it — 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. — android/app/src/main/kotlin/ninja/mirea/mireaapp/glance/ScheduleGlanceAppWidget.kt:355
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. — lib/app/widgets/local_notification_listener.dart:84
`on Exception` takes every exception and records none of it — 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. (×24) — lib/article/widgets/article_html.dart:34, lib/friends/cubit/friends_map_cubit.dart:532, lib/lost_and_found/utils/lost_found_contact_launcher.dart:41, …
`on Exception catch (_)` takes every exception and records none of it — 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. (×3) — lib/communities/view/community_detail_page.dart:30, lib/communities/view/all_communities_view.dart:58, lib/marketplace/view/marketplace_view.dart:102
`on Object` takes every exception and records none of it — 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. (×8) — lib/community/data/note_draft_store.dart:28, lib/community/data/note_draft_store.dart:135, lib/free_rooms/widgets/room_photo_gallery.dart:186, …
`on Object catch (_)` takes every exception and records none of it — 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. (×3) — lib/friends/services/friends_location_service.dart:270, lib/notifications/cubit/notifications_cubit.dart:208, lib/notifications/view/push_history_listener.dart:72
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether Dart's sound null safety is on and is not undermined by null assertions — a package whose `environment: sdk:` lower bound is 2.12 or above is null safe, so `String` cannot hold null and `String?` must be checked before use, and each postfix `!` is a run-time `Null check operator used on a null value` the author has told the analyzer cannot happen.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 11 of 55 WCAG 2.2 Level A/AA success criteria (20%; ≈22% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 44 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: this repository stores data through 'package:supabase_flutter' (lib/debug/debug_actions.dart:19) but declares no persisted model this check reads (Drift tables, ObjectBox/Floor @Entity, Isar @collection and Hive @HiveType classes, Serverpod table models). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'package:supabase_flutter' (lib/debug/debug_actions.dart:19) but declares no persisted model this check reads (Drift tables, ObjectBox/Floor @Entity, Isar @collection and Hive @HiveType classes, Serverpod table models). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'package:supabase_flutter' (lib/debug/debug_actions.dart:19) but declares no persisted model this check reads (Drift tables, ObjectBox/Floor @Entity, Isar @collection and Hive @HiveType classes, Serverpod table models). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
Not included — 46 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC2 Forms & labels — No form control/button found in the parsed markup — AC2 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Kotlin code is a Spring, JSR-330 or CDI singleton bean. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No Swift request handler (a Vapor, Hummingbird, Kitura, Swifter or Perfect route handler, as a method or a registered closure) is declared, so no state is shared between request threads. Dart isolates share no mutable memory, so no two requests write one object at the same instant. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — compose up failed (exit 14 — a file the compose project references is missing) — env file .env.social-media not found: stat .env.social-media: no such file or directory; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: this repository stores data through 'package:supabase_flutter' (lib/debug/debug_actions.dart:19) but declares no persisted model this check reads (Drift tables, Isar/ObjectBox/Floor/Hive entities, Serverpod table models). Personal data may be written through raw SQL or a hosted backend, so the absence of a personal-data field here is not evidence that none is stored, and encryption at rest is not scored over a subject that could not be established.
C2 Access Controls — Not assessed: this is a Flutter or Dart application whose data is served by a hosted backend ('package:supabase_flutter', lib/debug/debug_actions.dart:19). Its access control is that backend's configuration — Supabase row-level security, Firebase security rules, Appwrite permissions — and this repository carries none of it that this check reads (no Supabase migration, no server code). A client-side route guard hides a page; it authorizes nothing. Whether access is authorized by default could not be established, and its absence is not scored.
D11 Test Reliability — Test reliability not included — no .dart test runner
D12 Dependency Hygiene — Not scored — 7 Maven/Gradle manifest(s) were read, stating a version for 17 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.dart), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 5 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Aggregate boundaries — no aggregates detected — aggregate-boundary check not applicable
DM2 Strongly-typed ids — no in-repo typed-id idiom — primitive-obsession recorded as advisory DM8, DM2 not gated
DM3 Integration-event coupling — no integration events detected — coupling check not applicable
DM4 Rich vs anemic domain model — this Dart repository declares no domain-layer entity carrying stored data (every type is a typed-id wrapper, DTO/config, ORM row or presentation container), so DM4's rich-vs-anemic read has no population to be taken over
DM6 Domain ↔ infrastructure boundary — this Dart repository maps no type to a persistence framework (drift/floor/isar/objectbox/hive), so DM6's domain↔infrastructure fusion read has no population to be taken over
DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, which this analysis does not build from source alone for this language. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `flutter test --coverage` (or `dart test --coverage=coverage` then `dart run coverage:format_coverage --lcov`)) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for classes extending benchmark_harness's `BenchmarkBase`, `AsyncBenchmarkBase` or `PerfBenchmarkBase` (directly or through a base of your own), `benchmark(…)` calls under the pub `benchmark` package, Flutter's `benchmarkWidgets`, `watchPerformance` or `traceAction` in a test importing flutter_test, integration_test or flutter_driver, or benchmark_harness, benchmark or web_benchmarks in a pubspec.yaml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R8 Dependency Hygiene — Not measured — no package.json declares any dependency, so there is nothing to check imports against (imports may resolve through a host runtime rather than node).
S1 Web-Security Posture — No HTTP server of its own: 2570 Dart file(s) were read for weak hashes and ciphers, key material fixed in the source and disabled TLS certificate validation, and none was found. This repository serves no HTTP of its own — no server framework among its pubspec dependencies, no `HttpServer` bound and no shelf, dart_frog or serverpod import in its production source or `bin/`. Its Flutter web build (`web/index.html`) compiles to static files that run in the browser and are served by whatever hosts them: static files cannot enforce HTTPS, send HSTS or any other response header, set an HttpOnly cookie or validate a request, so those controls are the host's, not this code's. Where this repository commits the host's configuration (an nginx, Caddy or Apache config, a serving REDACTED, `_headers`, `vercel.json`, `netlify.toml`, `firebase.json`, `staticwebapp.config.json`) it is read for the security response headers it sets, and the shipped page is read for third-party scripts loaded without Subresource Integrity. Neither shows anything to report here. If this codebase starts serving HTTP, the dimension reactivates automatically.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
Dependency-rule violation: rtu_mirea_app (Application) → ads_ui (Web) — `rtu_mirea_app` is a Application project but references `ads_ui`, a Web project. The clean-architecture rule is that dependencies point INWARD — 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.
Dependency-rule violation: rtu_mirea_app (Application) → app_ui (Web) — `rtu_mirea_app` is a Application project but references `app_ui`, a Web project. The clean-architecture rule is that dependencies point INWARD — 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.
Dependency-rule violation: rtu_mirea_app (Application) → news_blocks_ui (Web) — `rtu_mirea_app` is a Application project but references `news_blocks_ui`, a Web project. The clean-architecture rule is that dependencies point INWARD — 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.
<html> without a lang web/index.html:1— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
Viewport restricts zoom web/index.html:18— 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.
MethodTooLong: AppTheme._buildTheme packages/app_ui/lib/src/theme/theme.dart:42— MethodTooLong — _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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _MapPlaceDetailsSheetState.build lib/map/widgets/map_place_details_sheet.dart:267— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ScheduleWeekView.build lib/schedule/view/schedule_page/schedule_week_view.dart:59— MethodTooLong — build runs 272 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 172 over it, 2.72× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: HomeDashboardContent.build lib/home/view/home_dashboard_content.dart:52— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _ScheduleBodyState.build lib/schedule/view/schedule_page/schedule_body.dart:162— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ScheduleDayView.build lib/schedule/view/schedule_page/schedule_day_view.dart:44— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _MapViewState._buildMap lib/map/view/map_view.dart:1173— MethodTooLong — _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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: NinjaLessonRow.build packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart:77— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _ScheduleShareSheetState.build lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart:298— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _LabelsPainter.paint lib/map/widgets/map_cartographic_layer.dart:371— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _FriendsListViewState._buildContent lib/friends/view/friends_page.dart:65— MethodTooLong — _buildContent runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _MapFloorAlignmentPageState.build lib/map/widgets/map_floor_alignment_page.dart:395— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _GroupSpaceViewState._content lib/people/view/group_space_view.dart:193— MethodTooLong — _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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _ServicesViewState.build lib/services/view/services_view.dart:109— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _MaterialUploadSheetState.build lib/knowledge_bank/widgets/material_upload_sheet.dart:172— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _KitImagePickerState.build packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart:220— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MapFreeRoomsPanel.build lib/map/widgets/map_free_rooms_panel.dart:93— MethodTooLong — build runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ScheduleChangePresentation.fromChange lib/schedule/widgets/schedule_change_presentation.dart:17— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _ComparePageState.build lib/schedule/view/compare/compare_page.dart:92— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: App.build lib/app/view/app.dart:56— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PollCard.build lib/polls/widgets/poll_card.dart:25— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _EditSchedulePageState.build lib/schedule/view/editor/edit_schedule_page.dart:28— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _VolumeLabelsPainter.paint lib/map/widgets/map_volume_layer.dart:477— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _NoteToolbarState._buildToolbar lib/community/widgets/collab_notes/editor/note_toolbar.dart:277— MethodTooLong — _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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _PollsViewState.build lib/polls/view/polls_view.dart:102— MethodTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Hotspot: lib/map/view/map_view.dart lib/map/view/map_view.dart:1173— lib/map/view/map_view.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in _MapViewState._buildMap at line 1173. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/map/view/map_view.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/schedule/view/schedule_page/schedule_day_view.dart lib/schedule/view/schedule_page/schedule_day_view.dart:44— 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 — 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 — a file this often edited pays the complexity back every time. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_day_view.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/home/view/home_dashboard_content.dart lib/home/view/home_dashboard_content.dart:52— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/home/view/home_dashboard_content.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:236— REDACTED 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 — 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 — a file this often edited pays the complexity back every time. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/map/widgets/svg_interactive_map.dart lib/map/widgets/svg_interactive_map.dart:391— lib/map/widgets/svg_interactive_map.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in _SvgInteractiveMapState._selectRoom at line 391. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/map/widgets/svg_interactive_map.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/schedule/view/schedule_page/schedule_body.dart lib/schedule/view/schedule_page/schedule_body.dart:162— 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 — 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 — a file this often edited pays the complexity back every time. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_body.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:254— REDACTED 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 — 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 — a file this often edited pays the complexity back every time. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/friends/view/friends_map_view.dart lib/friends/view/friends_map_view.dart:73— 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 — 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 — a file this often edited pays the complexity back every time. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/friends/view/friends_map_view.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/friends/widgets/ninja_geo_sharing_sheet.dart lib/friends/widgets/ninja_geo_sharing_sheet.dart:17— 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. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/friends/widgets/ninja_geo_sharing_sheet.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/schedule/view/schedule_page/schedule_week_view.dart lib/schedule/view/schedule_page/schedule_week_view.dart:59— lib/schedule/view/schedule_page/schedule_week_view.dart changed 5 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/schedule/view/schedule_page/schedule_week_view.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/map/widgets/map_place_details_sheet.dart lib/map/widgets/map_place_details_sheet.dart:267— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/map/widgets/map_place_details_sheet.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart:77— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/map/bloc/map_bloc.dart lib/map/bloc/map_bloc.dart:62— lib/map/bloc/map_bloc.dart changed 5 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/map/bloc/map_bloc.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/map/widgets/map_cartographic_layer.dart lib/map/widgets/map_cartographic_layer.dart:371— lib/map/widgets/map_cartographic_layer.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in _LabelsPainter.paint at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/map/widgets/map_cartographic_layer.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/polls/widgets/poll_card.dart lib/polls/widgets/poll_card.dart:25— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/polls/widgets/poll_card.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/schedule/bloc/schedule_bloc.dart lib/schedule/bloc/schedule_bloc.dart:130— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/schedule/bloc/schedule_bloc.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/map/data/map_data_repository.dart lib/map/data/map_data_repository.dart:355— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/map/data/map_data_repository.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/services/view/services_view.dart lib/services/view/services_view.dart:109— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/services/view/services_view.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
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:197— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: supabase/functions/miniapp-notify/index.ts supabase/functions/miniapp-notify/index.ts:57— 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 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- supabase/functions/miniapp-notify/index.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: packages/campus_repository/lib/src/campus_repository.dart packages/campus_repository/lib/src/campus_repository.dart:825— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- packages/campus_repository/lib/src/campus_repository.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/knowledge_bank/widgets/material_row.dart lib/knowledge_bank/widgets/material_row.dart:31— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/knowledge_bank/widgets/material_row.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart:26— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/map/widgets/map_free_rooms_panel.dart lib/map/widgets/map_free_rooms_panel.dart:93— lib/map/widgets/map_free_rooms_panel.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in MapFreeRoomsPanel.build at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/map/widgets/map_free_rooms_panel.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: lib/friends/cubit/friends_map_cubit.dart lib/friends/cubit/friends_map_cubit.dart:579— 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-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- lib/friends/cubit/friends_map_cubit.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Swallowed exception (caught, then discarded) android/app/src/main/kotlin/ninja/mirea/mireaapp/glance/ScheduleGlanceAppWidget.kt:355— `catch (e: Exception)` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/article/widgets/article_html.dart:34— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/communities/view/community_detail_page.dart:30— `on Exception catch (_)` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/communities/view/all_communities_view.dart:58— `on Exception catch (_)` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/community/data/note_draft_store.dart:28— `on Object` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/community/data/note_draft_store.dart:135— `on Object` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/free_rooms/widgets/room_photo_gallery.dart:186— `on Object` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/free_rooms/widgets/room_photo_gallery.dart:211— `on Object` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/friends/cubit/friends_map_cubit.dart:532— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/friends/services/friends_location_service.dart:270— `on Object catch (_)` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/knowledge_bank/utils/image_preview.dart:27— `on Object` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/lost_and_found/utils/lost_found_contact_launcher.dart:41— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/map_data_repository.dart:235— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/map_data_repository.dart:478— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/map_data_repository.dart:492— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/map_data_repository.dart:626— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/map_data_repository.dart:665— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/map_data_repository.dart:1105— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/file_map_data_cache.dart:58— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/map/data/file_map_data_cache.dart:82— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/marketplace/utils/marketplace_media_intake.dart:74— `on Object` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/marketplace/view/marketplace_view.dart:102— `on Exception catch (_)` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/mini_apps/view/mini_app_submit_view.dart:173— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/mini_apps/view/mini_app_runner_view.dart:280— `on Exception` takes every exception and records none of it — 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.
Swallowed exception (caught, then discarded) lib/mini_apps/view/mini_app_runner_view.dart:306— `on Exception` takes every exception and records none of it — 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.
+ 14 more in this group — see findings.md.
R4 · Test Coverage· No test reaches this file · ×35
No test reaches this file supabase/functions/miniapp-notify/index_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/miniapp-proxy/index.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/_shared/push_delivery_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/miniapp-notify/index.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/ingest/auth_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/sync-telegram-feed/telegram.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/_shared/cns.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/sync-telegram-feed/index.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/_shared/push_webhook.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/miniapp-notify/cns_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/sync-telegram-feed/media_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/miniapp-svc-free-rooms/screens.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/moderate-content/index.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/moderate-content/classifier.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/sync-telegram-feed/media.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/sync-telegram-feed/blocks.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/miniapp-deploy/index.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/_shared/push_delivery.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/ingest/sync_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/miniapp-svc-free-rooms/index.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/ingest/community_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/ingest/story_media_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/_shared/request_body_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/miniapp-svc-free-rooms/screens_test.ts:1— 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 — if neither does, no test reaches this one.
No test reaches this file supabase/functions/sync-telegram-feed/blocks_test.ts:1— 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 — if neither does, no test reaches this one.
Low cohesion: AppScopeContainer (LCOM4 22) lib/di/app_scope.dart:69— AppScopeContainer's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: CustomLessonEditorCubit (LCOM4 10) lib/schedule/cubit/custom_lesson_editor/custom_lesson_editor_cubit.dart:13— CustomLessonEditorCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: ProfileExtrasCubit (LCOM4 9) lib/profile/cubit/profile_extras_cubit.dart:4— ProfileExtrasCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: SchedulePreferencesCubit (LCOM4 9) lib/schedule/cubit/schedule_preferences/schedule_preferences_cubit.dart:12— SchedulePreferencesCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: CustomScheduleCubit (LCOM4 8) lib/schedule/cubit/custom_schedule/custom_schedule_cubit.dart:18— CustomScheduleCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: LessonCommentsCubit (LCOM4 8) lib/schedule/cubit/lesson_comments/lesson_comments_cubit.dart:14— LessonCommentsCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: FullScreenAdsBloc (LCOM4 5) lib/ads/bloc/full_screen_ads_bloc.dart:30— FullScreenAdsBloc's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: ArticleBloc (LCOM4 5) lib/article/bloc/article_bloc.dart:19— ArticleBloc's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _CollabNoteEditorViewState (LCOM4 5) lib/community/view/collab_note_editor_view.dart:37— _CollabNoteEditorViewState's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: NfcPassCubit (LCOM4 5) lib/nfc_pass/bloc/nfc_pass_cubit.dart:16— NfcPassCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: PromoDismissalsCubit (LCOM4 5) lib/promo/cubit/promo_dismissals_cubit.dart:8— PromoDismissalsCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _ScheduleShareSheetState (LCOM4 5) lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart:98— _ScheduleShareSheetState's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: ScheduleCubit (LCOM4 5) wear/lib/schedule/cubit/schedule_cubit.dart:15— ScheduleCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _AppPopoverRoute (LCOM4 5) packages/app_ui/lib/src/widgets/app_popover.dart:112— _AppPopoverRoute's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _KitImagePickerState (LCOM4 5) packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart:21— _KitImagePickerState's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: AccountPersonaFormCubit (LCOM4 5) lib/teacher_account/bloc/account_persona_form_cubit.dart:14— AccountPersonaFormCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _AppScheduleRefreshState (LCOM4 4) lib/app/view/app_schedule_refresh.dart:17— _AppScheduleRefreshState's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: AttendanceState (LCOM4 4) lib/attendance/cubit/attendance_state.dart:7— AttendanceState's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: FreeRoomViewModel (LCOM4 4) lib/free_rooms/widgets/free_room_view_model.dart:7— FreeRoomViewModel's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: PasswordResetBloc (LCOM4 4) lib/login/bloc/password_reset_bloc.dart:16— PasswordResetBloc's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _MapViewState (LCOM4 4) lib/map/view/map_view.dart:53— _MapViewState's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _RunnerHost (LCOM4 4) lib/mini_apps/view/mini_app_runner_view.dart:216— _RunnerHost's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: NotificationsCubit (LCOM4 4) lib/notifications/cubit/notifications_cubit.dart:8— NotificationsCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: _PushHistoryListenerState (LCOM4 4) lib/notifications/view/push_history_listener.dart:32— _PushHistoryListenerState's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
Low cohesion: StartupScreenCubit (LCOM4 4) lib/profile/cubit/startup_screen_cubit.dart:3— StartupScreenCubit's 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 — your repository's 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 — and which would otherwise dominate this list — 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.
FileTooLong: widgets/map_graph_editor_page.dart lib/map/widgets/map_graph_editor_page.dart— FileTooLong — 1158 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 658 over it, 2.32× 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.
FileTooLong: view/map_view.dart lib/map/view/map_view.dart— FileTooLong — 1132 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: _MapViewState (53-1455). The bar is 500 significant lines; this is 632 over it, 2.26× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: scripts/build_showcase_seed.mjs scripts/build_showcase_seed.mjs— FileTooLong — 1052 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 552 over it, 2.10× 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.
FileTooLong: src/campus_repository.dart packages/campus_repository/lib/src/campus_repository.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: data/map_data_repository.dart lib/map/data/map_data_repository.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: buttons/app_button.dart packages/app_ui/lib/src/widgets/buttons/app_button.dart— FileTooLong — 725 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 225 over it, 1.45× 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.
FileTooLong: note_editor/note_editor_cubit.dart lib/community/cubit/note_editor/note_editor_cubit.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: widgets/svg_interactive_map.dart lib/map/widgets/svg_interactive_map.dart— FileTooLong — 701 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: _SvgInteractiveMapState (71-849). The bar is 500 significant lines; this is 201 over it, 1.40× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: story_viewer/story_viewer_page.dart lib/feed/view/story_viewer/story_viewer_page.dart— FileTooLong — 650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 150 over it, 1.30× 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.
FileTooLong: cubit/friends_map_cubit.dart lib/friends/cubit/friends_map_cubit.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: routes/routes.dart lib/navigation/routes/routes.dart— FileTooLong — 620 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 120 over it, 1.24× 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.
FileTooLong: bloc/schedule_bloc.dart lib/schedule/bloc/schedule_bloc.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: bloc/map_bloc.dart lib/map/bloc/map_bloc.dart— FileTooLong — 579 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: MapBloc (19-707). The bar is 500 significant lines; this is 79 over it, 1.16× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: telegram/client.py tools/social_media_fetcher/src/clients/telegram/client.py— FileTooLong — 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 over it, 1.14× 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.
FileTooLong: REDACTED REDACTED— FileTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12× 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.
FileTooLong: widgets/map_place_details_sheet.dart lib/map/widgets/map_place_details_sheet.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/mini_apps_repository.dart packages/mini_apps_repository/lib/src/mini_apps_repository.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: widgets/map_volume_layer.dart lib/map/widgets/map_volume_layer.dart— FileTooLong — 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10× 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.
FileTooLong: sheets/schedule_share_sheet.dart lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: widgets/map_floor_alignment_page.dart lib/map/widgets/map_floor_alignment_page.dart— FileTooLong — 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× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
ClassTooLong: _MapViewState lib/map/view/map_view.dart:53— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: CampusRepository packages/campus_repository/lib/src/campus_repository.dart:18— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: MapDataRepository lib/map/data/map_data_repository.dart:69— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: NoteEditorCubit lib/community/cubit/note_editor/note_editor_cubit.dart:20— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _SvgInteractiveMapState lib/map/widgets/svg_interactive_map.dart:71— ClassTooLong — 638 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 238 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: FriendsMapCubit lib/friends/cubit/friends_map_cubit.dart:21— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ScheduleBloc lib/schedule/bloc/schedule_bloc.dart:26— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: MapBloc lib/map/bloc/map_bloc.dart:19— ClassTooLong — 565 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 165 over it, 1.41× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: MiniAppsRepository packages/mini_apps_repository/lib/src/mini_apps_repository.dart:11— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _MapPlaceDetailsSheetState lib/map/widgets/map_place_details_sheet.dart:44— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: UniversityConfig lib/config/university_config.dart:6— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _GroupSpaceViewState lib/people/view/group_space_view.dart:31— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _CollabNoteEditorViewState lib/community/view/collab_note_editor_view.dart:37— ClassTooLong — 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× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ScheduleWeekView lib/schedule/view/schedule_page/schedule_week_view.dart:27— ClassTooLong — 417 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 17 over it, 1.04× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (7 lines × 2) lib/communities/widgets/community_catalog_skeleton.dart:16— lib/communities/widgets/community_catalog_skeleton.dart:16-22 | lib/mini_apps/view/mini_app_runner_skeleton.dart:47-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) lib/free_rooms/widgets/room_photo_gallery.dart:205— lib/free_rooms/widgets/room_photo_gallery.dart:205-211 | lib/marketplace/utils/marketplace_media_intake.dart:68-74 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) lib/friends/widgets/friends_map_attribution.dart:18— lib/friends/widgets/friends_map_attribution.dart:18-24 | lib/friends/widgets/friends_map_controls.dart:23-29 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) lib/login/view/login_page_form.dart:29— lib/login/view/login_page_form.dart:29-35 | lib/login/view/sign_up_page.dart:84-91 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) lib/profile/widgets/edit_identity_sheet.dart:117— lib/profile/widgets/edit_identity_sheet.dart:117-123 | lib/profile/widgets/edit_profile_sheet.dart:133-139 — before extracting anything, compare `lib/profile/widgets/edit_identity_sheet.dart` and `lib/profile/widgets/edit_profile_sheet.dart` 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 — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) wear/lib/schedule/cubit/schedule_cubit.dart:72— wear/lib/schedule/cubit/schedule_cubit.dart:72-78 | wear/lib/schedule/cubit/schedule_cubit.dart:123-129 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) lib/mini_apps/view/mini_app_runner_page.dart:69— lib/mini_apps/view/mini_app_runner_page.dart:69-75 | lib/mini_apps/view/mini_app_runner_view.dart:74-80 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) packages/campus_repository/lib/src/supabase_collab_note_presence_session.dart:51— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) packages/stac_bridge/lib/src/widgets/kit/kit_bool_control_view.dart:29— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) lib/community/view/deadlines/add_deadline_sheet.dart:399— lib/community/view/deadlines/add_deadline_sheet.dart:399-405 | lib/schedule_management/widgets/updated_chip.dart:8-14 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) lib/mini_apps/widgets/mini_app_secret_sheet.dart:94— lib/mini_apps/widgets/mini_app_secret_sheet.dart:94-100 | lib/mini_apps/widgets/mini_app_tokens_sheet.dart:89-95 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) lib/schedule/view/schedule_page/schedule_clock_ticker.dart:24— lib/schedule/view/schedule_page/schedule_clock_ticker.dart:24-30 | lib/teacher_account/widgets/dashboard/teacher_dashboard_lifecycle.dart:21-27 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) REDACTED:298— REDACTED:298-304 | REDACTED:624-630 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) ios/HomeWidget/ScheduleWidget.swift:246— ios/HomeWidget/ScheduleWidget.swift:246-252 | ios/HomeWidget/ScheduleWidget.swift:260-266 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `ios/HomeWidget/ScheduleWidget.swift:246` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) lib/attendance/widgets/attendance_skeleton.dart:33— lib/attendance/widgets/attendance_skeleton.dart:33-42 | lib/grades/widgets/grades_skeleton.dart:19-28 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) lib/community/widgets/collab_notes/collab_note_card.dart:96— lib/community/widgets/collab_notes/collab_note_card.dart:96-105 | lib/community/widgets/collab_notes/note_save_status.dart:64-73 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) lib/friends/cubit/friends_map_cubit.dart:769— lib/friends/cubit/friends_map_cubit.dart:769-778 | lib/people/cubit/people_cubit.dart:143-152 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) lib/friends/widgets/ninja_geo_sharing_toggle_row.dart:34— lib/friends/widgets/ninja_geo_sharing_toggle_row.dart:34-47 | lib/people/widgets/people/study_group_action_card.dart:30-39 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) lib/profile/widgets/ninja_path/leaderboard_list.dart:10— lib/profile/widgets/ninja_path/leaderboard_list.dart:10-19 | lib/profile/widgets/ninja_path/ninja_path_skeleton.dart:149-158 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) lib/schedule/view/schedule_page/schedule_month_view.dart:162— lib/schedule/view/schedule_page/schedule_month_view.dart:162-171 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:132-141 — before extracting anything, compare `lib/schedule/view/schedule_page/schedule_month_view.dart` and `packages/app_ui/lib/src/widgets/app_calendar_month.dart` 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.
Duplicated block (10 lines × 2) lib/schedule/view/schedule_page/schedule_month_view.dart:376— lib/schedule/view/schedule_page/schedule_month_view.dart:376-386 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:236-245 — before extracting anything, compare `lib/schedule/view/schedule_page/schedule_month_view.dart` and `packages/app_ui/lib/src/widgets/app_calendar_month.dart` 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.
Duplicated block (10 lines × 2) packages/app_ui/lib/src/theme/theme.dart:192— packages/app_ui/lib/src/theme/theme.dart:192-201 | packages/app_ui/lib/src/theme/theme.dart:218-227 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) packages/campus_repository/lib/src/campus_repository.dart:369— packages/campus_repository/lib/src/campus_repository.dart:369-378 | packages/campus_repository/lib/src/campus_repository.dart:1260-1269 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) packages/study_groups_repository/lib/src/study_groups_repository.dart:115— packages/study_groups_repository/lib/src/study_groups_repository.dart:115-124 | packages/study_groups_repository/lib/src/study_groups_repository.dart:153-162 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:171— lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:171-180 | lib/knowledge_bank/widgets/material_upload_sheet.dart:161-170 — before extracting anything, compare `lib/knowledge_bank/widgets/material_batch_upload_sheet.dart` and `lib/knowledge_bank/widgets/material_upload_sheet.dart` 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 — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) packages/app_ui/lib/src/widgets/app_badge.dart:131— packages/app_ui/lib/src/widgets/app_badge.dart:131-140 | packages/app_ui/lib/src/widgets/app_tag.dart:76-85 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) macos/Runner/MainFlutterWindow.swift:5— macos/Runner/MainFlutterWindow.swift:5-14 | packages/web_oauth_interceptor_client/example/macos/Runner/MainFlutterWindow.swift:5-14 — before extracting anything, compare `macos/Runner/MainFlutterWindow.swift` and `packages/web_oauth_interceptor_client/example/macos/Runner/MainFlutterWindow.swift` as WHOLE FILES: 100% of the shorter file's 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 — 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.
Duplicated block (14 lines × 2) lib/communities/widgets/community_catalog_skeleton.dart:45— lib/communities/widgets/community_catalog_skeleton.dart:45-58 | lib/communities/widgets/community_catalog_skeleton.dart:92-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) lib/community/widgets/events/event_card.dart:62— lib/community/widgets/events/event_card.dart:62-75 | lib/community/widgets/events/event_detail_sheet.dart:67-80 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) lib/marketplace/widgets/listing_media.dart:47— lib/marketplace/widgets/listing_media.dart:47-60 | lib/marketplace/widgets/market_media_thumbnail.dart:46-59 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) lib/navigation/routes/routes.dart:850— lib/navigation/routes/routes.dart:850-863 | lib/navigation/routes/routes.dart:874-887 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) lib/people/widgets/people/people_map_banner.dart:18— lib/people/widgets/people/people_map_banner.dart:18-31 | lib/people/widgets/people/study_group_action_card.dart:23-36 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) lib/schedule_management/view/edit_body.dart:11— lib/schedule_management/view/edit_body.dart:11-24 | lib/schedule_management/view/hub_body.dart:28-41 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) packages/app_ui/lib/src/widgets/app_empty_state.dart:58— packages/app_ui/lib/src/widgets/app_empty_state.dart:58-71 | packages/app_ui/lib/src/widgets/app_error_state.dart:64-77 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart:54— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) packages/study_groups_repository/lib/src/study_groups_repository.dart:32— packages/study_groups_repository/lib/src/study_groups_repository.dart:32-45 | packages/study_groups_repository/lib/src/study_groups_repository.dart:55-68 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) wear/lib/schedule/view/schedule_loading_view.dart:63— wear/lib/schedule/view/schedule_loading_view.dart:63-76 | wear/lib/schedule/view/schedule_not_paired_view.dart:14-27 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) lib/onboarding/widgets/onboarding_identity_step.dart:285— lib/onboarding/widgets/onboarding_identity_step.dart:285-298 | lib/profile/widgets/edit_profile_sheet.dart:277-290 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) wear/android/app/src/main/kotlin/com/example/verygoodcore/MainActivity.kt:15— 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 — before extracting anything, compare `wear/android/app/src/main/kotlin/com/example/verygoodcore/MainActivity.kt` and `wear/android/app/src/main/kotlin/ninja/mirea/mireaapp/MainActivity.kt` as WHOLE FILES: 95% of the shorter file's 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 — 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.
Off the main sequence: connectivity_client — connectivity_client: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: deep_link_client — deep_link_client: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: package_info_client — package_info_client: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: permission_client — permission_client: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: share_launcher — share_launcher: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: web_oauth_interceptor_client — web_oauth_interceptor_client: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: app_ui — app_ui: abstractness 0.06, instability 0.00, distance 0.94 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
Off the main sequence: nfc_pass_client — nfc_pass_client: abstractness 0.18, instability 0.00, distance 0.82 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: analytics_repository — analytics_repository: abstractness 0.20, instability 0.00, distance 0.80 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: preferences_repository — preferences_repository: abstractness 0.20, instability 0.00, distance 0.80 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: auth_client — auth_client: abstractness 0.23, instability 0.00, distance 0.77 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: github — github: abstractness 0.25, instability 0.00, distance 0.75 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
TooManyMethods: CampusRepository packages/campus_repository/lib/src/campus_repository.dart:18— TooManyMethods — 87 methods. The bar is 30 methods; this is 57 over it, 2.90× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: AppColors packages/app_ui/lib/src/colors/colors.dart:5— TooManyMethods — 54 methods. The bar is 30 methods; this is 24 over it, 1.80× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: MapDataRepository lib/map/data/map_data_repository.dart:69— TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: MiniAppsRepository packages/mini_apps_repository/lib/src/mini_apps_repository.dart:11— TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: NoteEditorCubit lib/community/cubit/note_editor/note_editor_cubit.dart:20— TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: _MapViewState lib/map/view/map_view.dart:53— TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: FriendsMapCubit lib/friends/cubit/friends_map_cubit.dart:21— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ScheduleRepository packages/schedule_repository/lib/src/schedule_repository.dart:21— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ScheduleBloc lib/schedule/bloc/schedule_bloc.dart:26— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: FriendsRepository packages/friends_repository/lib/src/friends_repository.dart:6— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (15 lines × 2) lib/community/widgets/mentorship/mentor_profile_sheet.dart:273— lib/community/widgets/mentorship/mentor_profile_sheet.dart:273-287 | lib/community/widgets/mentorship/mentor_request_sheet.dart:136-150 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 2) lib/design_preview/pages/preview_home_page.dart:95— lib/design_preview/pages/preview_home_page.dart:95-109 | lib/design_preview/pages/preview_schedule_page.dart:48-62 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 2) lib/map/bloc/map_bloc.dart:195— lib/map/bloc/map_bloc.dart:195-209 | lib/map/bloc/map_bloc.dart:350-364 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) lib/profile/widgets/ninja_path/ninja_path_skeleton.dart:41— lib/profile/widgets/ninja_path/ninja_path_skeleton.dart:41-55 | lib/profile/widgets/ninja_path/ninja_path_skeleton.dart:95-109 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) lib/schedule_management/view/edit_row.dart:25— lib/schedule_management/view/edit_row.dart:25-39 | lib/schedule_management/widgets/schedule_hub_row.dart:39-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) lib/search/view/trending_row.dart:21— lib/search/view/trending_row.dart:21-35 | lib/search/widgets/search_result_item.dart:38-52 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) packages/community_catalog_repository/lib/src/client/community_catalog_client.dart:10— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) packages/lost_and_found_repository/lib/src/lost_found_repository.dart:318— 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 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) REDACTED:74— REDACTED:74-88 | REDACTED:60-75 — 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 — a file they already depend on, or a new one alongside them — 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 `REDACTED:74` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) lib/knowledge_bank/view/knowledge_bank_list.dart:132— lib/knowledge_bank/view/knowledge_bank_list.dart:132-139 | lib/knowledge_bank/view/knowledge_bank_list.dart:177-184 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) lib/login/view/login_page_form.dart:54— lib/login/view/login_page_form.dart:54-61 | lib/login/view/sign_up_page.dart:110-117 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) lib/map/widgets/map_cartographic_layer.dart:277— lib/map/widgets/map_cartographic_layer.dart:277-284 | lib/map/widgets/map_volume_layer.dart:309-316 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) lib/teacher_account/widgets/dashboard/teacher_rating_card.dart:18— lib/teacher_account/widgets/dashboard/teacher_rating_card.dart:18-25 | lib/teacher_account/widgets/dashboard/teacher_rating_shortcut.dart:18-25 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) packages/app_ui/lib/src/widgets/forms/app_search_bar.dart:133— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) packages/stac_bridge/lib/src/actions/stac_fetch_action_parser.dart:72— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) packages/stac_bridge/lib/src/widgets/kit/kit_bool_control_view.dart:49— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) lib/ads/bloc/ads_bloc.dart:17— lib/ads/bloc/ads_bloc.dart:17-24 | lib/home/cubit/home_cubit.dart:25-32 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) REDACTED:88— REDACTED:88-95 | tool/google_play_screenshots.py:86-93 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) lib/community/cubit/deadlines/deadlines_cubit.dart:38— lib/community/cubit/deadlines/deadlines_cubit.dart:38-46 | lib/community/cubit/events/events_cubit.dart:32-40 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) lib/community/widgets/events/events_skeleton.dart:9— lib/community/widgets/events/events_skeleton.dart:9-17 | lib/polls/view/polls_skeleton.dart:8-16 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) lib/knowledge_bank/view/knowledge_bank_view.dart:221— lib/knowledge_bank/view/knowledge_bank_view.dart:221-229 | lib/knowledge_bank/view/knowledge_bank_view.dart:246-254 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) lib/mini_apps/widgets/mini_app_tokens_skeleton.dart:15— lib/mini_apps/widgets/mini_app_tokens_skeleton.dart:15-23 | lib/mini_apps/widgets/revisions_skeleton.dart:16-24 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) packages/app_ui/lib/src/colors/colors.dart:274— packages/app_ui/lib/src/colors/colors.dart:274-282 | packages/app_ui/lib/src/ninja/ninja_colors.dart:237-245 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) packages/community_repository/lib/src/community_failure.dart:116— packages/community_repository/lib/src/community_failure.dart:116-124 | packages/community_repository/lib/src/community_failure.dart:139-147 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) lib/login/view/login_page.dart:18— lib/login/view/login_page.dart:18-26 | lib/login/view/sign_up_page.dart:15-23 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) lib/profile/cubit/profile_extras_cubit.dart:36— lib/profile/cubit/profile_extras_cubit.dart:36-44 | lib/profile/cubit/ui_preferences_cubit.dart:43-51 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) lib/feed/widgets/feed_hero_post.dart:83— lib/feed/widgets/feed_hero_post.dart:83-93 | lib/feed/widgets/feed_post_row.dart:54-64 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) lib/friends/view/corner.dart:20— lib/friends/view/corner.dart:20-30 | lib/friends/view/corner.dart:31-41 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:334— lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:334-344 | lib/knowledge_bank/widgets/material_upload_sheet.dart:256-266 — before extracting anything, compare `lib/knowledge_bank/widgets/material_batch_upload_sheet.dart` and `lib/knowledge_bank/widgets/material_upload_sheet.dart` 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 — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) lib/map/bloc/map_bloc.dart:284— lib/map/bloc/map_bloc.dart:284-294 | lib/map/bloc/map_bloc.dart:467-477 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) lib/mini_apps/view/stats_content.dart:19— lib/mini_apps/view/stats_content.dart:19-29 | lib/people/view/group_space_view.dart:136-146 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) packages/news_blocks_ui/lib/src/text_lead_paragraph.dart:15— packages/news_blocks_ui/lib/src/text_lead_paragraph.dart:15-25 | packages/news_blocks_ui/lib/src/text_paragraph.dart:15-25 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) lib/profile/view/notifications_settings_page.dart:14— lib/profile/view/notifications_settings_page.dart:14-24 | lib/profile/view/profile_settings_page.dart:81-91 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) lib/community/cubit/collab_notes/collab_notes_cubit.dart:88— lib/community/cubit/collab_notes/collab_notes_cubit.dart:88-93 | lib/community/cubit/collab_notes/collab_notes_cubit.dart:109-114 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) packages/campus_repository/lib/src/campus_repository.dart:239— packages/campus_repository/lib/src/campus_repository.dart:239-244 | packages/schedule_repository/lib/src/data/user_activities_data_source.dart:53-58 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) packages/stac_bridge/lib/src/widgets/kit/stac_app_checkbox_parser.dart:16— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) packages/stac_bridge/lib/src/widgets/material/stac_check_box_kit_parser.dart:15— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) lib/lost_and_found/config/lost_found_categories.dart:13— lib/lost_and_found/config/lost_found_categories.dart:13-18 | lib/marketplace/config/marketplace_category.dart:31-36 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) REDACTED:332— REDACTED:332-337 | REDACTED:464-469 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) lib/mini_apps/widgets/mini_app_secret_sheet.dart:146— lib/mini_apps/widgets/mini_app_secret_sheet.dart:146-158 | lib/mini_apps/widgets/mini_app_tokens_sheet.dart:140-152 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13 lines × 2) lib/people/widgets/group_space/ninja_group_announcement_card.dart:24— lib/people/widgets/group_space/ninja_group_announcement_card.dart:24-36 | lib/people/widgets/group_space/ninja_group_space_hero.dart:42-54 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13 lines × 2) packages/app_ui/lib/src/widgets/app_list_row.dart:97— packages/app_ui/lib/src/widgets/app_list_row.dart:97-109 | packages/app_ui/lib/src/widgets/app_list_row.dart:276-288 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) packages/app_ui/lib/src/widgets/app_spinner.dart:32— packages/app_ui/lib/src/widgets/app_spinner.dart:32-44 | packages/app_ui/lib/src/widgets/buttons/app_button.dart:511-523 — before extracting anything, compare `packages/app_ui/lib/src/widgets/app_spinner.dart` and `packages/app_ui/lib/src/widgets/buttons/app_button.dart` 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.
Duplicated block (13 lines × 2) packages/lost_and_found_repository/lib/src/lost_found_repository.dart:400— 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 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:358— lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:358-369 | lib/knowledge_bank/widgets/material_upload_sheet.dart:290-301 — before extracting anything, compare `lib/knowledge_bank/widgets/material_batch_upload_sheet.dart` and `lib/knowledge_bank/widgets/material_upload_sheet.dart` 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 — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:376— lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:376-387 | lib/knowledge_bank/widgets/material_upload_sheet.dart:348-359 — before extracting anything, compare `lib/knowledge_bank/widgets/material_batch_upload_sheet.dart` and `lib/knowledge_bank/widgets/material_upload_sheet.dart` 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 — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) lib/teacher_account/widgets/dashboard/teacher_dashboard_rating_section.dart:42— lib/teacher_account/widgets/dashboard/teacher_dashboard_rating_section.dart:42-53 | lib/teacher_account/widgets/dashboard/teacher_schedule_status.dart:34-45 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) packages/app_ui/lib/src/ninja/surfaces/ninja_list_cell.dart:136— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) packages/app_ui/lib/src/widgets/app_spinner.dart:86— packages/app_ui/lib/src/widgets/app_spinner.dart:86-97 | packages/app_ui/lib/src/widgets/buttons/app_button.dart:563-574 — before extracting anything, compare `packages/app_ui/lib/src/widgets/app_spinner.dart` and `packages/app_ui/lib/src/widgets/buttons/app_button.dart` 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.
Duplicated block (19 lines × 2) lib/search/view/search_empty_state.dart:51— lib/search/view/search_empty_state.dart:51-69 | lib/search/view/search_results.dart:219-237 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (19 lines × 2) lib/watch/bloc/watch_connectivity_cubit.dart:82— lib/watch/bloc/watch_connectivity_cubit.dart:82-100 | lib/watch/bloc/watch_connectivity_cubit.dart:135-153 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart:47— packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart:47-65 | packages/app_ui/lib/src/ninja/widgets/app_radio.dart:41-59 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (19 lines × 2) packages/app_ui/lib/src/widgets/gamification/app_settings_row.dart:61— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (16 lines × 2) lib/people/view/people_page.dart:165— lib/people/view/people_page.dart:165-180 | lib/study_group/view/study_group_view.dart:38-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) lib/schedule/cubit/schedule_changes/schedule_changes_cubit.dart:41— lib/schedule/cubit/schedule_changes/schedule_changes_cubit.dart:41-56 | lib/schedule/cubit/user_activities/user_activities_cubit.dart:23-38 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) lib/study_group/view/ninja_study_group_member_row.dart:77— lib/study_group/view/ninja_study_group_member_row.dart:77-92 | lib/study_group/view/ninja_study_group_request_card.dart:41-56 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (16 lines × 2) packages/app_ui/lib/src/colors/colors.dart:248— packages/app_ui/lib/src/colors/colors.dart:248-263 | packages/app_ui/lib/src/ninja/ninja_colors.dart:198-213 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) lib/marketplace/widgets/listing_media.dart:75— lib/marketplace/widgets/listing_media.dart:75-79 | lib/marketplace/widgets/market_media_thumbnail.dart:131-135 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) lib/people/cubit/people_cubit.dart:235— lib/people/cubit/people_cubit.dart:235-239 | lib/profile/cubit/profile_cubit.dart:290-294 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) lib/schedule/widgets/custom_lesson_editor/lesson_editor_section_label.dart:9— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) packages/stac_bridge/lib/src/widgets/kit/stac_app_chip_row_parser.dart:70— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×4
Recursive walk over a caller-supplied document has no depth cap lib/mini_apps/widgets/mini_app_content.dart:15— `render` is public, takes a document from its caller (line 5) and hands it to `_safeForeground`, which calls itself at line 15 (`_safeForeground`) with a piece of `node` (and at line 34, line 46) — and nowhere in `_safeForeground` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `_safeForeground` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart:115— `onCall` is public, takes a document from its caller (line 23) and hands it to `_body`, which calls itself at line 115 (`_body`) with a piece of `value` (and at line 123) — and nowhere in `_body` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `_body` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap packages/stac_bridge/lib/src/actions/action_execution.dart:68— `runMiniAppAction` is public and takes `Object ? action` from its caller, and it calls itself at line 68 (`runMiniAppAction`) with a piece of `action` (and at line 85) — and nowhere in `runMiniAppAction` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `runMiniAppAction` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap packages/stac_bridge/lib/src/expression/json_equality.dart:9— `jsonEquals` is public and takes `Object ? a` from its caller, and it calls itself at line 9 (`jsonEquals`) with a piece of `a` (and at line 16) — and nowhere in `jsonEquals` 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's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `jsonEquals` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
FunctionTooLong: index.createNotificationHandler supabase/functions/miniapp-notify/index.ts:57— FunctionTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: push_webhook.createPushWebhook supabase/functions/_shared/push_webhook.ts:38— FunctionTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: index.Deno.serve() supabase/functions/miniapp-proxy/index.ts:50— FunctionTooLong — 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× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) lib/community/cubit/collab_notes/collab_notes_cubit.dart:22— 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 — 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 — 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' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) lib/discourse_post_overview/view/post_overview_comment_tile.dart:21— 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 — 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 — 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' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) wear/lib/schedule/view/schedule_empty_view.dart:9— 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 — 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 — 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' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. 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.
Duplicated block (21 lines × 2) lib/marketplace/cubit/marketplace_cubit.dart:95— lib/marketplace/cubit/marketplace_cubit.dart:95-115 | lib/marketplace/cubit/marketplace_cubit.dart:140-160 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (21 lines × 2) lib/marketplace/cubit/marketplace_cubit.dart:117— lib/marketplace/cubit/marketplace_cubit.dart:117-137 | lib/marketplace/cubit/marketplace_cubit.dart:162-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (21 lines × 2) lib/people/widgets/people/ninja_people_group_member_card.dart:59— lib/people/widgets/people/ninja_people_group_member_card.dart:59-79 | lib/people/widgets/people/study_group_invite_card.dart:84-104 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (17 lines × 2) lib/people/widgets/group_space/ninja_group_note_card.dart:25— lib/people/widgets/group_space/ninja_group_note_card.dart:25-41 | lib/study_group/view/ninja_discover_study_group_card.dart:18-34 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) lib/schedule_management/view/create_schedule_row.dart:51— lib/schedule_management/view/create_schedule_row.dart:51-67 | lib/schedule_management/widgets/schedule_hub_row.dart:79-95 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) ios/HomeWidget/HomeWidget.swift:189— ios/HomeWidget/HomeWidget.swift:189-205 | ios/HomeWidget/HomeWidget.swift:207-223 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (11 lines × 2 locations) supabase/functions/_shared/cns.ts:251— supabase/functions/_shared/cns.ts:251 · supabase/functions/miniapp-proxy/index.ts:380 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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.
Duplicated block (11 lines × 2 locations) supabase/functions/ingest/index.ts:161— supabase/functions/ingest/index.ts:161 · supabase/functions/sync-telegram-feed/index.ts:222 — 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.
Duplicated block (11 lines × 2 locations) supabase/functions/miniapp-deploy/index.ts:35— supabase/functions/miniapp-deploy/index.ts:35 · supabase/functions/miniapp-proxy/index.ts:70 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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.
Duplicated block (31 lines × 2) lib/friends/view/find_friend_card_skeleton.dart:6— lib/friends/view/find_friend_card_skeleton.dart:6-36 | lib/friends/widgets/friend_row_skeleton.dart:6-36 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (31 lines × 2) packages/app_ui/lib/src/widgets/gamification/app_settings_toggle_row.dart:50— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (23 lines × 2) lib/marketplace/cubit/marketplace_cubit.dart:191— lib/marketplace/cubit/marketplace_cubit.dart:191-213 | lib/marketplace/cubit/marketplace_cubit.dart:223-245 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23 lines × 2) packages/stac_bridge/lib/src/widgets/kit/stac_app_select_field_parser.dart:49— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (18 lines × 2) lib/schedule/view/schedule_page/schedule_month_view.dart:393— lib/schedule/view/schedule_page/schedule_month_view.dart:393-410 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:247-264 — before extracting anything, compare `lib/schedule/view/schedule_page/schedule_month_view.dart` and `packages/app_ui/lib/src/widgets/app_calendar_month.dart` 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.
Duplicated block (18 lines × 2) lib/schedule_management/view/empty_schedule_results.dart:8— lib/schedule_management/view/empty_schedule_results.dart:8-25 | lib/schedule_management/view/schedule_zero_state.dart:8-25 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15–16 lines × 2) lib/community/widgets/mentorship/mentorship_skeleton.dart:13— lib/community/widgets/mentorship/mentorship_skeleton.dart:13-28 | lib/community/widgets/team_finder/team_list_skeleton.dart:16-30 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15–16 lines × 2) lib/map/bloc/map_bloc.dart:314— lib/map/bloc/map_bloc.dart:314-328 | lib/map/bloc/map_bloc.dart:498-513 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–13 lines × 2) lib/community/cubit/mentorship/mentorship_cubit.dart:73— lib/community/cubit/mentorship/mentorship_cubit.dart:73-85 | lib/community/cubit/mentorship/mentorship_cubit.dart:92-103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–13 lines × 2) packages/app_ui/lib/src/ninja/surfaces/ninja_empty_state.dart:115— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11–12 lines × 2) lib/community/widgets/team_finder/team_applications_skeleton.dart:15— lib/community/widgets/team_finder/team_applications_skeleton.dart:15-25 | lib/community/widgets/team_finder/team_list_skeleton.dart:21-32 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11–12 lines × 2) lib/study_group/widgets/create_group_sheet.dart:49— lib/study_group/widgets/create_group_sheet.dart:49-60 | lib/study_group/widgets/join_by_code_sheet.dart:34-44 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 4) lib/community/cubit/collab_notes/collab_notes_cubit.dart:27— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (10 lines × 4) lib/discourse_post_overview/view/post_overview_comment_tile.dart:21— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (9–10 lines × 2) lib/profile/widgets/edit_identity_sheet.dart:169— lib/profile/widgets/edit_identity_sheet.dart:169-178 | lib/profile/widgets/edit_profile_sheet.dart:186-194 — before extracting anything, compare `lib/profile/widgets/edit_identity_sheet.dart` and `lib/profile/widgets/edit_profile_sheet.dart` 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 — extracting one helper per block leaves the fork in place.
Duplicated block (9–10 lines × 2) REDACTED:272— REDACTED:272-281 | REDACTED:90-98 — 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 — a file they already depend on, or a new one alongside them — 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 `REDACTED:272` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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 `app_id` to `submission_id) or attributes.get("platform") != "IOS" or app.get("id") !=` in one and `candidate_id) or candidate_attributes.get("state") != "READY_FOR_REVIEW" or candidate_attributes.get("platform") != "IOS" or candidate_app.get("id") !=` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — 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.
Duplicated block (6 lines × 3) packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart:34— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) packages/app_ui/lib/src/widgets/app_progress_ring.dart:132— 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 — before extracting anything, compare `packages/app_ui/lib/src/widgets/app_spinner.dart` and `packages/app_ui/lib/src/widgets/buttons/app_button.dart` 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.
Duplicated block (12 lines × 2 locations) supabase/functions/ingest/auth.ts:127— supabase/functions/ingest/auth.ts:127 · supabase/functions/ingest/auth_test.ts:63 — 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.
Duplicated block (12 lines × 2 locations) supabase/functions/miniapp-notify/index_test.ts:287— supabase/functions/miniapp-notify/index_test.ts:287 · supabase/functions/miniapp-notify/index_test.ts:435 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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.
Duplicated block (9 lines × 2 locations) supabase/functions/miniapp-deploy/index.ts:83— supabase/functions/miniapp-deploy/index.ts:83 · supabase/functions/miniapp-notify/index.ts:290 — 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.
Duplicated block (9 lines × 2 locations) supabase/functions/miniapp-notify/index_test.ts:346— supabase/functions/miniapp-notify/index_test.ts:346 · supabase/functions/miniapp-notify/index_test.ts:416 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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.
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark web/index.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit's own accessibility assertion to the test suite (Flutter `meetsGuideline`, Espresso `AccessibilityChecks`, XCTest `performAccessibilityAudit`), 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's test and CI files — 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.
_LabelsPainter.paint (cyclomatic 79) lib/map/widgets/map_cartographic_layer.dart:371— _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.
ScheduleChangePresentation.fromChange (cyclomatic 73) lib/schedule/widgets/schedule_change_presentation.dart:17— 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.
_VolumeLabelsPainter.paint (cyclomatic 61) lib/map/widgets/map_volume_layer.dart:477— _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.
_MapPlaceDetailsSheetState.build (cyclomatic 58) lib/map/widgets/map_place_details_sheet.dart:267— _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.
ScheduleDayView.build (cyclomatic 58) lib/schedule/view/schedule_page/schedule_day_view.dart:44— 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.
index.createNotificationHandler (cyclomatic 53) supabase/functions/miniapp-notify/index.ts:57— index.createNotificationHandler has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 1 of the 53 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 60, 209, 149, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
app_store_screenshots.update_screenshots (cyclomatic 49) REDACTED:420— 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.
release_manifest.validate_manifest (cyclomatic 45) tool/release_manifest.py:116— 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.
FriendsLocationService.start (cyclomatic 44) lib/friends/services/friends_location_service.dart:56— 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.
push_webhook.createPushWebhook (cyclomatic 44) supabase/functions/_shared/push_webhook.ts:38— push_webhook.createPushWebhook has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to one function literal inside it that branches (line 42). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
PollCard.build (cyclomatic 43) lib/polls/widgets/poll_card.dart:25— 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.
_MapViewState._buildMap (cyclomatic 42) lib/map/view/map_view.dart:1173— _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.
NinjaLessonRow.build (cyclomatic 42) packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart:77— 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.
FriendsMapCubit._applyGeoSettings (cyclomatic 41) lib/friends/cubit/friends_map_cubit.dart:625— 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.
HomeDashboardContent.build (cyclomatic 40) lib/home/view/home_dashboard_content.dart:52— 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.
ScheduleWeekView.build (cyclomatic 40) lib/schedule/view/schedule_page/schedule_week_view.dart:59— 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.
ci_plan.plan_changes (cyclomatic 39) tool/ci_plan.py:106— 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.
community.validateCommunityPayload.observations (cyclomatic 38) supabase/functions/ingest/community.ts:22— 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.
_SvgInteractiveMapState._selectRoom (cyclomatic 36) lib/map/widgets/svg_interactive_map.dart:391— _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.
index.Deno.serve() (cyclomatic 35) supabase/functions/miniapp-proxy/index.ts:50— 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.
ScheduleExporterRepository.exportScheduleToCalendar (cyclomatic 34) packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart:26— 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.
OnboardingFlowCubit._restore (cyclomatic 33) lib/onboarding/bloc/onboarding_flow_cubit.dart:52— 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.
MapBloc._onMapInitialized (cyclomatic 32) lib/map/bloc/map_bloc.dart:62— 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.
StacNetworkRequestActionParser.onCall (cyclomatic 32) packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart:22— 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.
ios_artifact_check.verify_ipa (cyclomatic 32) tool/ios_artifact_check.py:16— 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.
_MapContributionFormState._buildPatch (cyclomatic 31) lib/map/widgets/map_contribution_form.dart:91— _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.
_ScheduleBodyState.build (cyclomatic 30) lib/schedule/view/schedule_page/schedule_body.dart:162— _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.
_ScheduleShareSheetState.build (cyclomatic 30) lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart:298— _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.
AppWeekGridCell.build (cyclomatic 30) packages/app_ui/lib/src/widgets/app_week_grid_cell.dart:36— 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.
app_store_submit.should_submit (cyclomatic 30) REDACTED:254— 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.
NoteEditorCubit._restoreLocalDraft (cyclomatic 29) lib/community/cubit/note_editor/note_editor_cubit.dart:170— 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.
_FriendsMapViewState.build (cyclomatic 29) lib/friends/view/friends_map_view.dart:73— _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.
NinjaGeoSharingSheet.build (cyclomatic 29) lib/friends/widgets/ninja_geo_sharing_sheet.dart:17— 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 — the same kind of value, with no behaviour of its own — 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.
_MapPlacesExplorerState.build (cyclomatic 29) lib/map/widgets/map_places_explorer.dart:163— _MapPlacesExplorerState.build has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
FriendsMapCubit._maybePublish (cyclomatic 28) lib/friends/cubit/friends_map_cubit.dart:357— 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.
TelegramFetcher._convert_media (cyclomatic 28) tools/social_media_fetcher/src/clients/telegram/client.py:571— 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.
app_store_submit.pending_review_submission (cyclomatic 28) REDACTED:62— 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.
prepare_shorebird_patch.verify_worktree (cyclomatic 28) REDACTED:236— 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.
_MapViewState._focusPending (cyclomatic 27) lib/map/view/map_view.dart:269— _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.
MiniAppContent._safeForeground (cyclomatic 27) lib/mini_apps/widgets/mini_app_content.dart:8— 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.
AppLessonCard.build (cyclomatic 27) packages/app_ui/lib/src/widgets/app_lesson_card.dart:53— 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.
MapBloc._onRefreshRequested (cyclomatic 26) lib/map/bloc/map_bloc.dart:330— 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.
IndoorNavigationGraph.IndoorNavigationGraph (cyclomatic 26) lib/map/navigation/indoor_navigation_graph.dart:6— 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.
MapVolumeMesh.fromLayers (cyclomatic 26) lib/map/services/map_volume_mesh.dart:12— 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.
_RoutePainter.paint (cyclomatic 26) lib/map/widgets/map_route_layer.dart:76— _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.
AppButton.build (cyclomatic 26) packages/app_ui/lib/src/widgets/buttons/app_button.dart:367— 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.
_KitImagePickerState.build (cyclomatic 26) packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart:220— _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.
OAuthSessionObserver._inspect (cyclomatic 26) packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart:84— 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.
TelegramToNewsBlocksAdapter.adapt_post_data (cyclomatic 26) tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py:28— 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.
FriendsMapCubit._updateGeoSettings (cyclomatic 25) lib/friends/cubit/friends_map_cubit.dart:579— 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.
_MapViewState._openNavigationLandmark (cyclomatic 25) lib/map/view/map_view.dart:875— _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.
MapFreeRoomsPanel.build (cyclomatic 25) lib/map/widgets/map_free_rooms_panel.dart:93— MapFreeRoomsPanel.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.
_MapRouteTimelineState.build (cyclomatic 25) lib/map/widgets/map_route_timeline.dart:192— _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.
GeoSharingCubit.setSharing (cyclomatic 25) lib/profile/cubit/geo_sharing_cubit.dart:78— 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.
ScheduleTimelineLesson.build (cyclomatic 25) lib/schedule/view/schedule_page/schedule_day_view.dart:430— 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.
_ServicesNfcCardState.build (cyclomatic 25) lib/services/view/widgets/services_nfc_card.dart:126— _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.
_AppSliderState.build (cyclomatic 25) packages/app_ui/lib/src/widgets/app_slider.dart:103— _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.
_MentorProfileSheetState._buildContent (cyclomatic 24) lib/community/widgets/mentorship/mentor_profile_sheet.dart:146— _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.
MapBloc._onFloorSelected (cyclomatic 24) lib/map/bloc/map_bloc.dart:441— MapBloc._onFloorSelected 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.
_GroupSpaceViewState._content (cyclomatic 24) lib/people/view/group_space_view.dart:193— _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.
ProfileCubit.load (cyclomatic 24) lib/profile/cubit/profile_cubit.dart:29— 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.
ScheduleBloc.restoreSelectedScheduleFromRemote (cyclomatic 24) lib/schedule/bloc/schedule_bloc.dart:130— 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.
google_play_screenshots.update_screenshots (cyclomatic 24) tool/google_play_screenshots.py:124— 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.
_CreateTeamSheetState._buildContent (cyclomatic 23) lib/community/widgets/team_finder/create_team_sheet.dart:161— _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.
FriendsMapCubit.refineViaWifi (cyclomatic 23) lib/friends/cubit/friends_map_cubit.dart:444— 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.
_MaterialUploadSheetState.build (cyclomatic 23) lib/knowledge_bank/widgets/material_upload_sheet.dart:172— _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.
_PasswordResetView.build (cyclomatic 23) lib/login/view/password_reset_page.dart:34— _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 — the same kind of value, with no behaviour of its own — 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.
MapBloc._parseFloor (cyclomatic 23) lib/map/bloc/map_bloc.dart:582— 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.
_EdgeDialogState._save (cyclomatic 23) lib/map/widgets/map_graph_editor_page.dart:1106— _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.
_MapRouteSheetState.build (cyclomatic 23) lib/map/widgets/map_route_sheet.dart:171— _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.
SearchBloc._onSearchQueryChanged (cyclomatic 23) lib/search/bloc/search_bloc.dart:112— 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.
AppGlassStyle.surface (cyclomatic 23) packages/app_ui/lib/src/glass/app_glass_style.dart:18— AppGlassStyle.surface 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.
_AppControlSurfaceState.build (cyclomatic 23) packages/app_ui/lib/src/widgets/app_control_surface.dart:37— _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.
AppChip.build (cyclomatic 23) packages/app_ui/lib/src/widgets/app_filter_chip.dart:103— 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.
_AppPressStateState.build (cyclomatic 23) packages/app_ui/lib/src/widgets/app_press_state.dart:84— _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.
_MapRenderProbeState._prepare (cyclomatic 22) tool/src/map_render_probe.dart:110— _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.
NoteEditorCubit._saveTitleLoop (cyclomatic 22) lib/community/cubit/note_editor/note_editor_cubit.dart:398— 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.
NoteEditorCubit._saveDocumentLoop (cyclomatic 22) lib/community/cubit/note_editor/note_editor_cubit.dart:608— 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.
_MaterialBatchUploadSheetState._buildContent (cyclomatic 22) lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:258— _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.
MapBloc._revalidateCachedStartup (cyclomatic 22) lib/map/bloc/map_bloc.dart:182— 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.
MapDataRepository.validateSvg (cyclomatic 22) lib/map/data/map_data_repository.dart:751— 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.
_MapContributionFormState.build (cyclomatic 22) lib/map/widgets/map_contribution_form.dart:248— _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.
_MapPlaceEditorPageState._review (cyclomatic 22) lib/map/widgets/map_place_editor_page.dart:191— _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.
ScheduleBloc._onSelectedScheduleRefreshRequested (cyclomatic 22) lib/schedule/bloc/schedule_bloc.dart:611— 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.
ScheduleWeekView._cell (cyclomatic 22) lib/schedule/view/schedule_page/schedule_week_view.dart:430— 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.
_LessonRemindSheetState.build (cyclomatic 22) lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart:158— _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.
_ServicesViewState.build (cyclomatic 22) lib/services/view/services_view.dart:109— _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.
AccountPersonaCubit._drain (cyclomatic 22) lib/teacher_account/cubit/account_persona_cubit.dart:221— 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.
auth.requireIngestKey (cyclomatic 22) supabase/functions/ingest/auth.ts:79— 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.
index.Deno.serve() (cyclomatic 22) supabase/functions/ingest/index.ts:131— 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.
_NoteDrawingEmbedState._reopen (cyclomatic 21) lib/community/widgets/collab_notes/editor/note_drawing_embed_builder.dart:109— _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.
_PreviewServicesPageState.build (cyclomatic 21) lib/design_preview/pages/preview_services_page.dart:134— _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.
FriendsMapCubit._syncTracking (cyclomatic 21) lib/friends/cubit/friends_map_cubit.dart:193— 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.
FriendsMapCubit.load (cyclomatic 21) lib/friends/cubit/friends_map_cubit.dart:231— 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.
MaterialRow.build (cyclomatic 21) lib/knowledge_bank/widgets/material_row.dart:31— 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.
IndoorRoutePlanner._buildRoute (cyclomatic 21) lib/map/navigation/indoor_route_planner.dart:195— 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.
_MapViewState._openPlace (cyclomatic 21) lib/map/view/map_view.dart:394— _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.
_MapRouteNodePickerState._content (cyclomatic 21) lib/map/widgets/map_route_node_picker.dart:88— _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.
PromoSectionView.build (cyclomatic 21) lib/promo/view/widgets/promo_section_view.dart:19— 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 — the same kind of value, with no behaviour of its own — 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.
NinjaDayPill.build (cyclomatic 21) packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart:182— 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.
CampusRepository.createPublicMaterial (cyclomatic 21) packages/campus_repository/lib/src/campus_repository.dart:825— 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.
AccountPersonaCubit.fromJson (cyclomatic 21) lib/teacher_account/cubit/account_persona_cubit.dart:306— 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.
TelegramFetcher._convert_message (cyclomatic 21) tools/social_media_fetcher/src/clients/telegram/client.py:415— 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.
payload.validatePayload (cyclomatic 21) supabase/functions/ingest/payload.ts:36— 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.
CommunityCatalogContent.build (cyclomatic 20) lib/communities/widgets/community_catalog_content.dart:24— 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.
IndoorRoutePlanner.findRouteBetween (cyclomatic 20) lib/map/navigation/indoor_route_planner.dart:100— 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.
_MapViewState._geographic (cyclomatic 20) lib/map/view/map_view.dart:962— _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.
_MapFloorAlignmentPageState.build (cyclomatic 20) lib/map/widgets/map_floor_alignment_page.dart:395— _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.
_PollCreatorSheetState._buildContent (cyclomatic 20) lib/polls/widgets/poll_creator_sheet.dart:364— _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.
ScheduleLessonCard.build (cyclomatic 20) wear/lib/schedule/view/schedule_lesson_card.dart:63— 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.
AppFeatureCard.build (cyclomatic 20) packages/app_ui/lib/src/widgets/app_feature_card.dart:40— 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.
_AppZoomableImageState._end (cyclomatic 20) packages/app_ui/lib/src/widgets/app_zoomable_image.dart:241— _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.
StacFetchActionParser.onCall (cyclomatic 20) packages/stac_bridge/lib/src/actions/stac_fetch_action_parser.dart:22— 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.
TeacherLessonTile.build (cyclomatic 20) lib/teacher_account/widgets/dashboard/teacher_lesson_tile.dart:25— 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.
OfficialNewsToNewsBlocksAdapter.adapt_post_data (cyclomatic 20) tools/social_media_fetcher/src/news_blocks/adapters/official_news_adapter.py:45— 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.
prepare_shorebird_patch.projection (cyclomatic 20) REDACTED:118— 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.
HomeLessonRow.build (cyclomatic 19) lib/home/view/widgets/home_lessons_group.dart:49— 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.
MapDataRepository._loadCampus (cyclomatic 19) lib/map/data/map_data_repository.dart:355— 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.
IndoorRoutePlanner._maneuver (cyclomatic 19) lib/map/navigation/indoor_route_planner.dart:278— 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.
_GraphNodeLabels.title (cyclomatic 19) lib/map/widgets/map_graph_editor_page.dart:800— _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.
_MapRouteGuidanceState.build (cyclomatic 19) lib/map/widgets/map_route_guidance.dart:57— _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.
_MapVolumeLayerState.didUpdateWidget (cyclomatic 19) lib/map/widgets/map_volume_layer.dart:176— _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.
_MarketSellSheetState.build (cyclomatic 19) lib/marketplace/widgets/market_sell_sheet.dart:248— _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.
_CustomLessonEditorViewState._save (cyclomatic 19) lib/schedule/view/custom_lesson_editor_view.dart:355— _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.
_TeacherProfilePageState._content (cyclomatic 19) lib/schedule/view/teacher_profile_page.dart:222— _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.
AppColors.== (cyclomatic 19) packages/app_ui/lib/src/colors/colors.dart:202— 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.
_AppChipRowState._scheduleReveal (cyclomatic 19) packages/app_ui/lib/src/widgets/mobile/app_chip_row.dart:72— _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.
AppTourController._show (cyclomatic 19) lib/tour/app_tour_controller.dart:87— 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.
_AppTourLayerState._buildLayer (cyclomatic 19) lib/tour/view/app_tour_overlay.dart:244— _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.
UniversityDeploymentConfig.fromJsonString (cyclomatic 18) tool/src/university_deployment_config.dart:29— 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.
ScheduleSearchPager.fetch (cyclomatic 18) tools/schedule_fetcher/lib/schedule_search_pager.dart:13— 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.
ArticleContentModel.fromBlocks (cyclomatic 18) lib/article/widgets/article_content_model.dart:15— 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.
NoteEditorCubit._resynchronize (cyclomatic 18) lib/community/cubit/note_editor/note_editor_cubit.dart:543— 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.
_CollabNoteEditorViewState._insertKeyboardImage (cyclomatic 18) lib/community/view/collab_note_editor_view.dart:318— _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.
TeamCard._actions (cyclomatic 18) lib/community/widgets/team_finder/team_card.dart:134— 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.
FriendsMapCubit._initialize (cyclomatic 18) lib/friends/cubit/friends_map_cubit.dart:89— 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.
MapBloc._onCampusSelected (cyclomatic 18) lib/map/bloc/map_bloc.dart:268— 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.
MapStructureLayers._split (cyclomatic 18) lib/map/widgets/map_structure_layer.dart:255— 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.
_PeoplePageState._handleLocations (cyclomatic 18) lib/people/view/people_page.dart:53— _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.
ScheduleBloc._onScheduleDeleteRequested (cyclomatic 18) lib/schedule/bloc/schedule_bloc.dart:519— 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.
_ComparePageState.build (cyclomatic 18) lib/schedule/view/compare/compare_page.dart:92— _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.
_ScheduleOverlapSwitcherState.build (cyclomatic 18) lib/schedule/view/schedule_page/schedule_overlap_switcher.dart:52— _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.
_HubBody.build (cyclomatic 18) lib/schedule_management/view/hub_body.dart:20— _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.
SupabaseAuthenticationClient.verifyPasswordResetCode (cyclomatic 18) packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart:197— 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.
_KitImagePickerState._pick (cyclomatic 18) packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart:120— _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.
TeacherDashboardIdentitySection.build (cyclomatic 18) lib/teacher_account/widgets/dashboard/teacher_dashboard_identity_section.dart:37— 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.
app_store_screenshots.replace_set (cyclomatic 18) REDACTED:273— 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.
app_store_submit.ensure_app_store_version (cyclomatic 18) REDACTED:330— 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.
index.Deno.serve() (cyclomatic 18) supabase/functions/miniapp-deploy/index.ts:19— 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.
TelegramImageMirror.mirror (cyclomatic 18) supabase/functions/sync-telegram-feed/media.ts:54— 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.
UniversityProviderConfigurator.configure (cyclomatic 17) tool/src/university_provider_configurator.dart:30— 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.
ScheduleSourceProbe._calendarUri (cyclomatic 17) tools/schedule_fetcher/lib/schedule_source_probe.dart:98— 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.
MentorRequestCard._actions (cyclomatic 17) lib/community/widgets/mentorship/mentor_request_card.dart:89— 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.
_MaterialUploadSheetState._pickFile (cyclomatic 17) lib/knowledge_bank/widgets/material_upload_sheet.dart:64— _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.
_MapProposalReviewState.build (cyclomatic 17) lib/map/widgets/map_community_sheet.dart:396— _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.
_VolumePainter.paint (cyclomatic 17) lib/map/widgets/map_volume_layer.dart:338— _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.
_SvgInteractiveMapState.build (cyclomatic 17) lib/map/widgets/svg_interactive_map.dart:226— _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.
_PushHistoryListenerState._record (cyclomatic 17) lib/notifications/view/push_history_listener.dart:169— _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.
_PollRunnerSheetState.build (cyclomatic 17) lib/polls/widgets/poll_runner_sheet.dart:219— _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.
PromoDismissalsCubit._synchronize (cyclomatic 17) lib/promo/cubit/promo_dismissals_cubit.dart:85— 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.
ComparisonDayDetails.build (cyclomatic 17) lib/schedule/view/compare/widgets/comparison_day_details.dart:38— 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.
_ScheduleDatePagerState.build (cyclomatic 17) lib/schedule/view/schedule_page/schedule_date_pager.dart:99— _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.
NinjaBanner.build (cyclomatic 17) packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart:29— 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.
AppListRow.build (cyclomatic 17) packages/app_ui/lib/src/widgets/app_list_row.dart:42— 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.
TelegramFetcher.get_channel_messages_with_groups (cyclomatic 17) tools/social_media_fetcher/src/clients/telegram/client.py:228— 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.
community_metadata.parse_community_page (cyclomatic 17) tools/social_media_fetcher/src/community_metadata.py:91— 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.
release_manifest.build_manifest (cyclomatic 17) tool/release_manifest.py:201— 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.
shorebird_provider_patch.verify_receipt (cyclomatic 17) tool/shorebird_provider_patch.py:103— 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.
(anonymous) (cyclomatic 17) web/firebase-messaging-sw.js:1— (anonymous) has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body's 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.
_NoteTextToolsSheetState.build (cyclomatic 16) lib/community/widgets/collab_notes/editor/note_text_tools_sheet.dart:180— _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.
_NoteToolbarState._addImage (cyclomatic 16) lib/community/widgets/collab_notes/editor/note_toolbar.dart:152— _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.
KnowledgeBankList.build (cyclomatic 16) lib/knowledge_bank/view/knowledge_bank_list.dart:48— 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.
MaterialGridCard.build (cyclomatic 16) lib/knowledge_bank/widgets/material_grid_card.dart:32— 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.
LostFoundItemSheet.build (cyclomatic 16) lib/lost_and_found/widgets/lost_found_item_sheet.dart:69— 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.
MapBloc._onCampusIndexRequested (cyclomatic 16) lib/map/bloc/map_bloc.dart:530— 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.
_MiniAppSecretSheetState.build (cyclomatic 16) lib/mini_apps/widgets/mini_app_secret_sheet.dart:102— _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.
NfcPassCubit.bindPass (cyclomatic 16) lib/nfc_pass/bloc/nfc_pass_cubit.dart:87— 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.
InboxNotificationTracker.observe (cyclomatic 16) lib/notifications/view/inbox_notification_tracker.dart:12— 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.
_GroupLinkSheetState.build (cyclomatic 16) lib/people/widgets/group_space/group_link_sheet.dart:95— _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.
_QuestionCard.build (cyclomatic 16) lib/polls/widgets/creator_questions_step.dart:111— _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.
_PollRunnerSheetState._submit (cyclomatic 16) lib/polls/widgets/poll_runner_sheet.dart:163— _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.
ScheduleBloc._pushSelectedSchedule (cyclomatic 16) lib/schedule/bloc/schedule_bloc.dart:239— 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.
ScheduleBloc._runLoad (cyclomatic 16) lib/schedule/bloc/schedule_bloc.dart:437— 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.
_LessonRemindSheetState._save (cyclomatic 16) lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart:102— _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.
ServicesDirectory.sections (cyclomatic 16) lib/services/data/services_directory.dart:310— 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.
AppScreenHeader.build (cyclomatic 16) packages/app_ui/lib/src/widgets/app_screen_header.dart:47— 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.
_AppInputFieldState._build (cyclomatic 16) packages/app_ui/lib/src/widgets/forms/app_input_field.dart:218— _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.
NfcPassRepository._bindPass (cyclomatic 16) packages/nfc_pass_repository/lib/src/nfc_pass_repository.dart:145— 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.
NfcPassStore.synchronizeSessionAccount (cyclomatic 16) packages/nfc_pass_repository/lib/src/storage/nfc_pass_store.dart:29— 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.
_TeacherPickerState.build (cyclomatic 16) lib/teacher_account/widgets/teacher_picker.dart:100— _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.
TelegramFetcher._convert_document_media (cyclomatic 16) tools/social_media_fetcher/src/clients/telegram/client.py:513— 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.
app_store_submit.set_release_notes (cyclomatic 16) REDACTED:410— 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.
build_web.public_config (cyclomatic 16) tool/build_web.py:26— 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.
configure_firebase.release_config (cyclomatic 16) tool/configure_firebase.py:7— 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.
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:152— 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's 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 × complexity hotspot — 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: “Fix startup recovery and campus authentication”; “Fix Pulse and NFC login returning to the app (#615)”; “Fix mobile services and iOS release workflows (#482)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-23..2026-10-21, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-23 17:36:21 +03:00' --until='2026-10-21 17:36:21 +03:00' --full-history --no-merges -- packages/web_oauth_interceptor_client/lib/src/web_oauth_interceptor_client.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
_LabelsPainter.paint (cognitive 130) lib/map/widgets/map_cartographic_layer.dart:371— _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.
_MapPlaceDetailsSheetState.build (cognitive 107) lib/map/widgets/map_place_details_sheet.dart:267— _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.
ScheduleDayView.build (cognitive 96) lib/schedule/view/schedule_page/schedule_day_view.dart:44— 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.
_VolumeLabelsPainter.paint (cognitive 95) lib/map/widgets/map_volume_layer.dart:477— _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.
ScheduleExporterRepository.exportScheduleToCalendar (cognitive 78) packages/schedule_exporter_repository/lib/src/schedule_exporter_repository.dart:26— 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.
app_store_screenshots.update_screenshots (cognitive 71) REDACTED:420— 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.
FriendsLocationService.start (cognitive 66) lib/friends/services/friends_location_service.dart:56— 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.
ScheduleChangePresentation.fromChange (cognitive 66) lib/schedule/widgets/schedule_change_presentation.dart:17— 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.
_MapContributionFormState.build (cognitive 64) lib/map/widgets/map_contribution_form.dart:248— _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 — 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's 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.
MapBloc._onMapInitialized (cognitive 59) lib/map/bloc/map_bloc.dart:62— 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.
HomeDashboardContent.build (cognitive 57) lib/home/view/home_dashboard_content.dart:52— 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.
FriendsMapCubit._applyGeoSettings (cognitive 56) lib/friends/cubit/friends_map_cubit.dart:625— 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.
MapVolumeMesh.fromLayers (cognitive 54) lib/map/services/map_volume_mesh.dart:12— 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.
AccountPersonaCubit._drain (cognitive 54) lib/teacher_account/cubit/account_persona_cubit.dart:221— 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.
_SvgInteractiveMapState._selectRoom (cognitive 53) lib/map/widgets/svg_interactive_map.dart:391— _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.
ScheduleWeekView.build (cognitive 52) lib/schedule/view/schedule_page/schedule_week_view.dart:59— 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.
release_manifest.validate_manifest (cognitive 52) tool/release_manifest.py:116— 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.
StacNetworkRequestActionParser.onCall (cognitive 51) packages/stac_bridge/lib/src/actions/stac_network_request_action_parser.dart:22— 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.
OnboardingFlowCubit._restore (cognitive 49) lib/onboarding/bloc/onboarding_flow_cubit.dart:52— 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.
index.createNotificationHandler (cognitive 49) supabase/functions/miniapp-notify/index.ts:57— index.createNotificationHandler 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). None of this is in the body itself: all 49 points belong to 4 function literals inside it that branch (lines 60, 209, 149, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
_MapContributionFormState._buildPatch (cognitive 47) lib/map/widgets/map_contribution_form.dart:91— _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.
ci_plan.plan_changes (cognitive 47) tool/ci_plan.py:106— 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.
_MapRenderProbeState._prepare (cognitive 45) tool/src/map_render_probe.dart:110— _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.
NoteEditorCubit._saveDocumentLoop (cognitive 45) lib/community/cubit/note_editor/note_editor_cubit.dart:608— 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.
MapBloc._onRefreshRequested (cognitive 45) lib/map/bloc/map_bloc.dart:330— 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.
_MapViewState._buildMap (cognitive 44) lib/map/view/map_view.dart:1173— _MapViewState._buildMap has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 20 (22 pts), boolean chains 11, if/else 10 (11 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
PollCard.build (cognitive 44) lib/polls/widgets/poll_card.dart:25— 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 — checks laid out side by side rather than stacked — 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.
NoteEditorCubit._restoreLocalDraft (cognitive 43) lib/community/cubit/note_editor/note_editor_cubit.dart:170— 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.
_GroupSpaceViewState._content (cognitive 43) lib/people/view/group_space_view.dart:193— _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.
_LessonRemindSheetState.build (cognitive 43) lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart:158— _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.
NinjaLessonRow.build (cognitive 43) packages/app_ui/lib/src/ninja/surfaces/ninja_lesson_row.dart:77— 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.
TelegramFetcher._convert_media (cognitive 43) tools/social_media_fetcher/src/clients/telegram/client.py:571— 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 — 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's 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.
TelegramToNewsBlocksAdapter.adapt_post_data (cognitive 41) tools/social_media_fetcher/src/news_blocks/adapters/telegram_adapter.py:28— 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.
prepare_shorebird_patch.verify_worktree (cognitive 41) REDACTED:236— 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.
MapBloc._revalidateCachedStartup (cognitive 40) lib/map/bloc/map_bloc.dart:182— 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.
MiniAppContent._safeForeground (cognitive 40) lib/mini_apps/widgets/mini_app_content.dart:8— 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.
index.Deno.serve() (cognitive 40) supabase/functions/miniapp-proxy/index.ts:50— 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.
MapDataRepository._loadCampus (cognitive 38) lib/map/data/map_data_repository.dart:355— 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.
GeoSharingCubit.setSharing (cognitive 38) lib/profile/cubit/geo_sharing_cubit.dart:78— 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.
ScheduleWeekView._cell (cognitive 38) lib/schedule/view/schedule_page/schedule_week_view.dart:430— 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.
app_store_submit.should_submit (cognitive 38) REDACTED:254— 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.
_MapViewState._openNavigationLandmark (cognitive 37) lib/map/view/map_view.dart:875— _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.
_TeacherPickerState.build (cognitive 37) lib/teacher_account/widgets/teacher_picker.dart:100— _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 — 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's 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.
app_store_submit.pending_review_submission (cognitive 37) REDACTED:62— 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.
ios_artifact_check.verify_ipa (cognitive 37) tool/ios_artifact_check.py:16— 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 — checks laid out side by side rather than stacked — 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.
_MapViewState._focusPending (cognitive 36) lib/map/view/map_view.dart:269— _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.
_PeoplePageState._handleLocations (cognitive 36) lib/people/view/people_page.dart:53— _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.
PromoDismissalsCubit._synchronize (cognitive 36) lib/promo/cubit/promo_dismissals_cubit.dart:85— 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.
_MapCommunitySheetState.build (cognitive 35) lib/map/widgets/map_community_sheet.dart:111— _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 — 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's 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.
FriendsMapCubit._updateGeoSettings (cognitive 34) lib/friends/cubit/friends_map_cubit.dart:579— 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.
IndoorNavigationGraph.IndoorNavigationGraph (cognitive 34) lib/map/navigation/indoor_navigation_graph.dart:6— 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.
_MapViewState._geographic (cognitive 34) lib/map/view/map_view.dart:962— _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.
_MapPlaceEditorPageState._review (cognitive 34) lib/map/widgets/map_place_editor_page.dart:191— _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.
_KitImagePickerState.build (cognitive 34) packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart:220— _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.
OAuthSessionObserver._inspect (cognitive 34) packages/web_oauth_interceptor_client/lib/src/oauth_session_observer.dart:84— 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.
push_webhook.createPushWebhook (cognitive 34) supabase/functions/_shared/push_webhook.ts:38— push_webhook.createPushWebhook 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). None of this is in the body itself: all 34 points belong to one function literal inside it that branches (line 42). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
NoteEditorCubit._saveTitleLoop (cognitive 33) lib/community/cubit/note_editor/note_editor_cubit.dart:398— 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.
_RoutePainter.paint (cognitive 33) lib/map/widgets/map_route_layer.dart:76— _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.
community.validateCommunityPayload.observations (cognitive 33) supabase/functions/ingest/community.ts:22— 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.
TelegramFetcher.get_channel_messages_with_groups (cognitive 32) tools/social_media_fetcher/src/clients/telegram/client.py:228— 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.
MapBloc._onFloorSelected (cognitive 31) lib/map/bloc/map_bloc.dart:441— MapBloc._onFloorSelected has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (13 pts), ternaries 2 (4 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.
_MapPlacesExplorerState.build (cognitive 31) lib/map/widgets/map_places_explorer.dart:163— _MapPlacesExplorerState.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12, ternaries 6 (9 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
_ComparePageState.build (cognitive 31) lib/schedule/view/compare/compare_page.dart:92— _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.
ComparisonDayDetails.build (cognitive 31) lib/schedule/view/compare/widgets/comparison_day_details.dart:38— 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.
AppLessonCard.build (cognitive 31) packages/app_ui/lib/src/widgets/app_lesson_card.dart:53— 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 — checks laid out side by side rather than stacked — 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.
CommunityCatalogContent.build (cognitive 30) lib/communities/widgets/community_catalog_content.dart:24— 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.
FriendsMapCubit._maybePublish (cognitive 30) lib/friends/cubit/friends_map_cubit.dart:357— 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.
KnowledgeBankList.build (cognitive 30) lib/knowledge_bank/view/knowledge_bank_list.dart:48— 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.
MapDataRepository.validateSvg (cognitive 30) lib/map/data/map_data_repository.dart:751— 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.
_ScheduleShareSheetState.build (cognitive 30) lib/schedule/view/schedule_page/sheets/schedule_share_sheet.dart:298— _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 — checks laid out side by side rather than stacked — 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.
SearchBloc._onSearchQueryChanged (cognitive 30) lib/search/bloc/search_bloc.dart:112— 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.
StacFetchActionParser.onCall (cognitive 30) packages/stac_bridge/lib/src/actions/stac_fetch_action_parser.dart:22— 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.
AccountPersonaCubit.fromJson (cognitive 30) lib/teacher_account/cubit/account_persona_cubit.dart:306— 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.
TelegramFetcher._convert_message (cognitive 30) tools/social_media_fetcher/src/clients/telegram/client.py:415— 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.
ScheduleSearchPager.fetch (cognitive 29) tools/schedule_fetcher/lib/schedule_search_pager.dart:13— 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.
MapFreeRoomsPanel.build (cognitive 29) lib/map/widgets/map_free_rooms_panel.dart:93— MapFreeRoomsPanel.build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 8 (10 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
_MapRouteNodePickerState._content (cognitive 29) lib/map/widgets/map_route_node_picker.dart:88— _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.
_MapRouteSheetState.build (cognitive 29) lib/map/widgets/map_route_sheet.dart:171— _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.
ScheduleTimelineLesson.build (cognitive 29) lib/schedule/view/schedule_page/schedule_day_view.dart:430— 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 — checks laid out side by side rather than stacked — 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.
OfficialNewsToNewsBlocksAdapter.adapt_post_data (cognitive 29) tools/social_media_fetcher/src/news_blocks/adapters/official_news_adapter.py:45— 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.
app_store_screenshots.replace_set (cognitive 29) REDACTED:273— 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.
google_play_screenshots.update_screenshots (cognitive 29) tool/google_play_screenshots.py:124— 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 — checks laid out side by side rather than stacked — 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.
MentorRequestCard._actions (cognitive 28) lib/community/widgets/mentorship/mentor_request_card.dart:89— 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.
TeamCard._actions (cognitive 28) lib/community/widgets/team_finder/team_card.dart:134— 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.
FriendsMapCubit.refineViaWifi (cognitive 28) lib/friends/cubit/friends_map_cubit.dart:444— 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.
MapBloc._onCampusIndexRequested (cognitive 28) lib/map/bloc/map_bloc.dart:530— 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.
IndoorRoutePlanner.findRouteBetween (cognitive 28) lib/map/navigation/indoor_route_planner.dart:100— 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.
_MapGeographicViewState.build (cognitive 28) lib/map/widgets/map_geographic_view.dart:53— _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.
_ServicesViewState.build (cognitive 28) lib/services/view/services_view.dart:109— _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.
prepare_shorebird_patch.projection (cognitive 28) REDACTED:118— 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.
_MentorProfileSheetState._buildContent (cognitive 27) lib/community/widgets/mentorship/mentor_profile_sheet.dart:146— _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.
_MaterialUploadSheetState._pickFile (cognitive 27) lib/knowledge_bank/widgets/material_upload_sheet.dart:64— _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.
_MaterialUploadSheetState.build (cognitive 27) lib/knowledge_bank/widgets/material_upload_sheet.dart:172— _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 — checks laid out side by side rather than stacked — 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.
_TeacherProfilePageState._content (cognitive 27) lib/schedule/view/teacher_profile_page.dart:222— _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.
AppWeekGridCell.build (cognitive 27) packages/app_ui/lib/src/widgets/app_week_grid_cell.dart:36— 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 — checks laid out side by side rather than stacked — 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.
_KitImagePickerState._pick (cognitive 27) packages/stac_bridge/lib/src/widgets/kit/kit_image_picker.dart:120— _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.
AppTourController._show (cognitive 27) lib/tour/app_tour_controller.dart:87— 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.
_NoteTextToolsSheetState.build (cognitive 26) lib/community/widgets/collab_notes/editor/note_text_tools_sheet.dart:180— _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.
_CreateTeamSheetState._buildContent (cognitive 26) lib/community/widgets/team_finder/create_team_sheet.dart:161— _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 — checks laid out side by side rather than stacked — 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.
_PreviewServicesPageState.build (cognitive 26) lib/design_preview/pages/preview_services_page.dart:134— _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.
_MaterialBatchUploadSheetState._buildContent (cognitive 26) lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:258— _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 — checks laid out side by side rather than stacked — 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.
_MaterialSubjectPickerState.build (cognitive 26) lib/knowledge_bank/widgets/material_subject_picker.dart:100— _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 — 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's 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.
IndoorRoutePlanner._buildRoute (cognitive 26) lib/map/navigation/indoor_route_planner.dart:195— 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.
_MapRouteTimelineState.build (cognitive 26) lib/map/widgets/map_route_timeline.dart:192— _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 — checks laid out side by side rather than stacked — 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.
_MiniAppTokensSheetState.build (cognitive 26) lib/mini_apps/widgets/mini_app_tokens_sheet.dart:97— _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.
ScheduleBloc._onSelectedScheduleRefreshRequested (cognitive 26) lib/schedule/bloc/schedule_bloc.dart:611— 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.
_AppSliderState.build (cognitive 26) packages/app_ui/lib/src/widgets/app_slider.dart:103— _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 — checks laid out side by side rather than stacked — 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.
ScheduleGlanceAppWidget.ModernMinimalWidget (cognitive 26) android/app/src/main/kotlin/ninja/mirea/mireaapp/glance/ScheduleGlanceAppWidget.kt:78— 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.
auth.requireIngestKey (cognitive 26) supabase/functions/ingest/auth.ts:79— 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.
index.Deno.serve() (cognitive 26) supabase/functions/ingest/index.ts:131— 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 — checks laid out side by side rather than stacked — 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.
ScheduleSourceProbe._calendarUri (cognitive 25) tools/schedule_fetcher/lib/schedule_source_probe.dart:98— 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.
_NoteDrawingEmbedState._reopen (cognitive 25) lib/community/widgets/collab_notes/editor/note_drawing_embed_builder.dart:109— _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.
FriendsMapCubit.load (cognitive 25) lib/friends/cubit/friends_map_cubit.dart:231— 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.
_FriendsMapViewState.build (cognitive 25) lib/friends/view/friends_map_view.dart:73— _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 — 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.
HomeDeadlinesGroup.build (cognitive 25) lib/home/view/widgets/home_deadlines_group.dart: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.
NfcPassCubit.bindPass (cognitive 25) lib/nfc_pass/bloc/nfc_pass_cubit.dart:87— 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.
_GroupSpaceViewState._showInitialPost (cognitive 25) lib/people/view/group_space_view.dart:80— _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.
ScheduleBloc.restoreSelectedScheduleFromRemote (cognitive 25) lib/schedule/bloc/schedule_bloc.dart:130— 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.
ScheduleBloc._cacheRefreshedSchedule (cognitive 25) lib/schedule/bloc/schedule_bloc.dart:689— 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 — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — 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.
_ScheduleBodyState.build (cognitive 25) lib/schedule/view/schedule_page/schedule_body.dart:162— _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 — 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.
_LessonRemindSheetState._save (cognitive 25) lib/schedule/view/schedule_page/sheets/lesson_remind_sheet.dart:102— _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.
_HubBody.build (cognitive 25) lib/schedule_management/view/hub_body.dart:20— _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.
_ServicesNfcCardState.build (cognitive 25) lib/services/view/widgets/services_nfc_card.dart:126— _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 — 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.
NinjaWeekStrip.build (cognitive 25) packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart:77— 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.
NinjaDayPill.build (cognitive 25) packages/app_ui/lib/src/ninja/surfaces/ninja_week_strip.dart:182— 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 — checks laid out side by side rather than stacked — 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.
_AppPressStateState.build (cognitive 25) packages/app_ui/lib/src/widgets/app_press_state.dart:84— _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 — checks laid out side by side rather than stacked — 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.
CampusRepository.createPublicMaterial (cognitive 25) packages/campus_repository/lib/src/campus_repository.dart:825— 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.
community_metadata.parse_community_page (cognitive 25) tools/social_media_fetcher/src/community_metadata.py:91— 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.
app_store_screenshots.remove_other_phone_assets (cognitive 25) REDACTED:351— 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.
MapBloc._parseFloor (cognitive 24) lib/map/bloc/map_bloc.dart:582— 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.
_VolumePainter.paint (cognitive 24) lib/map/widgets/map_volume_layer.dart:338— _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.
_SvgInteractiveMapState.build (cognitive 24) lib/map/widgets/svg_interactive_map.dart:226— _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.
_QuestionCard.build (cognitive 24) lib/polls/widgets/creator_questions_step.dart:111— _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.
ProfileCubit.load (cognitive 24) lib/profile/cubit/profile_cubit.dart:29— 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 — 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.
ScheduleBloc._onScheduleDeleteRequested (cognitive 24) lib/schedule/bloc/schedule_bloc.dart:519— 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.
ServicesDirectory.sections (cognitive 24) lib/services/data/services_directory.dart:310— 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.
AppChip.build (cognitive 24) packages/app_ui/lib/src/widgets/app_filter_chip.dart:103— 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 — checks laid out side by side rather than stacked — 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.
AppButton.build (cognitive 24) packages/app_ui/lib/src/widgets/buttons/app_button.dart:367— 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 — 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.
LocalNotificationsRepository.syncLessonReminders (cognitive 24) packages/local_notifications_repository/lib/src/local_notifications_repository.dart:65— 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.
UniversityDeploymentConfig.fromJsonString (cognitive 23) tool/src/university_deployment_config.dart:29— 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.
NoteEditorCubit._resynchronize (cognitive 23) lib/community/cubit/note_editor/note_editor_cubit.dart:543— 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.
LostFoundItemSheet.build (cognitive 23) lib/lost_and_found/widgets/lost_found_item_sheet.dart:69— 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.
MapBloc._onCampusSelected (cognitive 23) lib/map/bloc/map_bloc.dart:268— 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.
_MapSavedPlacesSheetState.build (cognitive 23) lib/map/widgets/map_saved_places_sheet.dart:108— _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 — checks laid out side by side rather than stacked — 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.
_MiniAppSecretSheetState.build (cognitive 23) lib/mini_apps/widgets/mini_app_secret_sheet.dart:102— _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.
ScheduleWidgetUpdater._prepareOptimizedScheduleData (cognitive 23) lib/schedule/utils/schedule_widget_updater.dart:79— 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 — 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's 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.
ScheduleLessonCard.build (cognitive 23) wear/lib/schedule/view/schedule_lesson_card.dart:63— 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 — checks laid out side by side rather than stacked — 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.
AppGlassStyle.surface (cognitive 23) packages/app_ui/lib/src/glass/app_glass_style.dart:18— AppGlassStyle.surface has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 12 (19 pts), boolean chains 2, match/switch 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.
_AppControlSurfaceState.build (cognitive 23) packages/app_ui/lib/src/widgets/app_control_surface.dart:37— _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 — 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.
AppFeatureCard.build (cognitive 23) packages/app_ui/lib/src/widgets/app_feature_card.dart:40— 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 — checks laid out side by side rather than stacked — 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.
_AppZoomableImageState._end (cognitive 23) packages/app_ui/lib/src/widgets/app_zoomable_image.dart:241— _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 — checks laid out side by side rather than stacked — 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.
NfcPassRepository._bindPass (cognitive 23) packages/nfc_pass_repository/lib/src/nfc_pass_repository.dart:145— 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.
TelegramFetcher.fetch_raw_data (cognitive 23) tools/social_media_fetcher/src/clients/telegram/client.py:160— 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.
release_manifest.build_manifest (cognitive 23) tool/release_manifest.py:201— 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.
TelegramImageMirror.mirror (cognitive 23) supabase/functions/sync-telegram-feed/media.ts:54— 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.
UniversityConfigurator._writeAtomically (cognitive 22) tool/src/university_configurator.dart:117— 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.
_CollabNoteEditorViewState._insertKeyboardImage (cognitive 22) lib/community/view/collab_note_editor_view.dart:318— _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.
FriendsMapCubit._initialize (cognitive 22) lib/friends/cubit/friends_map_cubit.dart:89— 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.
MapDataRepository._completeCampusDocument (cognitive 22) lib/map/data/map_data_repository.dart:454— 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.
_MapProposalReviewState.build (cognitive 22) lib/map/widgets/map_community_sheet.dart:396— _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.
_EdgeDialogState._save (cognitive 22) lib/map/widgets/map_graph_editor_page.dart:1106— _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.
_PollRunnerSheetState._submit (cognitive 22) lib/polls/widgets/poll_runner_sheet.dart:163— _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.
_CustomLessonEditorViewState._save (cognitive 22) lib/schedule/view/custom_lesson_editor_view.dart:355— _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.
_SessionViewState.build (cognitive 22) lib/schedule/view/session/session_page.dart:61— _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.
app_store_submit.replace_pending_build (cognitive 22) REDACTED:198— 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.
import_shorebird_release.verify_automatic_checkouts (cognitive 22) tool/import_shorebird_release.py:189— 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.
shorebird_provider_patch.verify_receipt (cognitive 22) tool/shorebird_provider_patch.py:103— 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.
ConfigureUniversity.run (cognitive 21) tool/configure_university.dart:26— 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.
_NoteToolbarState._addImage (cognitive 21) lib/community/widgets/collab_notes/editor/note_toolbar.dart:152— _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.
NinjaGeoSharingSheet.build (cognitive 21) lib/friends/widgets/ninja_geo_sharing_sheet.dart:17— 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 — checks laid out side by side rather than stacked — 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.
LostFoundCubit.toggleItemStatus (cognitive 21) lib/lost_and_found/cubit/lost_found_cubit.dart:87— 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.
MapDataRepository.loadCachedCampus (cognitive 21) lib/map/data/map_data_repository.dart:202— 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.
IndoorRoutePlanner._reachableLabels (cognitive 21) lib/map/navigation/indoor_route_planner.dart:52— 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.
_MapViewState._openPlace (cognitive 21) lib/map/view/map_view.dart:394— _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 — 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.
MapCanvasControls.build (cognitive 21) lib/map/widgets/map_canvas_controls.dart:27— MapCanvasControls.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (18 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.
MapStructureLayers._split (cognitive 21) lib/map/widgets/map_structure_layer.dart:255— 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.
_AppTourLayerState._buildLayer (cognitive 21) lib/tour/view/app_tour_overlay.dart:244— _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 — checks laid out side by side rather than stacked — 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.
app_store_submit.ensure_app_store_version (cognitive 21) REDACTED:330— 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 — checks laid out side by side rather than stacked — 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.
FriendsMapCubit._syncTracking (cognitive 20) lib/friends/cubit/friends_map_cubit.dart:193— 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.
FindFriendsDiscovery._people (cognitive 20) lib/friends/view/find_friends_discovery.dart:84— 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.
MaterialRow.build (cognitive 20) lib/knowledge_bank/widgets/material_row.dart:31— 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 — checks laid out side by side rather than stacked — 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.
_MapFloorAlignmentPageState.build (cognitive 20) lib/map/widgets/map_floor_alignment_page.dart:395— _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 — 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.
_GraphPainter.paint (cognitive 20) lib/map/widgets/map_graph_editor_page.dart:580— _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.
PollsCubit.createPoll (cognitive 20) lib/polls/cubit/polls_cubit.dart:79— 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 — 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's 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.
_CreatorPreviewStep.build (cognitive 20) lib/polls/widgets/creator_preview_step.dart:24— _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.
ScheduleMonthView._markers (cognitive 20) lib/schedule/view/schedule_page/schedule_month_view.dart:40— 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.
ExamTopicsCubit.fromJson (cognitive 20) lib/schedule/view/session/exam_topics_cubit.dart:51— 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.
ExamTopics.build (cognitive 20) lib/schedule/view/session/widgets/exam_topics.dart:25— 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.
_SearchSheetState._hits (cognitive 20) lib/search/view/search_sheet.dart:115— _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.
MiniAppTreeResolver._deferWidget (cognitive 20) packages/stac_bridge/lib/src/expression/mini_app_tree_resolver.dart:159— 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.
AccountPersonaCubit._restorePersona (cognitive 20) lib/teacher_account/cubit/account_persona_cubit.dart:56— 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.
_DeadlinesViewState.build (cognitive 19) lib/community/view/deadlines_view.dart:155— _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.
HomeLessonRow.build (cognitive 19) lib/home/view/widgets/home_lessons_group.dart:49— 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 — 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.
MaterialGridCard.build (cognitive 19) lib/knowledge_bank/widgets/material_grid_card.dart:32— 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 — checks laid out side by side rather than stacked — 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.
_MapViewState._mapInformation (cognitive 19) lib/map/view/map_view.dart:674— _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.
_MarketplaceBodyState._result (cognitive 19) lib/marketplace/widgets/marketplace_body.dart:195— _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.
MiniAppSubmitCubit.submit (cognitive 19) lib/mini_apps/cubit/mini_app_submit_cubit.dart:31— 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.
NotificationsSheet.build (cognitive 19) lib/notifications/view/notifications_sheet.dart:44— 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.
OnboardingFlowCubit.prepareFinish (cognitive 19) lib/onboarding/bloc/onboarding_flow_cubit.dart:243— 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.
ScheduleBloc._pushSelectedSchedule (cognitive 19) lib/schedule/bloc/schedule_bloc.dart:239— 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.
ScheduleBloc._runLoad (cognitive 19) lib/schedule/bloc/schedule_bloc.dart:437— 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.
_ChangesPageState._toggleAlerts (cognitive 19) lib/schedule/view/changes/changes_page.dart:101— _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.
_AppInputFieldState._buildTrailing (cognitive 19) packages/app_ui/lib/src/widgets/forms/app_input_field.dart:415— _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.
ArticleRepository.getArticle (cognitive 19) packages/article_repository/lib/src/article_repository.dart:32— 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.
SupabaseAuthenticationClient.verifyPasswordResetCode (cognitive 19) packages/auth_client/supabase_authentication_client/lib/src/supabase_authentication_client.dart:197— 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.
MiniAppTreeResolver._resolve (cognitive 19) packages/stac_bridge/lib/src/expression/mini_app_tree_resolver.dart:97— 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.
TeacherDashboardIdentitySection.build (cognitive 19) lib/teacher_account/widgets/dashboard/teacher_dashboard_identity_section.dart:37— 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 — 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.
TeacherLessonTile.build (cognitive 19) lib/teacher_account/widgets/dashboard/teacher_lesson_tile.dart:25— 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 — 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.
app_store_build_status.wait_for_build (cognitive 19) REDACTED:123— 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.
app_store_submit.set_release_notes (cognitive 19) REDACTED:410— 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.
ci_plan.local_dependencies (cognitive 19) tool/ci_plan.py:72— 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.
google_play_screenshots.validate_screenshot (cognitive 19) tool/google_play_screenshots.py:49— 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.
payload.validatePayload (cognitive 19) supabase/functions/ingest/payload.ts:36— 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 — 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.
(anonymous) (cognitive 19) web/firebase-messaging-sw.js:1— (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's 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.
createUpstreamProxy (cognitive 19) tools/schedule_relay/upstream_proxy.mjs:7— 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' 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's 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.
RetryingSourceClient.get (cognitive 18) tools/schedule_fetcher/lib/retrying_source_client.dart:45— 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.
DeviceTokenSyncController._activate (cognitive 18) lib/app/services/device_token_sync_controller.dart:49— 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.
_AddAbsenceSheetState.build (cognitive 18) lib/attendance/widgets/add_absence_sheet.dart:87— _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.
DrawingStroke.fromJson (cognitive 18) lib/community/widgets/collab_notes/editor/drawing_stroke.dart:28— 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.
HomeTrendingGroup.build (cognitive 18) lib/home/view/widgets/home_trending_group.dart:22— 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.
MapDataRepository._parseCampus (cognitive 18) lib/map/data/map_data_repository.dart:994— 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.
_RoomsPainter.paint (cognitive 18) lib/map/widgets/map_cartographic_layer.dart:295— _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.
_GraphNodeLabels.title (cognitive 18) lib/map/widgets/map_graph_editor_page.dart:800— _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.
_MapRouteGuidanceState.build (cognitive 18) lib/map/widgets/map_route_guidance.dart:57— _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 — 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.
_MapVolumeLayerState.didUpdateWidget (cognitive 18) lib/map/widgets/map_volume_layer.dart:176— _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.
_MarketSellSheetState.build (cognitive 18) lib/marketplace/widgets/market_sell_sheet.dart:248— _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 — 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.
InboxNotificationTracker.observe (cognitive 18) lib/notifications/view/inbox_notification_tracker.dart:12— 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 — 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.
_OnboardingSettingsStepState._togglePush (cognitive 18) lib/onboarding/widgets/onboarding_settings_step.dart:119— _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.
_GuestUpgradeSheetState._submit (cognitive 18) lib/profile/widgets/guest_upgrade_sheet.dart:78— _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.
_ScheduleDatePagerState.build (cognitive 18) lib/schedule/view/schedule_page/schedule_date_pager.dart:99— _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.
_TeacherProfilePageState._buildReviews (cognitive 18) lib/schedule/view/teacher_profile_page.dart:171— _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.
AppColors.== (cognitive 18) packages/app_ui/lib/src/colors/colors.dart:202— 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.
AppActivityHeatmap.build (cognitive 18) packages/app_ui/lib/src/widgets/app_activity_heatmap.dart:36— 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.
AppServiceTile.build (cognitive 18) packages/app_ui/lib/src/widgets/app_service_tile.dart:69— 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 — checks laid out side by side rather than stacked — 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.
StacPickImageActionParser.onCall (cognitive 18) packages/stac_bridge/lib/src/actions/stac_pick_image_action_parser.dart:16— 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.
MiniAppTreeResolver._resolveSwitch (cognitive 18) packages/stac_bridge/lib/src/expression/mini_app_tree_resolver.dart:260— 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 — 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's 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.
app_store_screenshots.jpeg_dimensions (cognitive 18) REDACTED:56— 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.
build_web.build (cognitive 18) tool/build_web.py:81— 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.
import_shorebird_release.find_artifact (cognitive 18) tool/import_shorebird_release.py:239— 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.
prepare_shorebird_patch.main (cognitive 18) REDACTED:306— 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.
release_manifest.resolve (cognitive 18) tool/release_manifest.py:265— 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.
auth.resolveIngestKey (cognitive 18) supabase/functions/ingest/auth.ts:44— 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.
firebase-messaging-sw.self.addEventListener("notificationclick") (cognitive 18) web/firebase-messaging-sw.js:1— firebase-messaging-sw.self.addEventListener("notificationclick") 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's 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.
ArticleBody.build (cognitive 17) lib/article/widgets/article_body.dart:24— 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.
NoteEditorCubit._applyRemoteChange (cognitive 17) lib/community/cubit/note_editor/note_editor_cubit.dart:485— 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.
_CollabNoteEditorViewState._onImageTap (cognitive 17) lib/community/view/collab_note_editor_view.dart:394— _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.
_AddDeadlineSheetState._save (cognitive 17) lib/community/view/deadlines/add_deadline_sheet.dart:165— _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.
_DeadlinesCalendar.build (cognitive 17) lib/community/view/deadlines_view.dart:354— _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.
DrawingToolbar.build (cognitive 17) lib/community/widgets/collab_notes/editor/drawing_toolbar.dart:64— 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.
DeadlineGroup.build (cognitive 17) lib/community/widgets/deadlines/deadline_group.dart:36— 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.
FriendsMapCubit._loadGeoSettings (cognitive 17) lib/friends/cubit/friends_map_cubit.dart:541— 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.
NinjaFriendsPanel.build (cognitive 17) lib/friends/widgets/ninja_friends_panel.dart:87— 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.
MarketListingCard.build (cognitive 17) lib/marketplace/widgets/market_listing_card.dart:33— 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 — checks laid out side by side rather than stacked — 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.
MiniAppsCatalogCubit.load (cognitive 17) lib/mini_apps/cubit/mini_apps_catalog_cubit.dart:18— 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.
PollsCubit.load (cognitive 17) lib/polls/cubit/polls_cubit.dart:24— 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.
_PollCreatorSheetState._buildContent (cognitive 17) lib/polls/widgets/poll_creator_sheet.dart:364— _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.
PromoSectionView.build (cognitive 17) lib/promo/view/widgets/promo_section_view.dart:19— 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.
AnalyticsStats.fromLessons (cognitive 17) lib/schedule/view/analytics/analytics_stats.dart:15— 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.
_ScheduleOverlapSwitcherState.build (cognitive 17) lib/schedule/view/schedule_page/schedule_overlap_switcher.dart:52— _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 — 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.
ScheduleWeekDayData.ScheduleWeekDayData (cognitive 17) lib/schedule/view/schedule_page/schedule_week_day_data.dart:9— 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.
LessonFieldChangeChip._buildChangeContent (cognitive 17) lib/schedule_diff/widgets/lesson_field_change_chip.dart:58— 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.
_ServicesNfcCardState._activate (cognitive 17) lib/services/view/widgets/services_nfc_card.dart:58— _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.
AppScreenHeader.build (cognitive 17) packages/app_ui/lib/src/widgets/app_screen_header.dart:47— 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 — checks laid out side by side rather than stacked — 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.
_AppInputFieldState._build (cognitive 17) packages/app_ui/lib/src/widgets/forms/app_input_field.dart:218— _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 — 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.
_GalleryImageItemState._openImage (cognitive 17) packages/app_ui/lib/src/widgets/images_horizontal_slider.dart:77— _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.
NinjaStudyGroupMemberRow.build (cognitive 17) lib/study_group/view/ninja_study_group_member_row.dart:55— 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 — 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's 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.
TeacherDayContent.build (cognitive 17) lib/teacher_account/widgets/dashboard/teacher_day_content.dart:28— 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.
sync_communities.run (cognitive 17) tools/social_media_fetcher/sync_communities.py:75— 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.
app_store_build_status.get_release_status (cognitive 17) REDACTED:187— 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.
build_web.public_config (cognitive 17) tool/build_web.py:26— 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 — checks laid out side by side rather than stacked — 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.
ci_plan.workspace_graph (cognitive 17) tool/ci_plan.py:42— 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.
configure_firebase.release_config (cognitive 17) tool/configure_firebase.py:7— 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 — checks laid out side by side rather than stacked — 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.
import_shorebird_release.binary_identity (cognitive 17) tool/import_shorebird_release.py:321— 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.
UniversityProviderConfigurator.configure (cognitive 16) tool/src/university_provider_configurator.dart:30— 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 — 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.
UniversityProviderSource.parse (cognitive 16) tool/src/university_provider_source.dart:6— 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 — checks laid out side by side rather than stacked — 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.
RemotePreferenceSync._performRemoteRestore (cognitive 16) lib/common/bloc/remote_preference_sync.dart:42— 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.
NoteEditorCubit.persistLocalDraft (cognitive 16) lib/community/cubit/note_editor/note_editor_cubit.dart:244— 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.
EventsBody._content (cognitive 16) lib/community/view/events/events_body.dart:35— 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.
DrawingCanvasState._down (cognitive 16) lib/community/widgets/collab_notes/editor/drawing_canvas.dart:111— 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 — checks laid out side by side rather than stacked — 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.
FeedHeroPost.build (cognitive 16) lib/feed/widgets/feed_hero_post.dart:35— 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.
_KnowledgeBankViewState._download (cognitive 16) lib/knowledge_bank/view/knowledge_bank_view.dart:220— _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.
PreferencesMapDataCache._write (cognitive 16) lib/map/data/map_data_cache.dart:56— 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.
MapDataRepository.loadCatalog (cognitive 16) lib/map/data/map_data_repository.dart:272— 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.
MapDataRepository.loadSvg (cognitive 16) lib/map/data/map_data_repository.dart:670— 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.
_MapProposalReviewState._review (cognitive 16) lib/map/widgets/map_community_sheet.dart:358— _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.
MiniAppRunnerCubit._refreshScreen (cognitive 16) lib/mini_apps/cubit/mini_app_runner_cubit.dart:206— 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.
_AppActionsSheet.build (cognitive 16) lib/mini_apps/view/app_actions_sheet.dart:50— _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.
NfcPassCubit.confirmBinding (cognitive 16) lib/nfc_pass/bloc/nfc_pass_cubit.dart:142— 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.
NotificationsState.fromJson (cognitive 16) lib/notifications/cubit/notifications_cubit.dart:227— 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.
NotificationInboxSnapshot.fromJson (cognitive 16) lib/notifications/data/notification_inbox_repository.dart: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.
_PushHistoryListenerState._record (cognitive 16) lib/notifications/view/push_history_listener.dart:169— _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 — 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.
_OnboardingSettingsStepState.build (cognitive 16) lib/onboarding/widgets/onboarding_settings_step.dart:223— _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 — checks laid out side by side rather than stacked — 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.
_GroupLinkSheetState.build (cognitive 16) lib/people/widgets/group_space/group_link_sheet.dart:95— _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 — 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.
_ChangesPageState.build (cognitive 16) lib/schedule/view/changes/changes_page.dart:175— _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.
_GroupPickerSheetState.build (cognitive 16) lib/schedule/view/compare/widgets/group_picker_sheet.dart:59— _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.
_LessonMaterialUploadSheetState._pickImage (cognitive 16) lib/schedule/view/schedule_details_page/lesson_material_upload_sheet.dart:74— _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.
_AddScheduleResults.build (cognitive 16) lib/schedule_management/view/add_schedule_results.dart:9— _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.
_SearchSheetState.build (cognitive 16) lib/search/view/search_sheet.dart:229— _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.
_BannerAdContentState.build (cognitive 16) packages/ads_ui/lib/src/widgets/banner_ad_content.dart:105— _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.
NinjaBanner.build (cognitive 16) packages/app_ui/lib/src/ninja/surfaces/ninja_banner.dart:29— 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 — 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.
AppListRow.build (cognitive 16) packages/app_ui/lib/src/widgets/app_list_row.dart:42— 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 — 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.
SupabaseCollabNoteRealtimeSession._subscribe (cognitive 16) packages/campus_repository/lib/src/supabase_collab_note_realtime_session.dart:36— 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.
NetworkLocationClient.geolocate (cognitive 16) packages/network_location_client/lib/src/network_location_client.dart:54— 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.
TeacherDashboardScheduleSection.build (cognitive 16) lib/teacher_account/widgets/dashboard/teacher_dashboard_schedule_section.dart:35— 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 — checks laid out side by side rather than stacked — 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.
TopTopicsContent._content (cognitive 16) lib/top_discussions/view/top_topics_content.dart:22— 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 — checks laid out side by side rather than stacked — 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.
TelegramFetcher._convert_message_group_to_raw_data (cognitive 16) tools/social_media_fetcher/src/clients/telegram/client.py:300— 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.
ci_packages.run_packages (cognitive 16) tool/ci_packages.py:9— 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.
shorebird_provider_patch.prepare (cognitive 16) tool/shorebird_provider_patch.py:64— 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.
verify_campus_map_api._read_response (cognitive 16) tool/verify_campus_map_api.py:108— 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.
ScheduleWidgetEntryView.body (cognitive 16) ios/HomeWidget/ScheduleWidget.swift:215— 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.
index.Deno.serve() (cognitive 16) supabase/functions/miniapp-deploy/index.ts:19— 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.
Near-duplicate member pair (39 shared lines) lib/schedule/view/schedule_page/schedule_month_view.dart:322— lib/schedule/view/schedule_page/schedule_month_view.dart:322-410 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:191-264 — 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' grain — 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.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) packages/app_ui/lib/src/ninja/surfaces/ninja_list_cell.dart:106— 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 — 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 — 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' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. 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.
Duplicated block (33 lines × 2) lib/schedule_management/view/add_schedule_row_skeleton.dart:6— lib/schedule_management/view/add_schedule_row_skeleton.dart:6-38 | lib/schedule_management/view/hub_row_skeleton.dart:6-38 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (31–32 lines × 2) packages/rtu_mirea_schedule_api_client/lib/src/ical_custom_fields_registry.dart:58— 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 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (29 lines × 2) lib/people/widgets/people/ninja_friends_tab_skeleton.dart:32— lib/people/widgets/people/ninja_friends_tab_skeleton.dart:32-60 | lib/people/widgets/people/ninja_group_tab_skeleton.dart:56-84 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (22 lines × 2) lib/profile/widgets/edit_identity_sheet.dart:94— lib/profile/widgets/edit_identity_sheet.dart:94-115 | lib/profile/widgets/edit_profile_sheet.dart:110-131 — before extracting anything, compare `lib/profile/widgets/edit_identity_sheet.dart` and `lib/profile/widgets/edit_profile_sheet.dart` 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 — extracting one helper per block leaves the fork in place.
Duplicated block (19–20 lines × 2) lib/design_preview/pages/preview_services_page.dart:265— lib/design_preview/pages/preview_services_page.dart:265-283 | lib/services/view/services_view.dart:281-300 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (20 lines × 2) lib/friends/widgets/ninja_geo_sharing_toggle_row.dart:56— lib/friends/widgets/ninja_geo_sharing_toggle_row.dart:56-75 | lib/people/widgets/people/study_group_action_card.dart:46-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (19 lines × 3) wear/lib/schedule/view/schedule_empty_view.dart:33— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (18–19 lines × 2) packages/app_ui/lib/src/ninja/surfaces/ninja_display_header.dart:52— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17–18 lines × 2) packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart:71— packages/app_ui/lib/src/ninja/widgets/app_checkbox.dart:71-87 | packages/app_ui/lib/src/ninja/widgets/app_radio.dart:85-102 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15–17 lines × 2) lib/map/widgets/svg_interactive_map.dart:321— lib/map/widgets/svg_interactive_map.dart:321-335 | lib/map/widgets/svg_interactive_map.dart:364-380 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 3) wear/lib/schedule/view/schedule_empty_view.dart:9— 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 — 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 — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (13–15 lines × 2) lib/people/widgets/people/ninja_friends_tab.dart:111— lib/people/widgets/people/ninja_friends_tab.dart:111-125 | lib/people/widgets/people/ninja_study_group_tab.dart:129-141 — 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 — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14–15 lines × 2) packages/app_ui/lib/src/widgets/gamification/app_leaderboard_row.dart:54— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11–13 lines × 2) lib/schedule/view/schedule_page/schedule_month_view.dart:361— lib/schedule/view/schedule_page/schedule_month_view.dart:361-373 | packages/app_ui/lib/src/widgets/app_calendar_month.dart:224-234 — before extracting anything, compare `lib/schedule/view/schedule_page/schedule_month_view.dart` and `packages/app_ui/lib/src/widgets/app_calendar_month.dart` 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.
Duplicated block (12 lines × 3) lib/community/cubit/deadlines/deadlines_cubit.dart:96— 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 — there are 3 copies across 2 file(s) — 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.
Duplicated block (7–11 lines × 3) lib/article/cubit/followed_sources_cubit.dart:14— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (10–11 lines × 2) lib/knowledge_bank/view/knowledge_bank_view.dart:234— lib/knowledge_bank/view/knowledge_bank_view.dart:234-243 | lib/knowledge_bank/view/knowledge_bank_view.dart:272-282 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8–9 lines × 3) lib/map/bloc/map_bloc.dart:136— lib/map/bloc/map_bloc.dart:136-143 | lib/map/bloc/map_bloc.dart:284-291 | lib/map/bloc/map_bloc.dart:466-474 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–9 lines × 2) packages/app_ui/lib/src/widgets/mobile/app_chip_row.dart:152— 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 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 3) lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:119— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) lib/article/cubit/followed_sources_cubit.dart:8— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) lib/community/cubit/deadlines/deadlines_cubit.dart:256— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (5 lines × 5) lib/community/view/deadlines/add_deadline_sheet.dart:247— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (11 lines × 6) lib/community/view/deadlines_page.dart:11— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times.
Duplicated block (13 lines × 3) lib/lost_and_found/view/lost_found_page.dart:11— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (15–19 lines × 3) tools/social_media_fetcher/src/ingest_client.py:137— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
No DR/backup evidence — A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced — a volume that survives a container recreate is not a tested restore from catastrophic loss.
Duplication concentrated across 6 sibling directories (10 clone groups) supabase/functions/_shared/push_webhook.ts:40— 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 — 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's bar for an individually reported row — 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's 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 — a common library every sibling imports — 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.
R10 · Code Duplication· Duplicated block with local edits (20 matched lines × 2 locations) · ×1
Duplicated block with local edits (20 matched lines × 2 locations) supabase/functions/miniapp-svc-free-rooms/screens.ts:52— supabase/functions/miniapp-svc-free-rooms/screens.ts:52 · supabase/functions/miniapp-svc-free-rooms/screens.ts:94 — the two spans are one implementation copied and then locally edited — 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's 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 — 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.
R10 · Code Duplication· Duplicated block with local edits (19 matched lines × 2 locations) · ×1
Duplicated block with local edits (19 matched lines × 2 locations) supabase/functions/_shared/push_webhook.ts:40— supabase/functions/_shared/push_webhook.ts:40 · supabase/functions/miniapp-notify/index.ts:58 — the two spans are one implementation copied and then locally edited — 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's 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 — 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.
R10 · Code Duplication· Duplicated block with local edits (17 matched lines × 2 locations) · ×1
Duplicated block with local edits (17 matched lines × 2 locations) supabase/functions/miniapp-proxy/index.ts:404— supabase/functions/miniapp-proxy/index.ts:404 · supabase/functions/sync-telegram-feed/media.ts:139 — the two spans are one implementation copied and then locally edited — 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's 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 — 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.
Duplicated block (14 lines × 2 locations) supabase/functions/_shared/push_delivery_test.ts:108— supabase/functions/_shared/push_delivery_test.ts:108 · supabase/functions/_shared/push_delivery_test.ts:148 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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.
R10 · Code Duplication· Duplicated block with local edits (14 matched lines × 2 locations) · ×1
Duplicated block with local edits (14 matched lines × 2 locations) supabase/functions/_shared/push_webhook.ts:142— supabase/functions/_shared/push_webhook.ts:142 · supabase/functions/miniapp-notify/index.ts:200 — the two spans are one implementation copied and then locally edited — 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's 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 — 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.
Duplicated block (11 lines × 4 locations) supabase/functions/miniapp-notify/index_test.ts:134— supabase/functions/miniapp-notify/index_test.ts:134 · supabase/functions/miniapp-notify/index_test.ts:153 · supabase/functions/miniapp-notify/index_test.ts:313 · supabase/functions/miniapp-notify/index_test.ts:332 — all 4 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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.
R10 · Code Duplication· Duplicated block with local edits (10 matched lines × 2 locations) · ×1
Duplicated block with local edits (10 matched lines × 2 locations) supabase/functions/_shared/push_delivery.ts:84— supabase/functions/_shared/push_delivery.ts:84 · supabase/functions/miniapp-notify/index.ts:45 — the two spans are one implementation copied and then locally edited — 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's 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 — 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.
Duplicated block (10 lines × 2 locations) supabase/functions/miniapp-proxy/index.ts:189— supabase/functions/miniapp-proxy/index.ts:189 · supabase/functions/miniapp-proxy/index.ts:235 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — 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 — the whole function, component or branch these lines sit in — 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.
Complex function (anonymous) (cyclomatic 50, cognitive 47) supabase/functions/miniapp-notify/index.ts:60— (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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 47, cognitive 50) supabase/functions/_shared/push_webhook.ts:42— (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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 45, cognitive 51) supabase/functions/miniapp-proxy/index.ts:50— (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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 38, cognitive 34) supabase/functions/ingest/community.ts:22— (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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function requireIngestKey (cyclomatic 24, cognitive 28) supabase/functions/ingest/auth.ts:79— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 22, cognitive 25) supabase/functions/ingest/index.ts:131— (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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function validatePayload (cyclomatic 21, cognitive 20) supabase/functions/ingest/payload.ts:36— 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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 20, cognitive 19) supabase/functions/miniapp-deploy/index.ts: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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function mirror (cyclomatic 18, cognitive 24) supabase/functions/sync-telegram-feed/media.ts:54— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 18, cognitive 17) supabase/functions/moderate-content/index.ts:46— (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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function resolveIngestKey (cyclomatic 15, cognitive 19) supabase/functions/ingest/auth.ts:44— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function identityHeaders (cyclomatic 14, cognitive 15) supabase/functions/miniapp-proxy/index.ts:321— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function collectPosts (cyclomatic 14, cognitive 15) supabase/functions/sync-telegram-feed/collect.ts:7— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 14, cognitive 13) supabase/functions/sync-telegram-feed/index.ts:209— (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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function download (cyclomatic 14, cognitive 12) supabase/functions/sync-telegram-feed/media.ts:121— 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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 13, cognitive 18) tools/schedule_relay/upstream_proxy.mjs:8— (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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function syncChannel (cyclomatic 12, cognitive 16) supabase/functions/sync-telegram-feed/index.ts:110— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (anonymous) (cyclomatic 12, cognitive 11) web/firebase-messaging-sw.js:1— (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 — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function readBoundedJson (cyclomatic 11, cognitive 14) supabase/functions/_shared/request_body.ts:7— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function ingestAuthScope (cyclomatic 11, cognitive 12) supabase/functions/ingest/auth.ts:23— 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 — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· supabase/functions/miniapp-notify/index_test.ts · ×1
supabase/functions/miniapp-notify/index_test.ts: 422 lines of code supabase/functions/miniapp-notify/index_test.ts:1— supabase/functions/miniapp-notify/index_test.ts has 422 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· supabase/functions/miniapp-proxy/index.ts · ×1
supabase/functions/miniapp-proxy/index.ts: 406 lines of code supabase/functions/miniapp-proxy/index.ts:1— supabase/functions/miniapp-proxy/index.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
Dead file (~448 LoC) supabase/functions/miniapp-notify/index_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~408 LoC) supabase/functions/_shared/push_delivery_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~282 LoC) supabase/functions/ingest/auth_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~224 LoC) supabase/functions/miniapp-notify/cns_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~222 LoC) supabase/functions/sync-telegram-feed/media_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~90 LoC) supabase/functions/ingest/sync_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~79 LoC) supabase/functions/ingest/community_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~73 LoC) supabase/functions/ingest/story_media_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~70 LoC) supabase/functions/_shared/request_body_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~64 LoC) supabase/functions/miniapp-svc-free-rooms/screens_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~56 LoC) supabase/functions/sync-telegram-feed/blocks_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~41 LoC) supabase/functions/sync-telegram-feed/collect_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~40 LoC) supabase/functions/app-push/cns_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~30 LoC) supabase/functions/ingest/test_assertions.ts— 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) — 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
Dead file (~25 LoC) supabase/functions/sync-telegram-feed/telegram_test.ts— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~16 LoC) tools/schedule_relay/local_proxy.mjs— 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 — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~1 LoC) supabase/functions/app-push/cns.ts— 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) — 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
Swallowed exception (empty catch) lib/app/widgets/local_notification_listener.dart:84— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
README/code drift README.md:77— README.md names `google-services.json`, but no file or folder `google-services.json` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/shorebird-releases.md:7— docs/shorebird-releases.md names `release-manifest.json`, but no file or folder `release-manifest.json` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/guide/publishing.md:43— docs/mini-apps/guide/publishing.md links to `/reference/http-api`, but `reference/http-api` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/guide/publishing.md:49— docs/mini-apps/guide/publishing.md links to `/reference/backend`, but `reference/backend` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/guide/quickstart.md:49— docs/mini-apps/guide/quickstart.md links to `/reference/state-storage`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/guide/quickstart.md:57— docs/mini-apps/guide/quickstart.md links to `/reference/actions#openpage`, but `reference/actions` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/guide/quickstart.md:61— docs/mini-apps/guide/quickstart.md links to `/reference/widgets`, but `reference/widgets` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/guide/quickstart.md:63— docs/mini-apps/guide/quickstart.md links to `/reference/deeplinks`, but `reference/deeplinks` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/actions.md:14— docs/mini-apps/reference/actions.md links to `/reference/deeplinks`, but `reference/deeplinks` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/actions.md:97— docs/mini-apps/reference/actions.md links to `/reference/state-storage#setstate`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/actions.md:98— docs/mini-apps/reference/actions.md links to `/reference/logic`, but `reference/logic` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/actions.md:226— docs/mini-apps/reference/actions.md links to `/reference/backend`, but `reference/backend` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/backend.md:8— docs/mini-apps/reference/backend.md links to `/reference/yandex-deploy`, but `reference/yandex-deploy` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/backend.md:14— docs/mini-apps/reference/backend.md links to `/diagrams/proxy-flow.svg`, but `diagrams/proxy-flow.svg` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/backend.md:43— docs/mini-apps/reference/backend.md links to `/guide/publishing`, but `guide/publishing` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/backend.md:156— docs/mini-apps/reference/backend.md links to `/diagrams/service-flow.svg`, but `diagrams/service-flow.svg` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/deeplinks.md:36— docs/mini-apps/reference/deeplinks.md links to `/reference/actions#opendeeplink`, but `reference/actions` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/http-api.md:63— docs/mini-apps/reference/http-api.md links to `/guide/publishing#разрешения-на-данные`, but `guide/publishing` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/logic.md:140— docs/mini-apps/reference/logic.md links to `/reference/actions#fetch`, but `reference/actions` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/logic.md:198— docs/mini-apps/reference/logic.md links to `/reference/state-storage#setstate`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/state-storage.md:29— docs/mini-apps/reference/state-storage.md links to `/reference/logic`, but `reference/logic` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/widgets.md:9— docs/mini-apps/reference/widgets.md links to `/reference/http-api`, but `reference/http-api` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/widgets.md:196— docs/mini-apps/reference/widgets.md links to `/reference/state-storage#setstate`, but `reference/state-storage` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/yandex-deploy.md:4— docs/mini-apps/reference/yandex-deploy.md links to `/reference/backend`, but `reference/backend` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/mini-apps/reference/yandex-deploy.md:174— docs/mini-apps/reference/yandex-deploy.md names `spec.yaml`, but no file or folder `spec.yaml` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Duplicated predicate lib/feed/view/story_viewer/story_slide.dart:41— `!MediaQuery.disableAnimationsOf(context) && !MediaQuery.accessibleNavigationOf(context)` appears character-identically in 4 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate packages/app_ui/lib/src/widgets/app_spinner.dart:36— `!MediaQuery.disableAnimationsOf(context) && !MediaQuery.accessibleNavigationOf(context) && TickerMode.valuesOf(context).enabled` appears character-identically in 2 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/app/view/app.dart:53— `!kIsWeb && (defaultTargetPlatform == .android || defaultTargetPlatform == .iOS)` appears character-identically in 3 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/nfc_pass/widgets/nfc_card_background.dart:60— `!mounted || !identical(_controller, controller)` appears character-identically in 2 files — lib/nfc_pass/widgets/nfc_card_background.dart, lib/nfc_pass/widgets/nfc_video_preview.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/profile/widgets/edit_identity_sheet.dart:120— `!mounted || request != _request || _handle.text.trim() != handle` appears character-identically in 2 files — lib/profile/widgets/edit_identity_sheet.dart, lib/profile/widgets/edit_profile_sheet.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/login/bloc/login_bloc.dart:69— `!state.isValid || state.status.isInProgress` appears character-identically in 2 files — lib/login/bloc/login_bloc.dart, lib/login/bloc/sign_up_bloc.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/map/widgets/map_cartographic_layer.dart:281— `'Лестница' || 'Лифт' || 'Пандус' || 'Эскалатор'` appears character-identically in 2 files — lib/map/widgets/map_cartographic_layer.dart, lib/map/widgets/map_volume_layer.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/community/widgets/collab_notes/editor/note_link_sheet.dart:116— `(uri.scheme == 'https' || uri.scheme == 'http') && uri.host.isNotEmpty && uri.userInfo.isEmpty` appears character-identically in 2 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/community/services/note_pdf_export.dart:187— `(uri.scheme == 'mailto' || uri.scheme == 'tel') && uri.path.isNotEmpty` appears character-identically in 2 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/notifications/view/push_history_listener.dart:143— `AppLifecycleState.inactive || AppLifecycleState.hidden || AppLifecycleState.paused || AppLifecycleState.detached` appears character-identically in 2 files — lib/notifications/view/push_history_listener.dart, lib/promo/cubit/promo_dismissals_cubit.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/friends/view/friends_map_view.dart:96— `FriendsLocationStatus.permissionDenied || FriendsLocationStatus.permissionDeniedForever || FriendsLocationStatus.failure` appears character-identically in 2 files — lib/friends/view/friends_map_view.dart, lib/friends/widgets/ninja_geo_sharing_sheet.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/common/media_viewer/media_viewer_page.dart:31— `MediaQuery.disableAnimationsOf(context) || MediaQuery.accessibleNavigationOf(context)` appears character-identically in 57 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/services/data/services_directory.dart:99— `NfcPassAvailability.isSupported && config.isEnabled(.nfcPass)` appears character-identically in 2 files — lib/services/data/services_directory.dart, lib/services/view/services_view.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/friends/widgets/ninja_geo_sharing_sheet.dart:141— `TargetPlatform.fuchsia || TargetPlatform.linux || TargetPlatform.macOS || TargetPlatform.windows` appears character-identically in 2 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/map/widgets/map_contribution_form.dart:275— `_busy || !widget.repository.isAuthenticated` appears character-identically in 2 files — lib/map/widgets/map_contribution_form.dart, lib/map/widgets/map_graph_editor_page.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/community/models/events_filter.dart:20— `a.year == b.year && a.month == b.month && a.day == b.day` appears character-identically in 6 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/article/widgets/article_html.dart:70— `anchor != null && anchor.localName != 'a'` appears character-identically in 2 files — lib/article/widgets/article_html.dart, lib/article/widgets/article_media.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/people/cubit/group_space/group_space_cubit.dart:286— `announcement != null && announcement.id == postId` appears character-identically in 2 files — lib/people/cubit/group_space/group_space_cubit.dart, lib/people/view/group_space_view.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/login/view/login_page_form.dart:76— `bloc.state.isValid && !bloc.state.status.isInProgress` appears character-identically in 2 files — lib/login/view/login_page_form.dart, lib/login/view/sign_up_page.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate packages/news_blocks_ui/lib/src/post_large/post_large.dart:36— `block.hasNavigationAction && action != null` appears character-identically in 2 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/knowledge_bank/widgets/material_batch_upload_sheet.dart:90— `bytes.isEmpty || bytes.length > _kMaxUploadBytes` appears character-identically in 2 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/schedule/view/schedule_details_page/lesson_details_body.dart:203— `change.oldValue.start != null || change.newValue.start != null` appears character-identically in 2 files — 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's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/home/view/widgets/hero/hero_done.dart:47— `constraints.maxWidth < 280 || MediaQuery.textScalerOf(context).scale(1) > 1.3` appears character-identically in 2 files — lib/home/view/widgets/hero/hero_done.dart, lib/home/view/widgets/home_lessons_group.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/communities/view/community_detail_page.dart:231— `constraints.maxWidth < 300 || MediaQuery.textScalerOf(context).scale(1) > 1.4` appears character-identically in 2 files — lib/communities/view/community_detail_page.dart, lib/schedule/view/compare/widgets/comparison_day_details.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/communities/view/community_detail_page.dart:131— `constraints.maxWidth < 320 || MediaQuery.textScalerOf(context).scale(1) > 1.4` appears character-identically in 2 files — lib/communities/view/community_detail_page.dart, lib/schedule/view/teacher_profile_page.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Documentation: no contributor guidance README.md— No guidance for contributors in the visible content; only CI and analysis links are present. Add a CONTRIBUTING doc covering pull request/merge process, test runs, and how to add new tenants.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` 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 (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — 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 `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
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 `(repository root)` (139900 LoC, 1493 module-visible types across 239 directories). Review these for cohesion — 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.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 1 of 839 analysed file(s) have no living knowledge left — 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 and example/demo trees and test files identified by path convention, largest first; 839 of the 2668 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 — 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.
Orphaned file ios/HomeWidget/HomeWidget.swift:1— 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.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.
Logging is not universal — Only 2/9 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `ios`, `macos`, `packages/web_oauth_interceptor_client/example`, `packages/web_oauth_interceptor_client/example/ios` and 2 more.
No SAST — No static application security testing detected. For this repository's stack, add the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 158129 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's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
Hand-rolled JSON/XML parsing via regex tools/social_media_fetcher/src/news_blocks/adapters/official_news_adapter.py:84— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` 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.
Silent fallback default on parse failure tools/social_media_fetcher/src/runtime_health.py:37— `_read` returns `{}` when `(OSError, ValueError)` is raised, with no log or raise — 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.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 5 file(s) — `docs/mini-apps/.vitepress/theme/index.ts`, `ios/HomeWidget/HomeWidget.swift`, `tools/social_media_fetcher/src/clients/telegram/stories.py`, `tools/social_media_fetcher/src/community_metadata.py`, `tools/social_media_fetcher/worker.py` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a16224-8f14-7884-86c8-532a69bf85c7 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 24 · Warnings: 1063 · Recommendations: 69 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 22-10-2026 @ 05:45 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.