Public report of raphamorim/rio, published 27 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). Assert 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, 27 October 2026, 13:21 UTC · Survey ID cd_e1b6c9430bcf48b9bb1c884e626705df
raphamorim/rio
Measured 27 October 2026, 13:19 UTC, at code version ec9ca50
Regression: 1 dimension fell since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreStrong
CriticalWeakAdequateStrongExemplary
Up 2 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: 179,671 lines of product code in 17 projects, tests not counted · Estimated rebuild effort: about 1.6 person-years · Weakest lens: Production Readiness, 64
Findings by how serious they are
40 critical800 serious86 minor
15 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
27 October 2026, 13:19 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.
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 ▸
61of 61 dimensions measured by tools.
883of 926 findings point to an exact file and line, so you can open each one in the code. The other 43 concern the repository as a whole, such as missing documentation.
61dimensions across 7 lenses, read from 179,671 lines of product code in 17 projects.
raphamorim/rio meets our standard for a preview release. It scores 68 out of 100 and is rated Strong, and 37 of its 40 critical findings are security problems.
Every lens scores high enough to be rated Strong, so no single lens holds the score back. The best first step is improving the documentation, worth about 3 points. Recording design decisions comes next, also worth about 3.
Thirty pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Four secrets can leak from the build pipeline, and two pipeline steps put outside input straight into a shell command, so an attacker can run commands in the build pipeline. Pinning each tool to an exact version, limiting each secret to its own step and passing outside input through environment variables would close these risks. The password or key in the code's history needs replacing, with the old one switched off. The three sets of files in separate parts that keep changing together need that dependency made explicit.
The product code is 179,671 lines, about €230,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.
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: 8 findings
These 8 critical or serious findings were in the previous survey, on 13 October 2026, and are gone from this one.
€76,000 to €380,000, for 1,272 to 4,035 hours of work, about 1.6 person-years for 1 to 3 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.9 at a score of 68. 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: 179,671 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
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 Documentation finding(s) in Documentation Quality — start with README.md.
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 3 points · Low effort · ADR Quality
3
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.
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 €230,000 to build again, about 1.6 person-years of work. Its weakest lens is Production Readiness, at 64 (Adequate). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Documentation finding(s) in Documentation Quality. Of all the actions in this report, it raises the score most for the work it takes: about 3 points for low effort, because it clears the 1 Documentation 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.4 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 27,702 lines over the last 90 days, which is about 112,347 lines a year. At that pace, the extra work comes to an estimated 5.6 to 37.4 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, never less than 2% to 5% and never more than 40% to 60% in all; 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, which only happens where the projects form a dependency cycle. A graph without cycles 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.
381 modules, with 1153 dependencies between them. 6 loops run through 137 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 341 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.
corcovado.poll uses corcovado.token, so a change to corcovado.token can break corcovado.poll, while a change to corcovado.poll can't break corcovado.token.
Position
Below the diagonal: corcovado.poll uses a module listed above it, which is the healthy direction.
7→9 corcovado.poll uses corcovado.event_imppart of a loop✕
Connections
17 pairs of types, where a type in corcovado.poll uses a type in corcovado.event_imp.
corcovado.poll uses corcovado.event_imp, so a change to corcovado.event_imp can break corcovado.poll, while a change to corcovado.poll can't break corcovado.event_imp.
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.
rio_vt.config.colors uses rio_graphics, so a change to rio_graphics can break rio_vt.config.colors, while a change to rio_vt.config.colors can't break rio_graphics.
Position
Below the diagonal: rio_vt.config.colors uses a module listed above it, which is the healthy direction.
corcovado.event_imp uses corcovado.token, so a change to corcovado.token can break corcovado.event_imp, while a change to corcovado.event_imp can't break corcovado.token.
Position
Below the diagonal: corcovado.event_imp uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in corcovado.event_imp uses a type in corcovado.poll.
The types involved
corcovado.event_imp.Evented → corcovado.poll.Poll
Direction
corcovado.event_imp uses corcovado.poll, so a change to corcovado.poll can break corcovado.event_imp, while a change to corcovado.event_imp can't break corcovado.poll.
Position
Below the diagonal: corcovado.event_imp uses a module listed above it, which is the healthy direction.
rio_backend.config.theme uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rio_backend.config.theme, while a change to rio_backend.config.theme can't break rio_vt.config.colors.
Position
Below the diagonal: rio_backend.config.theme uses a module listed above it, which is the healthy direction.
rio_vt.ansi.sixel uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rio_vt.ansi.sixel, while a change to rio_vt.ansi.sixel can't break rio_vt.config.colors.
Position
Below the diagonal: rio_vt.ansi.sixel uses a module listed above it, which is the healthy direction.
rio_vt.crosswords.style uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rio_vt.crosswords.style, while a change to rio_vt.crosswords.style can't break rio_vt.config.colors.
Position
Below the diagonal: rio_vt.crosswords.style uses a module listed above it, which is the healthy direction.
corcovado.channel uses corcovado.token, so a change to corcovado.token can break corcovado.channel, while a change to corcovado.channel can't break corcovado.token.
Position
Below the diagonal: corcovado.channel uses a module listed above it, which is the healthy direction.
corcovado.channel uses corcovado.poll, so a change to corcovado.poll can break corcovado.channel, while a change to corcovado.channel can't break corcovado.poll.
Position
Below the diagonal: corcovado.channel uses a module listed above it, which is the healthy direction.
corcovado.channel uses corcovado.event_imp, so a change to corcovado.event_imp can break corcovado.channel, while a change to corcovado.channel can't break corcovado.event_imp.
Position
Below the diagonal: corcovado.channel uses a module listed above it, which is the healthy direction.
corcovado.channel uses rio_vt.ansi.sixel, so a change to rio_vt.ansi.sixel can break corcovado.channel, while a change to corcovado.channel can't break rio_vt.ansi.sixel.
Position
Below the diagonal: corcovado.channel uses a module listed above it, which is the healthy direction.
rio_vt.crosswords.pos uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break rio_vt.crosswords.pos, while a change to rio_vt.crosswords.pos can't break rio_vt.crosswords.style.
Position
Below the diagonal: rio_vt.crosswords.pos uses a module listed above it, which is the healthy direction.
rioterm.context.renderable uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break rioterm.context.renderable, while a change to rioterm.context.renderable can't break rio_vt.crosswords.style.
Position
Below the diagonal: rioterm.context.renderable uses a module listed above it, which is the healthy direction.
rioterm.context.renderable uses rio_vt.crosswords.pos, so a change to rio_vt.crosswords.pos can break rioterm.context.renderable, while a change to rioterm.context.renderable can't break rio_vt.crosswords.pos.
Position
Below the diagonal: rioterm.context.renderable uses a module listed above it, which is the healthy direction.
15→21 rioterm.context.renderable uses rio_backend.configpart of a loop✕
Connections
1 pair of types, where a type in rioterm.context.renderable uses a type in rio_backend.config.
rioterm.context.renderable uses rio_backend.config, so a change to rio_backend.config can break rioterm.context.renderable, while a change to rioterm.context.renderable can't break rio_backend.config.
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.
15→27 rioterm.context.renderable uses rio_vt.eventpart of a loop✕
Connections
2 pairs of types, where a type in rioterm.context.renderable uses a type in rio_vt.event.
rioterm.context.renderable uses rio_vt.event, so a change to rio_vt.event can break rioterm.context.renderable, while a change to rioterm.context.renderable can't break rio_vt.event.
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.
rio_window.platform_impl.web.cursor uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.web.cursor uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.cursor uses corcovado.poll, so a change to corcovado.poll can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break corcovado.poll.
Position
Below the diagonal: rio_window.platform_impl.web.cursor uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.cursor uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break rio_vt.crosswords.style.
Position
Below the diagonal: rio_window.platform_impl.web.cursor uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.cursor uses corcovado.channel, so a change to corcovado.channel can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break corcovado.channel.
Position
Below the diagonal: rio_window.platform_impl.web.cursor uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.cursor uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break rioterm.context.renderable.
Position
Below the diagonal: rio_window.platform_impl.web.cursor uses a module listed above it, which is the healthy direction.
16→22 rio_window.platform_impl.web.cursor uses rioterm.contextpart of a loop✕
Connections
1 pair of types, where a type in rio_window.platform_impl.web.cursor uses a type in rioterm.context.
rio_window.platform_impl.web.cursor uses rioterm.context, so a change to rioterm.context can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break rioterm.context.
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.
16→23 rio_window.platform_impl.web.cursor uses rio_window.platform.webpart of a loop✕
Connections
3 pairs of types, where a type in rio_window.platform_impl.web.cursor uses a type in rio_window.platform.web.
rio_window.platform_impl.web.cursor uses rio_window.platform.web, so a change to rio_window.platform.web can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break rio_window.platform.web.
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.
16→24 rio_window.platform_impl.web.cursor uses rio_window.cursorpart of a loop✕
Connections
4 pairs of types, where a type in rio_window.platform_impl.web.cursor uses a type in rio_window.cursor.
rio_window.platform_impl.web.cursor uses rio_window.cursor, so a change to rio_window.cursor can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break rio_window.cursor.
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.
16→26 rio_window.platform_impl.web.cursor uses rio_window.event_looppart of a loop✕
Connections
1 pair of types, where a type in rio_window.platform_impl.web.cursor uses a type in rio_window.event_loop.
rio_window.platform_impl.web.cursor uses rio_window.event_loop, so a change to rio_window.event_loop can break rio_window.platform_impl.web.cursor, while a change to rio_window.platform_impl.web.cursor can't break rio_window.event_loop.
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.
sugarloaf.font uses rio_fonts.nerd_font, so a change to rio_fonts.nerd_font can break sugarloaf.font, while a change to sugarloaf.font can't break rio_fonts.nerd_font.
Position
Below the diagonal: sugarloaf.font uses a module listed above it, which is the healthy direction.
sugarloaf.font uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break sugarloaf.font, while a change to sugarloaf.font can't break rio_vt.crosswords.style.
Position
Below the diagonal: sugarloaf.font uses a module listed above it, which is the healthy direction.
sugarloaf.font uses rio_window.platform_impl.web.cursor, so a change to rio_window.platform_impl.web.cursor can break sugarloaf.font, while a change to sugarloaf.font can't break rio_window.platform_impl.web.cursor.
Position
Below the diagonal: sugarloaf.font uses a module listed above it, which is the healthy direction.
rio_grid uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rio_grid, while a change to rio_grid can't break rio_vt.config.colors.
Position
Below the diagonal: rio_grid uses a module listed above it, which is the healthy direction.
rio_grid uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break rio_grid, while a change to rio_grid can't break rio_vt.crosswords.style.
Position
Below the diagonal: rio_grid uses a module listed above it, which is the healthy direction.
rio_grid uses rio_vt.crosswords.pos, so a change to rio_vt.crosswords.pos can break rio_grid, while a change to rio_grid can't break rio_vt.crosswords.pos.
Position
Below the diagonal: rio_grid uses a module listed above it, which is the healthy direction.
sugarloaf.sugarloaf uses rio_backend.config.window, so a change to rio_backend.config.window can break sugarloaf.sugarloaf, while a change to sugarloaf.sugarloaf can't break rio_backend.config.window.
Position
Below the diagonal: sugarloaf.sugarloaf uses a module listed above it, which is the healthy direction.
sugarloaf.sugarloaf uses rio_graphics, so a change to rio_graphics can break sugarloaf.sugarloaf, while a change to sugarloaf.sugarloaf can't break rio_graphics.
Position
Below the diagonal: sugarloaf.sugarloaf uses a module listed above it, which is the healthy direction.
sugarloaf.sugarloaf uses sugarloaf.font, so a change to sugarloaf.font can break sugarloaf.sugarloaf, while a change to sugarloaf.sugarloaf can't break sugarloaf.font.
Position
Below the diagonal: sugarloaf.sugarloaf uses a module listed above it, which is the healthy direction.
19→20 sugarloaf.sugarloaf uses rioterm.rendererpart of a loop✕
Connections
1 pair of types, where a type in sugarloaf.sugarloaf uses a type in rioterm.renderer.
sugarloaf.sugarloaf uses rioterm.renderer, so a change to rioterm.renderer can break sugarloaf.sugarloaf, while a change to sugarloaf.sugarloaf can't break rioterm.renderer.
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.
19→22 sugarloaf.sugarloaf uses rioterm.contextpart of a loop✕
Connections
1 pair of types, where a type in sugarloaf.sugarloaf uses a type in rioterm.context.
sugarloaf.sugarloaf uses rioterm.context, so a change to rioterm.context can break sugarloaf.sugarloaf, while a change to sugarloaf.sugarloaf can't break rioterm.context.
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.
rioterm.renderer uses rio_graphics, so a change to rio_graphics can break rioterm.renderer, while a change to rioterm.renderer can't break rio_graphics.
Position
Below the diagonal: rioterm.renderer uses a module listed above it, which is the healthy direction.
rioterm.renderer uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rioterm.renderer, while a change to rioterm.renderer can't break rio_vt.config.colors.
Position
Below the diagonal: rioterm.renderer uses a module listed above it, which is the healthy direction.
rioterm.renderer uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break rioterm.renderer, while a change to rioterm.renderer can't break rio_vt.crosswords.style.
Position
Below the diagonal: rioterm.renderer uses a module listed above it, which is the healthy direction.
rioterm.renderer uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rioterm.renderer, while a change to rioterm.renderer can't break rioterm.context.renderable.
Position
Below the diagonal: rioterm.renderer uses a module listed above it, which is the healthy direction.
rioterm.renderer uses sugarloaf.sugarloaf, so a change to sugarloaf.sugarloaf can break rioterm.renderer, while a change to rioterm.renderer can't break sugarloaf.sugarloaf.
Position
Below the diagonal: rioterm.renderer uses a module listed above it, which is the healthy direction.
20→21 rioterm.renderer uses rio_backend.configpart of a loop✕
Connections
2 pairs of types, where a type in rioterm.renderer uses a type in rio_backend.config.
rioterm.renderer uses rio_backend.config, so a change to rio_backend.config can break rioterm.renderer, while a change to rioterm.renderer can't break rio_backend.config.
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.
20→22 rioterm.renderer uses rioterm.contextpart of a loop✕
Connections
1 pair of types, where a type in rioterm.renderer uses a type in rioterm.context.
rioterm.renderer uses rioterm.context, so a change to rioterm.context can break rioterm.renderer, while a change to rioterm.renderer can't break rioterm.context.
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.
rio_backend.config uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_backend.config, while a change to rio_backend.config can't break rio_backend.config.window.
Position
Below the diagonal: rio_backend.config uses a module listed above it, which is the healthy direction.
rio_backend.config uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rio_backend.config, while a change to rio_backend.config can't break rio_vt.config.colors.
Position
Below the diagonal: rio_backend.config uses a module listed above it, which is the healthy direction.
rio_backend.config uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_backend.config, while a change to rio_backend.config can't break rio_backend.config.theme.
Position
Below the diagonal: rio_backend.config uses a module listed above it, which is the healthy direction.
rio_backend.config uses rioterm.renderer, so a change to rioterm.renderer can break rio_backend.config, while a change to rio_backend.config can't break rioterm.renderer.
Position
Below the diagonal: rio_backend.config uses a module listed above it, which is the healthy direction.
rioterm.context uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rioterm.context, while a change to rioterm.context can't break rioterm.context.renderable.
Position
Below the diagonal: rioterm.context uses a module listed above it, which is the healthy direction.
rioterm.context uses sugarloaf.sugarloaf, so a change to sugarloaf.sugarloaf can break rioterm.context, while a change to rioterm.context can't break sugarloaf.sugarloaf.
Position
Below the diagonal: rioterm.context uses a module listed above it, which is the healthy direction.
rioterm.context uses rio_backend.config, so a change to rio_backend.config can break rioterm.context, while a change to rioterm.context can't break rio_backend.config.
Position
Below the diagonal: rioterm.context uses a module listed above it, which is the healthy direction.
22→27 rioterm.context uses rio_vt.eventpart of a loop✕
Connections
2 pairs of types, where a type in rioterm.context uses a type in rio_vt.event.
rio_window.platform.web uses corcovado.poll, so a change to corcovado.poll can break rio_window.platform.web, while a change to rio_window.platform.web can't break corcovado.poll.
Position
Below the diagonal: rio_window.platform.web uses a module listed above it, which is the healthy direction.
rio_window.platform.web uses rio_vt.ansi.sixel, so a change to rio_vt.ansi.sixel can break rio_window.platform.web, while a change to rio_window.platform.web can't break rio_vt.ansi.sixel.
Position
Below the diagonal: rio_window.platform.web uses a module listed above it, which is the healthy direction.
rio_window.platform.web uses rioterm.context, so a change to rioterm.context can break rio_window.platform.web, while a change to rio_window.platform.web can't break rioterm.context.
Position
Below the diagonal: rio_window.platform.web uses a module listed above it, which is the healthy direction.
23→24 rio_window.platform.web uses rio_window.cursorpart of a loop✕
Connections
3 pairs of types, where a type in rio_window.platform.web uses a type in rio_window.cursor.
rio_window.platform.web uses rio_window.cursor, so a change to rio_window.cursor can break rio_window.platform.web, while a change to rio_window.platform.web can't break rio_window.cursor.
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.
rio_window.cursor uses rio_vt.ansi.sixel, so a change to rio_vt.ansi.sixel can break rio_window.cursor, while a change to rio_window.cursor can't break rio_vt.ansi.sixel.
Position
Below the diagonal: rio_window.cursor uses a module listed above it, which is the healthy direction.
rio_window.cursor uses rio_window.platform.web, so a change to rio_window.platform.web can break rio_window.cursor, while a change to rio_window.cursor can't break rio_window.platform.web.
Position
Below the diagonal: rio_window.cursor uses a module listed above it, which is the healthy direction.
24→29 rio_window.cursor uses rio_window.platform_impl.linuxpart of a loop✕
Connections
1 pair of types, where a type in rio_window.cursor uses a type in rio_window.platform_impl.linux.
rio_window.cursor uses rio_window.platform_impl.linux, so a change to rio_window.platform_impl.linux can break rio_window.cursor, while a change to rio_window.cursor can't break rio_window.platform_impl.linux.
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.
rio_window.window uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.window, while a change to rio_window.window can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.window uses a module listed above it, which is the healthy direction.
rio_window.window uses rio_fonts.nerd_font, so a change to rio_fonts.nerd_font can break rio_window.window, while a change to rio_window.window can't break rio_fonts.nerd_font.
Position
Below the diagonal: rio_window.window uses a module listed above it, which is the healthy direction.
rio_window.window uses rio_graphics, so a change to rio_graphics can break rio_window.window, while a change to rio_window.window can't break rio_graphics.
Position
Below the diagonal: rio_window.window uses a module listed above it, which is the healthy direction.
rio_window.window uses rio_window.monitor, so a change to rio_window.monitor can break rio_window.window, while a change to rio_window.window can't break rio_window.monitor.
Position
Below the diagonal: rio_window.window uses a module listed above it, which is the healthy direction.
rio_window.window uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_window.window, while a change to rio_window.window can't break rio_backend.config.theme.
Position
Below the diagonal: rio_window.window uses a module listed above it, which is the healthy direction.
rio_window.window uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rio_window.window, while a change to rio_window.window can't break rioterm.context.renderable.
Position
Below the diagonal: rio_window.window uses a module listed above it, which is the healthy direction.
rio_window.window uses rio_window.platform.web, so a change to rio_window.platform.web can break rio_window.window, while a change to rio_window.window can't break rio_window.platform.web.
Position
Below the diagonal: rio_window.window uses a module listed above it, which is the healthy direction.
25→27 rio_window.window uses rio_vt.eventpart of a loop✕
Connections
2 pairs of types, where a type in rio_window.window uses a type in rio_vt.event.
rio_window.window uses rio_vt.event, so a change to rio_vt.event can break rio_window.window, while a change to rio_window.window can't break rio_vt.event.
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.
25→29 rio_window.window uses rio_window.platform_impl.linuxpart of a loop✕
Connections
1 pair of types, where a type in rio_window.window uses a type in rio_window.platform_impl.linux.
rio_window.window uses rio_window.platform_impl.linux, so a change to rio_window.platform_impl.linux can break rio_window.window, while a change to rio_window.window can't break rio_window.platform_impl.linux.
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.
rio_window.event_loop uses rio_window.monitor, so a change to rio_window.monitor can break rio_window.event_loop, while a change to rio_window.event_loop can't break rio_window.monitor.
Position
Below the diagonal: rio_window.event_loop uses a module listed above it, which is the healthy direction.
rio_window.event_loop uses corcovado.event_imp, so a change to corcovado.event_imp can break rio_window.event_loop, while a change to rio_window.event_loop can't break corcovado.event_imp.
Position
Below the diagonal: rio_window.event_loop uses a module listed above it, which is the healthy direction.
rio_window.event_loop uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_window.event_loop, while a change to rio_window.event_loop can't break rio_backend.config.theme.
Position
Below the diagonal: rio_window.event_loop uses a module listed above it, which is the healthy direction.
rio_window.event_loop uses rio_vt.ansi.sixel, so a change to rio_vt.ansi.sixel can break rio_window.event_loop, while a change to rio_window.event_loop can't break rio_vt.ansi.sixel.
Position
Below the diagonal: rio_window.event_loop uses a module listed above it, which is the healthy direction.
rio_window.event_loop uses rio_window.platform.web, so a change to rio_window.platform.web can break rio_window.event_loop, while a change to rio_window.event_loop can't break rio_window.platform.web.
Position
Below the diagonal: rio_window.event_loop uses a module listed above it, which is the healthy direction.
rio_window.event_loop uses rio_window.cursor, so a change to rio_window.cursor can break rio_window.event_loop, while a change to rio_window.event_loop can't break rio_window.cursor.
Position
Below the diagonal: rio_window.event_loop uses a module listed above it, which is the healthy direction.
rio_window.event_loop uses rio_window.window, so a change to rio_window.window can break rio_window.event_loop, while a change to rio_window.event_loop can't break rio_window.window.
Position
Below the diagonal: rio_window.event_loop uses a module listed above it, which is the healthy direction.
26→29 rio_window.event_loop uses rio_window.platform_impl.linuxpart of a loop✕
Connections
1 pair of types, where a type in rio_window.event_loop uses a type in rio_window.platform_impl.linux.
rio_window.event_loop uses rio_window.platform_impl.linux, so a change to rio_window.platform_impl.linux can break rio_window.event_loop, while a change to rio_window.event_loop can't break rio_window.platform_impl.linux.
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.
rio_vt.event uses rio_vt.crosswords.pos, so a change to rio_vt.crosswords.pos can break rio_vt.event, while a change to rio_vt.event can't break rio_vt.crosswords.pos.
Position
Below the diagonal: rio_vt.event uses a module listed above it, which is the healthy direction.
rio_vt.event uses rio_window.event_loop, so a change to rio_window.event_loop can break rio_vt.event, while a change to rio_vt.event can't break rio_window.event_loop.
Position
Below the diagonal: rio_vt.event uses a module listed above it, which is the healthy direction.
rio_vt.performer.handler uses rio_graphics, so a change to rio_graphics can break rio_vt.performer.handler, while a change to rio_vt.performer.handler can't break rio_graphics.
Position
Below the diagonal: rio_vt.performer.handler uses a module listed above it, which is the healthy direction.
rio_vt.performer.handler uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rio_vt.performer.handler, while a change to rio_vt.performer.handler can't break rio_vt.config.colors.
Position
Below the diagonal: rio_vt.performer.handler uses a module listed above it, which is the healthy direction.
rio_vt.performer.handler uses rio_vt.ansi.sixel, so a change to rio_vt.ansi.sixel can break rio_vt.performer.handler, while a change to rio_vt.performer.handler can't break rio_vt.ansi.sixel.
Position
Below the diagonal: rio_vt.performer.handler uses a module listed above it, which is the healthy direction.
rio_vt.performer.handler uses rio_vt.crosswords.pos, so a change to rio_vt.crosswords.pos can break rio_vt.performer.handler, while a change to rio_vt.performer.handler can't break rio_vt.crosswords.pos.
Position
Below the diagonal: rio_vt.performer.handler uses a module listed above it, which is the healthy direction.
rio_vt.performer.handler uses rio_vt.event, so a change to rio_vt.event can break rio_vt.performer.handler, while a change to rio_vt.performer.handler can't break rio_vt.event.
Position
Below the diagonal: rio_vt.performer.handler uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_fonts.nerd_font, so a change to rio_fonts.nerd_font can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_fonts.nerd_font.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_graphics, so a change to rio_graphics can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_graphics.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_window.monitor, so a change to rio_window.monitor can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_window.monitor.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_window.platform_impl.linux.common.xkb.state, so a change to rio_window.platform_impl.linux.common.xkb.state can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_window.platform_impl.linux.common.xkb.state.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_backend.config.theme.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rioterm.context.renderable.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_window.platform.web, so a change to rio_window.platform.web can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_window.platform.web.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_window.cursor, so a change to rio_window.cursor can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_window.cursor.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_window.window, so a change to rio_window.window can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_window.window.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_window.event_loop, so a change to rio_window.event_loop can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_window.event_loop.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux uses rio_vt.event, so a change to rio_vt.event can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break rio_vt.event.
Position
Below the diagonal: rio_window.platform_impl.linux uses a module listed above it, which is the healthy direction.
29→34 rio_window.platform_impl.linux uses librio.keypart of a loop✕
Connections
1 pair of types, where a type in rio_window.platform_impl.linux uses a type in librio.key.
rio_window.platform_impl.linux uses librio.key, so a change to librio.key can break rio_window.platform_impl.linux, while a change to rio_window.platform_impl.linux can't break librio.key.
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.
rio_window.platform_impl.linux.wayland.state uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.linux.wayland.state, while a change to rio_window.platform_impl.linux.wayland.state can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.linux.wayland.state uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.wayland.state uses rio_window.monitor, so a change to rio_window.monitor can break rio_window.platform_impl.linux.wayland.state, while a change to rio_window.platform_impl.linux.wayland.state can't break rio_window.monitor.
Position
Below the diagonal: rio_window.platform_impl.linux.wayland.state uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.wayland.state uses corcovado.event_imp, so a change to corcovado.event_imp can break rio_window.platform_impl.linux.wayland.state, while a change to rio_window.platform_impl.linux.wayland.state can't break corcovado.event_imp.
Position
Below the diagonal: rio_window.platform_impl.linux.wayland.state uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.wayland.state uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_window.platform_impl.linux.wayland.state, while a change to rio_window.platform_impl.linux.wayland.state can't break rio_backend.config.theme.
Position
Below the diagonal: rio_window.platform_impl.linux.wayland.state uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.wayland.state uses rio_vt.event, so a change to rio_vt.event can break rio_window.platform_impl.linux.wayland.state, while a change to rio_window.platform_impl.linux.wayland.state can't break rio_vt.event.
Position
Below the diagonal: rio_window.platform_impl.linux.wayland.state uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.web_sys.canvas uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.web.web_sys.canvas, while a change to rio_window.platform_impl.web.web_sys.canvas can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.web.web_sys.canvas uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.web_sys.canvas uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break rio_window.platform_impl.web.web_sys.canvas, while a change to rio_window.platform_impl.web.web_sys.canvas can't break rio_vt.crosswords.style.
Position
Below the diagonal: rio_window.platform_impl.web.web_sys.canvas uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.web_sys.canvas uses rio_window.platform_impl.web.cursor, so a change to rio_window.platform_impl.web.cursor can break rio_window.platform_impl.web.web_sys.canvas, while a change to rio_window.platform_impl.web.web_sys.canvas can't break rio_window.platform_impl.web.cursor.
Position
Below the diagonal: rio_window.platform_impl.web.web_sys.canvas uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.web_sys.canvas uses rio_window.platform.web, so a change to rio_window.platform.web can break rio_window.platform_impl.web.web_sys.canvas, while a change to rio_window.platform_impl.web.web_sys.canvas can't break rio_window.platform.web.
Position
Below the diagonal: rio_window.platform_impl.web.web_sys.canvas uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.web_sys.canvas uses rio_window.window, so a change to rio_window.window can break rio_window.platform_impl.web.web_sys.canvas, while a change to rio_window.platform_impl.web.web_sys.canvas can't break rio_window.window.
Position
Below the diagonal: rio_window.platform_impl.web.web_sys.canvas uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.web.web_sys.canvas uses rio_vt.event, so a change to rio_vt.event can break rio_window.platform_impl.web.web_sys.canvas, while a change to rio_window.platform_impl.web.web_sys.canvas can't break rio_vt.event.
Position
Below the diagonal: rio_window.platform_impl.web.web_sys.canvas uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses rio_graphics, so a change to rio_graphics can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break rio_graphics.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses corcovado.poll, so a change to corcovado.poll can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break corcovado.poll.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses rio_vt.config.colors, so a change to rio_vt.config.colors can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break rio_vt.config.colors.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses rio_vt.crosswords.style, so a change to rio_vt.crosswords.style can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break rio_vt.crosswords.style.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses rio_vt.crosswords.pos, so a change to rio_vt.crosswords.pos can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break rio_vt.crosswords.pos.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses rio_backend.config, so a change to rio_backend.config can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break rio_backend.config.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses rio_vt.event, so a change to rio_vt.event can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break rio_vt.event.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_vt.crosswords uses rio_vt.performer.handler, so a change to rio_vt.performer.handler can break rio_vt.crosswords, while a change to rio_vt.crosswords can't break rio_vt.performer.handler.
Position
Below the diagonal: rio_vt.crosswords uses a module listed above it, which is the healthy direction.
rio_window.event uses rio_window.platform_impl.linux.common.xkb.state, so a change to rio_window.platform_impl.linux.common.xkb.state can break rio_window.event, while a change to rio_window.event can't break rio_window.platform_impl.linux.common.xkb.state.
Position
Below the diagonal: rio_window.event uses a module listed above it, which is the healthy direction.
rio_window.event uses rio_window.platform_impl.linux, so a change to rio_window.platform_impl.linux can break rio_window.event, while a change to rio_window.event can't break rio_window.platform_impl.linux.
Position
Below the diagonal: rio_window.event uses a module listed above it, which is the healthy direction.
33→34 rio_window.event uses librio.keypart of a loop✕
Connections
1 pair of types, where a type in rio_window.event uses a type in librio.key.
The types involved
rio_window.event.KeyEvent → librio.key.Key
Direction
rio_window.event uses librio.key, so a change to librio.key can break rio_window.event, while a change to rio_window.event can't break librio.key.
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.
rio_window.platform_impl.macos.window_delegate uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rio_fonts.nerd_font, so a change to rio_fonts.nerd_font can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_fonts.nerd_font.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rio_window.monitor, so a change to rio_window.monitor can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_window.monitor.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rio_window.platform_impl.linux.common.xkb.state, so a change to rio_window.platform_impl.linux.common.xkb.state can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_window.platform_impl.linux.common.xkb.state.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_backend.config.theme.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rioterm.context.renderable.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rio_window.window, so a change to rio_window.window can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_window.window.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rio_vt.event, so a change to rio_vt.event can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_vt.event.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.macos.window_delegate uses rio_window.event, so a change to rio_window.event can break rio_window.platform_impl.macos.window_delegate, while a change to rio_window.platform_impl.macos.window_delegate can't break rio_window.event.
Position
Below the diagonal: rio_window.platform_impl.macos.window_delegate uses a module listed above it, which is the healthy direction.
librio uses rio_vt.performer.handler, so a change to rio_vt.performer.handler can break librio, while a change to librio can't break rio_vt.performer.handler.
Position
Below the diagonal: librio uses a module listed above it, which is the healthy direction.
rioterm.screen uses rio_backend.config.window, so a change to rio_backend.config.window can break rioterm.screen, while a change to rioterm.screen can't break rio_backend.config.window.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses rio_window.platform_impl.linux.common.xkb.state, so a change to rio_window.platform_impl.linux.common.xkb.state can break rioterm.screen, while a change to rioterm.screen can't break rio_window.platform_impl.linux.common.xkb.state.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses rio_vt.crosswords.pos, so a change to rio_vt.crosswords.pos can break rioterm.screen, while a change to rioterm.screen can't break rio_vt.crosswords.pos.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rioterm.screen, while a change to rioterm.screen can't break rioterm.context.renderable.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses sugarloaf.font, so a change to sugarloaf.font can break rioterm.screen, while a change to rioterm.screen can't break sugarloaf.font.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses sugarloaf.sugarloaf, so a change to sugarloaf.sugarloaf can break rioterm.screen, while a change to rioterm.screen can't break sugarloaf.sugarloaf.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in rioterm.screen uses a type in rioterm.renderer.
The types involved
rioterm.screen.Screen → rioterm.renderer.Renderer
Direction
rioterm.screen uses rioterm.renderer, so a change to rioterm.renderer can break rioterm.screen, while a change to rioterm.screen can't break rioterm.renderer.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses rio_backend.config, so a change to rio_backend.config can break rioterm.screen, while a change to rioterm.screen can't break rio_backend.config.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses rioterm.context, so a change to rioterm.context can break rioterm.screen, while a change to rioterm.screen can't break rioterm.context.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses rio_vt.crosswords, so a change to rio_vt.crosswords can break rioterm.screen, while a change to rioterm.screen can't break rio_vt.crosswords.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rioterm.screen uses rio_window.event, so a change to rio_window.event can break rioterm.screen, while a change to rioterm.screen can't break rio_window.event.
Position
Below the diagonal: rioterm.screen uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.xdisplay uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.linux.x11.xdisplay, while a change to rio_window.platform_impl.linux.x11.xdisplay can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.xdisplay uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.xdisplay uses rio_window.monitor, so a change to rio_window.monitor can break rio_window.platform_impl.linux.x11.xdisplay, while a change to rio_window.platform_impl.linux.x11.xdisplay can't break rio_window.monitor.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.xdisplay uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.xdisplay uses rio_vt.ansi.sixel, so a change to rio_vt.ansi.sixel can break rio_window.platform_impl.linux.x11.xdisplay, while a change to rio_window.platform_impl.linux.x11.xdisplay can't break rio_vt.ansi.sixel.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.xdisplay uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.xdisplay uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rio_window.platform_impl.linux.x11.xdisplay, while a change to rio_window.platform_impl.linux.x11.xdisplay can't break rioterm.context.renderable.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.xdisplay uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.xdisplay uses rio_window.cursor, so a change to rio_window.cursor can break rio_window.platform_impl.linux.x11.xdisplay, while a change to rio_window.platform_impl.linux.x11.xdisplay can't break rio_window.cursor.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.xdisplay uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.xdisplay uses rioterm.screen, so a change to rioterm.screen can break rio_window.platform_impl.linux.x11.xdisplay, while a change to rio_window.platform_impl.linux.x11.xdisplay can't break rioterm.screen.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.xdisplay uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rio_fonts.nerd_font, so a change to rio_fonts.nerd_font can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_fonts.nerd_font.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_backend.config.theme.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rioterm.context.renderable, so a change to rioterm.context.renderable can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rioterm.context.renderable.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rio_window.window, so a change to rio_window.window can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_window.window.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rio_window.event_loop, so a change to rio_window.event_loop can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_window.event_loop.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rio_vt.event, so a change to rio_vt.event can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_vt.event.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11.window uses rio_window.platform_impl.linux.x11.xdisplay, so a change to rio_window.platform_impl.linux.x11.xdisplay can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_window.platform_impl.linux.x11.xdisplay.
Position
Below the diagonal: rio_window.platform_impl.linux.x11.window uses a module listed above it, which is the healthy direction.
39→40 rio_window.platform_impl.linux.x11.window uses rio_window.platform_impl.linux.x11part of a loop✕
Connections
2 pairs of types, where a type in rio_window.platform_impl.linux.x11.window uses a type in rio_window.platform_impl.linux.x11.
rio_window.platform_impl.linux.x11.window uses rio_window.platform_impl.linux.x11, so a change to rio_window.platform_impl.linux.x11 can break rio_window.platform_impl.linux.x11.window, while a change to rio_window.platform_impl.linux.x11.window can't break rio_window.platform_impl.linux.x11.
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.
rio_window.platform_impl.linux.x11 uses rio_backend.config.window, so a change to rio_backend.config.window can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_backend.config.window.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_window.monitor, so a change to rio_window.monitor can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_window.monitor.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_backend.config.theme, so a change to rio_backend.config.theme can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_backend.config.theme.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_vt.ansi.sixel, so a change to rio_vt.ansi.sixel can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_vt.ansi.sixel.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses corcovado.channel, so a change to corcovado.channel can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break corcovado.channel.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_window.cursor, so a change to rio_window.cursor can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_window.cursor.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_window.window, so a change to rio_window.window can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_window.window.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_window.event_loop, so a change to rio_window.event_loop can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_window.event_loop.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_vt.event, so a change to rio_vt.event can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_vt.event.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_window.event, so a change to rio_window.event can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_window.event.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_window.platform_impl.linux.x11.xdisplay, so a change to rio_window.platform_impl.linux.x11.xdisplay can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_window.platform_impl.linux.x11.xdisplay.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
rio_window.platform_impl.linux.x11 uses rio_window.platform_impl.linux.x11.window, so a change to rio_window.platform_impl.linux.x11.window can break rio_window.platform_impl.linux.x11, while a change to rio_window.platform_impl.linux.x11 can't break rio_window.platform_impl.linux.x11.window.
Position
Below the diagonal: rio_window.platform_impl.linux.x11 uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 68% · Adequate · gated by X4 ·
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
39
High / Critical
A03:2025 — Software Supply Chain Failures
23
Medium
A07:2025 — Authentication Failures
2
High / Critical
Roadmap
Begin by improving documentation quality, specifically updating the README and establishing a structured ADR folder to record significant design decisions with their dates and consequences. Next, address the 315 instances of unstructured logging to ensure consistent data formatting. Finally, reduce technical debt by resolving the 18 high-churn complexity hotspots, prioritizing fixes in mod.rs, capi.rs, and application.rs.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md.
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.
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
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 — 40
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 — 800
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 — 86
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 15
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. 61 of 61 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. 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 — 61 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, 883 of 926 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 (.rs) 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 — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) 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 — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) 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.
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 (.rs) and this repository declares a Cargo test suite (repository root, 97 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
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 (133 contributor(s) across 4694 commit(s) sampled, automation and bot accounts excluded). One of them holds 93% of the history; the other 132 hold 0.1% 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.
D19 Documentation 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. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming 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. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
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's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — 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's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
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.
AX6 Interface segregation — 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 is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing 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.
AXB1 Runtime evidence locked — no reproducible boot — 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. Subject: 1 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
ED5 Idempotency — 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 decides whether a handler's mutation is safe to re-run by recognising its persistence writes (a database save, a repository write, an event publish) and its guards. Those markers are .NET member names, so in this repository's language a write such as `repository.save(order)` is not recognised and a same-named call on an unrelated library type could be. The handlers were found; their idempotency was neither confirmed nor ruled out.
GD1 Unfinished & placeholder code — 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, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python, Rust, c is not read yet, 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.
IC1 Incompleteness & stubs — 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, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python, Rust, c is not read yet, 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.
M4 Documentation accuracy — 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P5 DR & Backup — 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. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
X16 Unfloored truncation loop — 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, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, 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.
X18 Disposal-pattern correctness — 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, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, 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.
X4 Structured logging — 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. 275 further occurrence(s) are not listed individually; the score already reflects all 315.
X5 Nullable reference types — 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 MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's C, Python, Rust is not read yet, 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.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
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 publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
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.
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.
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 Dockerfile (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.
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".
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.
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.
74 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Application::window_event at 168. A further 44 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 Key::from_key_attribute_value at 308 — they are counted neither in the figure above nor in this dimension's score. 19 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: rio-window/src/platform_impl/web/keyboard.rs (Key::from_key_attribute_value at 308), rio-window/src/platform_impl/linux/common/xkb/keymap.rs (rio_window::platform_impl::linux::common::xkb::keymap::keysym_to_key at 199), rio-window/src/platform_impl/macos/event.rs (rio_window::platform_impl::macos::event::physicalkey_to_scancode at 123), frontends/rioterm/src/global_hotkey.rs (rioterm::global_hotkey::parse_hotkey at 66), sugarloaf/src/sprite/branch.rs (sugarloaf::sprite::branch::draw at 63), and 14 more not listed here. 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.
+ 35 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 7 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with Application::window_event (cyclomatic 168), rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode (cyclomatic 160), rio_window::platform_impl::windows::event_loop::public_window_callback_inner (cyclomatic 157). — 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 7 together lifts Cyclomatic Complexity from 5.5 to about 6.5/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.
+ 54 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 5 bodies over 120 down to 120 or less in Cognitive Complexity — start with Application::window_event (cognitive 339), rio_window::platform_impl::windows::event_loop::public_window_callback_inner (cognitive 263), Application::user_event (cognitive 253). — 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 5 together lifts Cognitive Complexity from 4.7 to about 5.8/10, projected with the scoring formula itself and assuming each lands exactly at 120; 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 Classes8.1 / 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 49 FileTooLong finding(s) in God Classes — start with mod.rs (12), window.rs (3), vulkan.rs (3). — One of this dimension's main actionable groups (49 warning-level).
Resolve the 41 MethodTooLong finding(s) in God Classes — start with mod.rs (14), cache.rs (4), event_processor.rs (3). — One of this dimension's main actionable groups (41 warning-level).
Resolve the 28 FunctionTooLong finding(s) in God Classes — start with keymap.rs (3), kitty_graphics_protocol.rs (2), keyboard_layout.rs (2). — One of this dimension's main actionable groups (28 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.
245 duplicated block group(s) detected. A further 15 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 118 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 14 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with mod.rs (4), cache.rs (3), keymap.rs. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 14 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), window.rs (3), vulkan.rs (2). — One of this dimension's main actionable groups (14 warning-level).
Resolve the 13 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), vulkan.rs (2), cache.rs (2). — One of this dimension's main actionable groups (13 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 · Coupling7.6 / 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.
17 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 5 module(s) off the main sequence, with abstractness counted on 14 of the 17 (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: rio-fonts · ×5
What to do
Resolve the 5 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (5 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 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with poll.rs, graphics.rs. — One of this dimension's main actionable groups (2 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.
1356 test methods: 1343 unit, 13 integration, 0 BDD, 0 e2e. The Rust suite contributes 1356 `#[test]` function(s) across 97 file(s) declaring at least one; its unit/integration split is Cargo's own — 6 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
26 outdated, 0 yanked direct Cargo dependencies. 114 of 120 direct crates were graded against crates.io (0 not published there, 6 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Outdated: bitflags · ×26
What to do
Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
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 599 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT, which is its own choice and is not judged here.
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 18 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (6), capi.rs (2), application.rs. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with sugarloaf.rs. — 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.
113 deducted task-comment markers across 179671 LoC (0.1/KLoC) → score 9.9. 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.
Resolve the 90 TodoComment finding(s) in Explicit Debt — start with window.rs (15), mod.rs (13), event_loop.rs (5). — One of this dimension's main actionable groups (90 warning-level).
Resolve the 13 XxxComment finding(s) in Explicit Debt — start with mod.rs (8), window_delegate.rs (2), conpty.rs. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 6 FixmeComment finding(s) in Explicit Debt — start with mod.rs (2), webgpu.rs, event_loop.rs. — One of this dimension's main actionable groups (6 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
0 of 1 documentation facets pass in full; short on: F2 example. 12 document(s) read across 1 unit(s).
Documentation: no build, run or usage exampleREADME.md:1
What to do
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).
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.
4 of 17 build units (Cargo) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
1 finding(s): 0 critical, 1 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 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 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).
39 finding(s): 0 critical, 36 high, 3 medium, 0 low. 30 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 3 file(s) — `misc/prepare-release.sh` (line 11), `misc/scripts/drawable-chars.sh`, `rio-vt/src/crosswords/search.rs` (line 259) — 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.
REDACTED
REDACTED
REDACTED
REDACTED
What to do
Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
No action in Static Analysis (SAST) — all 30 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (30 issue-level, 0 of them charged here).
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 9 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (9). — One of this dimension's main actionable groups (9 warning-level).
Resolve the 2 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d30_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 281 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is rio-vt/src/ansi/control.rs. Counted over 281 of the 381 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 filerio-vt/src/ansi/control.rs: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.
Resolve the 3 Boundary-crossing change coupling finding(s) in Change Coupling — start with sixel.rs, application.rs, mod.rs. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 5 Change coupling finding(s) in Change Coupling — start with mod.rs, vi_mode.rs, font_cache.rs. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
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 2 platform declaration(s) and 0 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.
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.
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 · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
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 17 project(s) that lack one — worth up to 0.9 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.
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 & versioning10.0 / 10Exemplary○ Nothing flagged
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.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Consider OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) and a health-check endpoint (a /health route on your axum/actix 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.
What to do
Enable Dependabot/Renovate or a dependency-review gate.
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.
The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
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.
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.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
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.
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 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 `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. 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.
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.
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 log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. 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 `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`info!` at line 580 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — teletypewriter/src/unix/mod.rs:580
`info!` at line 792 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — teletypewriter/src/unix/mod.rs:792
`warn!` at line 515 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/sugarloaf.rs:515
`warn!` at line 522 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/sugarloaf.rs:522
`error!` at line 389 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/cpu.rs:389
`error!` at line 559 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/cpu.rs:559
`warn!` at line 1948 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/mod.rs:1948
`error!` at line 2190 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/mod.rs:2190
`error!` at line 2383 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/mod.rs:2383
`info!` at line 2400 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/mod.rs:2400
`debug!` at line 299 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:299
`debug!` at line 321 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:321
`debug!` at line 387 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:387
`debug!` at line 396 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:396
`debug!` at line 437 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:437
`debug!` at line 447 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:447
`debug!` at line 538 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:538
`debug!` at line 672 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:672
`info!` at line 756 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/renderer/image_cache/cache.rs:756
`debug!` at line 194 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:194
`debug!` at line 200 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:200
`debug!` at line 416 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:416
`debug!` at line 440 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:440
`debug!` at line 449 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:449
`debug!` at line 474 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:474
`debug!` at line 478 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:478
`debug!` at line 506 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:506
`debug!` at line 514 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:514
`debug!` at line 521 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:521
`debug!` at line 629 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:629
`debug!` at line 668 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:668
`debug!` at line 680 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/loader.rs:680
`debug!` at line 176 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/macos.rs:176
`debug!` at line 338 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/mod.rs:338
`debug!` at line 400 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/mod.rs:400
`warn!` at line 975 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/mod.rs:975
`warn!` at line 2133 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/mod.rs:2133
`warn!` at line 2141 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/mod.rs:2141
`info!` at line 2183 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/mod.rs:2183
`warn!` at line 2191 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — sugarloaf/src/font/mod.rs:2191
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 — 2 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 — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 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.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 56 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.
AC1 Text alternatives — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC2 Forms & labels — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC3 Page structure — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC4 Keyboard semantics — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC5 ARIA correctness — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC6 Visual & motion safety — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AC7 A11y enforcement — Frontend below the scale floor (6 DOM element(s) < 25) — too little surface to assess accessibility.
AX1 Captive dependencies — Not applicable: Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. 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. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
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
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface 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
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~5737 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
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.
D21 Naming Consistency — Naming consistency is measured on C# only; Python, Rust, html not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
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 — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
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 (.rs), 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.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 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.
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 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 83 value object(s); 9 domain event(s); its domain events are published by services or handlers — no domain entity raises one
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — Not assessed, and this one is on us: 1 command handler(s) or message consumer(s) were found here, but this check does not yet recognise persistence writes in this repository's language. Idempotency was neither confirmed nor ruled out — this is a limit of the analyzer, not a finding about your code.
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — 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
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python, Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) 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
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
S1 Web-Security Posture — No web surface: 406 Rust file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
X16 Unfloored truncation loop — 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
X18 Disposal-pattern correctness — 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
X2 Cancellation propagation — no C# was loaded; this repository's Python and Rust were read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
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.
X5 Nullable reference types — 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
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
Boundary-crossing change coupling: sixel.rs ↔ graphics.rs rio-vt/src/ansi/sixel.rs:1— `rio-vt/src/ansi/sixel.rs` (context rio-vt) and `sugarloaf/src/sugarloaf/graphics.rs` (context sugarloaf) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `37b99d03` Extract rio-graphics crate and make sugarloaf optional in backend (at that commit the file was still `rio-backend/src/ansi/sixel.rs`); `7763f29d` use transmit_time instead (at that commit the file was still `rio-backend/src/ansi/sixel.rs`); `82ffe2b7` major rewrite on the protocol (at that commit the file was still `rio-backend/src/ansi/sixel.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: application.rs ↔ app_delegate.rs frontends/rioterm/src/application.rs:1— `frontends/rioterm/src/application.rs` (context frontends) and `rio-window/src/platform_impl/macos/app_delegate.rs` (context rio-window) sit in DIFFERENT parts of the tree yet change together 60% of the time (12 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `d94490d3` Fix scale desync after sleep/wake and on hidden tabs (#1792); `7c65d215` fix quit flow on macos; `5021b2b7` new quit on macos — run `git show` on any of them.
Boundary-crossing change coupling: mod.rs ↔ sixel.rs rio-backend/src/graphics/kitty/mod.rs:1— `rio-backend/src/graphics/kitty/mod.rs` (context rio-backend) and `rio-vt/src/ansi/sixel.rs` (context rio-vt) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `37b99d03` Extract rio-graphics crate and make sugarloaf optional in backend (at that commit the file was still `rio-backend/src/ansi/sixel.rs`); `928b147c` remove copa and rio-proc-macros crate (at that commit the file was still `rio-backend/src/ansi/sixel.rs`); `7763f29d` use transmit_time instead (at that commit the file was still `rio-backend/src/ansi/sixel.rs`) — run `git show` on any of them.
TodoComment teletypewriter/src/unix/mod.rs:813— // TODO: Currently we fork the process and don't wait to know if led to failure — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/build.rs:29— //! ## TODO: drop the system-binary requirement — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/tests/util/image.rs:510— // TODO: also copy and check mips — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/src/renderer/cpu.rs:463— // Underline pattern shaders — TODO: implement on CPU. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/src/font/loader.rs:13— // TODO: Fix wasm32 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/src/font/mod.rs:1019— // TODO: Currently, it will naively just extend fonts from symbol_map — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/src/font/mod.rs:1032— // TODO: We should have a new symbol map internally — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/src/context/webgpu.rs:349— // TODO: Fix formats with signs — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/src/context/webgpu.rs:355— // TODO: use output color format for the CanvasConfiguration when it lands on the wgpu — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment sugarloaf/src/components/filters/runtime/samplers.rs:12— // todo: may need to deal with differences in mip filter. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/error.rs:5— // TODO: Rename — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/event_loop.rs:673— // TODO(kchibisov): Remove `cfg` when the clipboard will be added. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/windows/event_loop.rs:533— // TODO: Investigate opportunities for caching — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/windows/keyboard_layout.rs:338— // TODO: validate that we can skip on unidentified keys (probably never occurs?) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/windows/keyboard_layout.rs:397— // TODO: validate that we can skip on unidentified keys (probably never occurs?) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/windows/window.rs:130— // TODO: Use `thread_executor` here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/windows/window.rs:138— // TODO: Use `thread_executor` here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/windows/window.rs:433— // TODO: Write a test once integration framework is ready to ensure that it holds. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/web/mod.rs:20— // TODO: FP, remove when <https://github.com/rust-lang/rust-clippy/issues/12377> is fixed.
TodoComment rio-window/src/platform_impl/web/web_sys/event.rs:102— // TODO: Remove this when Firefox supports correct movement values in coalesced events. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/web/web_sys/event.rs:257— // TODO: Remove when all browsers implement it correctly. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/web/web_sys/event.rs:280— // TODO: Remove when Safari supports `getCoalescedEvents`. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/web/web_sys/media_query_handle.rs:24— // TODO: Replace obsolete `addListener()` with `addEventListener()` and use — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment rio-window/src/platform_impl/web/web_sys/resize_scaling.rs:125— // TODO: Remove `-webkit-device-pixel-ratio`. Requires Safari v16. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FileTooLong: screen/mod.rs frontends/rioterm/src/screen/mod.rs— FileTooLong — 3181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 2681 over it, 6.36× 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: renderer/mod.rs sugarloaf/src/renderer/mod.rs— FileTooLong — 2076 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1576 over it, 4.15× 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/lib.rs rio-grid/src/lib.rs— FileTooLong — 1886 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 48 free functions. The bar is 500 significant lines; this is 1386 over it, 3.77× 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: windows/event_loop.rs rio-window/src/platform_impl/windows/event_loop.rs— FileTooLong — 1726 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1226 over it, 3.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: src/application.rs frontends/rioterm/src/application.rs— FileTooLong — 1521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1021 over it, 3.04× 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: macos/window_delegate.rs rio-window/src/platform_impl/macos/window_delegate.rs— FileTooLong — 1465 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: WindowDelegate (8 blocks, 164-2518). The bar is 500 significant lines; this is 965 over it, 2.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: x11/window.rs rio-window/src/platform_impl/linux/x11/window.rs— FileTooLong — 1438 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 92% of them inside a single declaration: UnownedWindow (2 blocks, 119-2067). The bar is 500 significant lines; this is 938 over it, 2.88× 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/text.rs sugarloaf/src/text.rs— FileTooLong — 1430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 930 over it, 2.86× 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: x11/event_processor.rs rio-window/src/platform_impl/linux/x11/event_processor.rs— FileTooLong — 1296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 96% of them inside a single declaration: EventProcessor (2 blocks, 48-2099). The bar is 500 significant lines; this is 796 over it, 2.59× 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: grid/vulkan.rs sugarloaf/src/grid/vulkan.rs— FileTooLong — 1207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 707 over it, 2.41× 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: font/mod.rs sugarloaf/src/font/mod.rs— FileTooLong — 1192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 692 over it, 2.38× 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: renderer/vulkan.rs sugarloaf/src/renderer/vulkan.rs— FileTooLong — 1141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 641 over it, 2.28× 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: performer/handler.rs rio-vt/src/performer/handler.rs— FileTooLong — 1140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 640 over it, 2.28× 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: windows/window.rs rio-window/src/platform_impl/windows/window.rs— FileTooLong — 1114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 66% of them inside a single declaration: Window (3 blocks, 98-1249). The bar is 500 significant lines; this is 614 over it, 2.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: layout/mod.rs frontends/rioterm/src/layout/mod.rs— FileTooLong — 1108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: ContextGrid (2 blocks, 108-1673). The bar is 500 significant lines; this is 608 over it, 2.22× 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/capi.rs librio/src/capi.rs— FileTooLong — 1086 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 63 free functions. The bar is 500 significant lines; this is 586 over it, 2.17× 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: ansi/kitty_graphics_protocol.rs rio-vt/src/ansi/kitty_graphics_protocol.rs— FileTooLong — 966 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 466 over it, 1.93× 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: context/vulkan.rs sugarloaf/src/context/vulkan.rs— FileTooLong — 954 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 454 over it, 1.91× 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: renderer/island.rs frontends/rioterm/src/renderer/island.rs— FileTooLong — 945 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 74% of them inside a single declaration: Island (2 blocks, 342-1478). The bar is 500 significant lines; this is 445 over it, 1.89× 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: windows/keyboard.rs rio-window/src/platform_impl/windows/keyboard.rs— FileTooLong — 939 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 439 over it, 1.88× 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: parser/mod.rs rio-vt/src/performer/parser/mod.rs— FileTooLong — 898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 71% of them inside a single declaration: Parser (2 blocks, 35-1144). The bar is 500 significant lines; this is 398 over it, 1.80× 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/capi.rs libsugarloaf/src/capi.rs— FileTooLong — 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 39 free functions. The bar is 500 significant lines; this is 387 over it, 1.77× 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: font/macos.rs sugarloaf/src/font/macos.rs— FileTooLong — 856 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 356 over it, 1.71× 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: context/mod.rs frontends/rioterm/src/context/mod.rs— FileTooLong — 855 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 355 over it, 1.71× 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: x11/mod.rs rio-window/src/platform_impl/linux/x11/mod.rs— FileTooLong — 851 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 351 over it, 1.70× 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.
MethodTooLong: ActiveEventLoop.register rio-window/src/platform_impl/web/event_loop/window_target.rs:88— MethodTooLong — register runs 375 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 275 over it, 3.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: WgpuRenderer.new sugarloaf/src/renderer/mod.rs:2630— MethodTooLong — new runs 342 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 242 over it, 3.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.
MethodTooLong: UnownedWindow.new rio-window/src/platform_impl/linux/x11/window.rs:166— MethodTooLong — new runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Renderer.run frontends/rioterm/src/renderer/mod.rs:446— MethodTooLong — run runs 309 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 209 over it, 3.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Island.render frontends/rioterm/src/renderer/island.rs:743— MethodTooLong — render runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.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.
MethodTooLong: MetalRenderer.new sugarloaf/src/renderer/mod.rs:283— MethodTooLong — new runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Renderer.render sugarloaf/src/renderer/mod.rs:1864— MethodTooLong — render runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: WinitState.event rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs:26— MethodTooLong — event runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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: Performer.csi_dispatch rio-vt/src/performer/handler.rs:1279— MethodTooLong — csi_dispatch runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: KeyEventBuilder.process_message rio-window/src/platform_impl/windows/keyboard.rs:84— MethodTooLong — process_message runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: CommandPalette.render frontends/rioterm/src/renderer/command_palette.rs:681— MethodTooLong — render runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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.
MethodTooLong: Renderer.render_metal sugarloaf/src/renderer/mod.rs:2168— MethodTooLong — render_metal runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Island.render_color_picker frontends/rioterm/src/renderer/island.rs:1264— MethodTooLong — render_color_picker runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.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: Renderer.render_graphic_overlays sugarloaf/src/renderer/mod.rs:1195— MethodTooLong — render_graphic_overlays runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Shared.set_listener rio-window/src/platform_impl/web/event_loop/runner.rs:220— MethodTooLong — set_listener runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: EventLoop.new rio-window/src/platform_impl/linux/x11/mod.rs:229— MethodTooLong — new runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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: Route.has_key_wait frontends/rioterm/src/router/mod.rs:268— MethodTooLong — has_key_wait runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.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: WgpuContext.new sugarloaf/src/context/webgpu.rs:20— MethodTooLong — new runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: EventLoop.single_iteration rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:338— MethodTooLong — single_iteration runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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.
MethodTooLong: Grid.shrink_columns rio-vt/src/crosswords/grid/resize.rs:301— MethodTooLong — shrink_columns runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: WinitState.pointer_frame rio-window/src/platform_impl/linux/wayland/seat/pointer/mod.rs:40— MethodTooLong — pointer_frame runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Renderer.push_virtual_placeholder_overlays frontends/rioterm/src/renderer/mod.rs:967— MethodTooLong — push_virtual_placeholder_overlays runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Graphics.evict_images rio-vt/src/ansi/graphics.rs:1143— MethodTooLong — evict_images runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: VulkanRenderer.new sugarloaf/src/renderer/vulkan.rs:137— MethodTooLong — new runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: Text.shape_for sugarloaf/src/text.rs:269— MethodTooLong — shape_for runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::windows::event_loop::public_window_callback_inner rio-window/src/platform_impl/windows/event_loop.rs:1216— FunctionTooLong — rio_window::platform_impl::windows::event_loop::public_window_callback_inner runs 918 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 818 over it, 9.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_grid::build_row_fg rio-grid/src/lib.rs:1847— FunctionTooLong — rio_grid::build_row_fg runs 399 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 299 over it, 3.99× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_vt::ansi::kitty_graphics_protocol::create_graphic_data rio-vt/src/ansi/kitty_graphics_protocol.rs:1024— FunctionTooLong — rio_vt::ansi::kitty_graphics_protocol::create_graphic_data runs 328 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 228 over it, 3.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: sugarloaf::sprite::branch::draw sugarloaf/src/sprite/branch.rs:34— FunctionTooLong — sugarloaf::sprite::branch::draw runs 290 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 190 over it, 2.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_vt::ansi::kitty_graphics_protocol::parse rio-vt/src/ansi/kitty_graphics_protocol.rs:359— FunctionTooLong — rio_vt::ansi::kitty_graphics_protocol::parse runs 284 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 184 over it, 2.84× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: libsugarloaf::capi::sl_render_surface libsugarloaf/src/capi.rs:1113— FunctionTooLong — libsugarloaf::capi::sl_render_surface runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::windows::keyboard_layout::vkey_to_non_char_key rio-window/src/platform_impl/windows/keyboard_layout.rs:773— FunctionTooLong — rio_window::platform_impl::windows::keyboard_layout::vkey_to_non_char_key runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::linux::common::xkb::keymap::keysym_to_key rio-window/src/platform_impl/linux/common/xkb/keymap.rs:471— FunctionTooLong — rio_window::platform_impl::linux::common::xkb::keymap::keysym_to_key runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::windows::keyboard_layout::keycode_to_vkey rio-window/src/platform_impl/windows/keyboard_layout.rs:559— FunctionTooLong — rio_window::platform_impl::windows::keyboard_layout::keycode_to_vkey runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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.
FunctionTooLong: rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode rio-window/src/platform_impl/windows/keyboard.rs:979— FunctionTooLong — rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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.
FunctionTooLong: rio_window::platform_impl::linux::common::xkb::keymap::physicalkey_to_scancode rio-window/src/platform_impl/linux/common/xkb/keymap.rs:295— FunctionTooLong — rio_window::platform_impl::linux::common::xkb::keymap::physicalkey_to_scancode runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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: rio_window::platform_impl::linux::common::xkb::keymap::scancode_to_physicalkey rio-window/src/platform_impl/linux/common/xkb/keymap.rs:35— FunctionTooLong — rio_window::platform_impl::linux::common::xkb::keymap::scancode_to_physicalkey runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::windows::keyboard::scancode_to_physicalkey rio-window/src/platform_impl/windows/keyboard.rs:1175— FunctionTooLong — rio_window::platform_impl::windows::keyboard::scancode_to_physicalkey runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::macos::menu::initialize rio-window/src/platform_impl/macos/menu.rs:12— FunctionTooLong — rio_window::platform_impl::macos::menu::initialize runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: sugarloaf::renderer::cpu::render_cpu sugarloaf/src/renderer/cpu.rs:286— FunctionTooLong — sugarloaf::renderer::cpu::render_cpu runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: sugarloaf::sprite::box_drawing::lc sugarloaf/src/sprite/box_drawing.rs:234— FunctionTooLong — sugarloaf::sprite::box_drawing::lc runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) 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.
FunctionTooLong: teletypewriter::unix::create_pty_with_spawn teletypewriter/src/unix/mod.rs:507— FunctionTooLong — teletypewriter::unix::create_pty_with_spawn runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: sugarloaf::sprite::box_drawing::draw sugarloaf/src/sprite/box_drawing.rs:82— FunctionTooLong — sugarloaf::sprite::box_drawing::draw runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_vt::performer::handler::get_termcap_capability rio-vt/src/performer/handler.rs:1860— FunctionTooLong — rio_vt::performer::handler::get_termcap_capability runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::macos::event::physicalkey_to_scancode rio-window/src/platform_impl/macos/event.rs:403— FunctionTooLong — rio_window::platform_impl::macos::event::physicalkey_to_scancode runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::macos::event::scancode_to_physicalkey rio-window/src/platform_impl/macos/event.rs:535— FunctionTooLong — rio_window::platform_impl::macos::event::scancode_to_physicalkey runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: sugarloaf::renderer::vulkan::build_quad_pipeline sugarloaf/src/renderer/vulkan.rs:991— FunctionTooLong — sugarloaf::renderer::vulkan::build_quad_pipeline runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: sugarloaf::renderer::vulkan::build_geometry_pipeline sugarloaf/src/renderer/vulkan.rs:1524— FunctionTooLong — sugarloaf::renderer::vulkan::build_geometry_pipeline runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: rio_window::platform_impl::macos::window_delegate::new_window rio-window/src/platform_impl/macos/window_delegate.rs:523— FunctionTooLong — rio_window::platform_impl::macos::window_delegate::new_window runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: sugarloaf::text::build_text_vulkan_state sugarloaf/src/text.rs:1561— FunctionTooLong — sugarloaf::text::build_text_vulkan_state runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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.
TooManyMethods: Screen frontends/rioterm/src/screen/mod.rs:65— TooManyMethods — 113 methods. The bar is 30 methods; this is 83 over it, 3.77× the bar. To reduce it, group the 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: UnownedWindow rio-window/src/platform_impl/linux/x11/window.rs:119— TooManyMethods — 94 methods. The bar is 30 methods; this is 64 over it, 3.13× the bar. To reduce it, group the 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: WindowDelegate rio-window/src/platform_impl/macos/window_delegate.rs:163— TooManyMethods — 79 methods. The bar is 30 methods; this is 49 over it, 2.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: Window rio-window/src/platform_impl/windows/window.rs:98— TooManyMethods — 73 methods. The bar is 30 methods; this is 43 over it, 2.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: ContextManager frontends/rioterm/src/context/mod.rs:135— TooManyMethods — 72 methods. The bar is 30 methods; this is 42 over it, 2.40× the bar. To reduce it, group the 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: Window rio-window/src/platform_impl/orbital/window.rs:26— TooManyMethods — 62 methods. The bar is 30 methods; this is 32 over it, 2.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: Window rio-window/src/platform_impl/linux/mod.rs:145— TooManyMethods — 61 methods. The bar is 30 methods; this is 31 over it, 2.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: Window rio-window/src/platform_impl/linux/wayland/window/mod.rs:40— TooManyMethods — 59 methods. The bar is 30 methods; this is 29 over it, 1.97× the bar. To reduce it, group the 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: XConnection rio-window/src/platform_impl/linux/x11/xdisplay.rs:20— TooManyMethods — 59 methods, declared across 14 files: x11/xdisplay.rs (15), util/cursor.rs (7), util/geometry.rs (7), x11/monitor.rs (6), +10 more file(s). The bar is 30 methods; this is 29 over it, 1.97× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the 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: Window rio-window/src/window.rs:72— TooManyMethods — 58 methods. The bar is 30 methods; this is 28 over it, 1.93× the bar. To reduce it, group the 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: WindowState rio-window/src/platform_impl/linux/wayland/window/state.rs:58— TooManyMethods — 57 methods. The bar is 30 methods; this is 27 over it, 1.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: ContextGrid frontends/rioterm/src/layout/mod.rs:108— TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. To reduce it, group the 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: Inner rio-window/src/platform_impl/web/window.rs:24— TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. To reduce it, group the 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: RioTerm librio-wasm/src/lib.rs:155— TooManyMethods — 52 methods. The bar is 30 methods; this is 22 over it, 1.73× the bar. To reduce it, group the 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: Sugarloaf sugarloaf/src/sugarloaf.rs:23— TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the 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: Parser rio-vt/src/performer/parser/mod.rs:35— TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× the bar. To reduce it, group the 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: EventProcessor rio-window/src/platform_impl/linux/x11/event_processor.rs:48— TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the 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: Grid rio-vt/src/crosswords/grid/mod.rs:40— TooManyMethods — 40 methods, declared across 2 files: grid/mod.rs (35), grid/resize.rs (5). The bar is 30 methods; this is 10 over it, 1.33× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the 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: Square rio-vt/src/crosswords/square.rs:217— TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the 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: Canvas rio-window/src/platform_impl/web/web_sys/canvas.rs:32— TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the 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: ApplicationDelegate rio-window/src/platform_impl/macos/app_delegate.rs:84— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the 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: Shared rio-window/src/platform_impl/web/event_loop/runner.rs: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.
ClassTooLong: UnownedWindow rio-window/src/platform_impl/linux/x11/window.rs:119— ClassTooLong — 1329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 94 methods, 2 blocks, lines 119-2067. The bar is 400 significant lines; this is 929 over it, 3.32× the bar. To reduce it, group the 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: EventProcessor rio-window/src/platform_impl/linux/x11/event_processor.rs:48— ClassTooLong — 1243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 42 methods, 2 blocks, lines 48-2099. The bar is 400 significant lines; this is 843 over it, 3.11× the bar. To reduce it, group the 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: WindowDelegate rio-window/src/platform_impl/macos/window_delegate.rs:163— ClassTooLong — 1187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 79 methods, 8 blocks, lines 164-2518. The bar is 400 significant lines; this is 787 over it, 2.97× the bar. To reduce it, group the 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: Renderer sugarloaf/src/renderer/mod.rs:838— ClassTooLong — 1052 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 29 methods, 2 blocks, lines 838-2626. The bar is 400 significant lines; this is 652 over it, 2.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.
ClassTooLong: ContextGrid frontends/rioterm/src/layout/mod.rs:108— ClassTooLong — 903 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 55 methods, 2 blocks, lines 108-1673. The bar is 400 significant lines; this is 503 over it, 2.26× the bar. To reduce it, group the 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: Window rio-window/src/platform_impl/windows/window.rs:98— ClassTooLong — 736 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 73 methods, 3 blocks, lines 98-1249. The bar is 400 significant lines; this is 336 over it, 1.84× the bar. To reduce it, group the 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: Text sugarloaf/src/text.rs:151— ClassTooLong — 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 20 methods, 2 blocks, lines 151-1167. The bar is 400 significant lines; this is 301 over it, 1.75× the bar. To reduce it, group the 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: Island frontends/rioterm/src/renderer/island.rs:342— ClassTooLong — 700 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 30 methods, 2 blocks, lines 342-1478. The bar is 400 significant lines; this is 300 over it, 1.75× the bar. To reduce it, group the 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: Renderer frontends/rioterm/src/renderer/mod.rs:153— ClassTooLong — 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 11 methods, 3 blocks, lines 153-1218. The bar is 400 significant lines; this is 276 over it, 1.69× the bar. To reduce it, group the 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: WindowState rio-window/src/platform_impl/linux/wayland/window/state.rs:58— ClassTooLong — 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 57 methods, 3 blocks, lines 58-1199. The bar is 400 significant lines; this is 270 over it, 1.68× the bar. To reduce it, group the 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: WinitView rio-window/src/platform_impl/macos/view.rs:164— ClassTooLong — 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 21 methods, 6 blocks, lines 165-1295. The bar is 400 significant lines; this is 254 over it, 1.64× the bar. To reduce it, group the 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: Parser rio-vt/src/performer/parser/mod.rs:35— ClassTooLong — 639 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 44 methods, 2 blocks, lines 35-1144. The bar is 400 significant lines; this is 239 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: Sugarloaf sugarloaf/src/sugarloaf.rs:23— ClassTooLong — 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 47 methods, 2 blocks, lines 23-1259. The bar is 400 significant lines; this is 204 over it, 1.51× the bar. To reduce it, group the 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: ImageCache sugarloaf/src/renderer/image_cache/cache.rs:65— ClassTooLong — 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 16 methods, 2 blocks, lines 65-1021. The bar is 400 significant lines; this is 171 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.
ClassTooLong: Performer rio-vt/src/performer/handler.rs:746— ClassTooLong — 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 3 methods, 3 blocks, lines 746-1637. The bar is 400 significant lines; this is 136 over it, 1.34× the bar. To reduce it, group the 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: Graphics rio-vt/src/ansi/graphics.rs:572— ClassTooLong — 452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 3 blocks, lines 572-1405. The bar is 400 significant lines; this is 52 over it, 1.13× the bar. To reduce it, group the 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: WgpuRenderer sugarloaf/src/renderer/mod.rs:76— ClassTooLong — 441 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 4 methods, 2 blocks, lines 76-3195. The bar is 400 significant lines; this is 41 over it, 1.10× the bar. To reduce it, group the 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: Window rio-window/src/platform_impl/linux/wayland/window/mod.rs:40— ClassTooLong — 436 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 59 methods, 4 blocks, lines 40-731. The bar is 400 significant lines; this is 36 over it, 1.09× the bar. To reduce it, group the 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: ApplicationDelegate rio-window/src/platform_impl/macos/app_delegate.rs:84— ClassTooLong — 431 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 33 methods, 5 blocks, lines 86-806. 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: ActiveEventLoop rio-window/src/platform_impl/web/event_loop/window_target.rs:49— ClassTooLong — 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 49-743. The bar is 400 significant lines; this is 29 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.
ClassTooLong: VulkanContext sugarloaf/src/context/vulkan.rs:114— ClassTooLong — 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 17 methods, 4 blocks, lines 114-1044. The bar is 400 significant lines; this is 2 over it, 1.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Hotspot: frontends/rioterm/src/application.rs frontends/rioterm/src/application.rs:1205— frontends/rioterm/src/application.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 168 in Application::window_event at line 1205. 6 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- frontends/rioterm/src/application.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: frontends/rioterm/src/screen/mod.rs frontends/rioterm/src/screen/mod.rs:3877— frontends/rioterm/src/screen/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in Screen::render at line 3877. 6 of those changes were fix/bug commits, and the other 19 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- frontends/rioterm/src/screen/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: librio/src/capi.rs librio/src/capi.rs:688— librio/src/capi.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in librio::capi::rio_surface_key at line 688. 7 of those changes were fix/bug commits, and the other 31 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- librio/src/capi.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/performer/handler.rs rio-vt/src/performer/handler.rs:1279— rio-vt/src/performer/handler.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in Performer::csi_dispatch at line 1279. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/performer/handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-grid/src/lib.rs rio-grid/src/lib.rs:1847— rio-grid/src/lib.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in rio_grid::build_row_fg at line 1847. Frequent change and high complexity in one file compound: schedule 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-grid/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: frontends/rioterm/src/renderer/mod.rs frontends/rioterm/src/renderer/mod.rs:446— frontends/rioterm/src/renderer/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Renderer::run at line 446. 3 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- frontends/rioterm/src/renderer/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/event/mod.rs rio-vt/src/event/mod.rs:301— rio-vt/src/event/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in RioEvent::fmt at line 301. Frequent change and high complexity in one file compound: schedule 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/event/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/performer/mod.rs rio-vt/src/performer/mod.rs:382— rio-vt/src/performer/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Machine::run at line 382. 3 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/performer/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/ansi/kitty_graphics_protocol.rs rio-vt/src/ansi/kitty_graphics_protocol.rs:1024— rio-vt/src/ansi/kitty_graphics_protocol.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in rio_vt::ansi::kitty_graphics_protocol::create_graphic_data at line 1024. 1 of those changes was a fix/bug commit, and the other 3 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/ansi/kitty_graphics_protocol.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: libsugarloaf/src/capi.rs libsugarloaf/src/capi.rs:1113— libsugarloaf/src/capi.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in libsugarloaf::capi::sl_render_surface at line 1113. 2 of those changes were fix/bug commits, and the other 4 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- libsugarloaf/src/capi.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: frontends/rioterm/src/renderer/island.rs frontends/rioterm/src/renderer/island.rs:743— frontends/rioterm/src/renderer/island.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Island::render at line 743. Frequent change and high complexity in one file compound: schedule 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- frontends/rioterm/src/renderer/island.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/crosswords/grid/resize.rs rio-vt/src/crosswords/grid/resize.rs:301— rio-vt/src/crosswords/grid/resize.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in Grid::shrink_columns at line 301. Frequent change and high complexity in one file compound: schedule 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/crosswords/grid/resize.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: teletypewriter/src/unix/mod.rs teletypewriter/src/unix/mod.rs:507— teletypewriter/src/unix/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in teletypewriter::unix::create_pty_with_spawn at line 507. Frequent change and high complexity in one file compound: schedule 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- teletypewriter/src/unix/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/crosswords/formatter.rs rio-vt/src/crosswords/formatter.rs:186— rio-vt/src/crosswords/formatter.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rio_vt::crosswords::formatter::write_sgr at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/crosswords/formatter.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: librio/src/key.rs librio/src/key.rs:242— librio/src/key.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in librio::key::kitty_codepoint at line 242. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- librio/src/key.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: sugarloaf/src/renderer/mod.rs sugarloaf/src/renderer/mod.rs:2168— sugarloaf/src/renderer/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Renderer::render_metal at line 2168. Frequent change and high complexity in one file compound: schedule 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- sugarloaf/src/renderer/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/ansi/graphics.rs rio-vt/src/ansi/graphics.rs:1143— rio-vt/src/ansi/graphics.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Graphics::evict_images at line 1143. Frequent change and high complexity in one file compound: schedule 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/ansi/graphics.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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: rio-vt/src/ansi/mode.rs rio-vt/src/ansi/mode.rs:53— rio-vt/src/ansi/mode.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PrivateMode::new at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- rio-vt/src/ansi/mode.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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.
sugarloaf::renderer::cpu::render_cpu (cognitive 76) sugarloaf/src/renderer/cpu.rs:286— sugarloaf::renderer::cpu::render_cpu has cognitive complexity 76 (threshold 15). Drivers by points: if/else 24 (57 pts), loops 7 (10 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 38). 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.
sugarloaf::sprite::box_drawing::lc (cognitive 72) sugarloaf/src/sprite/box_drawing.rs:234— sugarloaf::sprite::box_drawing::lc has cognitive complexity 72 (threshold 15). Drivers by points: if/else 40 (52 pts), boolean chains 16, match/switch 4 (nesting depth added 12). 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.
sugarloaf::renderer::cpu::draw_quad_instance (cognitive 66) sugarloaf/src/renderer/cpu.rs:848— sugarloaf::renderer::cpu::draw_quad_instance has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (47 pts), loops 5 (13 pts), boolean chains 6 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sugarloaf::font::loader::find_font_path_from_data (cognitive 35) sugarloaf/src/font/loader.rs:619— sugarloaf::font::loader::find_font_path_from_data has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sugarloaf::font::lookup_for_font_match (cognitive 25) sugarloaf/src/font/mod.rs:158— sugarloaf::font::lookup_for_font_match has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sugarloaf::font::find_font (cognitive 24) sugarloaf/src/font/mod.rs:2207— sugarloaf::font::find_font has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 4 (8 pts) (nesting depth added 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
sugarloaf::font::linux::discover_fallback (cognitive 24) sugarloaf/src/font/linux.rs:57— sugarloaf::font::linux::discover_fallback has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 1 (2 pts), boolean chains 1, match/switch 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.
sugarloaf::renderer::image_cache::colr_raster::first_base_glyph_id (cognitive 24) sugarloaf/src/renderer/image_cache/colr_raster.rs:572— sugarloaf::renderer::image_cache::colr_raster::first_base_glyph_id has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sugarloaf::renderer::cpu::draw_glyph (cognitive 20) sugarloaf/src/renderer/cpu.rs:728— sugarloaf::renderer::cpu::draw_glyph has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
sugarloaf::font::loader::find_best_match (cognitive 18) sugarloaf/src/font/loader.rs:219— sugarloaf::font::loader::find_best_match has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 5 (7 pts), boolean chains 2 (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.
sugarloaf::font::macos::rasterize_glyph (cognitive 18) sugarloaf/src/font/macos.rs:446— sugarloaf::font::macos::rasterize_glyph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5 (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.
sugarloaf::grid::cpu::blit_mask (cognitive 17) sugarloaf/src/grid/cpu.rs:584— sugarloaf::grid::cpu::blit_mask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sugarloaf::text::blit_text_mask (cognitive 17) sugarloaf/src/text.rs:1905— sugarloaf::text::blit_text_mask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sugarloaf::font::macos::apply_variation_overrides (cognitive 16) sugarloaf/src/font/macos.rs:788— sugarloaf::font::macos::apply_variation_overrides has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 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.
sugarloaf::font::macos::shape_text (cognitive 16) sugarloaf/src/font/macos.rs:1306— sugarloaf::font::macos::shape_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sugarloaf::sprite::braille::draw (cognitive 16) sugarloaf/src/sprite/braille.rs:20— sugarloaf::sprite::braille::draw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, 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.
Duplicated block (12 lines × 2) rio-window/src/platform_impl/linux/common/xkb/keymap.rs:454— rio-window/src/platform_impl/linux/common/xkb/keymap.rs:454-465 | rio-window/src/platform_impl/windows/keyboard.rs:1121-1132 — before extracting anything, compare `rio-window/src/platform_impl/linux/common/xkb/keymap.rs` and `rio-window/src/platform_impl/windows/keyboard.rs` 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) rio-window/src/platform_impl/linux/common/xkb/mod.rs:163— rio-window/src/platform_impl/linux/common/xkb/mod.rs:163-174 | rio-window/src/platform_impl/linux/common/xkb/mod.rs:184-195 — 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) rio-window/src/platform_impl/macos/window_delegate.rs:1284— rio-window/src/platform_impl/macos/window_delegate.rs:1284-1295 | rio-window/src/platform_impl/macos/window_delegate.rs:1309-1320 — 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) rio-window/src/platform_impl/windows/event_loop.rs:1465— rio-window/src/platform_impl/windows/event_loop.rs:1465-1476 | rio-window/src/platform_impl/windows/event_loop.rs:1483-1494 — 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) sugarloaf/src/font/macos.rs:1378— sugarloaf/src/font/macos.rs:1378-1389 | sugarloaf/src/font/macos.rs:1496-1507 — 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) sugarloaf/src/font/mod.rs:322— sugarloaf/src/font/mod.rs:322-333 | sugarloaf/src/font/mod.rs:385-396 — 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) sugarloaf/src/grid/metal.rs:542— sugarloaf/src/grid/metal.rs:542-553 | sugarloaf/src/grid/vulkan.rs:847-858 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/grid/vulkan.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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) sugarloaf/src/grid/webgpu.rs:830— sugarloaf/src/grid/webgpu.rs:830-841 | sugarloaf/src/text.rs:1519-1530 — 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) sugarloaf/src/renderer/image_cache/cache.rs:156— sugarloaf/src/renderer/image_cache/cache.rs:156-167 | sugarloaf/src/renderer/image_cache/cache.rs:457-468 — 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) sugarloaf/src/renderer/image_cache/cache.rs:582— sugarloaf/src/renderer/image_cache/cache.rs:582-593 | sugarloaf/src/renderer/image_cache/cache.rs:648-659 — 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) sugarloaf/src/renderer/image_cache/cache.rs:904— sugarloaf/src/renderer/image_cache/cache.rs:904-915 | sugarloaf/src/renderer/image_cache/cache.rs:932-943 — 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) sugarloaf/src/renderer/vulkan.rs:1242— sugarloaf/src/renderer/vulkan.rs:1242-1253 | sugarloaf/src/text.rs:1757-1768 — before extracting anything, compare `sugarloaf/src/renderer/vulkan.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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) sugarloaf/src/renderer/mod.rs:2871— sugarloaf/src/renderer/mod.rs:2871-2883 | sugarloaf/src/renderer/mod.rs:2992-3003 — 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) frontends/rioterm/src/bindings/mod.rs:793— frontends/rioterm/src/bindings/mod.rs:793-804 | frontends/rioterm/src/bindings/mod.rs:1051-1062 — 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) frontends/rioterm/src/bindings/mod.rs:1222— frontends/rioterm/src/bindings/mod.rs:1222-1231 | frontends/rioterm/src/bindings/mod.rs:1290-1299 — 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) rio-vt/src/crosswords/mod.rs:5126— rio-vt/src/crosswords/mod.rs:5126-5135 | rio-vt/src/crosswords/mod.rs:5233-5242 — 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) rio-window/src/platform_impl/linux/common/xkb/keymap.rs:366— rio-window/src/platform_impl/linux/common/xkb/keymap.rs:366-375 | rio-window/src/platform_impl/windows/keyboard.rs:1109-1118 — before extracting anything, compare `rio-window/src/platform_impl/linux/common/xkb/keymap.rs` and `rio-window/src/platform_impl/windows/keyboard.rs` 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 (10 lines × 2) rio-window/src/platform_impl/windows/event_loop.rs:1683— rio-window/src/platform_impl/windows/event_loop.rs:1683-1692 | rio-window/src/platform_impl/windows/event_loop.rs:1725-1734 — 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) rio-window/src/platform_impl/windows/window.rs:240— rio-window/src/platform_impl/windows/window.rs:240-249 | rio-window/src/platform_impl/windows/window.rs:302-311 — 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) rio-window/src/platform_impl/windows/window.rs:369— rio-window/src/platform_impl/windows/window.rs:369-378 | rio-window/src/platform_impl/windows/window.rs:958-967 — 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) rio-window/src/platform_impl/windows/window.rs:492— rio-window/src/platform_impl/windows/window.rs:492-501 | rio-window/src/platform_impl/windows/window.rs:511-520 — 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) sugarloaf/src/font/macos.rs:1315— sugarloaf/src/font/macos.rs:1315-1324 | sugarloaf/src/font/macos.rs:1463-1472 — 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) sugarloaf/src/font/metrics.rs:91— sugarloaf/src/font/metrics.rs:91-100 | sugarloaf/src/font/mod.rs:1291-1300 — 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) sugarloaf/src/font/mod.rs:655— sugarloaf/src/font/mod.rs:655-664 | sugarloaf/src/font/mod.rs:718-727 — 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) sugarloaf/src/grid/vulkan.rs:1552— sugarloaf/src/grid/vulkan.rs:1552-1561 | sugarloaf/src/text.rs:1716-1725 — before extracting anything, compare `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 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) sugarloaf/src/renderer/image_cache/colr_raster.rs:460— sugarloaf/src/renderer/image_cache/colr_raster.rs:460-469 | sugarloaf/src/renderer/image_cache/colr_raster.rs:485-494 — 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) sugarloaf/src/renderer/vulkan.rs:925— sugarloaf/src/renderer/vulkan.rs:925-934 | sugarloaf/src/renderer/vulkan.rs:1172-1181 — 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) rio-window/src/platform_impl/web/event_loop/runner.rs:353— rio-window/src/platform_impl/web/event_loop/runner.rs:353-362 | rio-window/src/platform_impl/web/event_loop/runner.rs:377-386 — 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.
XxxComment teletypewriter/src/windows/conpty.rs:97— // XXX: This will block until the conout pipe is drained. Will cause a deadlock if the — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/macos/app_delegate.rs:714— // XXX: how does it make sense that `event_handler.ready()` can ever return `false` here if — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/macos/window_delegate.rs:843— // XXX Send `Focused(false)` right after creating the window delegate, so we won't — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/macos/window_delegate.rs:1333— // XXX the resize increments are only used during live resizes. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/mod.rs:698— // XXX only update the error, if it wasn't handled by any of the hooks. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/x11/ime/context.rs:200— // XXX: this struct doesn't destroy its XIC resource when dropped. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/wayland/window/mod.rs:184— // XXX Do initial commit. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/wayland/window/mod.rs:219— // XXX Wait for the initial configure to arrive. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/wayland/window/mod.rs:380— // XXX clients don't know whether they are minimized or not. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/wayland/window/mod.rs:682— // XXX there's no such concept on Wayland. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/wayland/seat/text_input/mod.rs:94— // XXX this check is essential, because `leave` could have a — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:57— // XXX can't remove RefCell out of here, unless we can plumb generics into the `Window`, which — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:72— // XXX drop after everything else, just to be safe. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (9 lines × 2) frontends/rioterm/src/renderer/assistant.rs:182— frontends/rioterm/src/renderer/assistant.rs:182-190 | frontends/rioterm/src/renderer/search.rs:133-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 (9 lines × 2) rio-vt/src/crosswords/mod.rs:1843— rio-vt/src/crosswords/mod.rs:1843-1851 | rio-vt/src/crosswords/mod.rs:1919-1927 — 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) rio-vt/src/performer/parser/mod.rs:1039— rio-vt/src/performer/parser/mod.rs:1039-1047 | rio-vt/src/performer/parser/mod.rs:1114-1122 — 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) rio-window/src/platform_impl/linux/common/xkb/keymap.rs:309— rio-window/src/platform_impl/linux/common/xkb/keymap.rs:309-317 | rio-window/src/platform_impl/windows/keyboard.rs:1005-1013 — before extracting anything, compare `rio-window/src/platform_impl/linux/common/xkb/keymap.rs` and `rio-window/src/platform_impl/windows/keyboard.rs` 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 (9 lines × 2) rio-window/src/platform_impl/linux/wayland/seat/touch/mod.rs:83— rio-window/src/platform_impl/linux/wayland/seat/touch/mod.rs:83-91 | rio-window/src/platform_impl/linux/wayland/seat/touch/mod.rs:126-134 — 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) rio-window/src/platform_impl/linux/x11/dnd.rs:76— rio-window/src/platform_impl/linux/x11/dnd.rs:76-84 | rio-window/src/platform_impl/linux/x11/dnd.rs:100-108 — 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) sugarloaf/src/grid/vulkan.rs:1404— sugarloaf/src/grid/vulkan.rs:1404-1412 | sugarloaf/src/renderer/vulkan.rs:1158-1166 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9 lines × 2) sugarloaf/src/renderer/image_cache/cache.rs:205— sugarloaf/src/renderer/image_cache/cache.rs:205-213 | sugarloaf/src/renderer/image_cache/cache.rs:636-644 — 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) sugarloaf/src/renderer/image_cache/colr_raster.rs:594— sugarloaf/src/renderer/image_cache/colr_raster.rs:594-602 | sugarloaf/src/renderer/image_cache/colr_raster.rs:618-626 — 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) sugarloaf/src/renderer/vulkan.rs:675— sugarloaf/src/renderer/vulkan.rs:675-683 | sugarloaf/src/renderer/vulkan.rs:701-709 — 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) rio-vt/src/ansi/graphics.rs:773— rio-vt/src/ansi/graphics.rs:773-783 | rio-vt/src/ansi/kitty_graphics_protocol.rs:48-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 (9 lines × 2) sugarloaf/src/grid/metal.rs:778— sugarloaf/src/grid/metal.rs:778-789 | sugarloaf/src/text.rs:1302-1310 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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 (9 lines × 2) sugarloaf/src/renderer/image_cache/cache.rs:130— sugarloaf/src/renderer/image_cache/cache.rs:130-140 | sugarloaf/src/renderer/image_cache/cache.rs:151-159 — 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) frontends/rioterm/src/renderer/mod.rs:307— frontends/rioterm/src/renderer/mod.rs:307-314 | libsugarloaf/src/capi.rs:854-860 — before extracting anything, compare `frontends/rioterm/src/renderer/mod.rs` and `libsugarloaf/src/capi.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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 (7 lines × 2) rio-vt/src/crosswords/mod.rs:1381— rio-vt/src/crosswords/mod.rs:1381-1387 | rio-vt/src/crosswords/mod.rs:1440-1446 — 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) sugarloaf/src/font/loader.rs:575— sugarloaf/src/font/loader.rs:575-581 | sugarloaf/src/font/mod.rs:1713-1719 — 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) sugarloaf/src/font/mod.rs:1616— sugarloaf/src/font/mod.rs:1616-1622 | sugarloaf/src/font/mod.rs:1673-1679 — 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) sugarloaf/src/grid/vulkan.rs:1209— sugarloaf/src/grid/vulkan.rs:1209-1215 | sugarloaf/src/grid/vulkan.rs:1234-1240 — 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) rio-window/src/platform/wayland.rs:85— rio-window/src/platform/wayland.rs:85-91 | rio-window/src/platform/x11.rs:203-209 — 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) rio-vt/src/ansi/glyph_protocol.rs:289— rio-vt/src/ansi/glyph_protocol.rs:289-295 | rio-vt/src/ansi/glyph_protocol.rs:304-312 — 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) sugarloaf/src/renderer/mod.rs:962— sugarloaf/src/renderer/mod.rs:962-968 | sugarloaf/src/renderer/mod.rs:1336-1343 — 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) rio-window/src/platform_impl/web/web_sys/canvas.rs:299— rio-window/src/platform_impl/web/web_sys/canvas.rs:299-305 | rio-window/src/platform_impl/web/web_sys/canvas.rs:323-330 — 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) teletypewriter/src/unix/mod.rs:976— teletypewriter/src/unix/mod.rs:976-982 | teletypewriter/src/unix/mod.rs:1005-1011 — 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) rio-window/src/platform_impl/web/web_sys/mod.rs:91— rio-window/src/platform_impl/web/web_sys/mod.rs:91-97 | rio-window/src/platform_impl/web/web_sys/mod.rs:112-118 — 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) sugarloaf/src/renderer/mod.rs:3111— sugarloaf/src/renderer/mod.rs:3111-3117 | sugarloaf/src/renderer/mod.rs:3149-3155 — 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) frontends/rioterm/src/bindings/mod.rs:1235— frontends/rioterm/src/bindings/mod.rs:1235-1242 | frontends/rioterm/src/bindings/mod.rs:1303-1310 — 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) frontends/rioterm/src/screen/mod.rs:2712— frontends/rioterm/src/screen/mod.rs:2712-2719 | frontends/rioterm/src/screen/mod.rs:2793-2800 — 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) rio-vt/src/crosswords/mod.rs:1887— rio-vt/src/crosswords/mod.rs:1887-1894 | rio-vt/src/crosswords/mod.rs:1970-1977 — 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) rio-vt/src/crosswords/mod.rs:5100— rio-vt/src/crosswords/mod.rs:5100-5107 | rio-vt/src/crosswords/mod.rs:5122-5129 — 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) rio-window/src/platform_impl/macos/cursor.rs:139— rio-window/src/platform_impl/macos/cursor.rs:139-146 | rio-window/src/platform_impl/macos/cursor.rs:147-154 — 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) rio-window/src/platform_impl/macos/event.rs:487— rio-window/src/platform_impl/macos/event.rs:487-494 | rio-window/src/platform_impl/windows/keyboard.rs:1090-1097 — 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) sugarloaf/src/grid/vulkan.rs:587— sugarloaf/src/grid/vulkan.rs:587-594 | sugarloaf/src/renderer/vulkan.rs:1486-1493 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (8 lines × 2) sugarloaf/src/renderer/mod.rs:2508— sugarloaf/src/renderer/mod.rs:2508-2515 | sugarloaf/src/renderer/mod.rs:2521-2528 — 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) rio-window/src/platform_impl/macos/monitor.rs:89— rio-window/src/platform_impl/macos/monitor.rs:89-96 | rio-window/src/platform_impl/windows/monitor.rs:51-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 (8 lines × 2) sugarloaf/src/grid/vulkan.rs:1298— sugarloaf/src/grid/vulkan.rs:1298-1305 | sugarloaf/src/renderer/vulkan.rs:793-800 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (8 lines × 2) rio-window/src/platform_impl/web/event_loop/runner.rs:401— rio-window/src/platform_impl/web/event_loop/runner.rs:401-408 | rio-window/src/platform_impl/web/event_loop/runner.rs:419-426 — 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 (5 lines × 2) corcovado/src/sys/unix/uds.rs:177— corcovado/src/sys/unix/uds.rs:177-181 | corcovado/src/sys/unix/uds.rs:212-216 — 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 (5 lines × 2) frontends/rioterm/src/bindings/mod.rs:1205— frontends/rioterm/src/bindings/mod.rs:1205-1209 | frontends/rioterm/src/bindings/mod.rs:1267-1271 — 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 (5 lines × 2) frontends/rioterm/src/bindings/mod.rs:1212— frontends/rioterm/src/bindings/mod.rs:1212-1216 | frontends/rioterm/src/bindings/mod.rs:1280-1284 — 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 (5 lines × 2) frontends/rioterm/src/layout/mod.rs:1208— frontends/rioterm/src/layout/mod.rs:1208-1212 | frontends/rioterm/src/layout/mod.rs:1214-1218 — 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 (5 lines × 2) sugarloaf/src/grid/vulkan.rs:1053— sugarloaf/src/grid/vulkan.rs:1053-1057 | sugarloaf/src/text.rs:1085-1089 — before extracting anything, compare `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 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 (5 lines × 2) sugarloaf/src/renderer/mod.rs:1955— sugarloaf/src/renderer/mod.rs:1955-1959 | sugarloaf/src/renderer/mod.rs:2113-2117 — 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 (5 lines × 2) sugarloaf/src/sprite/box_drawing.rs:595— sugarloaf/src/sprite/box_drawing.rs:595-599 | sugarloaf/src/sprite/box_drawing.rs:611-615 — 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 (5 lines × 2) sugarloaf/src/sprite/powerline.rs:63— sugarloaf/src/sprite/powerline.rs:63-67 | sugarloaf/src/sprite/powerline.rs:107-113 — 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 (5 lines × 2) rio-graphics/src/glyph/glyph_registry.rs:58— rio-graphics/src/glyph/glyph_registry.rs:58-62 | rio-vt/src/ansi/glyph_protocol.rs:51-55 — 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) frontends/rioterm/src/layout/mod.rs:307— frontends/rioterm/src/layout/mod.rs:307-311 | frontends/rioterm/src/layout/mod.rs:472-476 — 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 (5 lines × 2) sugarloaf/src/renderer/cpu.rs:517— sugarloaf/src/renderer/cpu.rs:517-521 | sugarloaf/src/renderer/cpu.rs:854-858 — 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) frontends/rioterm/src/application.rs:408— frontends/rioterm/src/application.rs:408-414 | frontends/rioterm/src/application.rs:468-473 — 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) frontends/rioterm/src/bindings/mod.rs:1248— frontends/rioterm/src/bindings/mod.rs:1248-1253 | frontends/rioterm/src/bindings/mod.rs:1316-1323 — 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) rio-grid/src/lib.rs:756— rio-grid/src/lib.rs:756-761 | rio-grid/src/lib.rs:1035-1040 — 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) rio-vt/src/crosswords/mod.rs:5118— rio-vt/src/crosswords/mod.rs:5118-5123 | rio-vt/src/crosswords/mod.rs:5224-5229 — 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) rio-window/src/platform_impl/linux/wayland/window/mod.rs:154— rio-window/src/platform_impl/linux/wayland/window/mod.rs:154-159 | rio-window/src/platform_impl/linux/wayland/window/mod.rs:509-514 — 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) sugarloaf/src/sprite/box_drawing.rs:467— sugarloaf/src/sprite/box_drawing.rs:467-472 | sugarloaf/src/sprite/box_drawing.rs:496-501 — 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) teletypewriter/src/windows/spsc.rs:72— teletypewriter/src/windows/spsc.rs:72-77 | teletypewriter/src/windows/spsc.rs:134-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 (6 lines × 2) rio-window/src/platform_impl/macos/monitor.rs:69— rio-window/src/platform_impl/macos/monitor.rs:69-74 | rio-window/src/platform_impl/windows/monitor.rs: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) rio-window/src/platform_impl/macos/monitor.rs:80— rio-window/src/platform_impl/macos/monitor.rs:80-85 | rio-window/src/platform_impl/windows/monitor.rs:42-47 — 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) sugarloaf/src/grid/vulkan.rs:1770— sugarloaf/src/grid/vulkan.rs:1770-1775 | sugarloaf/src/renderer/vulkan.rs:807-812 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×9
Duplicated block (13 lines × 2) librio/src/render_state.rs:270— librio/src/render_state.rs:270-282 | rio-vt/src/crosswords/grid/mod.rs:700-712 — 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 (13 lines × 2) rio-fonts/src/nerd_font.rs:1370— rio-fonts/src/nerd_font.rs:1370-1382 | rio-fonts/src/nerd_font.rs:2616-2628 — 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) rio-fonts/src/nerd_font.rs:2247— rio-fonts/src/nerd_font.rs:2247-2259 | rio-fonts/src/nerd_font.rs:3058-3070 — 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) rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:204— rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:204-216 | rio-window/src/platform_impl/linux/x11/mod.rs:470-482 — before extracting anything, compare `rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs` and `rio-window/src/platform_impl/linux/x11/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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) rio-window/src/platform_impl/linux/x11/ime/context.rs:273— rio-window/src/platform_impl/linux/x11/ime/context.rs:273-285 | rio-window/src/platform_impl/linux/x11/ime/context.rs:333-345 — 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) sugarloaf/src/grid/webgpu.rs:693— sugarloaf/src/grid/webgpu.rs:693-705 | sugarloaf/src/text.rs:1534-1546 — 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 (13 lines × 2) sugarloaf/src/renderer/image_cache/cache.rs:235— sugarloaf/src/renderer/image_cache/cache.rs:235-247 | sugarloaf/src/renderer/image_cache/cache.rs:254-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.
Duplicated block (13 lines × 2) sugarloaf/src/renderer/mod.rs:631— sugarloaf/src/renderer/mod.rs:631-643 | sugarloaf/src/renderer/mod.rs:2045-2057 — 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) teletypewriter/src/unix/mod.rs:312— teletypewriter/src/unix/mod.rs:312-324 | teletypewriter/src/unix/mod.rs:337-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.
Screen::render (cognitive 105) frontends/rioterm/src/screen/mod.rs:3877— Screen::render has cognitive complexity 105 (threshold 15). Drivers by points: if/else 43 (72 pts), loops 8 (16 pts), match/switch 4 (10 pts), boolean chains 7 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Screen::handle_island_click (cognitive 47) frontends/rioterm/src/screen/mod.rs:2915— Screen::handle_island_click has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 7 (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.
Screen::process_key_bindings (cognitive 45) frontends/rioterm/src/screen/mod.rs:1038— Screen::process_key_bindings has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Screen::process_key_event (cognitive 36) frontends/rioterm/src/screen/mod.rs:812— Screen::process_key_event has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (27 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). 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.
Screen::scroll (cognitive 29) frontends/rioterm/src/screen/mod.rs:3614— Screen::scroll has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 4 (8 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.
Screen::update_hint_state (cognitive 27) frontends/rioterm/src/screen/mod.rs:4933— Screen::update_hint_state has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Screen::find_hint_at_point (cognitive 19) frontends/rioterm/src/screen/mod.rs:2232— Screen::find_hint_at_point has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Screen::set_ime_preedit (cognitive 18) frontends/rioterm/src/screen/mod.rs:413— Screen::set_ime_preedit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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.
Duplicated block (14 lines × 2) frontends/rioterm/src/layout/mod.rs:790— frontends/rioterm/src/layout/mod.rs:790-803 | frontends/rioterm/src/layout/mod.rs:816-829 — 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) frontends/rioterm/src/layout/mod.rs:850— frontends/rioterm/src/layout/mod.rs:850-863 | frontends/rioterm/src/layout/mod.rs:876-889 — 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) frontends/rioterm/src/layout/mod.rs:1475— frontends/rioterm/src/layout/mod.rs:1475-1488 | frontends/rioterm/src/layout/mod.rs:1526-1539 — 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) frontends/rioterm/src/layout/mod.rs:1578— frontends/rioterm/src/layout/mod.rs:1578-1591 | frontends/rioterm/src/layout/mod.rs:1630-1643 — 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) rio-grid/src/lib.rs:2846— rio-grid/src/lib.rs:2846-2859 | rio-grid/src/lib.rs:2915-2928 — 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) sugarloaf/src/font/macos.rs:756— sugarloaf/src/font/macos.rs:756-769 | sugarloaf/src/font/macos.rs:773-786 — 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) sugarloaf/src/sprite/box_drawing.rs:366— sugarloaf/src/sprite/box_drawing.rs:366-379 | sugarloaf/src/sprite/box_drawing.rs:392-405 — 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) rio-window/src/platform_impl/web/web_sys/pointer.rs:41— rio-window/src/platform_impl/web/web_sys/pointer.rs:41-54 | rio-window/src/platform_impl/web/web_sys/pointer.rs:61-74 — 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.
sugarloaf::sprite::box_drawing::lc (cyclomatic 53) sugarloaf/src/sprite/box_drawing.rs:234— sugarloaf::sprite::box_drawing::lc has cyclomatic complexity 53 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: sugarloaf::sprite::box_drawing::draw (cyclomatic 129) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
sugarloaf::renderer::cpu::render_cpu (cyclomatic 37) sugarloaf/src/renderer/cpu.rs:286— sugarloaf::renderer::cpu::render_cpu has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
sugarloaf::renderer::cpu::draw_quad_instance (cyclomatic 34) sugarloaf/src/renderer/cpu.rs:848— sugarloaf::renderer::cpu::draw_quad_instance 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.
sugarloaf::font::lookup_for_font_match (cyclomatic 17) sugarloaf/src/font/mod.rs:158— sugarloaf::font::lookup_for_font_match 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.
sugarloaf::font::linux::discover_fallback (cyclomatic 17) sugarloaf/src/font/linux.rs:57— sugarloaf::font::linux::discover_fallback 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.
sugarloaf::font::loader::find_best_match (cyclomatic 16) sugarloaf/src/font/loader.rs:219— sugarloaf::font::loader::find_best_match has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — 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.
sugarloaf::sprite::braille::draw (cyclomatic 16) sugarloaf/src/sprite/braille.rs:20— sugarloaf::sprite::braille::draw 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.
rio_grid::build_row_fg (cognitive 216) rio-grid/src/lib.rs:1847— rio_grid::build_row_fg has cognitive complexity 216 (threshold 15). Drivers by points: if/else 69 (187 pts), boolean chains 15, loops 6 (12 pts), match/switch 1 (2 pts) (nesting depth added 125). 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.
rio_grid::row_hints_for (cognitive 23) rio-grid/src/lib.rs:232— rio_grid::row_hints_for has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rio_grid::rasterize_decoration (cognitive 23) rio-grid/src/lib.rs:866— rio_grid::rasterize_decoration has cognitive complexity 23 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 1 (3 pts), match/switch 1 (nesting depth added 13). 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.
rio_grid::build_row_bg (cognitive 19) rio-grid/src/lib.rs:1174— rio_grid::build_row_bg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). 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.
rio_grid::emit_preedit_cluster (cognitive 17) rio-grid/src/lib.rs:2610— rio_grid::emit_preedit_cluster has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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.
rio_grid::emit_underlines (cognitive 17) rio-grid/src/lib.rs:2780— rio_grid::emit_underlines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rio_grid::emit_strikethroughs (cognitive 16) rio-grid/src/lib.rs:2862— rio_grid::emit_strikethroughs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rio_vt::ansi::kitty_graphics_protocol::create_graphic_data (cognitive 100) rio-vt/src/ansi/kitty_graphics_protocol.rs:1024— rio_vt::ansi::kitty_graphics_protocol::create_graphic_data has cognitive complexity 100 (threshold 15). Drivers by points: if/else 38 (72 pts), boolean chains 10, loops 3 (9 pts), match/switch 6 (9 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rio_vt::ansi::kitty_graphics_protocol::parse (cognitive 60) rio-vt/src/ansi/kitty_graphics_protocol.rs:359— rio_vt::ansi::kitty_graphics_protocol::parse has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (45 pts), match/switch 5 (10 pts), boolean chains 4, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rio_vt::ansi::kitty_graphics_protocol::parse_control_data (cognitive 42) rio-vt/src/ansi/kitty_graphics_protocol.rs:796— rio_vt::ansi::kitty_graphics_protocol::parse_control_data has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 10 (33 pts), if/else 3 (7 pts), loops 2 (nesting depth added 27). 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.
rio_vt::grapheme_lut::cluster_width (cognitive 21) rio-vt/src/grapheme_lut.rs:117— rio_vt::grapheme_lut::cluster_width has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rio_vt::ansi::iterm2_image_protocol::param_values (cognitive 18) rio-vt/src/ansi/iterm2_image_protocol.rs:87— rio_vt::ansi::iterm2_image_protocol::param_values has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rio_vt::crosswords::formatter::push_color (cognitive 18) rio-vt/src/crosswords/formatter.rs:248— rio_vt::crosswords::formatter::push_color has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (nesting depth added 7). 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.
rio_vt::performer::parser::trim_valid_partial_utf8 (cognitive 16) rio-vt/src/performer/parser/mod.rs:1329— rio_vt::performer::parser::trim_valid_partial_utf8 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (11 lines × 2) sugarloaf/src/font/macos.rs:981— sugarloaf/src/font/macos.rs:981-991 | sugarloaf/src/font/macos.rs:1165-1175 — 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) sugarloaf/src/grid/metal.rs:563— sugarloaf/src/grid/metal.rs:563-573 | sugarloaf/src/grid/vulkan.rs:868-878 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/grid/vulkan.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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) sugarloaf/src/renderer/vulkan.rs:368— sugarloaf/src/renderer/vulkan.rs:368-378 | sugarloaf/src/renderer/vulkan.rs:603-613 — 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) sugarloaf/src/sprite/box_drawing.rs:321— sugarloaf/src/sprite/box_drawing.rs:321-331 | sugarloaf/src/sprite/box_drawing.rs:385-395 — 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) rio-vt/src/crosswords/mod.rs:2697— rio-vt/src/crosswords/mod.rs:2697-2707 | rio-vt/src/crosswords/search.rs:685-695 — 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) rio-vt/src/crosswords/mod.rs:2710— rio-vt/src/crosswords/mod.rs:2710-2720 | rio-vt/src/crosswords/search.rs:698-708 — 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) sugarloaf/src/grid/vulkan.rs:1449— sugarloaf/src/grid/vulkan.rs:1449-1459 | sugarloaf/src/renderer/vulkan.rs:946-956 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
FixmeComment sugarloaf/src/context/webgpu.rs:350— // FIXME: On Nvidia GPUs usage Rgba16Float texture format causes driver to enable HDR. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment rio-window/src/platform_impl/windows/event_loop.rs:1153— // FIXME: detect WM_DWMCOMPOSITIONCHANGED and call DwmEnableBlurBehindWindow if necessary — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment rio-window/src/platform_impl/orbital/mod.rs:227— // FIXME no way to get real refresh rate for now. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment rio-window/src/platform_impl/orbital/mod.rs:233— // FIXME this is not the real refresh rate — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment rio-window/src/platform_impl/linux/x11/window.rs:866— // FIXME: this is actually not correct if we're setting the — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment rio-window/src/platform_impl/linux/wayland/window/state.rs:1041— // FIXME: This won't fly unless user will have a way to request IME window per seat, since — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (15 lines × 2) frontends/rioterm/src/router/mod.rs:573— frontends/rioterm/src/router/mod.rs:573-587 | frontends/rioterm/src/router/mod.rs:607-621 — 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) frontends/rioterm/src/screen/touch.rs:148— frontends/rioterm/src/screen/touch.rs:148-162 | frontends/rioterm/src/screen/touch.rs:228-242 — 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) rio-fonts/src/nerd_font.rs:2874— rio-fonts/src/nerd_font.rs:2874-2888 | rio-fonts/src/nerd_font.rs:3055-3069 — 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) rio-graphics/src/lib.rs:346— rio-graphics/src/lib.rs:346-360 | rio-graphics/src/lib.rs:411-425 — 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) sugarloaf/src/renderer/vulkan.rs:1560— sugarloaf/src/renderer/vulkan.rs:1560-1574 | sugarloaf/src/renderer/vulkan.rs:1578-1592 — 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) teletypewriter/src/windows/pipes.rs:132— teletypewriter/src/windows/pipes.rs:132-146 | teletypewriter/src/windows/pipes.rs:320-334 — 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.
Renderer::run (cognitive 103) frontends/rioterm/src/renderer/mod.rs:446— Renderer::run has cognitive complexity 103 (threshold 15). Drivers by points: if/else 32 (81 pts), loops 7 (15 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 59). 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.
Renderer::render (cognitive 88) sugarloaf/src/renderer/mod.rs:1864— Renderer::render has cognitive complexity 88 (threshold 15). Drivers by points: if/else 23 (67 pts), loops 3 (8 pts), boolean chains 7, match/switch 2 (6 pts) (nesting depth added 53). 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.
Renderer::render_graphic_overlays (cognitive 40) sugarloaf/src/renderer/mod.rs:1195— Renderer::render_graphic_overlays has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Renderer::render_metal (cognitive 33) sugarloaf/src/renderer/mod.rs:2168— Renderer::render_metal has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (5 pts), boolean chains 4, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Renderer::push_virtual_placeholder_overlays (cognitive 27) frontends/rioterm/src/renderer/mod.rs:967— Renderer::push_virtual_placeholder_overlays has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (6 pts), loops 2 (3 pts) (nesting depth added 13). Of this number, 23 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EventProcessor::process_xevent (cognitive 36) rio-window/src/platform_impl/linux/x11/event_processor.rs:143— EventProcessor::process_xevent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 6 (14 pts), boolean chains 1 (nesting depth added 19). 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.
EventProcessor::client_message (cognitive 30) rio-window/src/platform_impl/linux/x11/event_processor.rs:406— EventProcessor::client_message has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 1 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EventProcessor::configure_notify (cognitive 25) rio-window/src/platform_impl/linux/x11/event_processor.rs:618— EventProcessor::configure_notify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 1, match/switch 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.
EventProcessor::xinput_key_input (cognitive 23) rio-window/src/platform_impl/linux/x11/event_processor.rs:991— EventProcessor::xinput_key_input has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 1, match/switch 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.
EventProcessor::xkb_event (cognitive 17) rio-window/src/platform_impl/linux/x11/event_processor.rs:1734— EventProcessor::xkb_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 7). 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.
TooManyFields: Colors rio-vt/src/config/colors/mod.rs:97— TooManyFields — 42 stored fields. The bar is 30 stored fields; this is 12 over it, 1.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: KittyGraphicsCommand rio-vt/src/ansi/kitty_graphics_protocol.rs:177— TooManyFields — 41 stored fields. The bar is 30 stored fields; this is 11 over it, 1.37× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: WindowState rio-window/src/platform_impl/linux/wayland/window/state.rs:58— TooManyFields — 37 stored fields beside 57 methods. The bar is 30 stored fields; this is 7 over it, 1.23× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Config rio-backend/src/config/mod.rs:100— TooManyFields — 37 stored fields beside 6 methods. The bar is 30 stored fields; this is 7 over it, 1.23× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Renderer frontends/rioterm/src/renderer/mod.rs:153— TooManyFields — 31 stored fields beside 11 methods. The bar is 30 stored fields; this is 1 over it, 1.03× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
Change coupling: mod.rs ↔ watcher.rs frontends/rioterm/src/screen/mod.rs:1— `frontends/rioterm/src/screen/mod.rs` and `frontends/rioterm/src/watcher.rs` change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `e566c9cb` Fix: Configuration updates triggered multiple times on one save; `c22e31bf` remove use_wa from code reference; `c711e4ca` remove tokio runtime — run `git show` on any of them.
Change coupling: vi_mode.rs ↔ selection.rs rio-vt/src/crosswords/vi_mode.rs:1— `rio-vt/src/crosswords/vi_mode.rs` and `rio-vt/src/selection.rs` change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `071eaaa6` scrollback-history-limit (closes #993) (at that commit the files were still `rio-backend/src/crosswords/vi_mode.rs` and `rio-backend/src/selection.rs`); `99607e6f` scale_constraint (at that commit the files were still `rio-backend/src/crosswords/vi_mode.rs` and `rio-backend/src/selection.rs`); `c22e31bf` remove use_wa from code reference (at that commit the files were still `rio-backend/src/crosswords/vi_mode.rs` and `rio-backend/src/selection.rs`) — run `git show` on any of them.
Change coupling: font_cache.rs ↔ mod.rs frontends/rioterm/src/renderer/font_cache.rs:1— `frontends/rioterm/src/renderer/font_cache.rs` and `frontends/rioterm/src/renderer/mod.rs` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `99607e6f` scale_constraint; `4cdd0343` constraint width; `754a50ad` Migrate frontend to new sugarloaf api (#1365) — run `git show` on any of them.
Change coupling: assistant.rs ↔ welcome.rs frontends/rioterm/src/router/routes/assistant.rs:1— `frontends/rioterm/src/router/routes/assistant.rs` and `frontends/rioterm/src/router/routes/welcome.rs` change together 64% of the time (18 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are `39a2b22a` refactor cursor; `754a50ad` Migrate frontend to new sugarloaf api (#1365); `6801f342` updates — run `git show` on any of them.
Change coupling: trail_cursor.rs ↔ mod.rs frontends/rioterm/src/renderer/trail_cursor.rs:1— `frontends/rioterm/src/renderer/trail_cursor.rs` and `frontends/rioterm/src/screen/mod.rs` change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `a0fb6da4` trail: converge thin shapes onto drawn cursor geometry, clamp vi row; `5432ea88` Rework cursor trail: exact easing, visibility fade, config surface (#…; `e5d023a2` allow drag and reorder tabs — run `git show` on any of them.
Duplicated block (27 lines × 2) frontends/rioterm/src/context/mod.rs:1247— frontends/rioterm/src/context/mod.rs:1247-1273 | frontends/rioterm/src/context/mod.rs:1311-1337 — 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 (27 lines × 2) frontends/rioterm/src/layout/mod.rs:1542— frontends/rioterm/src/layout/mod.rs:1542-1568 | frontends/rioterm/src/layout/mod.rs:1594-1620 — 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 (27 lines × 2) rio-vt/src/crosswords/mod.rs:776— rio-vt/src/crosswords/mod.rs:776-802 | rio-vt/src/crosswords/mod.rs:890-916 — 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 (27 lines × 2) rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:298— rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:298-324 | rio-window/src/platform_impl/linux/x11/mod.rs:569-595 — before extracting anything, compare `rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs` and `rio-window/src/platform_impl/linux/x11/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 (27 lines × 2) sugarloaf/src/renderer/image_cache/cache.rs:361— sugarloaf/src/renderer/image_cache/cache.rs:361-387 | sugarloaf/src/renderer/image_cache/cache.rs:411-437 — 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 (17 lines × 2) rio-window/src/platform_impl/web/web_sys/event.rs:202— rio-window/src/platform_impl/web/web_sys/event.rs:202-218 | rio-window/src/platform_impl/web/web_sys/event.rs:221-237 — 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 (17 lines × 2) sugarloaf/src/grid/cpu.rs:376— sugarloaf/src/grid/cpu.rs:376-392 | sugarloaf/src/grid/cpu.rs:429-445 — 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 (17 lines × 2) sugarloaf/src/grid/vulkan.rs:327— sugarloaf/src/grid/vulkan.rs:327-343 | sugarloaf/src/grid/vulkan.rs:365-381 — 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 (17 lines × 2) sugarloaf/src/renderer/mod.rs:911— sugarloaf/src/renderer/mod.rs:911-927 | sugarloaf/src/renderer/mod.rs:1290-1306 — 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 (17 lines × 2) sugarloaf/src/renderer/vulkan.rs:1017— sugarloaf/src/renderer/vulkan.rs:1017-1033 | sugarloaf/src/renderer/vulkan.rs:1552-1568 — 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.
Off the main sequence: rio-fonts — rio-fonts: 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: rio-graphics — rio-graphics: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: rio-unicode — rio-unicode: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: corcovado — corcovado: abstractness 0.08, instability 0.00, distance 0.92 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: rio-window — rio-window: abstractness 0.11, instability 0.00, distance 0.89 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode (cyclomatic 160) rio-window/src/platform_impl/windows/keyboard.rs:979— rio_window::platform_impl::windows::keyboard::physicalkey_to_scancode has cyclomatic complexity 160 (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.
rio_window::platform_impl::windows::event_loop::public_window_callback_inner (cyclomatic 157) rio-window/src/platform_impl/windows/event_loop.rs:1216— rio_window::platform_impl::windows::event_loop::public_window_callback_inner has cyclomatic complexity 157 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rio_window::platform_impl::macos::window_delegate::new_window (cyclomatic 29) rio-window/src/platform_impl/macos/window_delegate.rs:523— rio_window::platform_impl::macos::window_delegate::new_window 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.
rio_window::platform_impl::windows::event_loop::handle_raw_input (cyclomatic 18) rio-window/src/platform_impl/windows/event_loop.rs:2797— rio_window::platform_impl::windows::event_loop::handle_raw_input 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.
Screen::process_key_bindings (cyclomatic 84) frontends/rioterm/src/screen/mod.rs:1038— Screen::process_key_bindings has cyclomatic complexity 84 (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.
Screen::render (cyclomatic 53) frontends/rioterm/src/screen/mod.rs:3877— Screen::render has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Screen::handle_island_click (cyclomatic 33) frontends/rioterm/src/screen/mod.rs:2915— Screen::handle_island_click 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.
Screen::process_key_event (cyclomatic 23) frontends/rioterm/src/screen/mod.rs:812— Screen::process_key_event 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. This is NOT this file's highest cyclomatic complexity: Screen::execute_palette_action (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
rio_vt::ansi::kitty_graphics_protocol::create_graphic_data (cyclomatic 56) rio-vt/src/ansi/kitty_graphics_protocol.rs:1024— rio_vt::ansi::kitty_graphics_protocol::create_graphic_data has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rio_vt::ansi::kitty_graphics_protocol::parse_control_data (cyclomatic 46) rio-vt/src/ansi/kitty_graphics_protocol.rs:796— rio_vt::ansi::kitty_graphics_protocol::parse_control_data has cyclomatic complexity 46 (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.
rio_vt::ansi::kitty_graphics_protocol::parse (cyclomatic 34) rio-vt/src/ansi/kitty_graphics_protocol.rs:359— rio_vt::ansi::kitty_graphics_protocol::parse 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.
rio_vt::crosswords::formatter::write_sgr (cyclomatic 18) rio-vt/src/crosswords/formatter.rs:186— rio_vt::crosswords::formatter::write_sgr 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.
Renderer::run (cyclomatic 40) frontends/rioterm/src/renderer/mod.rs:446— Renderer::run 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.
Renderer::render (cyclomatic 34) sugarloaf/src/renderer/mod.rs:1864— Renderer::render 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.
Renderer::render_graphic_overlays (cyclomatic 24) sugarloaf/src/renderer/mod.rs:1195— Renderer::render_graphic_overlays 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.
Renderer::render_metal (cyclomatic 20) sugarloaf/src/renderer/mod.rs:2168— Renderer::render_metal 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.
EventLoop::single_iteration (cyclomatic 21) rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:338— EventLoop::single_iteration 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.
EventLoop::run (cyclomatic 19) rio-window/src/platform_impl/orbital/event_loop.rs:563— EventLoop::run 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. This is NOT this file's highest cyclomatic complexity: rio_window::platform_impl::orbital::event_loop::convert_scancode (cyclomatic 94) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
EventLoop::process_event (cyclomatic 18) rio-window/src/platform_impl/orbital/event_loop.rs:376— EventLoop::process_event 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. This is NOT this file's highest cyclomatic complexity: rio_window::platform_impl::orbital::event_loop::convert_scancode (cyclomatic 94) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
EventLoop::single_iteration (cyclomatic 17) rio-window/src/platform_impl/linux/x11/mod.rs:617— EventLoop::single_iteration 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.
HackComment rio-window/src/platform_impl/windows/event_loop.rs:1306— // HACK(msiglreith): To add the drop shadow we slightly tweak the non-client area. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment rio-window/src/platform_impl/windows/keyboard_layout.rs:430— // HACK: `ToUnicodeEx` seems to fail getting the string for the numpad — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs:96— // HACK: this is just for GNOME not fixing their ordering issue of modifiers. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs:277— // HACK: part of the workaround from `WlKeyboardEvent::Enter`. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
rio_window::platform_impl::windows::event_loop::public_window_callback_inner (cognitive 263) rio-window/src/platform_impl/windows/event_loop.rs:1216— rio_window::platform_impl::windows::event_loop::public_window_callback_inner has cognitive complexity 263 (threshold 15). Drivers by points: if/else 86 (202 pts), match/switch 17 (42 pts), loops 4 (10 pts), boolean chains 9 (nesting depth added 147). 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.
rio_window::platform_impl::macos::window_delegate::new_window (cognitive 34) rio-window/src/platform_impl/macos/window_delegate.rs:523— rio_window::platform_impl::macos::window_delegate::new_window has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (24 pts), match/switch 4 (6 pts), boolean chains 2, loops 1 (2 pts) (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.
rio_window::platform_impl::windows::event_loop::handle_raw_input (cognitive 30) rio-window/src/platform_impl/windows/event_loop.rs:2797— rio_window::platform_impl::windows::event_loop::handle_raw_input has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 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.
rio_window::platform_impl::macos::event::create_key_event (cognitive 20) rio-window/src/platform_impl/macos/event.rs:103— rio_window::platform_impl::macos::event::create_key_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (5 pts), boolean chains 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, 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.
Grid::shrink_columns (cognitive 127) rio-vt/src/crosswords/grid/resize.rs:301— Grid::shrink_columns has cognitive complexity 127 (threshold 15). Drivers by points: if/else 34 (85 pts), loops 6 (24 pts), boolean chains 15, match/switch 1 (3 pts) (nesting depth added 71). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
Grid::grow_columns (cognitive 57) rio-vt/src/crosswords/grid/resize.rs:103— Grid::grow_columns has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (45 pts), boolean chains 8, loops 2, match/switch 1 (2 pts) (nesting depth added 24). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
Grid::scroll_up (cognitive 17) rio-vt/src/crosswords/grid/mod.rs:380— Grid::scroll_up has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 5 (6 pts), boolean chains 2 (nesting depth added 5). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
Grid::scroll_down (cognitive 16) rio-vt/src/crosswords/grid/mod.rs:311— Grid::scroll_down has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 3 (nesting depth added 6). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
ContextGrid::collapse_single_child_containers (cognitive 46) frontends/rioterm/src/layout/mod.rs:711— ContextGrid::collapse_single_child_containers has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (33 pts), match/switch 2 (7 pts), loops 3 (6 pts) (nesting depth added 32). 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.
ContextGrid::walk_separators (cognitive 41) frontends/rioterm/src/layout/mod.rs:468— ContextGrid::walk_separators has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 5 (12 pts), loops 3 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ContextGrid::find_horizontal_neighbors (cognitive 21) frontends/rioterm/src/layout/mod.rs:781— ContextGrid::find_horizontal_neighbors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (ContextGrid::find_vertical_neighbors) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ContextGrid::find_vertical_neighbors (cognitive 21) frontends/rioterm/src/layout/mod.rs:841— ContextGrid::find_vertical_neighbors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (ContextGrid::find_horizontal_neighbors) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
EventLoop::run (cognitive 41) rio-window/src/platform_impl/orbital/event_loop.rs:563— EventLoop::run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 8 (18 pts), match/switch 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EventLoop::single_iteration (cognitive 32) rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:338— EventLoop::single_iteration has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 6, match/switch 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EventLoop::single_iteration (cognitive 25) rio-window/src/platform_impl/linux/x11/mod.rs:617— EventLoop::single_iteration has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EventLoop::poll_events_with_timeout (cognitive 16) rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:258— EventLoop::poll_events_with_timeout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (18 lines × 2) rio-grid/src/lib.rs:1977— rio-grid/src/lib.rs:1977-1994 | rio-grid/src/lib.rs:2070-2087 — 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 (18 lines × 2) rio-grid/src/lib.rs:2368— rio-grid/src/lib.rs:2368-2385 | rio-grid/src/lib.rs:2684-2701 — 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 (18 lines × 2) rio-vt/src/ansi/charset.rs:69— rio-vt/src/ansi/charset.rs:69-86 | rio-vt/src/crosswords/pos.rs:138-155 — 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 (18 lines × 2) sugarloaf/src/font/macos.rs:325— sugarloaf/src/font/macos.rs:325-342 | sugarloaf/src/font/macos.rs:387-404 — 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.
Performer::csi_dispatch (cyclomatic 87) rio-vt/src/performer/handler.rs:1279— Performer::csi_dispatch has cyclomatic complexity 87 (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. This is NOT this file's highest cyclomatic complexity: rio_vt::performer::handler::get_termcap_capability (cyclomatic 273) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
Performer::osc_dispatch (cyclomatic 47) rio-vt/src/performer/handler.rs:1095— Performer::osc_dispatch has cyclomatic complexity 47 (threshold 15). Of this number, 45 points are the body's own statements and 2 belong to one function item inside it that branches. 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. This is NOT this file's highest cyclomatic complexity: rio_vt::performer::handler::get_termcap_capability (cyclomatic 273) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
Performer::process_apc_buffer (cyclomatic 19) rio-vt/src/performer/handler.rs:765— Performer::process_apc_buffer 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. This is NOT this file's highest cyclomatic complexity: rio_vt::performer::handler::get_termcap_capability (cyclomatic 273) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
rio_grid::build_row_fg (cyclomatic 80) rio-grid/src/lib.rs:1847— rio_grid::build_row_fg has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rio_grid::rasterize_decoration (cyclomatic 17) rio-grid/src/lib.rs:866— rio_grid::rasterize_decoration has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
rio_grid::row_hints_for (cyclomatic 16) rio-grid/src/lib.rs:232— rio_grid::row_hints_for 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.
librio::capi::rio_surface_key (cyclomatic 34) librio/src/capi.rs:688— librio::capi::rio_surface_key has cyclomatic complexity 34 (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.
librio::key::encode_legacy (cyclomatic 18) librio/src/key.rs:333— librio::key::encode_legacy 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. This is NOT this file's highest cyclomatic complexity: librio::key::kitty_codepoint (cyclomatic 25) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
librio::key::encode (cyclomatic 18) librio/src/key.rs:436— librio::key::encode 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. This is NOT this file's highest cyclomatic complexity: librio::key::kitty_codepoint (cyclomatic 25) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
Performer::osc_dispatch (cognitive 58) rio-vt/src/performer/handler.rs:1095— Performer::osc_dispatch has cognitive complexity 58 (threshold 15). Drivers by points: match/switch 11 (22 pts), if/else 10 (19 pts), loops 6 (15 pts), boolean chains 2 (nesting depth added 29). Of this number, 55 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Performer::csi_dispatch (cognitive 48) rio-vt/src/performer/handler.rs:1279— Performer::csi_dispatch has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 12 (21 pts), if/else 8 (15 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Performer::process_apc_buffer (cognitive 44) rio-vt/src/performer/handler.rs:765— Performer::process_apc_buffer has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Surface::serialize (cognitive 46) librio/src/lib.rs:900— Surface::serialize has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 6 (13 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Surface::url_at (cognitive 24) librio/src/lib.rs:1091— Surface::url_at has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (5 pts), boolean chains 3, match/switch 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.
Surface::scroll_wheel (cognitive 18) librio/src/lib.rs:683— Surface::scroll_wheel has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), boolean chains 2, match/switch 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, 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.
Duplicated block (16 lines × 2) rio-fonts/src/nerd_font.rs:1917— rio-fonts/src/nerd_font.rs:1917-1932 | rio-fonts/src/nerd_font.rs:1958-1973 — 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 × 2) rio-vt/src/ansi/charset.rs:48— rio-vt/src/ansi/charset.rs:48-63 | rio-vt/src/crosswords/pos.rs:117-132 — 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) sugarloaf/src/renderer/vulkan.rs:1053— sugarloaf/src/renderer/vulkan.rs:1053-1068 | sugarloaf/src/renderer/vulkan.rs:1588-1603 — 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–14 lines × 2) rio-fonts/src/nerd_font.rs:1643— rio-fonts/src/nerd_font.rs:1643-1656 | rio-fonts/src/nerd_font.rs:2752-2764 — 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–14 lines × 2) rio-fonts/src/nerd_font.rs:1728— rio-fonts/src/nerd_font.rs:1728-1741 | rio-fonts/src/nerd_font.rs:1801-1813 — 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–14 lines × 2) rio-window/src/platform_impl/linux/x11/event_processor.rs:1757— rio-window/src/platform_impl/linux/x11/event_processor.rs:1757-1770 | rio-window/src/platform_impl/linux/x11/event_processor.rs:1773-1785 — 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 × 4) sugarloaf/src/renderer/vulkan.rs:325— sugarloaf/src/renderer/vulkan.rs:325-337 | sugarloaf/src/renderer/vulkan.rs:407-418 | sugarloaf/src/renderer/vulkan.rs:495-505 | sugarloaf/src/renderer/vulkan.rs:562-572 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 4) sugarloaf/src/renderer/vulkan.rs:1023— sugarloaf/src/renderer/vulkan.rs:1023-1033 | sugarloaf/src/renderer/vulkan.rs:1047-1057 | sugarloaf/src/renderer/vulkan.rs:1558-1568 | sugarloaf/src/renderer/vulkan.rs:1576-1586 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 4) sugarloaf/src/renderer/vulkan.rs:1041— sugarloaf/src/renderer/vulkan.rs:1041-1051 | sugarloaf/src/renderer/vulkan.rs:1249-1259 | sugarloaf/src/renderer/vulkan.rs:1564-1574 | sugarloaf/src/renderer/vulkan.rs:1582-1592 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) rio-window/src/platform_impl/windows/event_loop.rs:1937— rio-window/src/platform_impl/windows/event_loop.rs:1937-1947 | rio-window/src/platform_impl/windows/event_loop.rs:1977-1987 | rio-window/src/platform_impl/windows/event_loop.rs:2017-2027 — 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 (11 lines × 3) rio-window/src/platform_impl/windows/event_loop.rs:1957— rio-window/src/platform_impl/windows/event_loop.rs:1957-1967 | rio-window/src/platform_impl/windows/event_loop.rs:1997-2007 | rio-window/src/platform_impl/windows/event_loop.rs:2037-2047 — 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 (11 lines × 3) sugarloaf/src/text.rs:584— sugarloaf/src/text.rs:584-594 | sugarloaf/src/text.rs:629-639 | sugarloaf/src/text.rs:716-726 — 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.
Application::window_event (cyclomatic 168) frontends/rioterm/src/application.rs:1205— Application::window_event has cyclomatic complexity 168 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Application::user_event (cyclomatic 149) frontends/rioterm/src/application.rs:378— Application::user_event has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Grid::shrink_columns (cyclomatic 50) rio-vt/src/crosswords/grid/resize.rs:301— Grid::shrink_columns has cyclomatic complexity 50 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
Grid::grow_columns (cyclomatic 33) rio-vt/src/crosswords/grid/resize.rs:103— Grid::grow_columns has cyclomatic complexity 33 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
EventProcessor::process_xevent (cyclomatic 41) rio-window/src/platform_impl/linux/x11/event_processor.rs:143— EventProcessor::process_xevent has cyclomatic complexity 41 (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.
EventProcessor::client_message (cyclomatic 16) rio-window/src/platform_impl/linux/x11/event_processor.rs:406— EventProcessor::client_message 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.
WinitState::event (cyclomatic 34) rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs:26— WinitState::event has cyclomatic complexity 34 (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.
WinitState::pointer_frame (cyclomatic 23) rio-window/src/platform_impl/linux/wayland/seat/pointer/mod.rs:40— WinitState::pointer_frame 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.
Machine::run (cyclomatic 21) rio-vt/src/performer/mod.rs:382— Machine::run 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.
Machine::pty_read (cyclomatic 19) rio-vt/src/performer/mod.rs:240— Machine::pty_read 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.
WindowFlags::apply_diff (cyclomatic 21) rio-window/src/platform_impl/windows/window_state.rs:319— WindowFlags::apply_diff 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.
WindowFlags::to_window_styles (cyclomatic 16) rio-window/src/platform_impl/windows/window_state.rs:257— WindowFlags::to_window_styles 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.
GraphicData::resized (cyclomatic 17) rio-graphics/src/lib.rs:391— GraphicData::resized has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — 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.
GraphicData::compute_display_dimensions (cyclomatic 16) rio-graphics/src/lib.rs:326— GraphicData::compute_display_dimensions has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — 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.
Application::window_event (cognitive 339) frontends/rioterm/src/application.rs:1205— Application::window_event has cognitive complexity 339 (threshold 15). Drivers by points: if/else 106 (266 pts), match/switch 18 (46 pts), boolean chains 27 (nesting depth added 188). 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.
Application::user_event (cognitive 253) frontends/rioterm/src/application.rs:378— Application::user_event has cognitive complexity 253 (threshold 15). Drivers by points: if/else 88 (216 pts), match/switch 6 (17 pts), loops 4 (11 pts), boolean chains 9 (nesting depth added 146). 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.
Island::render (cognitive 62) frontends/rioterm/src/renderer/island.rs:743— Island::render has cognitive complexity 62 (threshold 15). Drivers by points: if/else 28 (52 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Island::render_color_picker (cognitive 23) frontends/rioterm/src/renderer/island.rs:1264— Island::render_color_picker has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
KeyEventBuilder::process_message (cognitive 54) rio-window/src/platform_impl/windows/keyboard.rs:84— KeyEventBuilder::process_message has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 27). 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.
KeyEventBuilder::synthesize_kbd_state (cognitive 17) rio-window/src/platform_impl/windows/keyboard.rs:351— KeyEventBuilder::synthesize_kbd_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WinitState::event (cognitive 49) rio-window/src/platform_impl/linux/wayland/seat/keyboard/mod.rs:26— WinitState::event has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 14 (23 pts), boolean chains 1 (nesting depth added 22). 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.
WinitState::pointer_frame (cognitive 33) rio-window/src/platform_impl/linux/wayland/seat/pointer/mod.rs:40— WinitState::pointer_frame has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rioterm::context::title::update_title (cognitive 46) frontends/rioterm/src/context/title.rs:74— rioterm::context::title::update_title has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rioterm::bindings::kitty_keyboard::build_key_sequence (cognitive 16) frontends/rioterm/src/bindings/kitty_keyboard.rs:14— rioterm::bindings::kitty_keyboard::build_key_sequence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Config::overwrite_with_platform_config (cognitive 43) rio-backend/src/config/mod.rs:515— Config::overwrite_with_platform_config has cognitive complexity 43 (threshold 15). Drivers by points: if/else 40 (43 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.
Config::try_load (cognitive 36) rio-backend/src/config/mod.rs:418— Config::try_load has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 5 (15 pts), boolean chains 1 (nesting depth added 25). 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.
Machine::run (cognitive 39) rio-vt/src/performer/mod.rs:382— Machine::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 2 (6 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Machine::pty_read (cognitive 23) rio-vt/src/performer/mod.rs:240— Machine::pty_read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 5, 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.
ImageCache::process_atlases (cognitive 33) sugarloaf/src/renderer/image_cache/cache.rs:797— ImageCache::process_atlases has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 20). 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.
ImageCache::allocate (cognitive 21) sugarloaf/src/renderer/image_cache/cache.rs:283— ImageCache::allocate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
teletypewriter::unix::terminfo_exists (cognitive 31) teletypewriter/src/unix/mod.rs:265— teletypewriter::unix::terminfo_exists has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
teletypewriter::unix::create_pty_with_spawn (cognitive 20) teletypewriter/src/unix/mod.rs:507— teletypewriter::unix::create_pty_with_spawn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (4 pts), match/switch 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.
WindowFlags::apply_diff (cognitive 27) rio-window/src/platform_impl/windows/window_state.rs:319— WindowFlags::apply_diff has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 7). 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.
WindowFlags::to_window_styles (cognitive 16) rio-window/src/platform_impl/windows/window_state.rs:257— WindowFlags::to_window_styles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15 (16 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.
LogicalLine::extract (cognitive 26) frontends/rioterm/src/hints.rs:411— LogicalLine::extract has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (9 pts), boolean chains 4 (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.
LogicalLine::match_at (cognitive 20) frontends/rioterm/src/hints.rs:492— LogicalLine::match_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
librio::key::encode (cognitive 23) librio/src/key.rs:436— librio::key::encode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
librio::key::encode_legacy (cognitive 22) librio/src/key.rs:333— librio::key::encode_legacy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WindowDelegate::set_fullscreen (cognitive 22) rio-window/src/platform_impl/macos/window_delegate.rs:1637— WindowDelegate::set_fullscreen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 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.
WindowDelegate::setup_display_link (cognitive 16) rio-window/src/platform_impl/macos/window_delegate.rs:2407— WindowDelegate::setup_display_link has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function item inside it that branches (vsync_callback). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
List::fill_cube (cognitive 21) rio-vt/src/config/colors/term.rs:195— List::fill_cube has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 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.
List::fill_named (cognitive 20) rio-vt/src/config/colors/term.rs:99— List::fill_named has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. To reduce it, split the body: this score is breadth rather than depth — 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.
PartialKeyEventInfo::from_message (cognitive 18) rio-window/src/platform_impl/windows/keyboard.rs:546— PartialKeyEventInfo::from_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 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.
PartialKeyEventInfo::finalize (cognitive 16) rio-window/src/platform_impl/windows/keyboard.rs:643— PartialKeyEventInfo::finalize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 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.
Text::shape_for (cognitive 17) sugarloaf/src/text.rs:269— Text::shape_for has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 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, 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.
Text::rasterize_slot (cognitive 17) sugarloaf/src/text.rs:487— Text::rasterize_slot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×2
REDACTED
REDACTED
D30 · Dependency Vulnerabilities· Medium vulnerability · ×2
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (4 members, 50+ identical tokens) frontends/rioterm/src/layout/mod.rs:1439— frontends/rioterm/src/layout/mod.rs:1439-1488 | frontends/rioterm/src/layout/mod.rs:1490-1539 | frontends/rioterm/src/layout/mod.rs:1541-1591 | frontends/rioterm/src/layout/mod.rs:1593-1643 — 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) sugarloaf/src/renderer/vulkan.rs:321— sugarloaf/src/renderer/vulkan.rs:321-384 | sugarloaf/src/renderer/vulkan.rs:403-481 | sugarloaf/src/renderer/vulkan.rs:494-547 | sugarloaf/src/renderer/vulkan.rs:558-617 — 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 (22–23 lines × 2) frontends/rioterm/src/renderer/island.rs:1416— frontends/rioterm/src/renderer/island.rs:1416-1437 | frontends/rioterm/src/renderer/search.rs:271-293 — 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–23 lines × 2) sugarloaf/src/text.rs:577— sugarloaf/src/text.rs:577-598 | sugarloaf/src/text.rs:622-644 — 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 (22 lines × 2) frontends/rioterm/src/context/mod.rs:1219— frontends/rioterm/src/context/mod.rs:1219-1240 | frontends/rioterm/src/context/mod.rs:1341-1362 — 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 (22 lines × 2) rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:235— rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs:235-256 | rio-window/src/platform_impl/linux/x11/mod.rs:506-527 — before extracting anything, compare `rio-window/src/platform_impl/linux/wayland/event_loop/mod.rs` and `rio-window/src/platform_impl/linux/x11/mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 (21 lines × 2) rio-window/src/keyboard.rs:102— rio-window/src/keyboard.rs:102-122 | rio-window/src/keyboard.rs:157-177 — 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) sugarloaf/src/font/mod.rs:630— sugarloaf/src/font/mod.rs:630-650 | sugarloaf/src/font/mod.rs:694-714 — 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 (18–19 lines × 2) rio-grid/src/lib.rs:3200— rio-grid/src/lib.rs:3200-3217 | sugarloaf/src/text.rs:1254-1272 — 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 (18–19 lines × 2) sugarloaf/src/renderer/batch.rs:199— sugarloaf/src/renderer/batch.rs:199-217 | sugarloaf/src/renderer/batch.rs:388-405 — 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–14 lines × 5) rio-fonts/src/nerd_font.rs:1692— rio-fonts/src/nerd_font.rs:1692-1705 | rio-fonts/src/nerd_font.rs:2131-2143 | rio-fonts/src/nerd_font.rs:2168-2181 | rio-fonts/src/nerd_font.rs:2986-2999 | rio-fonts/src/nerd_font.rs:3071-3083 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (13–14 lines × 5) sugarloaf/src/renderer/batch.rs:122— sugarloaf/src/renderer/batch.rs:122-134 | sugarloaf/src/renderer/batch.rs:238-251 | sugarloaf/src/renderer/batch.rs:304-316 | sugarloaf/src/renderer/batch.rs:426-438 | sugarloaf/src/renderer/batch.rs:457-469 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 7) rio-fonts/src/nerd_font.rs:779— rio-fonts/src/nerd_font.rs:779-790 | rio-fonts/src/nerd_font.rs:815-826 | rio-fonts/src/nerd_font.rs:923-934 | rio-fonts/src/nerd_font.rs:1039-1050 | rio-fonts/src/nerd_font.rs:1057-1068 | rio-fonts/src/nerd_font.rs:1842-1853 | rio-fonts/src/nerd_font.rs:2739-2750 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 7) rio-fonts/src/nerd_font.rs:1227— rio-fonts/src/nerd_font.rs:1227-1238 | rio-fonts/src/nerd_font.rs:1362-1373 | rio-fonts/src/nerd_font.rs:1640-1651 | rio-fonts/src/nerd_font.rs:2399-2410 | rio-fonts/src/nerd_font.rs:2461-2472 | rio-fonts/src/nerd_font.rs:2541-2552 | rio-fonts/src/nerd_font.rs:2696-2707 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–12 lines × 3) sugarloaf/src/grid/metal.rs:839— sugarloaf/src/grid/metal.rs:839-850 | sugarloaf/src/renderer/mod.rs:526-536 | sugarloaf/src/text.rs:1355-1362 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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 (8–12 lines × 3) sugarloaf/src/text.rs:531— sugarloaf/src/text.rs:531-538 | sugarloaf/src/text.rs:599-610 | sugarloaf/src/text.rs:645-653 — 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 (10 lines × 4) sugarloaf/src/renderer/batch.rs:355— sugarloaf/src/renderer/batch.rs:355-364 | sugarloaf/src/renderer/batch.rs:365-374 | sugarloaf/src/renderer/batch.rs:375-384 | sugarloaf/src/renderer/batch.rs:385-394 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 4) sugarloaf/src/renderer/mod.rs:323— sugarloaf/src/renderer/mod.rs:323-332 | sugarloaf/src/renderer/mod.rs:347-356 | sugarloaf/src/renderer/mod.rs:371-380 | sugarloaf/src/renderer/mod.rs:495-504 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–10 lines × 2) frontends/rioterm/src/hints.rs:213— frontends/rioterm/src/hints.rs:213-222 | frontends/rioterm/src/hints.rs:265-273 — 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–10 lines × 2) sugarloaf/src/renderer/image_cache/cache.rs:193— sugarloaf/src/renderer/image_cache/cache.rs:193-202 | sugarloaf/src/renderer/image_cache/cache.rs:571-579 — 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 × 3) sugarloaf/src/grid/vulkan.rs:1383— sugarloaf/src/grid/vulkan.rs:1383-1391 | sugarloaf/src/renderer/vulkan.rs:911-919 | sugarloaf/src/renderer/vulkan.rs:1142-1150 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9 lines × 3) sugarloaf/src/renderer/batch.rs:254— sugarloaf/src/renderer/batch.rs:254-262 | sugarloaf/src/renderer/batch.rs:264-272 | sugarloaf/src/renderer/batch.rs:274-282 — 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 lines × 3) frontends/rioterm/src/application.rs:1689— frontends/rioterm/src/application.rs:1689-1696 | frontends/rioterm/src/application.rs:1720-1727 | frontends/rioterm/src/application.rs:1739-1746 — 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 lines × 3) frontends/rioterm/src/bindings/mod.rs:1139— frontends/rioterm/src/bindings/mod.rs:1139-1146 | frontends/rioterm/src/bindings/mod.rs:1221-1228 | frontends/rioterm/src/bindings/mod.rs:1289-1296 — 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 (7 lines × 3) rio-vt/src/performer/parser/mod.rs:1152— rio-vt/src/performer/parser/mod.rs:1152-1158 | rio-vt/src/performer/parser/mod.rs:1184-1190 | rio-vt/src/performer/parser/mod.rs:1213-1219 — 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 (7 lines × 3) sugarloaf/src/grid/cpu.rs:632— sugarloaf/src/grid/cpu.rs:632-638 | sugarloaf/src/renderer/cpu.rs:795-801 | sugarloaf/src/text.rs:1951-1957 — before extracting anything, compare `sugarloaf/src/grid/cpu.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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 (5 lines × 3) sugarloaf/src/text.rs:526— sugarloaf/src/text.rs:526-530 | sugarloaf/src/text.rs:594-598 | sugarloaf/src/text.rs:639-644 — 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) rio-window/src/platform_impl/linux/mod.rs:1012— rio-window/src/platform_impl/linux/mod.rs:1012-1016 | rio-window/src/platform_impl/macos/app_delegate.rs:843-847 | rio-window/src/platform_impl/windows/event_loop.rs:658-662 — 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.
Low cohesion: Poll (LCOM4 4) corcovado/src/poll.rs:329— Poll'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: Graphics (LCOM4 4) rio-vt/src/ansi/graphics.rs:572— Graphics'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.
Config::overwrite_with_platform_config (cyclomatic 41) rio-backend/src/config/mod.rs:515— Config::overwrite_with_platform_config has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
UnownedWindow::new (cyclomatic 33) rio-window/src/platform_impl/linux/x11/window.rs:166— UnownedWindow::new has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Route::has_key_wait (cyclomatic 31) frontends/rioterm/src/router/mod.rs:268— Route::has_key_wait 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.
SequenceBuilder::try_build_control_char_or_mod (cyclomatic 30) frontends/rioterm/src/bindings/kitty_keyboard.rs:328— SequenceBuilder::try_build_control_char_or_mod has cyclomatic complexity 30 (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. This is NOT this file's highest cyclomatic complexity: SequenceBuilder::try_build_named_kitty (cyclomatic 42) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
Island::render (cyclomatic 30) frontends/rioterm/src/renderer/island.rs:743— Island::render 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.
KeyEventBuilder::process_message (cyclomatic 29) rio-window/src/platform_impl/windows/keyboard.rs:84— KeyEventBuilder::process_message 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. This is NOT this file's highest cyclomatic complexity: rio_window::platform_impl::windows::keyboard::scancode_to_physicalkey (cyclomatic 160) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
ViModeCursor::motion (cyclomatic 28) rio-vt/src/crosswords/vi_mode.rs:74— ViModeCursor::motion has cyclomatic complexity 28 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
TrailCursor::tick (cyclomatic 27) frontends/rioterm/src/renderer/trail_cursor.rs:211— TrailCursor::tick 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.
LayoutCache::prepare_layout (cyclomatic 27) rio-window/src/platform_impl/windows/keyboard_layout.rs:303— LayoutCache::prepare_layout 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. This is NOT this file's highest cyclomatic complexity: rio_window::platform_impl::windows::keyboard_layout::keycode_to_vkey (cyclomatic 196) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
libsugarloaf::capi::sl_render_surface (cyclomatic 26) libsugarloaf/src/capi.rs:1113— libsugarloaf::capi::sl_render_surface 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.
teletypewriter::unix::terminfo_exists (cyclomatic 26) teletypewriter/src/unix/mod.rs:265— teletypewriter::unix::terminfo_exists 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.
rioterm::context::title::update_title (cyclomatic 25) frontends/rioterm/src/context/title.rs:74— rioterm::context::title::update_title 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.
ActiveEventLoop::register (cyclomatic 25) rio-window/src/platform_impl/web/event_loop/window_target.rs:88— ActiveEventLoop::register has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
FontLibraryData::load (cyclomatic 21) sugarloaf/src/font/mod.rs:887— FontLibraryData::load 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.
Surface::serialize (cyclomatic 19) librio/src/lib.rs:900— Surface::serialize 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.
Shared::set_listener (cyclomatic 19) rio-window/src/platform_impl/web/event_loop/runner.rs:220— Shared::set_listener 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.
WindowDelegate::set_fullscreen (cyclomatic 19) rio-window/src/platform_impl/macos/window_delegate.rs:1637— WindowDelegate::set_fullscreen 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.
MetalRenderer::render (cyclomatic 18) sugarloaf/src/renderer/mod.rs:564— MetalRenderer::render 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.
Graphics::evict_images (cyclomatic 17) rio-vt/src/ansi/graphics.rs:1143— Graphics::evict_images has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
WgpuContext::new (cyclomatic 17) sugarloaf/src/context/webgpu.rs:20— WgpuContext::new has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — 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.
ImageCache::process_atlases (cyclomatic 17) sugarloaf/src/renderer/image_cache/cache.rs:797— ImageCache::process_atlases 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.
CommandPalette::render (cyclomatic 16) frontends/rioterm/src/renderer/command_palette.rs:681— CommandPalette::render 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.
Selection::rotate (cyclomatic 16) rio-vt/src/selection.rs:147— Selection::rotate 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.
Database::query (cyclomatic 16) sugarloaf/src/font/loader.rs:413— Database::query has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — 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.
Repeated repair: sugarloaf/src/sugarloaf.rs sugarloaf/src/sugarloaf.rs:497— sugarloaf/src/sugarloaf.rs changed 3 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 9 (its worst body is Sugarloaf::set_background_image at line 497), 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: window.opacity transparency on Windows (#1905)”; “fix(kitty): draw Unicode placeholders after a=t + a=p,U=1, track GPU uploads per image (#1893)”; “Fix scale desync after sleep/wake and on hidden tabs (#1792)”. 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-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:30:01 +01:00' --until='2026-10-26 23:30:01 +01:00' --full-history --no-merges -- sugarloaf/src/sugarloaf.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and 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.
LayoutCache::prepare_layout (cognitive 59) rio-window/src/platform_impl/windows/keyboard_layout.rs:303— LayoutCache::prepare_layout has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (40 pts), match/switch 4 (9 pts), loops 5 (7 pts), boolean chains 3 (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.
libsugarloaf::capi::sl_render_surface (cognitive 50) libsugarloaf/src/capi.rs:1113— libsugarloaf::capi::sl_render_surface has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 5, loops 2 (3 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.
Route::has_key_wait (cognitive 44) frontends/rioterm/src/router/mod.rs:268— Route::has_key_wait has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 4 (11 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FontLibraryData::load (cognitive 41) sugarloaf/src/font/mod.rs:887— FontLibraryData::load has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 4 (6 pts), match/switch 3 (6 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.
TrailCursor::tick (cognitive 39) frontends/rioterm/src/renderer/trail_cursor.rs:211— TrailCursor::tick has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 11, loops 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.
UnownedWindow::new (cognitive 38) rio-window/src/platform_impl/linux/x11/window.rs:166— UnownedWindow::new has cognitive complexity 38 (threshold 15). Drivers by points: if/else 26 (31 pts), match/switch 4, loops 1 (2 pts), boolean chains 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, 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.
Poll::poll1 (cognitive 37) corcovado/src/poll.rs:1048— Poll::poll1 has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (32 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MetalRenderer::render (cognitive 37) sugarloaf/src/renderer/mod.rs:564— MetalRenderer::render has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReadinessQueue::poll (cognitive 31) corcovado/src/poll.rs:2168— ReadinessQueue::poll has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CommandPalette::render (cognitive 31) frontends/rioterm/src/renderer/command_palette.rs:681— CommandPalette::render has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (29 pts), loops 1, 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.
Crosswords::format_vt (cognitive 27) rio-vt/src/crosswords/formatter.rs:82— Crosswords::format_vt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Shared::set_listener (cognitive 27) rio-window/src/platform_impl/web/event_loop/runner.rs:220— Shared::set_listener has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (25 pts), loops 1 (2 pts) (nesting depth added 7). 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.
RenderState::collect_virtual_runs (cognitive 26) librio/src/render_state.rs:348— RenderState::collect_virtual_runs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActiveEventLoop::register (cognitive 26) rio-window/src/platform_impl/web/event_loop/window_target.rs:88— ActiveEventLoop::register has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 13. 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.
Graphics::evict_images (cognitive 25) rio-vt/src/ansi/graphics.rs:1143— Graphics::evict_images has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5, match/switch 3 (5 pts) (nesting depth added 9). Of this number, 21 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WinitView::update_modifiers (cognitive 25) rio-window/src/platform_impl/macos/view.rs:1139— WinitView::update_modifiers has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 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.
WgpuContext::new (cognitive 25) sugarloaf/src/context/webgpu.rs:20— WgpuContext::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (10 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VulkanGridRenderer::render_text (cognitive 24) sugarloaf/src/grid/vulkan.rs:1030— VulkanGridRenderer::render_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (8 pts), match/switch 1 (4 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.
Selection::rotate (cognitive 23) rio-vt/src/selection.rs:147— Selection::rotate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6 (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.
SearchOverlay::render (cognitive 22) frontends/rioterm/src/renderer/search.rs:202— SearchOverlay::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FiltersBrush::update_filters (cognitive 22) sugarloaf/src/components/filters/mod.rs:23— FiltersBrush::update_filters has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 4, loops 2, boolean chains 1 (nesting depth added 10). 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.
FontCache::pre_populate (cognitive 21) frontends/rioterm/src/renderer/font_cache.rs:91— FontCache::pre_populate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 2 (5 pts) (nesting depth added 15). 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.
Selector::register (cognitive 20) corcovado/src/sys/unix/kqueue.rs:124— Selector::register has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, loops 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.
HintState::find_hyperlink_matches (cognitive 20) frontends/rioterm/src/hints.rs:252— HintState::find_hyperlink_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 1 (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.
RegistrationInner::update (cognitive 19) corcovado/src/poll.rs:1917— RegistrationInner::update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CpuGridRenderer::render_text (cognitive 19) sugarloaf/src/grid/cpu.rs:422— CpuGridRenderer::render_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, 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.
SequenceBuilder::try_build_textual (cognitive 18) frontends/rioterm/src/bindings/kitty_keyboard.rs:118— SequenceBuilder::try_build_textual has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, match/switch 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.
Parser::ground_dispatch (cognitive 18) rio-vt/src/performer/parser/mod.rs:971— Parser::ground_dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PreeditLine::new (cognitive 16) rio-grid/src/preedit.rs:86— PreeditLine::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 3 (4 pts), match/switch 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WindowState::configure (cognitive 16) rio-window/src/platform_impl/linux/wayland/window/state.rs:273— WindowState::configure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 3 (6 pts), boolean chains 2 (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.
CursorHandler::set_cursor (cognitive 16) rio-window/src/platform_impl/web/cursor.rs:248— CursorHandler::set_cursor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (3 pts) (nesting depth added 9). 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.
D4 · Code Duplication· Near-duplicate member family (6 members, 49 shared lines) · ×1
Near-duplicate member family (6 members, 49 shared lines) sugarloaf/src/grid/vulkan.rs:1676— sugarloaf/src/grid/vulkan.rs:1676-1767 | sugarloaf/src/renderer/vulkan.rs:824-904 | sugarloaf/src/renderer/vulkan.rs:996-1131 | sugarloaf/src/renderer/vulkan.rs:1223-1325 | sugarloaf/src/renderer/vulkan.rs:1529-1667 | sugarloaf/src/text.rs:1736-1857 — These 6 members are variants of one another: a block of 49 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 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 6 times.
D4 · Code Duplication· Near-duplicate member family (3 members, 25 shared lines) · ×1
Near-duplicate member family (3 members, 25 shared lines) sugarloaf/src/grid/cpu.rs:83— sugarloaf/src/grid/cpu.rs:83-120 | sugarloaf/src/grid/metal.rs:203-250 | sugarloaf/src/grid/webgpu.rs:94-145 — These 3 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times.
D4 · Code Duplication· Near-duplicate member family (3 members, 19 shared lines) · ×1
Near-duplicate member family (3 members, 19 shared lines) sugarloaf/src/grid/metal.rs:584— sugarloaf/src/grid/metal.rs:584-606 | sugarloaf/src/grid/vulkan.rs:885-907 | sugarloaf/src/grid/webgpu.rs:380-402 — These 3 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times.
Near-duplicate member pair (57 shared lines) sugarloaf/src/grid/metal.rs:770— sugarloaf/src/grid/metal.rs:770-855 | sugarloaf/src/text.rs:1289-1367 — These two members are variants of one another: 57 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.
Near-duplicate member pair (41 shared lines) sugarloaf/src/font/macos.rs:1306— sugarloaf/src/font/macos.rs:1306-1410 | sugarloaf/src/font/macos.rs:1436-1524 — These two members are variants of one another: 41 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.
Near-duplicate member pair (35 shared lines) frontends/rioterm/src/bindings/mod.rs:1198— frontends/rioterm/src/bindings/mod.rs:1198-1253 | frontends/rioterm/src/bindings/mod.rs:1261-1323 — These two members are variants of one another: 35 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· Edited copy of a member (43 corresponding lines) · ×1
Edited copy of a member (43 corresponding lines) sugarloaf/src/grid/cpu.rs:597— sugarloaf/src/grid/cpu.rs:597-644 | sugarloaf/src/text.rs:1918-1963 — These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (32 corresponding lines) · ×1
Edited copy of a member (32 corresponding lines) sugarloaf/src/grid/cpu.rs:659— sugarloaf/src/grid/cpu.rs:659-695 | sugarloaf/src/text.rs:1978-2012 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (40 corresponding lines) · ×1
Edited copy of a member (40 corresponding lines) rio-vt/src/ansi/charset.rs:47— rio-vt/src/ansi/charset.rs:47-86 | rio-vt/src/crosswords/pos.rs:116-155 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×1
Edited copy of a member (19 corresponding lines) rio-vt/src/performer/parser/mod.rs:1151— rio-vt/src/performer/parser/mod.rs:1151-1176 | rio-vt/src/performer/parser/mod.rs:1183-1207 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (8 members, 50+ identical tokens) rio-window/src/platform_impl/windows/window.rs:153— rio-window/src/platform_impl/windows/window.rs:153-164 | rio-window/src/platform_impl/windows/window.rs:182-193 | rio-window/src/platform_impl/windows/window.rs:347-359 | rio-window/src/platform_impl/windows/window.rs:368-393 | rio-window/src/platform_impl/windows/window.rs:747-759 | rio-window/src/platform_impl/windows/window.rs:934-946 | rio-window/src/platform_impl/windows/window.rs:957-978 | rio-window/src/platform_impl/windows/window.rs:1102-1114 — These 8 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 8 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 8 times.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) frontends/rioterm/src/renderer/assistant.rs:13— frontends/rioterm/src/renderer/assistant.rs:13-20 | frontends/rioterm/src/renderer/command_palette.rs:14-21 | frontends/rioterm/src/renderer/island.rs:1481-1488 | frontends/rioterm/src/renderer/search.rs:13-20 | rio-grid/src/lib.rs:1164-1171 | sugarloaf/src/grid/cpu.rs:517-524 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' 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 6 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) sugarloaf/src/renderer/batch.rs:121— sugarloaf/src/renderer/batch.rs:121-220 | sugarloaf/src/renderer/batch.rs:237-286 | sugarloaf/src/renderer/batch.rs:303-411 | sugarloaf/src/renderer/batch.rs:425-441 | sugarloaf/src/renderer/batch.rs:456-481 — 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 (48 lines × 2) frontends/rioterm/src/hints.rs:702— frontends/rioterm/src/hints.rs:702-749 | frontends/rioterm/src/screen/mod.rs:5093-5140 — 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 (39–41 lines × 2) sugarloaf/src/grid/cpu.rs:598— sugarloaf/src/grid/cpu.rs:598-638 | sugarloaf/src/text.rs:1919-1957 — before extracting anything, compare `sugarloaf/src/grid/cpu.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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 (24–34 lines × 3) corcovado/src/event_imp.rs:561— corcovado/src/event_imp.rs:561-584 | corcovado/src/event_imp.rs:1027-1051 | corcovado/src/sys/unix/ready.rs:493-526 — 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 (34 lines × 2) rio-fonts/src/nerd_font.rs:443— rio-fonts/src/nerd_font.rs:443-476 | rio-fonts/src/nerd_font.rs:483-516 — 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 (28–32 lines × 2) frontends/rioterm/src/renderer/mod.rs:317— frontends/rioterm/src/renderer/mod.rs:317-348 | libsugarloaf/src/capi.rs:863-890 — before extracting anything, compare `frontends/rioterm/src/renderer/mod.rs` and `libsugarloaf/src/capi.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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 (30–32 lines × 2) sugarloaf/src/grid/cpu.rs:660— sugarloaf/src/grid/cpu.rs:660-691 | sugarloaf/src/text.rs:1979-2008 — before extracting anything, compare `sugarloaf/src/grid/cpu.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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 (31 lines × 2) sugarloaf/src/renderer/mod.rs:1962— sugarloaf/src/renderer/mod.rs:1962-1992 | sugarloaf/src/renderer/mod.rs:2120-2150 — 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 (28–30 lines × 6) sugarloaf/src/grid/vulkan.rs:1726— sugarloaf/src/grid/vulkan.rs:1726-1753 | sugarloaf/src/renderer/vulkan.rs:867-896 | sugarloaf/src/renderer/vulkan.rs:1091-1118 | sugarloaf/src/renderer/vulkan.rs:1285-1312 | sugarloaf/src/renderer/vulkan.rs:1627-1654 | sugarloaf/src/text.rs:1817-1844 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (28–29 lines × 2) frontends/rioterm/src/renderer/mod.rs:378— frontends/rioterm/src/renderer/mod.rs:378-406 | libsugarloaf/src/capi.rs:907-934 — before extracting anything, compare `frontends/rioterm/src/renderer/mod.rs` and `libsugarloaf/src/capi.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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 (29 lines × 2) sugarloaf/src/renderer/batch.rs:936— sugarloaf/src/renderer/batch.rs:936-964 | sugarloaf/src/renderer/batch.rs:978-1006 — 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 (25–28 lines × 3) sugarloaf/src/grid/cpu.rs:84— sugarloaf/src/grid/cpu.rs:84-111 | sugarloaf/src/grid/metal.rs:204-228 | sugarloaf/src/grid/webgpu.rs:95-119 — 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 (19–27 lines × 2) sugarloaf/src/font/macos.rs:1350— sugarloaf/src/font/macos.rs:1350-1376 | sugarloaf/src/font/macos.rs:1476-1494 — 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 (26–27 lines × 2) sugarloaf/src/renderer/cpu.rs:225— sugarloaf/src/renderer/cpu.rs:225-250 | sugarloaf/src/renderer/cpu.rs:881-907 — 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 (26 lines × 2) frontends/rioterm/src/layout/mod.rs:1440— frontends/rioterm/src/layout/mod.rs:1440-1465 | frontends/rioterm/src/layout/mod.rs:1491-1516 — 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 (25–26 lines × 2) rio-vt/src/crosswords/mod.rs:5067— rio-vt/src/crosswords/mod.rs:5067-5092 | rio-vt/src/crosswords/mod.rs:5191-5215 — 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 (17–24 lines × 2) sugarloaf/src/renderer/mod.rs:400— sugarloaf/src/renderer/mod.rs:400-423 | sugarloaf/src/renderer/mod.rs:435-451 — 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–23 lines × 14) rio-fonts/src/nerd_font.rs:1987— rio-fonts/src/nerd_font.rs:1987-2009 | rio-fonts/src/nerd_font.rs:2031-2043 | rio-fonts/src/nerd_font.rs:2075-2087 | rio-fonts/src/nerd_font.rs:2096-2108 | rio-fonts/src/nerd_font.rs:2117-2129 | rio-fonts/src/nerd_font.rs:2146-2158 | rio-fonts/src/nerd_font.rs:2175-2187 | rio-fonts/src/nerd_font.rs:2227-2239 | rio-fonts/src/nerd_font.rs:2801-2813 | rio-fonts/src/nerd_font.rs:2898-2910 | rio-fonts/src/nerd_font.rs:2952-2964 | rio-fonts/src/nerd_font.rs:2993-3005 | rio-fonts/src/nerd_font.rs:3015-3027 | rio-fonts/src/nerd_font.rs:3087-3099 — all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (19–23 lines × 2) sugarloaf/src/grid/metal.rs:831— sugarloaf/src/grid/metal.rs:831-853 | sugarloaf/src/text.rs:1347-1365 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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 (21–23 lines × 2) sugarloaf/src/grid/vulkan.rs:1598— sugarloaf/src/grid/vulkan.rs:1598-1618 | sugarloaf/src/text.rs:1764-1786 — before extracting anything, compare `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 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–23 lines × 2) sugarloaf/src/renderer/mod.rs:937— sugarloaf/src/renderer/mod.rs:937-959 | sugarloaf/src/renderer/mod.rs:1316-1333 — 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–22 lines × 2) sugarloaf/src/components/filters/builtin/mod.rs:58— sugarloaf/src/components/filters/builtin/mod.rs:58-78 | sugarloaf/src/components/filters/builtin/mod.rs:100-121 — 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–21 lines × 21) rio-fonts/src/nerd_font.rs:699— rio-fonts/src/nerd_font.rs:699-719 | rio-fonts/src/nerd_font.rs:798-810 | rio-fonts/src/nerd_font.rs:834-846 | rio-fonts/src/nerd_font.rs:942-954 | rio-fonts/src/nerd_font.rs:1031-1043 | rio-fonts/src/nerd_font.rs:1076-1088 | rio-fonts/src/nerd_font.rs:1219-1231 | rio-fonts/src/nerd_font.rs:1246-1258 | rio-fonts/src/nerd_font.rs:1389-1401 | rio-fonts/src/nerd_font.rs:1807-1819 | rio-fonts/src/nerd_font.rs:1870-1882 | rio-fonts/src/nerd_font.rs:2137-2149 | rio-fonts/src/nerd_font.rs:2218-2230 | rio-fonts/src/nerd_font.rs:2418-2430 | rio-fonts/src/nerd_font.rs:2480-2492 | rio-fonts/src/nerd_font.rs:2506-2518 | rio-fonts/src/nerd_font.rs:2560-2572 | rio-fonts/src/nerd_font.rs:2627-2639 | rio-fonts/src/nerd_font.rs:2661-2673 | rio-fonts/src/nerd_font.rs:2766-2778 | rio-fonts/src/nerd_font.rs:2792-2804 — all 21 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 (20–21 lines × 2) frontends/rioterm/src/renderer/island.rs:1304— frontends/rioterm/src/renderer/island.rs:1304-1324 | frontends/rioterm/src/renderer/island.rs:1336-1355 — 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 (18–21 lines × 2) rio-vt/src/crosswords/mod.rs:1875— rio-vt/src/crosswords/mod.rs:1875-1892 | rio-vt/src/crosswords/mod.rs:3896-3916 — 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 (20 lines × 4) rio-fonts/src/nerd_font.rs:454— rio-fonts/src/nerd_font.rs:454-473 | rio-fonts/src/nerd_font.rs:494-513 | rio-fonts/src/nerd_font.rs:658-677 | rio-fonts/src/nerd_font.rs:682-701 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (20 lines × 3) rio-fonts/src/nerd_font.rs:1663— rio-fonts/src/nerd_font.rs:1663-1682 | rio-fonts/src/nerd_font.rs:2107-2126 | rio-fonts/src/nerd_font.rs:2942-2961 — 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 (20 lines × 2) rio-vt/src/ansi/kitty_graphics_protocol.rs:1400— rio-vt/src/ansi/kitty_graphics_protocol.rs:1400-1419 | rio-vt/src/ansi/kitty_graphics_protocol.rs:1515-1534 — 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 × 3) sugarloaf/src/grid/metal.rs:585— sugarloaf/src/grid/metal.rs:585-603 | sugarloaf/src/grid/vulkan.rs:886-904 | sugarloaf/src/grid/webgpu.rs:381-399 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/grid/vulkan.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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 (14–19 lines × 3) sugarloaf/src/renderer/vulkan.rs:1065— sugarloaf/src/renderer/vulkan.rs:1065-1078 | sugarloaf/src/renderer/vulkan.rs:1261-1274 | sugarloaf/src/text.rs:1788-1806 — before extracting anything, compare `sugarloaf/src/renderer/vulkan.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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 (17–19 lines × 2) rio-window/src/platform_impl/windows/event_loop.rs:283— rio-window/src/platform_impl/windows/event_loop.rs:283-301 | rio-window/src/platform_impl/windows/event_loop.rs:351-367 — 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–19 lines × 2) sugarloaf/src/grid/metal.rs:789— sugarloaf/src/grid/metal.rs:789-804 | sugarloaf/src/text.rs:1312-1330 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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 (14–19 lines × 2) sugarloaf/src/grid/metal.rs:806— sugarloaf/src/grid/metal.rs:806-824 | sugarloaf/src/text.rs:1327-1340 — before extracting anything, compare `sugarloaf/src/grid/metal.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 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 (17–18 lines × 7) rio-fonts/src/nerd_font.rs:1230— rio-fonts/src/nerd_font.rs:1230-1247 | rio-fonts/src/nerd_font.rs:1855-1871 | rio-fonts/src/nerd_font.rs:2384-2401 | rio-fonts/src/nerd_font.rs:2402-2419 | rio-fonts/src/nerd_font.rs:2464-2481 | rio-fonts/src/nerd_font.rs:2544-2561 | rio-fonts/src/nerd_font.rs:2699-2716 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15–18 lines × 3) sugarloaf/src/renderer/mod.rs:331— sugarloaf/src/renderer/mod.rs:331-345 | sugarloaf/src/renderer/mod.rs:355-369 | sugarloaf/src/renderer/mod.rs:483-500 — 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 (17–18 lines × 2) rio-vt/src/crosswords/mod.rs:1780— rio-vt/src/crosswords/mod.rs:1780-1797 | rio-vt/src/crosswords/mod.rs:3656-3672 — 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 (17 lines × 5) rio-fonts/src/nerd_font.rs:2086— rio-fonts/src/nerd_font.rs:2086-2102 | rio-fonts/src/nerd_font.rs:2208-2224 | rio-fonts/src/nerd_font.rs:2238-2254 | rio-fonts/src/nerd_font.rs:2974-2990 | rio-fonts/src/nerd_font.rs:3077-3093 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (17 lines × 4) rio-fonts/src/nerd_font.rs:435— rio-fonts/src/nerd_font.rs:435-451 | rio-fonts/src/nerd_font.rs:475-491 | rio-fonts/src/nerd_font.rs:651-667 | rio-fonts/src/nerd_font.rs:675-691 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (17 lines × 3) rio-fonts/src/nerd_font.rs:2010— rio-fonts/src/nerd_font.rs:2010-2026 | rio-fonts/src/nerd_font.rs:2043-2059 | rio-fonts/src/nerd_font.rs:2147-2163 — 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 (16–17 lines × 3) rio-fonts/src/nerd_font.rs:2056— rio-fonts/src/nerd_font.rs:2056-2071 | rio-fonts/src/nerd_font.rs:2119-2135 | rio-fonts/src/nerd_font.rs:2995-3011 — 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 (13–17 lines × 2) sugarloaf/src/renderer/mod.rs:392— sugarloaf/src/renderer/mod.rs:392-408 | sugarloaf/src/renderer/mod.rs:515-527 — 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 × 4) frontends/rioterm/src/layout/mod.rs:1450— frontends/rioterm/src/layout/mod.rs:1450-1465 | frontends/rioterm/src/layout/mod.rs:1501-1516 | frontends/rioterm/src/layout/mod.rs:1553-1568 | frontends/rioterm/src/layout/mod.rs:1605-1620 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11–16 lines × 3) sugarloaf/src/renderer/mod.rs:2861— sugarloaf/src/renderer/mod.rs:2861-2876 | sugarloaf/src/renderer/mod.rs:2912-2922 | sugarloaf/src/renderer/mod.rs:3027-3037 — 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 (14–16 lines × 3) sugarloaf/src/renderer/vulkan.rs:322— sugarloaf/src/renderer/vulkan.rs:322-337 | sugarloaf/src/renderer/vulkan.rs:404-418 | sugarloaf/src/renderer/vulkan.rs:559-572 — 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 (13–16 lines × 2) frontends/rioterm/src/application.rs:382— frontends/rioterm/src/application.rs:382-397 | frontends/rioterm/src/application.rs:469-481 — 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–15 lines × 8) rio-fonts/src/nerd_font.rs:782— rio-fonts/src/nerd_font.rs:782-796 | rio-fonts/src/nerd_font.rs:818-832 | rio-fonts/src/nerd_font.rs:926-940 | rio-fonts/src/nerd_font.rs:1042-1056 | rio-fonts/src/nerd_font.rs:1060-1074 | rio-fonts/src/nerd_font.rs:1375-1388 | rio-fonts/src/nerd_font.rs:2447-2460 | rio-fonts/src/nerd_font.rs:2742-2756 — all 8 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 (13–15 lines × 3) sugarloaf/src/renderer/vulkan.rs:1059— sugarloaf/src/renderer/vulkan.rs:1059-1071 | sugarloaf/src/renderer/vulkan.rs:1255-1267 | sugarloaf/src/renderer/vulkan.rs:1594-1608 — 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 (14–15 lines × 2) frontends/rioterm/src/renderer/mod.rs:1029— frontends/rioterm/src/renderer/mod.rs:1029-1043 | librio/src/render_state.rs:395-408 — 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–15 lines × 2) sugarloaf/src/text.rs:600— sugarloaf/src/text.rs:600-614 | sugarloaf/src/text.rs:646-657 — 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–14 lines × 28) rio-fonts/src/nerd_font.rs:701— rio-fonts/src/nerd_font.rs:701-714 | rio-fonts/src/nerd_font.rs:792-804 | rio-fonts/src/nerd_font.rs:828-840 | rio-fonts/src/nerd_font.rs:936-948 | rio-fonts/src/nerd_font.rs:1033-1046 | rio-fonts/src/nerd_font.rs:1052-1064 | rio-fonts/src/nerd_font.rs:1070-1082 | rio-fonts/src/nerd_font.rs:1221-1234 | rio-fonts/src/nerd_font.rs:1240-1252 | rio-fonts/src/nerd_font.rs:1391-1404 | rio-fonts/src/nerd_font.rs:1809-1822 | rio-fonts/src/nerd_font.rs:1864-1876 | rio-fonts/src/nerd_font.rs:2139-2152 | rio-fonts/src/nerd_font.rs:2160-2172 | rio-fonts/src/nerd_font.rs:2220-2233 | rio-fonts/src/nerd_font.rs:2394-2406 | rio-fonts/src/nerd_font.rs:2412-2424 | rio-fonts/src/nerd_font.rs:2456-2468 | rio-fonts/src/nerd_font.rs:2474-2486 | rio-fonts/src/nerd_font.rs:2500-2512 | rio-fonts/src/nerd_font.rs:2554-2566 | rio-fonts/src/nerd_font.rs:2621-2633 | rio-fonts/src/nerd_font.rs:2647-2659 | rio-fonts/src/nerd_font.rs:2663-2676 | rio-fonts/src/nerd_font.rs:2709-2721 | rio-fonts/src/nerd_font.rs:2734-2746 | rio-fonts/src/nerd_font.rs:2768-2781 | rio-fonts/src/nerd_font.rs:2794-2807 — all 28 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 (12–14 lines × 3) frontends/rioterm/src/context/title.rs:133— frontends/rioterm/src/context/title.rs:133-146 | frontends/rioterm/src/context/title.rs:158-169 | frontends/rioterm/src/context/title.rs:177-188 — 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 (10–13 lines × 5) sugarloaf/src/renderer/vulkan.rs:852— sugarloaf/src/renderer/vulkan.rs:852-864 | sugarloaf/src/renderer/vulkan.rs:1077-1088 | sugarloaf/src/renderer/vulkan.rs:1273-1282 | sugarloaf/src/renderer/vulkan.rs:1614-1624 | sugarloaf/src/text.rs:1805-1814 — before extracting anything, compare `sugarloaf/src/renderer/vulkan.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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–13 lines × 4) sugarloaf/src/renderer/vulkan.rs:1002— sugarloaf/src/renderer/vulkan.rs:1002-1014 | sugarloaf/src/renderer/vulkan.rs:1229-1240 | sugarloaf/src/renderer/vulkan.rs:1537-1549 | sugarloaf/src/text.rs:1743-1755 — before extracting anything, compare `sugarloaf/src/renderer/vulkan.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 122 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 × 3) rio-fonts/src/nerd_font.rs:2164— rio-fonts/src/nerd_font.rs:2164-2176 | rio-fonts/src/nerd_font.rs:2246-2258 | rio-fonts/src/nerd_font.rs:2982-2994 — 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–13 lines × 4) rio-fonts/src/nerd_font.rs:2301— rio-fonts/src/nerd_font.rs:2301-2308 | rio-fonts/src/nerd_font.rs:2310-2322 | rio-fonts/src/nerd_font.rs:2325-2337 | rio-fonts/src/nerd_font.rs:2351-2363 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–13 lines × 3) sugarloaf/src/grid/metal.rs:884— sugarloaf/src/grid/metal.rs:884-892 | sugarloaf/src/renderer/mod.rs:407-419 | sugarloaf/src/renderer/mod.rs:439-447 — 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–13 lines × 3) frontends/rioterm/src/screen/mod.rs:1567— frontends/rioterm/src/screen/mod.rs:1567-1579 | frontends/rioterm/src/screen/mod.rs:1585-1597 | frontends/rioterm/src/screen/mod.rs:1602-1608 — 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 (11–13 lines × 2) sugarloaf/src/text.rs:379— sugarloaf/src/text.rs:379-389 | sugarloaf/src/text.rs:1225-1237 — 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 × 8) rio-fonts/src/nerd_font.rs:788— rio-fonts/src/nerd_font.rs:788-799 | rio-fonts/src/nerd_font.rs:824-835 | rio-fonts/src/nerd_font.rs:932-943 | rio-fonts/src/nerd_font.rs:1048-1059 | rio-fonts/src/nerd_font.rs:1066-1077 | rio-fonts/src/nerd_font.rs:2156-2167 | rio-fonts/src/nerd_font.rs:2452-2463 | rio-fonts/src/nerd_font.rs:2748-2759 — all 8 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 (10–12 lines × 6) sugarloaf/src/grid/vulkan.rs:1700— sugarloaf/src/grid/vulkan.rs:1700-1711 | sugarloaf/src/renderer/vulkan.rs:847-858 | sugarloaf/src/renderer/vulkan.rs:1073-1082 | sugarloaf/src/renderer/vulkan.rs:1269-1278 | sugarloaf/src/renderer/vulkan.rs:1610-1619 | sugarloaf/src/text.rs:1801-1810 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (12 lines × 5) rio-fonts/src/nerd_font.rs:2165— rio-fonts/src/nerd_font.rs:2165-2176 | rio-fonts/src/nerd_font.rs:2247-2258 | rio-fonts/src/nerd_font.rs:2877-2888 | rio-fonts/src/nerd_font.rs:2983-2994 | rio-fonts/src/nerd_font.rs:3058-3069 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (12 lines × 4) rio-fonts/src/nerd_font.rs:1723— rio-fonts/src/nerd_font.rs:1723-1734 | rio-fonts/src/nerd_font.rs:2172-2183 | rio-fonts/src/nerd_font.rs:2990-3001 | rio-fonts/src/nerd_font.rs:3074-3085 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–12 lines × 2) frontends/rioterm/src/renderer/mod.rs:364— frontends/rioterm/src/renderer/mod.rs:364-375 | libsugarloaf/src/capi.rs:897-904 — before extracting anything, compare `frontends/rioterm/src/renderer/mod.rs` and `libsugarloaf/src/capi.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 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–12 lines × 3) rio-fonts/src/nerd_font.rs:392— rio-fonts/src/nerd_font.rs:392-403 | rio-fonts/src/nerd_font.rs:405-416 | rio-fonts/src/nerd_font.rs:417-426 — 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 (7–12 lines × 3) rio-fonts/src/nerd_font.rs:583— rio-fonts/src/nerd_font.rs:583-594 | rio-fonts/src/nerd_font.rs:605-616 | rio-fonts/src/nerd_font.rs:627-633 — 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 (11–12 lines × 2) sugarloaf/src/renderer/mod.rs:375— sugarloaf/src/renderer/mod.rs:375-386 | sugarloaf/src/renderer/mod.rs:499-509 — 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 × 7) rio-fonts/src/nerd_font.rs:441— rio-fonts/src/nerd_font.rs:441-451 | rio-fonts/src/nerd_font.rs:461-471 | rio-fonts/src/nerd_font.rs:481-491 | rio-fonts/src/nerd_font.rs:501-511 | rio-fonts/src/nerd_font.rs:657-667 | rio-fonts/src/nerd_font.rs:669-679 | rio-fonts/src/nerd_font.rs:681-691 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 6) sugarloaf/src/grid/vulkan.rs:1680— sugarloaf/src/grid/vulkan.rs:1680-1690 | sugarloaf/src/renderer/vulkan.rs:825-835 | sugarloaf/src/renderer/vulkan.rs:1000-1010 | sugarloaf/src/renderer/vulkan.rs:1227-1237 | sugarloaf/src/renderer/vulkan.rs:1535-1545 | sugarloaf/src/text.rs:1741-1751 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (9–11 lines × 2) sugarloaf/src/grid/vulkan.rs:1488— sugarloaf/src/grid/vulkan.rs:1488-1498 | sugarloaf/src/grid/vulkan.rs:1516-1524 — 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–10 lines × 3) frontends/rioterm/src/screen/mod.rs:2564— frontends/rioterm/src/screen/mod.rs:2564-2570 | frontends/rioterm/src/screen/mod.rs:2607-2616 | frontends/rioterm/src/screen/mod.rs:2652-2658 — 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 (9–10 lines × 3) sugarloaf/src/renderer/cpu.rs:102— sugarloaf/src/renderer/cpu.rs:102-111 | sugarloaf/src/renderer/cpu.rs:121-129 | sugarloaf/src/renderer/cpu.rs:144-152 — 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 (10 lines × 3) sugarloaf/src/renderer/mod.rs:412— sugarloaf/src/renderer/mod.rs:412-423 | sugarloaf/src/renderer/mod.rs:442-451 | sugarloaf/src/renderer/mod.rs:530-540 — 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 × 4) sugarloaf/src/grid/cpu.rs:601— sugarloaf/src/grid/cpu.rs:601-609 | sugarloaf/src/grid/cpu.rs:660-667 | sugarloaf/src/text.rs:1922-1929 | sugarloaf/src/text.rs:1979-1986 — before extracting anything, compare `sugarloaf/src/grid/cpu.rs` and `sugarloaf/src/text.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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 (7–9 lines × 2) frontends/rioterm/src/screen/mod.rs:885— frontends/rioterm/src/screen/mod.rs:885-893 | frontends/rioterm/src/screen/mod.rs:4826-4832 — 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–8 lines × 2) rio-vt/src/crosswords/mod.rs:1863— rio-vt/src/crosswords/mod.rs:1863-1869 | rio-vt/src/crosswords/mod.rs:3882-3889 — 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 × 8) rio-window/src/platform_impl/windows/window.rs:154— rio-window/src/platform_impl/windows/window.rs:154-160 | rio-window/src/platform_impl/windows/window.rs:183-189 | rio-window/src/platform_impl/windows/window.rs:348-355 | rio-window/src/platform_impl/windows/window.rs:369-376 | rio-window/src/platform_impl/windows/window.rs:748-755 | rio-window/src/platform_impl/windows/window.rs:935-942 | rio-window/src/platform_impl/windows/window.rs:958-965 | rio-window/src/platform_impl/windows/window.rs:1103-1110 — all 8 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) sugarloaf/src/text.rs:511— sugarloaf/src/text.rs:511-516 | sugarloaf/src/text.rs:577-582 | sugarloaf/src/text.rs:622-627 — 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 × 6) frontends/rioterm/src/renderer/assistant.rs:16— frontends/rioterm/src/renderer/assistant.rs:16-20 | frontends/rioterm/src/renderer/command_palette.rs:17-21 | frontends/rioterm/src/renderer/island.rs:1484-1488 | frontends/rioterm/src/renderer/search.rs:16-20 | rio-grid/src/lib.rs:1167-1171 | sugarloaf/src/grid/cpu.rs:520-524 — 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 (11 lines × 5) sugarloaf/src/grid/vulkan.rs:1756— sugarloaf/src/grid/vulkan.rs:1756-1767 | sugarloaf/src/renderer/vulkan.rs:1121-1131 | sugarloaf/src/renderer/vulkan.rs:1315-1325 | sugarloaf/src/renderer/vulkan.rs:1657-1667 | sugarloaf/src/text.rs:1847-1857 — `sugarloaf/src/grid/vulkan.rs` and `sugarloaf/src/renderer/vulkan.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 10 separate duplicated blocks between them, totalling at least 116 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Interpolated log message defeats structured logging teletypewriter/src/unix/mod.rs:580— `info!` at line 580 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging teletypewriter/src/unix/mod.rs:792— `info!` at line 792 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/sugarloaf.rs:515— `warn!` at line 515 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/sugarloaf.rs:522— `warn!` at line 522 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/cpu.rs:389— `error!` at line 389 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/cpu.rs:559— `error!` at line 559 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/mod.rs:1948— `warn!` at line 1948 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/mod.rs:2190— `error!` at line 2190 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/mod.rs:2383— `error!` at line 2383 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/mod.rs:2400— `info!` at line 2400 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:299— `debug!` at line 299 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:321— `debug!` at line 321 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:387— `debug!` at line 387 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:396— `debug!` at line 396 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:437— `debug!` at line 437 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:447— `debug!` at line 447 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:538— `debug!` at line 538 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:672— `debug!` at line 672 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/renderer/image_cache/cache.rs:756— `info!` at line 756 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/font/loader.rs:194— `debug!` at line 194 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/font/loader.rs:200— `debug!` at line 200 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/font/loader.rs:416— `debug!` at line 416 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/font/loader.rs:440— `debug!` at line 440 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/font/loader.rs:449— `debug!` at line 449 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging sugarloaf/src/font/loader.rs:474— `debug!` at line 474 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Duplicated predicate frontends/rioterm/src/context/renderable.rs:357— `!term.damage_event_in_flight && term.peek_damage_event().is_some()` appears character-identically in 2 files — frontends/rioterm/src/context/renderable.rs, rio-vt/src/performer/mod.rs. 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 frontends/rioterm/src/renderer/mod.rs:366— `inverse && cell_style.flags.contains(StyleFlags::BOLD)` appears character-identically in 2 files — frontends/rioterm/src/renderer/mod.rs, libsugarloaf/src/capi.rs. 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 frontends/rioterm/src/renderer/mod.rs:365— `inverse && cell_style.flags.contains(StyleFlags::DIM)` appears character-identically in 2 files — frontends/rioterm/src/renderer/mod.rs, libsugarloaf/src/capi.rs. 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 frontends/rioterm/src/renderer/assistant.rs:188— `mouse_x < ox || mouse_x > ox + ow || mouse_y < oy || mouse_y > oy + oh` appears character-identically in 2 files — frontends/rioterm/src/renderer/assistant.rs, frontends/rioterm/src/renderer/search.rs. 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 rio-vt/src/ansi/graphics.rs:241— `overlay.width <= 0.0 || overlay.height <= 0.0` appears character-identically in 2 files — rio-vt/src/ansi/graphics.rs, sugarloaf/src/renderer/cpu.rs. 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 rio-window/src/platform_impl/macos/monitor.rs:70— `self.size == other.size && self.bit_depth == other.bit_depth && self.refresh_rate_millihertz == other.refresh_rate_millihertz && self.monito…` appears character-identically in 2 files — rio-window/src/platform_impl/macos/monitor.rs, rio-window/src/platform_impl/windows/monitor.rs. 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.
Silent fallback default on Err frontends/rioterm/src/layout/mod.rs:394— `get_panel_size` turns every `Err` into `0.0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Silent fallback default on Err rio-window/src/platform_impl/orbital/mod.rs:154— `new` turns every `Err` into `0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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 arm or in the doc comment, and the row stops firing.
Documentation: no build, run or usage example README.md:1— the repository holds project manifests and neither `README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
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 — 4 of 17 project(s) overshoot their size bounds, lowering Project Cohesion to 5.3/10. The most over is `rio-window` (51800 LoC, 445 module-visible types across 27 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
REDACTED
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 1 of 281 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, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 281 of the 381 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: rio-vt/src/ansi/control.rs. 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 rio-vt/src/ansi/control.rs: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.
No release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Outdated: bitflags — `bitflags` is locked at 2.13.1 but 2.13.2 is the current stable release on crates.io, and it already satisfies the `"2.9.0"` requirement declared in librio/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bitflags` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.6.6 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.6.1"` requirement declared in frontends/rioterm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: flate2 — `flate2` is locked at 1.1.9 but 1.1.10 is the current stable release on crates.io, and it already satisfies the `"1.1.9"` requirement declared in rio-vt/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p flate2` and commit the updated REDACTED.
Outdated: js-sys — `js-sys` is locked at 0.3.104 but 0.3.106 is the current stable release on crates.io, and it already satisfies the `"0.3.83"` requirement declared in librio-wasm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p js-sys` and commit the updated REDACTED.
Outdated: libc — `libc` is locked at 0.2.189 but 0.2.191 is the current stable release on crates.io, and it already satisfies the `"0.2.189"` requirement declared in corcovado/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libc` and commit the updated REDACTED.
Outdated: librashader — `librashader` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12.0"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader` and commit the updated REDACTED.
Outdated: librashader-cache — `librashader-cache` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader-cache` and commit the updated REDACTED.
Outdated: librashader-common — `librashader-common` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader-common` and commit the updated REDACTED.
Outdated: librashader-pack — `librashader-pack` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader-pack` and commit the updated REDACTED.
Outdated: librashader-preprocess — `librashader-preprocess` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader-preprocess` and commit the updated REDACTED.
Outdated: librashader-presets — `librashader-presets` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader-presets` and commit the updated REDACTED.
Outdated: librashader-reflect — `librashader-reflect` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader-reflect` and commit the updated REDACTED.
Outdated: librashader-runtime — `librashader-runtime` is locked at 0.12.0 but 0.12.1 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p librashader-runtime` and commit the updated REDACTED.
Outdated: memmap2 — `memmap2` is locked at 0.9.11 but 0.9.12 is the current stable release on crates.io, and it already satisfies the `"0.9.11"` requirement declared in rio-window/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p memmap2` and commit the updated REDACTED.
Outdated: notify — `notify` is locked at 8.2.0 but 8.2.1 is the current stable release on crates.io, and it already satisfies the `"8.2.0"` requirement declared in frontends/rioterm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p notify` and commit the updated REDACTED.
Outdated: signal-hook — `signal-hook` is locked at 0.4.4 but 0.4.5 is the current stable release on crates.io, and it already satisfies the `"0.4.4"` requirement declared in teletypewriter/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p signal-hook` and commit the updated REDACTED.
Outdated: smallvec — `smallvec` is locked at 1.15.2 but 1.16.4 is the current stable release on crates.io, and it already satisfies the `"1.15.2"` requirement declared in rio-grid/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p smallvec` and commit the updated REDACTED.
Outdated: smol_str — `smol_str` is locked at 0.3.6 but 0.3.7 is the current stable release on crates.io, and it already satisfies the `"0.3.2"` requirement declared in rio-window/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p smol_str` and commit the updated REDACTED.
Outdated: thiserror — `thiserror` is locked at 2.0.20 but 2.0.21 is the current stable release on crates.io, and it already satisfies the `"2.0.1"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p thiserror` and commit the updated REDACTED.
Outdated: tinyvec — `tinyvec` is locked at 1.12.0 but 1.13.3 is the current stable release on crates.io, and it already satisfies the `"1.8.1"` requirement declared in frontends/rioterm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tinyvec` and commit the updated REDACTED.
Outdated: twox-hash — `twox-hash` is locked at 2.1.3 but 2.1.5 is the current stable release on crates.io, and it already satisfies the `"2.1.1"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p twox-hash` and commit the updated REDACTED.
Outdated: wasm-bindgen — `wasm-bindgen` is locked at 0.2.127 but 0.2.129 is the current stable release on crates.io, and it already satisfies the `"0.2.106"` requirement declared in librio-wasm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p wasm-bindgen` and commit the updated REDACTED.
Outdated: wasm-bindgen-futures — `wasm-bindgen-futures` is locked at 0.4.77 but 0.4.79 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in rio-window/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p wasm-bindgen-futures` and commit the updated REDACTED.
Outdated: wasm-bindgen-test — `wasm-bindgen-test` is locked at 0.3.77 but 0.3.79 is the current stable release on crates.io, and it already satisfies the `"0.3.42"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p wasm-bindgen-test` and commit the updated REDACTED.
Outdated: web-sys — `web-sys` is locked at 0.3.104 but 0.3.106 is the current stable release on crates.io, and it already satisfies the `"0.3.77"` requirement declared in sugarloaf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p web-sys` and commit the updated REDACTED.
+ 1 more in this group — see findings.md.
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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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.
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 01a17d84-34f6-7bf8-9392-ef831bf5cd16 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 40 · Warnings: 800 · Recommendations: 60 · Info: 26 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 27-10-2026 @ 13:19 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.