Public report of fyne-io/fyne, published 13 November 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.11.3). 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, 13 November 2026, 12:33 UTC · Survey ID cd_1061d7471c074e46b4fae5aacd8d4531
fyne-io/fyne
Measured 13 November 2026, 12:33 UTC, at code version 6267ae7
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
Up 3 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 medium codebase: 79,929 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.8 person-years · Weakest lens: Accessibility, 37
Findings by how serious they are
32 critical609 serious167 minor
19 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look 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
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
13 November 2026, 12:33 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 the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work 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 ▸
46of 46 dimensions measured by tools.
778of 808 findings point to an exact file and line, so you can open each one in the code. The other 30 concern the repository as a whole, such as missing documentation.
46dimensions across 7 lenses, read from 79,929 lines of product code in 1 project.
fyne-io/fyne falls short of our standard for production, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 47 out of 100 and is rated Weak, and 28 of its 32 critical findings are security problems.
Accessibility, at 37, is the weakest lens and counts most in the score. The best first step is labelling the form fields and buttons, worth about 7 points. Adding text alternatives comes next, worth about 6 points. Raising Accessibility to 70 would lift the score to about 55.
Eleven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Eight weaknesses in the code could be used by an attacker, and six passwords or keys in the code's history and one in the code are open to anyone who can read the repository. Pinning each tool to an exact version, fixing the weaknesses the scanner points to and replacing each exposed password or key would close these risks. Updating the vulnerable packages would fix the package with a known security hole, and the pipeline step that installs packages without pinning their versions needs the packages it installs pinned to exact versions. The image with no text description needs a text description.
The product code is 79,929 lines, about €120,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.
We compare 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: 29 findings
These 29 critical or serious findings were in the previous survey, on 24 October 2026, and are gone from this one.
A11y enforcement · Accessibility enforcement below the top rung
Rebuild cost: about €120,000 · Estimate
Cost to rebuild
€39,000 to €200,000, for 654 to 2,076 hours of work, about 0.8 person-years for 1 to 2 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 47. 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
Medium: 79,929 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: We price 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
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Raises the score by about 7 points · Medium effort · Forms & labels
2
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 6 points · Medium effort · Text alternatives
3
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Raises the score by about 6 points · Medium effort · Page structure
Diagnosis: what the measurements show together
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 €120,000 to build again, about 0.8 person-years of work. Its weakest lens is Accessibility, at 37 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label. Of all the actions in this report, it raises the score most for the work it takes: about 7 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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.
62 modules, with 130 dependencies between them. 3 loops run through 6 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 22 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.
io/fyne/v2/cmd/fyne_demo uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/cmd/fyne_demo, while a change to io/fyne/v2/cmd/fyne_demo can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo uses a module listed above it, which is the healthy direction.
io/fyne/v2/driver/desktop uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/driver/desktop, while a change to io/fyne/v2/driver/desktop can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/driver/desktop uses a module listed above it, which is the healthy direction.
io/fyne/v2/driver/embedded uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/driver/embedded, while a change to io/fyne/v2/driver/embedded can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/driver/embedded uses a module listed above it, which is the healthy direction.
io/fyne/v2/driver/mobile uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/driver/mobile, while a change to io/fyne/v2/driver/mobile can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/animation uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/animation, while a change to io/fyne/v2/internal/animation can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/animation uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/async uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/async, while a change to io/fyne/v2/internal/async can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/async uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/driver, while a change to io/fyne/v2/internal/driver can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/driver uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/metadata uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/metadata, while a change to io/fyne/v2/internal/metadata can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/metadata uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter/software uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/painter/software, while a change to io/fyne/v2/internal/painter/software can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/painter/software uses a module listed above it, which is the healthy direction.
12→18 io/fyne/v2/internal/painter/software uses io/fyne/v2/canvaspart of a loop✕
Connections
14 pairs of types, where a type in io/fyne/v2/internal/painter/software uses a type in io/fyne/v2/canvas.
io/fyne/v2/internal/painter/software uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/internal/painter/software, while a change to io/fyne/v2/internal/painter/software can't break io/fyne/v2/canvas.
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.
io/fyne/v2/internal/scheduler uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/scheduler, while a change to io/fyne/v2/internal/scheduler can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/scheduler uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/svg uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/svg, while a change to io/fyne/v2/internal/svg can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/svg uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/theme uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/theme, while a change to io/fyne/v2/internal/theme can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/theme uses a module listed above it, which is the healthy direction.
io/fyne/v2/storage uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/storage, while a change to io/fyne/v2/storage can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/storage uses a module listed above it, which is the healthy direction.
io/fyne/v2/storage/repository uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/storage/repository, while a change to io/fyne/v2/storage/repository can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/storage/repository uses a module listed above it, which is the healthy direction.
62 pairs of types, where a type in io/fyne/v2/canvas uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/canvas uses io/fyne/v2/internal/painter/software, so a change to io/fyne/v2/internal/painter/software can break io/fyne/v2/canvas, while a change to io/fyne/v2/canvas can't break io/fyne/v2/internal/painter/software.
Position
Below the diagonal: io/fyne/v2/canvas uses a module listed above it, which is the healthy direction.
io/fyne/v2/canvas uses io/fyne/v2/internal/svg, so a change to io/fyne/v2/internal/svg can break io/fyne/v2/canvas, while a change to io/fyne/v2/canvas can't break io/fyne/v2/internal/svg.
Position
Below the diagonal: io/fyne/v2/canvas uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne/internal/commands uses io/fyne/v2/internal/metadata, so a change to io/fyne/v2/internal/metadata can break io/fyne/v2/cmd/fyne/internal/commands, while a change to io/fyne/v2/cmd/fyne/internal/commands can't break io/fyne/v2/internal/metadata.
Position
Below the diagonal: io/fyne/v2/cmd/fyne/internal/commands uses a module listed above it, which is the healthy direction.
19→23 io/fyne/v2/cmd/fyne/internal/commands uses io/fyne/v2/cmd/fyne/commandspart of a loop✕
Connections
5 pairs of types, where a type in io/fyne/v2/cmd/fyne/internal/commands uses a type in io/fyne/v2/cmd/fyne/commands.
io/fyne/v2/cmd/fyne/internal/commands uses io/fyne/v2/cmd/fyne/commands, so a change to io/fyne/v2/cmd/fyne/commands can break io/fyne/v2/cmd/fyne/internal/commands, while a change to io/fyne/v2/cmd/fyne/internal/commands can't break io/fyne/v2/cmd/fyne/commands.
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.
io/fyne/v2/data/binding uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/data/binding, while a change to io/fyne/v2/data/binding can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/data/binding uses a module listed above it, which is the healthy direction.
io/fyne/v2/data/binding uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/data/binding, while a change to io/fyne/v2/data/binding can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/data/binding uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/app uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/app, while a change to io/fyne/v2/internal/app can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/app uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/app uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/internal/app, while a change to io/fyne/v2/internal/app can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/internal/app uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/cache uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/cache, while a change to io/fyne/v2/internal/cache can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/cache uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/cache uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/internal/cache, while a change to io/fyne/v2/internal/cache can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/internal/cache uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne/commands uses io/fyne/v2/cmd/fyne/internal/commands, so a change to io/fyne/v2/cmd/fyne/internal/commands can break io/fyne/v2/cmd/fyne/commands, while a change to io/fyne/v2/cmd/fyne/commands can't break io/fyne/v2/cmd/fyne/internal/commands.
Position
Below the diagonal: io/fyne/v2/cmd/fyne/commands uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal, while a change to io/fyne/v2/internal can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal uses io/fyne/v2/internal/app, so a change to io/fyne/v2/internal/app can break io/fyne/v2/internal, while a change to io/fyne/v2/internal can't break io/fyne/v2/internal/app.
Position
Below the diagonal: io/fyne/v2/internal uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/painter, while a change to io/fyne/v2/internal/painter can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/painter uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/internal/painter, while a change to io/fyne/v2/internal/painter can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/internal/painter uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/internal/painter, while a change to io/fyne/v2/internal/painter can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/internal/painter uses a module listed above it, which is the healthy direction.
54 pairs of types, where a type in io/fyne/v2/internal/widget uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/internal/widget uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/widget, while a change to io/fyne/v2/internal/widget can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/widget uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/widget uses io/fyne/v2/driver/desktop, so a change to io/fyne/v2/driver/desktop can break io/fyne/v2/internal/widget, while a change to io/fyne/v2/internal/widget can't break io/fyne/v2/driver/desktop.
Position
Below the diagonal: io/fyne/v2/internal/widget uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/widget uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/internal/widget, while a change to io/fyne/v2/internal/widget can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/internal/widget uses a module listed above it, which is the healthy direction.
35 pairs of types, where a type in io/fyne/v2/app uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/app uses io/fyne/v2/driver/desktop, so a change to io/fyne/v2/driver/desktop can break io/fyne/v2/app, while a change to io/fyne/v2/app can't break io/fyne/v2/driver/desktop.
Position
Below the diagonal: io/fyne/v2/app uses a module listed above it, which is the healthy direction.
io/fyne/v2/app uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/app, while a change to io/fyne/v2/app can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/app uses a module listed above it, which is the healthy direction.
io/fyne/v2/app uses io/fyne/v2/internal/scheduler, so a change to io/fyne/v2/internal/scheduler can break io/fyne/v2/app, while a change to io/fyne/v2/app can't break io/fyne/v2/internal/scheduler.
Position
Below the diagonal: io/fyne/v2/app uses a module listed above it, which is the healthy direction.
io/fyne/v2/app uses io/fyne/v2/internal/app, so a change to io/fyne/v2/internal/app can break io/fyne/v2/app, while a change to io/fyne/v2/app can't break io/fyne/v2/internal/app.
Position
Below the diagonal: io/fyne/v2/app uses a module listed above it, which is the healthy direction.
io/fyne/v2/app uses io/fyne/v2/internal, so a change to io/fyne/v2/internal can break io/fyne/v2/app, while a change to io/fyne/v2/app can't break io/fyne/v2/internal.
Position
Below the diagonal: io/fyne/v2/app uses a module listed above it, which is the healthy direction.
io/fyne/v2/driver/software uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/driver/software, while a change to io/fyne/v2/driver/software can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/driver/software uses a module listed above it, which is the healthy direction.
io/fyne/v2/driver/software uses io/fyne/v2/driver, so a change to io/fyne/v2/driver can break io/fyne/v2/driver/software, while a change to io/fyne/v2/driver/software can't break io/fyne/v2/driver.
Position
Below the diagonal: io/fyne/v2/driver/software uses a module listed above it, which is the healthy direction.
io/fyne/v2/driver/software uses io/fyne/v2/internal/app, so a change to io/fyne/v2/internal/app can break io/fyne/v2/driver/software, while a change to io/fyne/v2/driver/software can't break io/fyne/v2/internal/app.
Position
Below the diagonal: io/fyne/v2/driver/software uses a module listed above it, which is the healthy direction.
io/fyne/v2/driver/software uses io/fyne/v2/internal, so a change to io/fyne/v2/internal can break io/fyne/v2/driver/software, while a change to io/fyne/v2/driver/software can't break io/fyne/v2/internal.
Position
Below the diagonal: io/fyne/v2/driver/software uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter/gl uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/painter/gl, while a change to io/fyne/v2/internal/painter/gl can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/painter/gl uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter/gl uses io/fyne/v2/internal/driver/mobile/gl, so a change to io/fyne/v2/internal/driver/mobile/gl can break io/fyne/v2/internal/painter/gl, while a change to io/fyne/v2/internal/painter/gl can't break io/fyne/v2/internal/driver/mobile/gl.
Position
Below the diagonal: io/fyne/v2/internal/painter/gl uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter/gl uses io/fyne/v2/internal/driver, so a change to io/fyne/v2/internal/driver can break io/fyne/v2/internal/painter/gl, while a change to io/fyne/v2/internal/painter/gl can't break io/fyne/v2/internal/driver.
Position
Below the diagonal: io/fyne/v2/internal/painter/gl uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter/gl uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/internal/painter/gl, while a change to io/fyne/v2/internal/painter/gl can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/internal/painter/gl uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter/gl uses io/fyne/v2/internal, so a change to io/fyne/v2/internal can break io/fyne/v2/internal/painter/gl, while a change to io/fyne/v2/internal/painter/gl can't break io/fyne/v2/internal.
Position
Below the diagonal: io/fyne/v2/internal/painter/gl uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/painter/gl uses io/fyne/v2/internal/painter, so a change to io/fyne/v2/internal/painter can break io/fyne/v2/internal/painter/gl, while a change to io/fyne/v2/internal/painter/gl can't break io/fyne/v2/internal/painter.
Position
Below the diagonal: io/fyne/v2/internal/painter/gl uses a module listed above it, which is the healthy direction.
576 pairs of types, where a type in io/fyne/v2/widget uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
45 pairs of types, where a type in io/fyne/v2/widget uses a type in io/fyne/v2/driver/desktop. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/widget uses io/fyne/v2/driver/desktop, so a change to io/fyne/v2/driver/desktop can break io/fyne/v2/widget, while a change to io/fyne/v2/widget can't break io/fyne/v2/driver/desktop.
Position
Below the diagonal: io/fyne/v2/widget uses a module listed above it, which is the healthy direction.
io/fyne/v2/widget uses io/fyne/v2/driver/mobile, so a change to io/fyne/v2/driver/mobile can break io/fyne/v2/widget, while a change to io/fyne/v2/widget can't break io/fyne/v2/driver/mobile.
Position
Below the diagonal: io/fyne/v2/widget uses a module listed above it, which is the healthy direction.
io/fyne/v2/widget uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/widget, while a change to io/fyne/v2/widget can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/widget uses a module listed above it, which is the healthy direction.
47 pairs of types, where a type in io/fyne/v2/widget uses a type in io/fyne/v2/canvas. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/widget uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/widget, while a change to io/fyne/v2/widget can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/widget uses a module listed above it, which is the healthy direction.
io/fyne/v2/widget uses io/fyne/v2/data/binding, so a change to io/fyne/v2/data/binding can break io/fyne/v2/widget, while a change to io/fyne/v2/widget can't break io/fyne/v2/data/binding.
Position
Below the diagonal: io/fyne/v2/widget uses a module listed above it, which is the healthy direction.
io/fyne/v2/widget uses io/fyne/v2/internal/widget, so a change to io/fyne/v2/internal/widget can break io/fyne/v2/widget, while a change to io/fyne/v2/widget can't break io/fyne/v2/internal/widget.
Position
Below the diagonal: io/fyne/v2/widget uses a module listed above it, which is the healthy direction.
30→31 io/fyne/v2/widget uses io/fyne/v2/dialogpart of a loop✕
Connections
11 pairs of types, where a type in io/fyne/v2/widget uses a type in io/fyne/v2/dialog.
io/fyne/v2/widget uses io/fyne/v2/dialog, so a change to io/fyne/v2/dialog can break io/fyne/v2/widget, while a change to io/fyne/v2/widget can't break io/fyne/v2/dialog.
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.
95 pairs of types, where a type in io/fyne/v2/dialog uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/dialog uses io/fyne/v2/driver/desktop, so a change to io/fyne/v2/driver/desktop can break io/fyne/v2/dialog, while a change to io/fyne/v2/dialog can't break io/fyne/v2/driver/desktop.
Position
Below the diagonal: io/fyne/v2/dialog uses a module listed above it, which is the healthy direction.
io/fyne/v2/dialog uses io/fyne/v2/driver/mobile, so a change to io/fyne/v2/driver/mobile can break io/fyne/v2/dialog, while a change to io/fyne/v2/dialog can't break io/fyne/v2/driver/mobile.
Position
Below the diagonal: io/fyne/v2/dialog uses a module listed above it, which is the healthy direction.
io/fyne/v2/dialog uses io/fyne/v2/storage, so a change to io/fyne/v2/storage can break io/fyne/v2/dialog, while a change to io/fyne/v2/dialog can't break io/fyne/v2/storage.
Position
Below the diagonal: io/fyne/v2/dialog uses a module listed above it, which is the healthy direction.
io/fyne/v2/dialog uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/dialog, while a change to io/fyne/v2/dialog can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/dialog uses a module listed above it, which is the healthy direction.
io/fyne/v2/dialog uses io/fyne/v2/internal/widget, so a change to io/fyne/v2/internal/widget can break io/fyne/v2/dialog, while a change to io/fyne/v2/dialog can't break io/fyne/v2/internal/widget.
Position
Below the diagonal: io/fyne/v2/dialog uses a module listed above it, which is the healthy direction.
io/fyne/v2/dialog uses io/fyne/v2/widget, so a change to io/fyne/v2/widget can break io/fyne/v2/dialog, while a change to io/fyne/v2/dialog can't break io/fyne/v2/widget.
Position
Below the diagonal: io/fyne/v2/dialog uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/common uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/driver/common, while a change to io/fyne/v2/internal/driver/common can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/driver/common uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/common uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/internal/driver/common, while a change to io/fyne/v2/internal/driver/common can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/internal/driver/common uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/common uses io/fyne/v2/internal/app, so a change to io/fyne/v2/internal/app can break io/fyne/v2/internal/driver/common, while a change to io/fyne/v2/internal/driver/common can't break io/fyne/v2/internal/app.
Position
Below the diagonal: io/fyne/v2/internal/driver/common uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/common uses io/fyne/v2/internal, so a change to io/fyne/v2/internal can break io/fyne/v2/internal/driver/common, while a change to io/fyne/v2/internal/driver/common can't break io/fyne/v2/internal.
Position
Below the diagonal: io/fyne/v2/internal/driver/common uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/common uses io/fyne/v2/internal/painter/gl, so a change to io/fyne/v2/internal/painter/gl can break io/fyne/v2/internal/driver/common, while a change to io/fyne/v2/internal/driver/common can't break io/fyne/v2/internal/painter/gl.
Position
Below the diagonal: io/fyne/v2/internal/driver/common uses a module listed above it, which is the healthy direction.
29 pairs of types, where a type in io/fyne/v2/internal/driver/embedded uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/internal/driver/embedded uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/driver/embedded, while a change to io/fyne/v2/internal/driver/embedded can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/driver/embedded uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/embedded uses io/fyne/v2/driver/embedded, so a change to io/fyne/v2/driver/embedded can break io/fyne/v2/internal/driver/embedded, while a change to io/fyne/v2/internal/driver/embedded can't break io/fyne/v2/driver/embedded.
Position
Below the diagonal: io/fyne/v2/internal/driver/embedded uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/embedded uses io/fyne/v2/driver/mobile, so a change to io/fyne/v2/driver/mobile can break io/fyne/v2/internal/driver/embedded, while a change to io/fyne/v2/internal/driver/embedded can't break io/fyne/v2/driver/mobile.
Position
Below the diagonal: io/fyne/v2/internal/driver/embedded uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/embedded uses io/fyne/v2/driver/software, so a change to io/fyne/v2/driver/software can break io/fyne/v2/internal/driver/embedded, while a change to io/fyne/v2/internal/driver/embedded can't break io/fyne/v2/driver/software.
Position
Below the diagonal: io/fyne/v2/internal/driver/embedded uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/repository uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/repository, while a change to io/fyne/v2/internal/repository can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/repository uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/repository uses io/fyne/v2/storage/repository, so a change to io/fyne/v2/storage/repository can break io/fyne/v2/internal/repository, while a change to io/fyne/v2/internal/repository can't break io/fyne/v2/storage/repository.
Position
Below the diagonal: io/fyne/v2/internal/repository uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/repository uses io/fyne/v2/app, so a change to io/fyne/v2/app can break io/fyne/v2/internal/repository, while a change to io/fyne/v2/internal/repository can't break io/fyne/v2/app.
Position
Below the diagonal: io/fyne/v2/internal/repository uses a module listed above it, which is the healthy direction.
io/fyne/v2/tools/playground uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/tools/playground, while a change to io/fyne/v2/tools/playground can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/tools/playground uses a module listed above it, which is the healthy direction.
io/fyne/v2/tools/playground uses io/fyne/v2/driver/software, so a change to io/fyne/v2/driver/software can break io/fyne/v2/tools/playground, while a change to io/fyne/v2/tools/playground can't break io/fyne/v2/driver/software.
Position
Below the diagonal: io/fyne/v2/tools/playground uses a module listed above it, which is the healthy direction.
43 pairs of types, where a type in io/fyne/v2/cmd/fyne_demo/tutorials uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/cmd/fyne_demo/tutorials uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/cmd/fyne_demo/tutorials, while a change to io/fyne/v2/cmd/fyne_demo/tutorials can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo/tutorials uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_demo/tutorials uses io/fyne/v2/driver/desktop, so a change to io/fyne/v2/driver/desktop can break io/fyne/v2/cmd/fyne_demo/tutorials, while a change to io/fyne/v2/cmd/fyne_demo/tutorials can't break io/fyne/v2/driver/desktop.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo/tutorials uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_demo/tutorials uses io/fyne/v2/driver/mobile, so a change to io/fyne/v2/driver/mobile can break io/fyne/v2/cmd/fyne_demo/tutorials, while a change to io/fyne/v2/cmd/fyne_demo/tutorials can't break io/fyne/v2/driver/mobile.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo/tutorials uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_demo/tutorials uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/cmd/fyne_demo/tutorials, while a change to io/fyne/v2/cmd/fyne_demo/tutorials can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo/tutorials uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_demo/tutorials uses io/fyne/v2/data/binding, so a change to io/fyne/v2/data/binding can break io/fyne/v2/cmd/fyne_demo/tutorials, while a change to io/fyne/v2/cmd/fyne_demo/tutorials can't break io/fyne/v2/data/binding.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo/tutorials uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_demo/tutorials uses io/fyne/v2/widget, so a change to io/fyne/v2/widget can break io/fyne/v2/cmd/fyne_demo/tutorials, while a change to io/fyne/v2/cmd/fyne_demo/tutorials can't break io/fyne/v2/widget.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo/tutorials uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_demo/tutorials uses io/fyne/v2/dialog, so a change to io/fyne/v2/dialog can break io/fyne/v2/cmd/fyne_demo/tutorials, while a change to io/fyne/v2/cmd/fyne_demo/tutorials can't break io/fyne/v2/dialog.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_demo/tutorials uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_settings/settings uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/cmd/fyne_settings/settings, while a change to io/fyne/v2/cmd/fyne_settings/settings can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_settings/settings uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_settings/settings uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/cmd/fyne_settings/settings, while a change to io/fyne/v2/cmd/fyne_settings/settings can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_settings/settings uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_settings/settings uses io/fyne/v2/app, so a change to io/fyne/v2/app can break io/fyne/v2/cmd/fyne_settings/settings, while a change to io/fyne/v2/cmd/fyne_settings/settings can't break io/fyne/v2/app.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_settings/settings uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_settings/settings uses io/fyne/v2/widget, so a change to io/fyne/v2/widget can break io/fyne/v2/cmd/fyne_settings/settings, while a change to io/fyne/v2/cmd/fyne_settings/settings can't break io/fyne/v2/widget.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_settings/settings uses a module listed above it, which is the healthy direction.
io/fyne/v2/cmd/fyne_settings/settings uses io/fyne/v2/dialog, so a change to io/fyne/v2/dialog can break io/fyne/v2/cmd/fyne_settings/settings, while a change to io/fyne/v2/cmd/fyne_settings/settings can't break io/fyne/v2/dialog.
Position
Below the diagonal: io/fyne/v2/cmd/fyne_settings/settings uses a module listed above it, which is the healthy direction.
134 pairs of types, where a type in io/fyne/v2/container uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/container uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/container, while a change to io/fyne/v2/container can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/container uses a module listed above it, which is the healthy direction.
io/fyne/v2/container uses io/fyne/v2/driver/desktop, so a change to io/fyne/v2/driver/desktop can break io/fyne/v2/container, while a change to io/fyne/v2/container can't break io/fyne/v2/driver/desktop.
Position
Below the diagonal: io/fyne/v2/container uses a module listed above it, which is the healthy direction.
io/fyne/v2/container uses io/fyne/v2/internal/theme, so a change to io/fyne/v2/internal/theme can break io/fyne/v2/container, while a change to io/fyne/v2/container can't break io/fyne/v2/internal/theme.
Position
Below the diagonal: io/fyne/v2/container uses a module listed above it, which is the healthy direction.
io/fyne/v2/container uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/container, while a change to io/fyne/v2/container can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/container uses a module listed above it, which is the healthy direction.
io/fyne/v2/container uses io/fyne/v2/internal/widget, so a change to io/fyne/v2/internal/widget can break io/fyne/v2/container, while a change to io/fyne/v2/container can't break io/fyne/v2/internal/widget.
Position
Below the diagonal: io/fyne/v2/container uses a module listed above it, which is the healthy direction.
io/fyne/v2/container uses io/fyne/v2/widget, so a change to io/fyne/v2/widget can break io/fyne/v2/container, while a change to io/fyne/v2/container can't break io/fyne/v2/widget.
Position
Below the diagonal: io/fyne/v2/container uses a module listed above it, which is the healthy direction.
io/fyne/v2/container uses io/fyne/v2/dialog, so a change to io/fyne/v2/dialog can break io/fyne/v2/container, while a change to io/fyne/v2/container can't break io/fyne/v2/dialog.
Position
Below the diagonal: io/fyne/v2/container uses a module listed above it, which is the healthy direction.
79 pairs of types, where a type in io/fyne/v2/internal/driver/mobile uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/internal/driver/mobile/gl, so a change to io/fyne/v2/internal/driver/mobile/gl can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/internal/driver/mobile/gl.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/driver/mobile, so a change to io/fyne/v2/driver/mobile can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/driver/mobile.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/internal/animation, so a change to io/fyne/v2/internal/animation can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/internal/animation.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/internal/driver, so a change to io/fyne/v2/internal/driver can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/internal/driver.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/storage, so a change to io/fyne/v2/storage can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/storage.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/storage/repository, so a change to io/fyne/v2/storage/repository can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/storage/repository.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/widget, so a change to io/fyne/v2/widget can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/widget.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/mobile uses io/fyne/v2/internal/driver/common, so a change to io/fyne/v2/internal/driver/common can break io/fyne/v2/internal/driver/mobile, while a change to io/fyne/v2/internal/driver/mobile can't break io/fyne/v2/internal/driver/common.
Position
Below the diagonal: io/fyne/v2/internal/driver/mobile uses a module listed above it, which is the healthy direction.
71 pairs of types, where a type in io/fyne/v2/internal/driver/glfw uses a type in io/fyne/v2. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2, so a change to io/fyne/v2 can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/driver, so a change to io/fyne/v2/driver can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/driver.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/driver/desktop, so a change to io/fyne/v2/driver/desktop can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/driver/desktop.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/internal/animation, so a change to io/fyne/v2/internal/animation can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/internal/animation.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/internal/async, so a change to io/fyne/v2/internal/async can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/internal/async.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/internal/driver, so a change to io/fyne/v2/internal/driver can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/internal/driver.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/canvas, so a change to io/fyne/v2/canvas can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/canvas.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/app, so a change to io/fyne/v2/app can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/app.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/widget, so a change to io/fyne/v2/widget can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/widget.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/internal/driver/common, so a change to io/fyne/v2/internal/driver/common can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/internal/driver/common.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
io/fyne/v2/internal/driver/glfw uses io/fyne/v2/container, so a change to io/fyne/v2/container can break io/fyne/v2/internal/driver/glfw, while a change to io/fyne/v2/internal/driver/glfw can't break io/fyne/v2/container.
Position
Below the diagonal: io/fyne/v2/internal/driver/glfw uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 50% · Adequate · gated by X5 ·
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
155
High / Critical
A03:2025 — Software Supply Chain Failures
10
High / Critical
A07:2025 — Authentication Failures
8
High / Critical
Roadmap
Top priorities: Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label; Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video; Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
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.
Declare the default where Java declares it: `@NullMarked` (org.jspecify.annotations) in each package's `package-info.java`, or once in `module-info.java`, and run NullAway (Error Prone) or the Checker Framework so the declaration is enforced. Then annotate the real exceptions `@Nullable` and resolve the suppressions rather than adding to them: a `@SuppressWarnings("NullAway")` or `castToNonNull(x)` on a value the checker could show to be null is a `NullPointerException` waiting for the path that makes it true — where the value genuinely cannot be null, say something the checker can see instead (a null check, `Objects.requireNonNull`, a non-null field initialised in the constructor).
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 — 32
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 — 609
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 — 167
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 19
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
This survey 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. All 46 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two 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. 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.
What we checked — 46 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, 778 of 808 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 or a scanner, 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 — We 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 (.go) 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.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we 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 — We 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (REDACTED), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
D24 Comment Value — not measured this run — We 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. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D26 Project Cohesion — not measured this run — We 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. `(repository root)` (79929 LoC, 423 module-visible types across 61 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
D32 Data Compliance (PII/GDPR) — not measured this run — We 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. `data/binding/convert.go`, `data/binding/items.go`, `data/binding/lists.go`, `data/binding/pref_helper.go`, `data/binding/preference.go`, … (+1 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We 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. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
C1 Data Protection — not measured this run — We 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. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — We 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. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — We 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. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — We 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. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — We 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. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
GD1 Unfinished & placeholder code — not measured this run — We 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 this repository's Go, Java, c, objectivec is most of its product and 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 — We 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 this repository's Go, c, objectivec is most of its product and 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.
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.
S1 Web-Security Posture — not measured this run — We 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. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X12 Unreachable branch — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X16 Unfloored truncation loop — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X21 Side-effecting pattern guard — not measured this run — We 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 most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do 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.
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.
D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
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.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
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 checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D23 Boundary Type-Coupling: Boundary leakage is detected from type references across detected contexts — leaks that flow through primitives, serialization or shared infrastructure may not surface as a typed reference.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
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 (REDACTED, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
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.
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.
67 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was WebGLDebugUtils.makeLostContextSimulatingCanvas at 65. A further 8 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 glfw.glfwKeyToKeyName at 50 — they are counted neither in the figure above nor in this dimension's score. 4 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: theme/size.go (builtinTheme.Size at 29), theme/theme.go (theme.darkPaletteColorNamed at 26), widget/richtextentry_undo.go (widget.sameSegment at 17), internal/painter/gl/draw.go (painter.drawObject at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 62 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 30 down to 30 or less in Cyclomatic Complexity — start with WebGLDebugUtils.makeLostContextSimulatingCanvas (cyclomatic 65). — Refactoring it lifts Cyclomatic Complexity from 6.5 to about 7.3/10.
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.
+ 125 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 2 bodies over 60 down to 60 or less in Cognitive Complexity — start with binres.PackResources (cognitive 68), binres.addAttributeNamespace (cognitive 61). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cognitive Complexity from 6.0 to about 6.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.3 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 18 FileTooLong finding(s) in God Classes — start with draw.go (2), entry.go, richtext.go. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 16 TooManyMethods finding(s) in God Classes — start with driver.go (2), window_desktop.go, painter.go. — One of this dimension's main actionable groups (16 warning-level).
Resolve the 5 ClassTooLong finding(s) in God Classes — start with entry.go, REDACTED, richtextentry.go. — One of this dimension's main actionable groups (5 warning-level).
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.
75 duplicated block group(s) detected. A further 80 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 2 of the 155 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
Edited copy of a member (8 corresponding lines) · ×5internal/painter/gl/texture.go:234
+ 69 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 8 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with touchscreen.go (2), tabs.go, fileitem.go. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with gridwrap.go (3), generic.go, REDACTED. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 6 Edited copy of a member (15 corresponding lines) finding(s) in Code Duplication — start with gridwrap.go (2), node.go, preference.go. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d4_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 13 Low cohesion finding(s) in Cohesion (LCOM4) — start with gradient.go (2), doctabs.go, apptabs.go. — One of this dimension's main actionable groups (13 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
12 outdated, 1 author-deprecated direct Go module(s), 3 pinning or checksum defect(s). 37 of 37 direct requirement(s) were graded against proxy.golang.org (0 not served there, 6 publishing no tagged release to be behind). Whether any of these modules is UNMAINTAINED is not graded — proxy.golang.org publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, not a registry one. Known CVEs in this module graph are D30's question, read from REDACTED and go.sum there.
Dependency pinned to a stale untagged commit: github.com/mcuadros/go-version · ×3
Deprecated module: golang.org/x/tools/go/vcs
Outdated: github.com/anthonynsimon/bild · ×12
What to do
Resolve the 3 Dependency pinned to a stale untagged commit finding(s) in Dependency Hygiene. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 Deprecated module finding(s) in Dependency Hygiene. — One of this dimension's main actionable groups (1 warning-level).
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 53 required Go module(s) use a banned license. Licences were read per module version from the licence files pkg.go.dev detects (via api.deps.dev), over every module this repository's REDACTED requires, direct and indirect, at the version the build uses. Go records no test-only scope at module level, so modules only this repository's own tests import are included. 1 of them carry no licence file that matches a known SPDX licence; that is missing data, not a violation, and none of them is charged.
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.
Top hotspots: widget/entry.go (26×24=624); widget/richtext.go (24×25=600); internal/driver/glfw/window.go (17×30=510)
Hotspot: widget/entry.go · ×7widget/entry.go:1772
What to do
Resolve the 7 Hotspot finding(s) in Churn × Complexity Hotspots — start with entry.go, richtext.go, window.go. — One of this dimension's main actionable groups (7 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.0 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
23 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is internal/painter/atlas.go. Counted over 234 of the 590 production source files in this repository: 352 are under the ~2,400-byte size floor this dimension measures over, and the remaining 4 have no attributable history left to measure.
Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)
✓ On the Gold path — maintain.
Detailed fixes: d16_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.
130 deducted task-comment markers across 79929 LoC (0.2/KLoC) → score 9.7. 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 123 TodoComment finding(s) in Explicit Debt — start with binres.go (12), window.go (10), darwin_desktop.go (5). — One of this dimension's main actionable groups (123 warning-level).
Resolve the 7 FixmeComment finding(s) in Explicit Debt — start with window_wasm.go (6), apptabs.go. — One of this dimension's main actionable groups (7 warning-level).
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.
1 of 1 documentation facets pass in full. 2 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.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: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
What it measures: Whether domain types (IDs, enums, value objects) leak across bounded-context boundaries.
Method: Cross-context domain-type leakage via Roslyn structural classification (strongly-typed IDs / value objects) over every public surface. Exhaustive, deterministic, type-level aggregate-boundary check.
Coverage: Bounded contexts derived from NAMESPACE prefix (or graph-inferred where available); cross-boundary domain-type leakage then checked exhaustively over every public member of every type.
No domain types leak across context boundaries (2 contexts). Contexts: driver, widget.
✓ On the Gold path — maintain.
Detailed fixes: d23_recommendation.md.
Do you agree with this assessment?
D27 · Navigability8.5 / 10Strong✓ Tool-verified
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
33 % of calls cross a namespace and 15 % go through an interface, but 54 % of collaborators are co-located — so following a call takes several hops. Baseline: small — navigation cost is tolerated.
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.
6 finding(s): 0 critical, 6 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 6 REDACTED finding(s) in Secrets (history) — start with REDACTED (5), REDACTED. — One of this dimension's main actionable groups (6 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).
160 finding(s): 0 critical, 20 high, 15 medium, 125 low. 11 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 7 file(s) — `data/binding/convert.go` (line 196, line 209), `data/binding/items.go` (line 23, line 224, line 258, …), `data/binding/lists.go` (line 29, line 548), `data/binding/pref_helper.go` (lines 14–15, line 16, line 18, …), `data/binding/preference.go` (line 110, line 138, line 154, …), … (+2 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 8 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (6). — One of this dimension's main actionable groups (6 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 11 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 (11 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 5 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (5). — One of this dimension's main actionable groups (5 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.
12 of 238 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is storage/repository/repository.go. Counted over 238 of the 590 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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 Change coupling finding(s) in Change Coupling — start with bundled-icons.go, painter.go, draw.go. — One of this dimension's main actionable groups (3 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.
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. Reported 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. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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 3 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.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives3.5 / 10Weak✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. — cmd/fyne/internal/templates/data/index.html:124
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Do you agree with this assessment?
AC2 · Forms & labels1.0 / 10Critical✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. — cmd/fyne/internal/templates/data/index.html:138
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Do you agree with this assessment?
AC3 · Page structure4.1 / 10Weak✓ Tool-verified
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). — cmd/fyne/internal/templates/data/index.html:2
A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>. — cmd/fyne/internal/templates/data/index.html:2
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — cmd/fyne/internal/templates/data/index.html:2
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
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.
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.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
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
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.
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.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
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.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
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 outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
`http.Get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×3) — internal/driver/mobile/gl/dll_windows.go:25, internal/repository/http.go:73, resource.go:71
`http.Head(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×2) — internal/repository/http.go:57, internal/repository/http.go:83
What to do
Give every `http.Client` an explicit `Timeout` (never call `http.Get`/`http.Post` or `http.DefaultClient`, which have none), or build each request with `http.NewRequestWithContext` under a `context.WithTimeout`; add retry with back-off (`hashicorp/go-retryablehttp`) and a breaker (`sony/gobreaker`) around dependencies that fail.
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.
Other · Code Health — Whether functions that make a cancellable request accept or pass on a context.Context (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Only 0/5 functions that make a cancellable request (net/http, net.Dial) accept a context.Context or pass one on, so a request keeps running after whatever wanted it has given up — a cancelled request, a shutdown, an expired deadline. Take `ctx context.Context` as the first parameter and build the request with it (`http.NewRequestWithContext`, `DialContext`); where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
`LoadResourceFromURLString` calls `http.Get(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`. — resource.go:70
`Exists` calls `http.Head(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`. — internal/repository/http.go:56
`Reader` calls `http.Get(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`. — internal/repository/http.go:72
`CanRead` calls `http.Head(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`. — internal/repository/http.go:82
`downloadDLLs` calls `http.Get(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`. — internal/driver/mobile/gl/dll_windows.go:22
What to do
Thread a context.Context through functions that make requests, so the work stops when its caller gives up.
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?
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.
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.
`if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×22) — widget/check.go:263, widget/date_entry.go:56, widget/entry.go:1443, …
`if _, err := strconv.Atoi(num); err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — cmd/fyne/internal/commands/package.go:421
Other · Code Health — Whether Java packages are null-marked and not undermined by heavy nullness suppression — a package under `@NullMarked` (or `@NonNullApi`, `@ParametersAreNonnullByDefault`, `@NonNullByDefault`, or a NullAway/Checker Framework configuration naming it) makes an unannotated reference exclude null, and `@SuppressWarnings("NullAway")`, `("nullness")`, `("null")` and `castToNonNull(…)` are what silence it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
0/1 of this repository's Java package directories are under a non-null default: a `package-info.java` declaring `@NullMarked` (JSpecify) or `@NonNullApi`, `@ParametersAreNonnullByDefault`, `@NonNullByDefault`, `@DefaultQualifier(NonNull.class)`; a `module-info.java` declaring `@NullMarked`; every type in it `@NullMarked`; or a build that runs NullAway with the package in `AnnotatedPackages`, or the Checker Framework's `NullnessChecker`. Elsewhere every reference admits null and no checker warns on the dereference that throws a `NullPointerException`.
What to do
Declare the default where Java declares it: `@NullMarked` (org.jspecify.annotations) in each package's `package-info.java`, or once in `module-info.java`, and run NullAway (Error Prone) or the Checker Framework so the declaration is enforced. Then annotate the real exceptions `@Nullable` and resolve the suppressions rather than adding to them: a `@SuppressWarnings("NullAway")` or `castToNonNull(x)` on a value the checker could show to be null is a `NullPointerException` waiting for the path that makes it true — where the value genuinely cannot be null, say something the checker can see instead (a null check, `Objects.requireNonNull`, a non-null field initialised in the constructor).
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 13 of 55 WCAG 2.2 Level A/AA success criteria (24%; ≈26% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 42 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
X10 Duplicated predicate — 9 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 5 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 62 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.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — Not applicable: this repository's Go imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Java imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No Go request handler (a net/http, Gin, Echo, Fiber or fasthttp handler, or a gRPC service method) is declared as a method or function, and no handler function literal writes a value captured from outside it, so no state is shared between request goroutines. No class in this Java code is a Spring, JSR-330 or CDI singleton bean.
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 — no public interfaces
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
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 — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~51044 lines of test source are present (.go) 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.
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# and TypeScript only; Go, Java, html not measured.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .go, .java source were not judged.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. 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) — 6 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
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.
D5 Coupling — Not applicable — this Go build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
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 signals for this style, 2 needed — the count is met but a required primary signal is absent): 5 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 5 domain event(s); its domain events are published by services or handlers — no domain entity raises one
ED1 Event-Driven — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 5 domain event(s); 5 event-sourced shape(s) (event folds / event-recording aggregates)
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 4 aggregate(s) with Apply/When folds; 1 Go aggregate(s) recording domain events (own events-slice append / raise-record)
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
M4 Documentation accuracy — Not applicable: the 2 current-state document(s) make no claim of a kind M4 checks.
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 — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
PF3 Async & latency hygiene — Not applicable: Go has no async/await function colour, so there is no asynchronous code for a blocking call to stall.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) 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. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X12 Unreachable branch — X12 reached only 1% of this repository's production lines — go (79,220 lines), c (2,259 lines), objectivec (1,494 lines), java (709 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — X16 reached only 2% of this repository's production lines — go (79,220 lines), c (2,259 lines), objectivec (1,494 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X21 Side-effecting pattern guard — X21 reached only 2% of this repository's production lines — go (79,220 lines), c (2,259 lines), objectivec (1,494 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Java was read, and it logs through none that an assembled message defeats: java.util.logging's level methods, log4j 1, commons-logging, JBoss Logging and Flogger take one finished message (as log4net does in C#), or it makes no call through a named logger at all. Calls made through SLF4J or log4j 2 (`org.slf4j.Logger`, `org.apache.logging.log4j.Logger`, Lombok's `@Slf4j`) would be judged.
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.
AC1 · Text alternatives· <img> without a text alternative · ×1
<img> without a text alternative cmd/fyne/internal/templates/data/index.html:124— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
AC2 · Forms & labels· <input> without a programmatic label · ×1
<input> without a programmatic label cmd/fyne/internal/templates/data/index.html:138— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<html> without a lang cmd/fyne/internal/templates/data/index.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC3 · Page structure· Document without a <title> · ×1
Document without a <title> cmd/fyne/internal/templates/data/index.html:2— A page with no <title> gives no name in the tab, history or screen-reader page list. Add a descriptive <title> in <head>.
TodoComment widget/button.go:422— // TODO support disabling bitmap resource not just SVG — 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 widget/entry.go:110— // TODO: Add OnSelectChanged — 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 widget/fileicon.go:72— // TODO remove background when `SetSelected` is gone. — 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 widget/list_test.go:28— // TODO check rendered count — 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 widget/list_test.go:41— // TODO check rendered count — 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 widget/menu_desktop_test.go:177— // macOS and Windows are off-by-a-fraction for symbol font TODO find out why — 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 widget/popup_menu.go:147— // TODO here we may need a scroller as it's wider than our canvas — 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 widget/popup_menu.go:153— // TODO here we may need a scroller as it's longer than our canvas — 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 widget/popup_test.go:295— // TODO constrain after a move — 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 widget/popup_test.go:315— // TODO this constrain too — 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 widget/richtext.go:55— // used to apply text minsize to the scroller `scr`, if present - TODO improve #2464
TodoComment widget/richtext.go:1272— // TODO resolve this in a similar way to #2991
TodoComment widget/richtext.go:1785— //revive:disable-line:add-constant -- TODO: clarify whether we want to define a common letter constant for approximate character sizes — 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 widget/richtext_objects.go:482— // TODO maybe return "---\n"? — 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 widget/richtext_test.go:480— // TODO make this a simple refresh call once it's in — 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 widget/slider.go:226— //revive:disable-next-line:add-constant -- TODO: clarify what this 1.5 is about — 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 widget/slider.go:486— // TODO based on old size...0 — 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 test/app.go:82— // TODO should this be randomised? — 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 storage/uri_test.go:270— // TODO hook in an http/https handler — 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 internal/widget/scroller.go:39— // TODO consider the smallest useful scroll view? — 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 internal/widget/scroller_test.go:49— // TODO why is this off by a 1bit RGB difference? — 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 internal/painter/draw.go:420— // TODO: length formula can be improved to get a fully rounded (pill shape) outer edge for thin (small sweep) arc segments — 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 internal/painter/font.go:161— // TODO only one emoji - maybe others too — 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 internal/painter/gl/draw_test.go:81— // TODO add check for minsize somehow? — 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 internal/driver/mobile/canvas.go:113— // TODO check — 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.
Swallowed exception (caught, then discarded) widget/check.go:263— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) widget/date_entry.go:56— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) widget/entry.go:1443— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) widget/fileicon.go:128— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) widget/select.go:327— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) widget/select.go:352— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) widget/slider.go:400— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) storage/repository/uri.go:53— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) internal/docs.go:56— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) internal/scheduler/scheduler.go:207— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) internal/painter/gl/draw.go:999— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:63— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) internal/driver/mobile/gl/dll_windows.go:123— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) internal/driver/mobile/gl/dll_windows.go:159— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) cmd/fyne/internal/util/mobile.go:18— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:191— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) cmd/fyne/internal/commands/package.go:421— `if _, err := strconv.Atoi(num); err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:525— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) cmd/fyne/internal/commands/translate.go:362— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) cmd/fyne/internal/commands/translate.go:380— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) cmd/fyne/internal/commands/translate.go:397— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) app/app_xdg.go:43— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) REDACTED:23— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
FileTooLong: widget/entry.go widget/entry.go— FileTooLong — 1362 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: Entry (74 blocks, 43-1591). The bar is 500 significant lines; this is 862 over it, 2.72× 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: widget/richtext.go widget/richtext.go— FileTooLong — 1257 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 757 over it, 2.51× 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: widget/table.go widget/table.go— FileTooLong — 1105 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 605 over it, 2.21× 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: widget/richtextentry.go widget/richtextentry.go— FileTooLong — 1019 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 519 over it, 2.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: gl/draw.go internal/painter/gl/draw.go— FileTooLong — 853 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: painter (29 blocks, 74-1253). The bar is 500 significant lines; this is 353 over it, 1.71× 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: widget/tree.go widget/tree.go— FileTooLong — 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 over it, 1.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: data/webgl-debug.js cmd/fyne/internal/templates/data/webgl-debug.js— FileTooLong — 650 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 150 over it, 1.30× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: painter/draw.go internal/painter/draw.go— FileTooLong — 638 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 138 over it, 1.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: glfw/window.go internal/driver/glfw/window.go— FileTooLong — 636 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: window (58 blocks, 29-1028). The bar is 500 significant lines; this is 136 over it, 1.27× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: binres/binres.go cmd/fyne/internal/mobile/binres/binres.go— FileTooLong — 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: glfw/window_desktop.go internal/driver/glfw/window_desktop.go— FileTooLong — 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 over it, 1.23× 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: container/tabs.go container/tabs.go— FileTooLong — 593 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 93 over it, 1.19× 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: dialog/file.go dialog/file.go— FileTooLong — 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 over it, 1.18× 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: mobile/driver.go internal/driver/mobile/driver.go— FileTooLong — 573 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: driver (30 blocks, 54-853). The bar is 500 significant lines; this is 73 over it, 1.15× 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: widget/list.go widget/list.go— FileTooLong — 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09× 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: widget/richtext_objects.go widget/richtext_objects.go— FileTooLong — 541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 41 over it, 1.08× 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: widget/textgrid.go widget/textgrid.go— FileTooLong — 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08× 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: theme/icons.go theme/icons.go— FileTooLong — 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03× 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.
TooManyMethods: window internal/driver/glfw/window_desktop.go:73— TooManyMethods — 102 methods, declared across 9 files: glfw/window.go (58), glfw/window_desktop.go (32), glfw/accessibility_notdarwin.go (3), glfw/window_notdarwin.go (3), +5 more file(s). The bar is 30 methods; this is 72 over it, 3.40× 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: painter internal/painter/gl/painter.go:48— TooManyMethods — 81 methods, declared across 8 files: gl/draw.go (29), gl/painter.go (22), gl/texture.go (13), gl/atlas.go (10), +4 more file(s). The bar is 30 methods; this is 51 over it, 2.70× 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: Entry widget/entry.go:43— TooManyMethods — 80 methods, declared across 2 files: widget/entry.go (73), widget/entry_validation.go (7). The bar is 30 methods; this is 50 over it, 2.67× 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: RichTextEntry widget/richtextentry.go:41— TooManyMethods — 53 methods, declared across 2 files: widget/richtextentry.go (42), widget/richtextentry_undo.go (11). The bar is 30 methods; this is 23 over it, 1.77× 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: coreContext REDACTED:89— TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. Most of these members implement gl.context (48 of 48 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
TooManyMethods: mobileContext internal/painter/gl/gl_gomobile.go:86— TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. Most of these members implement gl.context (48 of 48 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
TooManyMethods: Table widget/table.go:51— TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× 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: GoNativeActivity internal/driver/mobile/app/GoNativeActivity.java: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: RichText widget/richtext.go:35— TooManyMethods — 39 methods, declared across 2 files: widget/richtext.go (37), widget/markdown.go (2). The bar is 30 methods; this is 9 over it, 1.30× 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: fyneApp app/app.go:25— TooManyMethods — 37 methods, declared across 10 files: app/app.go (17), app/app_xdg.go (9), app/app_schedule.go (2), app/cloud.go (2), +6 more file(s). The bar is 30 methods; this is 7 over it, 1.23× 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: gLDriver internal/driver/glfw/driver.go:39— TooManyMethods — 37 methods, declared across 6 files: glfw/driver.go (15), glfw/driver_desktop.go (11), glfw/loop.go (5), glfw/loop_desktop.go (3), +2 more file(s). The bar is 30 methods; this is 7 over it, 1.23× 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 internal/driver/mobile/window.go:13— TooManyMethods — 36 methods, declared across 4 files: mobile/window.go (31), mobile/accessibility_notandroid.go (3), mobile/menubutton.go (1), mobile/window_android.go (1). The bar is 30 methods; this is 6 over it, 1.20× 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: InMemoryPreferences internal/preferences.go:11— 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: glCanvas internal/driver/glfw/canvas.go:21— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: driver internal/driver/mobile/driver.go:54— TooManyMethods — 32 methods, declared across 3 files: mobile/driver.go (29), mobile/animation.go (2), mobile/menu.go (1). The bar is 30 methods; this is 2 over it, 1.07× 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: AppTabs container/apptabs.go:19— 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.
Low cohesion: DocTabs (LCOM4 8) container/doctabs.go:21— DocTabs's methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: AppTabs (LCOM4 6) container/apptabs.go:19— AppTabs's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — 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 6 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: LinearGradient (LCOM4 4) canvas/gradient.go:14— LinearGradient'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: RadialGradient (LCOM4 4) canvas/gradient.go:98— RadialGradient'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: Image (LCOM4 4) canvas/image.go:64— Image'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: Text (LCOM4 4) canvas/text.go:16— Text'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: tabButton (LCOM4 4) container/tabs.go:520— tabButton'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: gLDriver (LCOM4 4) internal/driver/glfw/driver.go:39— gLDriver'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: Button (LCOM4 4) widget/button.go:54— Button'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: gridWrapItem (LCOM4 4) widget/gridwrap.go:460— gridWrapItem'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: listItem (LCOM4 4) widget/list.go:606— listItem'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: ProgressBar (LCOM4 4) widget/progressbar.go:99— ProgressBar'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: radioItem (LCOM4 4) widget/radio_item.go:27— radioItem'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.
Duplicated block (7 lines × 2) container/tabs.go:535— container/tabs.go:535-541 | container/tabs.go:789-795 — 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) dialog/fileitem.go:68— dialog/fileitem.go:68-74 | dialog/fileitem.go:100-106 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dialog/fileitem.go:68` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) internal/driver/embedded/touchscreen.go:85— internal/driver/embedded/touchscreen.go:85-91 | internal/driver/mobile/canvas.go:289-295 — before extracting anything, compare `internal/driver/embedded/touchscreen.go` and `internal/driver/mobile/canvas.go` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) internal/painter/software/draw.go:105— internal/painter/software/draw.go:105-111 | internal/painter/software/draw.go:291-297 — 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) widget/check.go:300— widget/check.go:300-306 | widget/radio_item.go:132-138 — 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) widget/gridwrap.go:755— widget/gridwrap.go:755-761 | widget/list.go:925-931 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (7 lines × 2) widget/label.go:146— widget/label.go:146-152 | widget/richtext.go:202-208 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) internal/driver/embedded/touchscreen.go:142— internal/driver/embedded/touchscreen.go:142-148 | internal/driver/mobile/canvas.go:387-393 — before extracting anything, compare `internal/driver/embedded/touchscreen.go` and `internal/driver/mobile/canvas.go` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/embedded/touchscreen.go:142` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Hotspot: widget/entry.go widget/entry.go:1772— widget/entry.go changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in entryRenderer.Refresh at line 1772. 5 of those changes were fix/bug commits, and the other 21 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 09:03:58 +01:00' --until='2026-11-12 09:03:58 +01:00' --full-history --no-merges -- widget/entry.go`: 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: widget/richtext.go widget/richtext.go:516— widget/richtext.go changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in RichText.insertAt at line 516. 5 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 09:03:58 +01:00' --until='2026-11-12 09:03:58 +01:00' --full-history --no-merges -- widget/richtext.go`: 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: internal/driver/glfw/window.go internal/driver/glfw/window.go:497— internal/driver/glfw/window.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in window.processMouseClicked at line 497. 4 of those changes were fix/bug commits, and the other 13 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 09:03:58 +01:00' --until='2026-11-12 09:03:58 +01:00' --full-history --no-merges -- internal/driver/glfw/window.go`: 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: widget/richtextentry.go widget/richtextentry.go:839— widget/richtextentry.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in widget.segmentsToMarkdown at line 839. 2 of those changes were fix/bug commits, and the other 15 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 09:03:58 +01:00' --until='2026-11-12 09:03:58 +01:00' --full-history --no-merges -- widget/richtextentry.go`: 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: internal/driver/mobile/driver.go internal/driver/mobile/driver.go:178— internal/driver/mobile/driver.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in driver.Run at line 178. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 09:03:58 +01:00' --until='2026-11-12 09:03:58 +01:00' --full-history --no-merges -- internal/driver/mobile/driver.go`: 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: internal/driver/mobile/canvas.go internal/driver/mobile/canvas.go:286— internal/driver/mobile/canvas.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in canvas.tapMove at line 286. 3 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 09:03:58 +01:00' --until='2026-11-12 09:03:58 +01:00' --full-history --no-merges -- internal/driver/mobile/canvas.go`: 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: widget/markdown.go widget/markdown.go:54— widget/markdown.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in widget.renderNode at line 54. 1 of those changes was a fix/bug commit, 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-14 09:03:58 +01:00' --until='2026-11-12 09:03:58 +01:00' --full-history --no-merges -- widget/markdown.go`: 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.
FixmeComment internal/driver/glfw/window_wasm.go:106— // FIXME: not supported with WebGL — 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 internal/driver/glfw/window_wasm.go:111— // FIXME: not implemented yet — 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 internal/driver/glfw/window_wasm.go:115— // FIXME: no meaning for defining center on screen in WebGL — 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 internal/driver/glfw/window_wasm.go:119— // FIXME: no meaning for defining focus in WebGL — 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 internal/driver/glfw/window_wasm.go:123— // FIXME: no support for SetIcon yet — 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 internal/driver/glfw/window_wasm.go:127— // FIXME: there could really only be one window — 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 container/apptabs.go:327— // FIXME MenuItem can't show if it is the currently selected tab (#1753)
Duplicated block (11 lines × 2) storage/repository/generic.go:117— storage/repository/generic.go:117-127 | storage/repository/generic.go:262-272 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `storage/repository/generic.go:117` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) widget/gridwrap.go:222— widget/gridwrap.go:222-232 | widget/list.go:308-318 — 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) widget/gridwrap.go:234— widget/gridwrap.go:234-244 | widget/list.go:320-330 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `widget/gridwrap.go:234` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a `defer`-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead — before the caller uses what it releases — so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register.
Duplicated block (11 lines × 2) widget/table.go:1676— widget/table.go:1676-1686 | widget/table.go:1718-1728 — 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) data/binding/lists.go:376— data/binding/lists.go:376-386 | data/binding/trees.go:471-481 — 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) widget/gridwrap.go:247— widget/gridwrap.go:247-257 | widget/list.go:335-345 — 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) cmd/fyne_demo/tutorials/collection.go:46— cmd/fyne_demo/tutorials/collection.go:46-56 | cmd/fyne_demo/tutorials/collection.go:86-96 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `cmd/fyne_demo/tutorials/collection.go:46` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×6
Edited copy of a member (15 corresponding lines) widget/gridwrap.go:107— widget/gridwrap.go:107-121 | widget/list.go:148-162 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (15 corresponding lines) cmd/fyne/internal/mobile/binres/node.go:59— cmd/fyne/internal/mobile/binres/node.go:59-77 | cmd/fyne/internal/mobile/binres/node.go:189-203 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (15 corresponding lines) data/binding/preference.go:122— data/binding/preference.go:122-136 | data/binding/preference.go:138-152 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (15 corresponding lines) internal/painter/font.go:62— internal/painter/font.go:62-76 | internal/painter/font.go:78-92 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (15 corresponding lines) widget/gridwrap.go:454— widget/gridwrap.go:454-468 | widget/list.go:600-614 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (15 corresponding lines) widget/entry.go:1431— widget/entry.go:1431-1447 | widget/entry.go:1538-1552 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Duplicated block (6 lines × 2) internal/painter/draw.go:75— internal/painter/draw.go:75-80 | internal/painter/draw.go:278-283 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/draw.go:75` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) internal/painter/draw.go:205— internal/painter/draw.go:205-210 | internal/painter/draw.go:731-736 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/draw.go:205` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) internal/painter/draw.go:650— internal/painter/draw.go:650-656 | internal/painter/draw.go:687-692 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/draw.go:650` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) internal/driver/glfw/window.go:1030— internal/driver/glfw/window.go:1030-1035 | internal/driver/mobile/driver.go:688-693 — 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) widget/date_entry.go:104— widget/date_entry.go:104-109 | widget/select_entry.go:59-64 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) widget/date_entry.go:112— widget/date_entry.go:112-117 | widget/select_entry.go:67-72 — 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.
ClassTooLong: Entry widget/entry.go:43— ClassTooLong — 897 significant lines (blank, comment-only and punctuation-only lines excluded), 80 methods, 74 blocks, lines 43-1591. The bar is 400 significant lines; this is 497 over it, 2.24× 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: Table widget/table.go:51— ClassTooLong — 580 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods, 46 blocks, lines 51-1080. The bar is 400 significant lines; this is 180 over it, 1.45× 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: RichTextEntry widget/richtextentry.go:41— ClassTooLong — 511 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods, 43 blocks, lines 41-1752. The bar is 400 significant lines; this is 111 over it, 1.28× 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: RichText widget/richtext.go:35— ClassTooLong — 468 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods, 38 blocks, lines 35-1885. The bar is 400 significant lines; this is 68 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.
ClassTooLong: GoNativeActivity internal/driver/mobile/app/GoNativeActivity.java:48— ClassTooLong — 442 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 42 over it, 1.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.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×5
Edited copy of a member (8 corresponding lines) internal/painter/gl/texture.go:234— internal/painter/gl/texture.go:234-241 | internal/painter/gl/texture.go:243-250 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (8 corresponding lines) widget/gridwrap.go:754— widget/gridwrap.go:754-761 | widget/list.go:924-931 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (8 corresponding lines) container/innerwindow.go:519— container/innerwindow.go:519-526 | dialog/color_channel.go:105-113 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (8 corresponding lines) cmd/fyne/internal/mobile/binres/node.go:48— cmd/fyne/internal/mobile/binres/node.go:48-56 | cmd/fyne/internal/mobile/binres/node.go:243-250 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (8 corresponding lines) widget/hyperlink.go:192— widget/hyperlink.go:192-200 | widget/label.go:120-127 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Duplicated block (12 lines × 2) internal/driver/embedded/touchscreen.go:106— internal/driver/embedded/touchscreen.go:106-117 | internal/driver/mobile/canvas.go:314-325 — before extracting anything, compare `internal/driver/embedded/touchscreen.go` and `internal/driver/mobile/canvas.go` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/embedded/touchscreen.go:106` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) widget/check_group.go:185— widget/check_group.go:185-196 | widget/radio_group.go:166-177 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `widget/check_group.go:185` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) widget/gridwrap.go:93— widget/gridwrap.go:93-104 | widget/list.go:107-118 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `widget/gridwrap.go:93` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) widget/textgrid.go:214— widget/textgrid.go:214-225 | widget/textgrid.go:256-267 — 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) layout/centerlayout.go:30— layout/centerlayout.go:30-41 | layout/stacklayout.go:43-54 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) REDACTED:194— REDACTED:194-203 | cmd/fyne/internal/mobile/build_iosapp.go:227-236 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) layout/boxlayout.go:85— layout/boxlayout.go:85-94 | layout/boxlayout.go:170-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `layout/boxlayout.go:85` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) widget/entry.go:467— widget/entry.go:467-476 | widget/entry.go:800-809 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `widget/entry.go:467` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) cmd/fyne/internal/mobile/binres/binres.go:527— cmd/fyne/internal/mobile/binres/binres.go:527-536 | cmd/fyne/internal/mobile/binres/binres.go:818-827 — 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) data/binding/maps.go:128— data/binding/maps.go:128-137 | data/binding/trees.go:289-298 — 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. The matched lines also register a scope-exit action (a `defer`-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead — before the caller uses what it releases — so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register.
Duplicated block (5 lines × 2) cmd/fyne/internal/commands/package.go:156— cmd/fyne/internal/commands/package.go:156-160 | REDACTED:163-167 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `cmd/fyne/internal/commands/package.go:153` calls `StringVar` and `REDACTED:161` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) internal/driver/common/canvas.go:65— internal/driver/common/canvas.go:65-69 | internal/driver/common/canvas.go:75-79 — 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) internal/painter/draw.go:660— internal/painter/draw.go:660-664 | internal/painter/draw.go:695-699 — 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) internal/painter/draw.go:666— internal/painter/draw.go:666-670 | internal/painter/draw.go:700-704 — 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) widget/table.go:1322— widget/table.go:1322-1326 | widget/table.go:1477-1481 — 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.
Outbound HTTP without resilience internal/driver/mobile/gl/dll_windows.go:25— `http.Get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience internal/repository/http.go:57— `http.Head(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience internal/repository/http.go:73— `http.Get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience internal/repository/http.go:83— `http.Head(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience resource.go:71— `http.Get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
X2 · Cancellation propagation· Function without context.Context · ×5
Function without context.Context: LoadResourceFromURLString resource.go:70— `LoadResourceFromURLString` calls `http.Get(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`.
Function without context.Context: Exists internal/repository/http.go:56— `Exists` calls `http.Head(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`.
Function without context.Context: Reader internal/repository/http.go:72— `Reader` calls `http.Get(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`.
Function without context.Context: CanRead internal/repository/http.go:82— `CanRead` calls `http.Head(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`.
Function without context.Context: downloadDLLs internal/driver/mobile/gl/dll_windows.go:22— `downloadDLLs` calls `http.Get(…)` but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take `ctx context.Context` as the first parameter and build the request with it: `http.NewRequestWithContext(ctx, …)`, `(&net.Dialer{}).DialContext(ctx, …)`.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×4
Edited copy of a member (17 corresponding lines) widget/date_entry.go:146— widget/date_entry.go:146-165 | widget/select_entry.go:97-113 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (17 corresponding lines) dialog/confirm.go:41— dialog/confirm.go:41-58 | dialog/custom.go:81-97 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (17 corresponding lines) widget/gridwrap.go:88— widget/gridwrap.go:88-104 | widget/list.go:102-118 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (17 corresponding lines) storage/repository/generic.go:41— storage/repository/generic.go:41-62 | storage/repository/generic.go:74-90 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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) · ×4
Edited copy of a member (19 corresponding lines) app/preferences.go:49— app/preferences.go:49-68 | app/secret_preferences.go:138-156 — 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.
Edited copy of a member (19 corresponding lines) internal/preferences.go:77— internal/preferences.go:77-95 | internal/preferences.go:123-142 — 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.
Edited copy of a member (19 corresponding lines) layout/boxlayout.go:113— layout/boxlayout.go:113-131 | layout/boxlayout.go:199-217 — 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.
Edited copy of a member (19 corresponding lines) widget/menu.go:56— widget/menu.go:56-74 | widget/menu.go:80-99 — 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· Edited copy of a member (11 corresponding lines) · ×4
Edited copy of a member (11 corresponding lines) widget/tree.go:890— widget/tree.go:890-900 | widget/tree.go:902-912 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (11 corresponding lines) canvas/animation.go:57— canvas/animation.go:57-67 | canvas/animation.go:74-84 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (11 corresponding lines) cmd/fyne/internal/commands/get.go:147— cmd/fyne/internal/commands/get.go:147-157 | cmd/fyne/internal/commands/package.go:177-189 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (11 corresponding lines) widget/gridwrap.go:598— widget/gridwrap.go:598-608 | widget/list.go:747-757 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Duplicated block (9 lines × 2) cmd/fyne/internal/mobile/binres/node.go:65— cmd/fyne/internal/mobile/binres/node.go:65-73 | cmd/fyne/internal/mobile/binres/node.go:255-263 — 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) internal/painter/software/draw.go:86— internal/painter/software/draw.go:86-94 | internal/painter/software/draw.go:323-331 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/software/draw.go:86` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) widget/gridwrap.go:482— widget/gridwrap.go:482-490 | widget/list.go:628-636 — 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) widget/table.go:1689— widget/table.go:1689-1697 | widget/table.go:1731-1739 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `widget/table.go:1689` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D12 · Dependency Hygiene· Dependency pinned to a stale untagged commit · ×3
Dependency pinned to a stale untagged commit: github.com/mcuadros/go-version — Direct dependency `github.com/mcuadros/go-version` is required at `v0.0.0-20190830083331-035f6764e8d2` in REDACTED — a pseudo-version, which pins an UNTAGGED commit from 2019-08-30, 7.2 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of `github.com/mcuadros/go-version` and has not moved this requirement in 7.2 years: every fix the module has published since that commit — including any security fix — is absent from this build, whether the module went quiet or moved on without you. Check whether `github.com/mcuadros/go-version` now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit.
Dependency pinned to a stale untagged commit: github.com/nfnt/resize — Direct dependency `github.com/nfnt/resize` is required at `v0.0.0-20180221191011-83c6a9932646` in REDACTED — a pseudo-version, which pins an UNTAGGED commit from 2018-02-21, 8.7 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of `github.com/nfnt/resize` and has not moved this requirement in 8.7 years: every fix the module has published since that commit — including any security fix — is absent from this build, whether the module went quiet or moved on without you. Check whether `github.com/nfnt/resize` now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit.
Dependency pinned to a stale untagged commit: github.com/srwiley/rasterx — Direct dependency `github.com/srwiley/rasterx` is required at `v0.0.0-20220730225603-2ab79fcdd4ef` in REDACTED — a pseudo-version, which pins an UNTAGGED commit from 2022-07-30, 4.3 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of `github.com/srwiley/rasterx` and has not moved this requirement in 4.3 years: every fix the module has published since that commit — including any security fix — is absent from this build, whether the module went quiet or moved on without you. Check whether `github.com/srwiley/rasterx` now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit.
TooManyFields: window internal/driver/glfw/window_desktop.go:73— TooManyFields — 50 stored fields beside 102 methods. The bar is 30 stored fields; this is 20 over it, 1.67× 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: Entry widget/entry.go:43— TooManyFields — 41 stored fields beside 80 methods. 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: Table widget/table.go:51— TooManyFields — 39 stored fields beside 45 methods. The bar is 30 stored fields; this is 9 over it, 1.30× 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: bundled-icons.go ↔ gen.go theme/bundled-icons.go:1— `theme/bundled-icons.go` and `theme/gen.go` change together 76% of the time (16 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are `5d1778b6` Use embed to bundle icons; `f6776373` Add an optional `Partial` state to checkbox widget that displays a dash; `1df5b2af` Add desktop icon — run `git show` on any of them.
Change coupling: painter.go ↔ vector.go internal/painter/software/painter.go:1— `internal/painter/software/painter.go` and `internal/painter/vector.go` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — 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 5 shared commits counted here, the most recent 3 are `79f8527d` Renaming the `Polygon` to `RegularPolygon` to make room for a more fl…; `9f0114b4` implement bezier curve with software painter; `ccd9c5b0` add ellipse canvas, implement software painter — run `git show` on any of them.
Change coupling: draw.go ↔ painter.go internal/painter/draw.go:1— `internal/painter/draw.go` and `internal/painter/software/painter.go` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — 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 5 shared commits counted here, the most recent 3 are `79f8527d` Renaming the `Polygon` to `RegularPolygon` to make room for a more fl…; `9f0114b4` implement bezier curve with software painter; `ccd9c5b0` add ellipse canvas, implement software painter — run `git show` on any of them.
D4 · Code Duplication· Edited copy of a member (28 corresponding lines) · ×3
Edited copy of a member (28 corresponding lines) widget/check_group.go:141— widget/check_group.go:141-168 | widget/check_group.go:232-261 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (28 corresponding lines) widget/table.go:659— widget/table.go:659-686 | widget/table.go:803-830 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (28 corresponding lines) app/preferences.go:128— app/preferences.go:128-161 | app/secret_preferences.go:46-73 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (13 corresponding lines) · ×3
Edited copy of a member (13 corresponding lines) widget/gridwrap.go:481— widget/gridwrap.go:481-493 | widget/list.go:627-639 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (13 corresponding lines) internal/widget/base.go:84— internal/widget/base.go:84-96 | widget/widget.go:165-177 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (13 corresponding lines) internal/widget/base.go:99— internal/widget/base.go:99-111 | widget/widget.go:104-116 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (7 corresponding lines) · ×3
Edited copy of a member (7 corresponding lines) internal/painter/gl/draw.go:584— internal/painter/gl/draw.go:584-594 | internal/painter/software/draw.go:377-383 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (7 corresponding lines) internal/painter/gl/draw.go:1195— internal/painter/gl/draw.go:1195-1201 | internal/painter/gl/texture.go:329-335 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (7 corresponding lines) cmd/fyne/internal/commands/package-darwin.go:27— cmd/fyne/internal/commands/package-darwin.go:27-33 | cmd/fyne_demo/tutorials/icons.go:79-86 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (5 corresponding lines) · ×3
Edited copy of a member (5 corresponding lines) widget/activity.go:224— widget/activity.go:224-228 | widget/menu_item.go:361-366 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (5 corresponding lines) widget/entry_password.go:66— widget/entry_password.go:66-70 | widget/entry_validation.go:125-129 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (5 corresponding lines) widget/gridwrap.go:420— widget/gridwrap.go:420-424 | widget/list.go:568-572 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (6 corresponding lines) · ×3
Edited copy of a member (6 corresponding lines) canvas/circle.go:90— canvas/circle.go:90-95 | canvas/line.go:26-31 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (6 corresponding lines) dialog/dialog.go:93— dialog/dialog.go:93-98 | dialog/file.go:763-769 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (6 corresponding lines) widget/check.go:387— widget/check.go:387-397 | widget/entry.go:1218-1223 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (10 corresponding lines) · ×3
Edited copy of a member (10 corresponding lines) internal/svg/svg.go:288— internal/svg/svg.go:288-297 | internal/svg/svg.go:302-311 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (10 corresponding lines) internal/driver/embedded/driver.go:52— internal/driver/embedded/driver.go:52-61 | internal/driver/mobile/driver.go:158-168 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (10 corresponding lines) internal/widget/base.go:66— internal/widget/base.go:66-75 | widget/widget.go:71-80 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Duplicated block (16 lines × 2) widget/gridwrap.go:273— widget/gridwrap.go:273-288 | widget/list.go:367-382 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `widget/list.go:387` calls `GetScrollOffset` and `widget/gridwrap.go:291` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16 lines × 2) widget/gridwrap.go:551— widget/gridwrap.go:551-566 | widget/list.go:697-712 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (16 lines × 2) widget/progressbar.go:183— widget/progressbar.go:183-198 | widget/slider.go:374-389 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) dialog/confirm.go:51— dialog/confirm.go:51-58 | dialog/custom.go:90-97 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `dialog/confirm.go:51` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) internal/painter/draw.go:194— internal/painter/draw.go:194-201 | internal/painter/draw.go:720-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. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/draw.go:194` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) data/binding/lists.go:536— data/binding/lists.go:536-543 | data/binding/trees.go:587-594 — 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.
FunctionTooLong: painter.drawRoundArcUsingAdder internal/painter/draw.go:856— FunctionTooLong — drawRoundArcUsingAdder runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part 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: glfw.glfwKeyToKeyName internal/driver/glfw/window_desktop.go:516— FunctionTooLong — glfwKeyToKeyName runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×2
Edited copy of a member (25 corresponding lines) internal/painter/software/draw.go:70— internal/painter/software/draw.go:70-94 | internal/painter/software/draw.go:307-331 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (25 corresponding lines) lang/lang.go:93— lang/lang.go:93-117 | lang/lang.go:132-157 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (37 corresponding lines) · ×2
Edited copy of a member (37 corresponding lines) widget/gridwrap.go:618— widget/gridwrap.go:618-655 | widget/list.go:767-803 — These two members are one piece of code written twice and then edited apart: 37 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.
Edited copy of a member (37 corresponding lines) cmd/fyne_demo/tutorials/collection.go:25— cmd/fyne_demo/tutorials/collection.go:25-61 | cmd/fyne_demo/tutorials/collection.go:63-101 — These two members are one piece of code written twice and then edited apart: 37 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 (23 corresponding lines) · ×2
Edited copy of a member (23 corresponding lines) internal/painter/gl/atlas.go:50— internal/painter/gl/atlas.go:50-73 | internal/painter/gl/atlas.go:75-97 — These two members are one piece of code written twice and then edited apart: 23 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.
Edited copy of a member (23 corresponding lines) container/doctabs.go:14— container/doctabs.go:14-37 | container/apptabs.go:12-34 — These two members are one piece of code written twice and then edited apart: 23 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 (18 corresponding lines) · ×2
Edited copy of a member (18 corresponding lines) widget/check_group.go:208— widget/check_group.go:208-225 | widget/radio_group.go:189-206 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (18 corresponding lines) widget/entry.go:459— widget/entry.go:459-476 | widget/entry.go:792-809 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 copies of one member (3 members, 16+ corresponding lines) · ×2
Edited copies of one member (3 members, 16+ corresponding lines) internal/driver/mobile/file.go:50— internal/driver/mobile/file.go:50-65 | internal/driver/mobile/file.go:68-87 | internal/driver/mobile/file.go:114-137 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 16+ corresponding lines) data/binding/trees.go:392— data/binding/trees.go:392-407 | data/binding/trees.go:427-442 | data/binding/trees.go:444-459 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×2
Edited copy of a member (12 corresponding lines) widget/gridwrap.go:163— widget/gridwrap.go:163-174 | widget/list.go:188-199 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (12 corresponding lines) data/binding/lists.go:426— data/binding/lists.go:426-437 | data/binding/trees.go:483-496 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (16 corresponding lines) · ×2
Edited copy of a member (16 corresponding lines) dialog/fileitem.go:62— dialog/fileitem.go:62-77 | dialog/fileitem.go:91-110 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (16 corresponding lines) widget/table.go:699— widget/table.go:699-714 | widget/table.go:716-731 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (20 corresponding lines) · ×2
Edited copy of a member (20 corresponding lines) internal/docs.go:22— internal/docs.go:22-46 | internal/docs.go:101-120 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
Edited copy of a member (20 corresponding lines) data/binding/convert.go:359— data/binding/convert.go:359-379 | data/binding/convert.go:397-416 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 copies of one member (3 members, 13+ corresponding lines) · ×2
Edited copies of one member (3 members, 13+ corresponding lines) canvas/canvas.go:45— canvas/canvas.go:45-57 | container.go:214-226 | internal/widget/base.go:131-143 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 13+ corresponding lines) data/binding/items.go:268— data/binding/items.go:268-280 | data/binding/lists.go:551-563 | data/binding/trees.go:603-615 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (20 lines × 2) internal/driver/embedded/touchscreen.go:184— internal/driver/embedded/touchscreen.go:184-203 | internal/driver/mobile/canvas.go:469-488 — before extracting anything, compare `internal/driver/embedded/touchscreen.go` and `internal/driver/mobile/canvas.go` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/embedded/touchscreen.go:184` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `internal/driver/mobile/canvas.go:466` calls `Since`, `clearCapturedTap` and `internal/driver/embedded/touchscreen.go:182` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (20 lines × 2) widget/gridwrap.go:199— widget/gridwrap.go:199-218 | widget/list.go:285-304 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (14 lines × 2) internal/driver/embedded/touchscreen.go:67— internal/driver/embedded/touchscreen.go:67-80 | internal/driver/mobile/canvas.go:271-284 — before extracting anything, compare `internal/driver/embedded/touchscreen.go` and `internal/driver/mobile/canvas.go` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/embedded/touchscreen.go:67` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) internal/painter/draw.go:155— internal/painter/draw.go:155-168 | internal/painter/draw.go:221-234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–13 lines × 2) app/preferences.go:50— app/preferences.go:50-62 | app/secret_preferences.go:139-150 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `app/preferences.go:50` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–13 lines × 2) widget/gridwrap.go:319— widget/gridwrap.go:319-331 | widget/list.go:399-410 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13 lines × 2) widget/richtextentry.go:1038— widget/richtextentry.go:1038-1050 | widget/richtextentry.go:1451-1463 — 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) internal/widget/base.go:34— internal/widget/base.go:34-46 | widget/widget.go:40-52 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Check import visibility before settling on that home: `internal/widget/base.go` sits under a restricted `internal` directory, which only code inside its own subtree is permitted to import from — so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate.
Duplicated block (11 lines × 3) canvas/canvas.go:47— canvas/canvas.go:47-57 | container.go:216-226 | internal/widget/base.go:133-143 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `canvas/canvas.go:47` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Check import visibility before settling on that home: `internal/widget/base.go` sits under a restricted `internal` directory, which only code inside its own subtree is permitted to import from — so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate.
Duplicated block (11 lines × 3) widget/gridwrap.go:358— widget/gridwrap.go:358-368 | widget/list.go:429-439 | widget/tree.go:462-472 — 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.
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark cmd/fyne/internal/templates/data/index.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
WebGLDebugUtils.makeLostContextSimulatingCanvas (cyclomatic 65) cmd/fyne/internal/templates/data/webgl-debug.js:631— WebGLDebugUtils.makeLostContextSimulatingCanvas has cyclomatic complexity 65 (threshold 15). Most of this is not in the body itself: 1 of the 65 points is its own statement and the rest belongs to 46 function items inside it that branch (freeResources, makeLostContextSimulatingContext, a function literal at line 651, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
window.processMouseClicked (cyclomatic 30) internal/driver/glfw/window.go:497— window.processMouseClicked has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
driver.Run (cyclomatic 30) internal/driver/mobile/driver.go:178— driver.Run has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 2 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 184). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
window.processKeyPressed (cyclomatic 29) internal/driver/glfw/window.go:725— window.processKeyPressed 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.
widget.renderNode (cyclomatic 29) widget/markdown.go:54— widget.renderNode has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case's concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases — they stay explicit and reviewable.
Entry.TypedKey (cyclomatic 29) widget/entry.go:695— Entry.TypedKey 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.
sprintfString.Set (cyclomatic 27) data/binding/sprintf.go:115— sprintfString.Set 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.
canvas.tapUp (cyclomatic 27) internal/driver/mobile/canvas.go:381— canvas.tapUp 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.
tableCellsRenderer.moveIndicators (cyclomatic 27) widget/table.go:1473— tableCellsRenderer.moveIndicators has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mobile.goAndroidBuild (cyclomatic 26) REDACTED:39— mobile.goAndroidBuild has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mobile.goIOSBuild (cyclomatic 26) cmd/fyne/internal/mobile/build_iosapp.go:23— mobile.goIOSBuild 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.
mobile.envInit (cyclomatic 26) cmd/fyne/internal/mobile/env.go:92— mobile.envInit 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.
binres.addAttributeNamespace (cyclomatic 26) cmd/fyne/internal/mobile/binres/binres.go:651— binres.addAttributeNamespace 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.
window.triggersShortcut (cyclomatic 26) internal/driver/glfw/window.go:847— window.triggersShortcut 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.
Builder.build (cyclomatic 25) cmd/fyne/internal/commands/build.go:167— Builder.build has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mobile.runBuildImpl (cyclomatic 25) cmd/fyne/internal/mobile/build.go:99— mobile.runBuildImpl 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.
painter.VectorPad (cyclomatic 25) internal/painter/vector.go:15— painter.VectorPad 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.
RichText.insertAt (cyclomatic 25) widget/richtext.go:516— RichText.insertAt 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.
tableCellsRenderer.refreshForID (cyclomatic 25) widget/table.go:1317— tableCellsRenderer.refreshForID has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
binres.PackResources (cyclomatic 24) REDACTED:67— binres.PackResources 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.
entryRenderer.Refresh (cyclomatic 24) widget/entry.go:1772— entryRenderer.Refresh 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.
textRenderer.layoutRow (cyclomatic 24) widget/richtext.go:1400— textRenderer.layoutRow 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.
Packager.validate (cyclomatic 23) cmd/fyne/internal/commands/package.go:307— Packager.validate has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
binres.buildXML (cyclomatic 23) cmd/fyne/internal/mobile/binres/binres.go:313— binres.buildXML has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 369, 342). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
window.processMouseMoved (cyclomatic 23) internal/driver/glfw/window.go:374— window.processMouseMoved has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
textRenderer.Refresh (cyclomatic 23) widget/richtext.go:1299— textRenderer.Refresh has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
window.create (cyclomatic 22) internal/driver/glfw/window_desktop.go:808— window.create has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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: glfw.glfwKeyToKeyName (cyclomatic 50) 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.
treeContentRenderer.Layout (cyclomatic 22) widget/tree.go:687— treeContentRenderer.Layout has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 708). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
Releaser.validate (cyclomatic 21) REDACTED:445— Releaser.validate 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.
mobile.addAssets (cyclomatic 21) REDACTED:171— mobile.addAssets has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
canvas.tapMove (cyclomatic 21) internal/driver/mobile/canvas.go:286— canvas.tapMove has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Packager.doPackage (cyclomatic 20) cmd/fyne/internal/commands/package.go:242— Packager.doPackage 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.
noosDriver.doRun (cyclomatic 20) internal/driver/embedded/driver.go:71— noosDriver.doRun 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.
gLDriver.runGL (cyclomatic 20) internal/driver/glfw/loop.go:105— gLDriver.runGL has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
widget.segmentsToMarkdown (cyclomatic 20) widget/richtextentry.go:839— widget.segmentsToMarkdown has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 912, 847, 890, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Table.hoverAt (cyclomatic 20) widget/table.go:740— Table.hoverAt has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Packager.packageWindows (cyclomatic 19) cmd/fyne/internal/commands/package-windows.go:25— Packager.packageWindows 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.
widget.wrapWordLines (cyclomatic 19) widget/richtext.go:1688— widget.wrapWordLines 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.
RichTextEntry.TypedKey (cyclomatic 19) widget/richtextentry.go:221— RichTextEntry.TypedKey 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.
tableCellsRenderer.refreshHeaders (cyclomatic 19) widget/table.go:1660— tableCellsRenderer.refreshHeaders has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
textGridRow.refreshCells (cyclomatic 19) widget/textgrid.go:783— textGridRow.refreshCells 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.
Tree.TypedKey (cyclomatic 19) widget/tree.go:399— Tree.TypedKey has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body's own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mobile.parseBuildTarget (cyclomatic 18) cmd/fyne/internal/mobile/build.go:378— mobile.parseBuildTarget has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
binres.resolveElements (cyclomatic 18) cmd/fyne/internal/mobile/binres/binres.go:434— binres.resolveElements has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 466, 438). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
driver.walkObjectTree (cyclomatic 18) internal/driver/util.go:137— driver.walkObjectTree has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
painter.drawRoundArcUsingAdder (cyclomatic 18) internal/painter/draw.go:856— painter.drawRoundArcUsingAdder has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body's own statements and 3 belong to one function literal inside it that branches. 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.
software.drawShadow (cyclomatic 18) internal/painter/software/draw.go:493— software.drawShadow 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.
widget.renderEmphasis (cyclomatic 18) widget/markdown.go:205— widget.renderEmphasis has cyclomatic complexity 18 (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.
widget.flattenSegments (cyclomatic 18) widget/richtextentry.go:723— widget.flattenSegments has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Image.Refresh (cyclomatic 17) canvas/image.go:133— Image.Refresh 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.
fileDialog.makeUI (cyclomatic 17) dialog/file.go:116— fileDialog.makeUI has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body's own statements and 5 belong to 3 function literals inside it that branch. To reduce it, 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.
driver.typeDownCanvas (cyclomatic 17) internal/driver/mobile/driver.go:761— driver.typeDownCanvas 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.
painter.NormalizeBezierCurvePoints (cyclomatic 17) internal/painter/draw.go:479— painter.NormalizeBezierCurvePoints 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.
gridWrapLayout.updateGrid (cyclomatic 17) widget/gridwrap.go:673— gridWrapLayout.updateGrid 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.
listLayout.updateList (cyclomatic 17) widget/list.go:805— listLayout.updateList 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.
tableCellsRenderer.moveMarker (cyclomatic 17) widget/table.go:1590— tableCellsRenderer.moveMarker has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
commands.validateAppID (cyclomatic 16) cmd/fyne/internal/commands/package.go:454— commands.validateAppID 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.
XML.kind (cyclomatic 16) cmd/fyne/internal/mobile/binres/binres.go:790— XML.kind 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.
tabButtonRenderer.Refresh (cyclomatic 16) container/tabs.go:696— tabButtonRenderer.Refresh 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.
sprintfString.DataChanged (cyclomatic 16) data/binding/sprintf.go:37— sprintfString.DataChanged 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.
painter.drawOblong (cyclomatic 16) internal/painter/draw.go:610— painter.drawOblong 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.
repository.GenericDeleteAll (cyclomatic 16) storage/repository/generic.go:161— repository.GenericDeleteAll 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.
textRenderer.Layout (cyclomatic 16) widget/richtext.go:1086— textRenderer.Layout 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.
rowBoundsBuilder.appendText (cyclomatic 16) widget/richtext_rowbounds.go:167— rowBoundsBuilder.appendText 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.
Table.visibleColumnWidths (cyclomatic 16) widget/table.go:919— Table.visibleColumnWidths 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. This shape REPEATS in the file: one other method here (Table.visibleRowHeights) 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.
Table.visibleRowHeights (cyclomatic 16) widget/table.go:1016— Table.visibleRowHeights 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. This shape REPEATS in the file: one other method here (Table.visibleColumnWidths) 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.
textGridRow.setCellRune (cyclomatic 16) widget/textgrid.go:729— textGridRow.setCellRune 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.
Deprecated module: golang.org/x/tools/go/vcs — `golang.org/x/tools/go/vcs` is required at v0.1.0-deprecated in REDACTED, and its author has DEPRECATED the module: "This module contains one deprecated package. See the package deprecation notice for more information." A deprecation is declared by the author in the module's own REDACTED and applies to the whole module, not to one release, so moving to a newer version of it does not clear this. Follow the replacement the notice names.
binres.PackResources (cognitive 68) REDACTED:67— binres.PackResources has cognitive complexity 68 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 11 (31 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
binres.addAttributeNamespace (cognitive 61) cmd/fyne/internal/mobile/binres/binres.go:651— binres.addAttributeNamespace has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 3 (10 pts), match/switch 3 (7 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mobile.envInit (cognitive 53) cmd/fyne/internal/mobile/env.go:92— mobile.envInit has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 28). 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.
widget.wrapWordLines (cognitive 49) widget/richtext.go:1688— widget.wrapWordLines has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (42 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
textRenderer.layoutRow (cognitive 47) widget/richtext.go:1400— textRenderer.layoutRow has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 4 (7 pts), match/switch 2 (4 pts) (nesting depth added 26). 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.
canvas.tapUp (cognitive 45) internal/driver/mobile/canvas.go:381— canvas.tapUp has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 5 (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.
textRenderer.Refresh (cognitive 44) widget/richtext.go:1299— textRenderer.Refresh has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 4, 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.
mobile.runBuildImpl (cognitive 42) cmd/fyne/internal/mobile/build.go:99— mobile.runBuildImpl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 2 (6 pts), match/switch 2, 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.
gLDriver.runGL (cognitive 42) internal/driver/glfw/loop.go:105— gLDriver.runGL has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 25). Of this number, 41 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
window.processKeyPressed (cognitive 42) internal/driver/glfw/window.go:725— window.processKeyPressed has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 6, 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.
noosDriver.doRun (cognitive 41) internal/driver/embedded/driver.go:71— noosDriver.doRun has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (34 pts), match/switch 2 (5 pts), loops 2 (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.
tableCellsRenderer.refreshHeaders (cognitive 41) widget/table.go:1660— tableCellsRenderer.refreshHeaders has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 5 (11 pts) (nesting depth added 23). Of this number, 25 points are the body's own statements and 16 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
treeContentRenderer.Layout (cognitive 41) widget/tree.go:687— treeContentRenderer.Layout has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 3, boolean chains 2 (nesting depth added 18). Most of this is not in the body itself: 8 of the 41 points are its own statements and the rest belongs to one function literal inside it that branches (line 708). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
mobile.goIOSBuild (cognitive 40) cmd/fyne/internal/mobile/build_iosapp.go:23— mobile.goIOSBuild has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (38 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mobile.goAndroidBuild (cognitive 39) REDACTED:39— mobile.goAndroidBuild has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (37 pts), boolean chains 1, loops 1 (nesting depth added 13). Of this number, 37 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
window.processMouseClicked (cognitive 39) internal/driver/glfw/window.go:497— window.processMouseClicked has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 7, match/switch 3 (4 pts) (nesting depth added 15). Of this number, 36 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
driver.Run (cognitive 37) internal/driver/mobile/driver.go:178— driver.Run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 4 (13 pts), boolean chains 2, loops 2 (nesting depth added 22). Most of this is not in the body itself: 1 of the 37 points is its own statement and the rest belongs to one function literal inside it that branches (line 184). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
binres.UnmarshalXML (cognitive 36) cmd/fyne/internal/mobile/binres/binres.go:213— binres.UnmarshalXML has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 2 (6 pts), match/switch 2 (5 pts), boolean chains 1 (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.
window.processMouseMoved (cognitive 35) internal/driver/glfw/window.go:374— window.processMouseMoved has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 6 (nesting depth added 12). Of this number, 31 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mobile.addAssets (cognitive 33) REDACTED:171— mobile.addAssets has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 1 (nesting depth added 12). Of this number, 24 points are the body's own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
painter.drawOblong (cognitive 33) internal/painter/draw.go:610— painter.drawOblong has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sprintfString.Set (cognitive 32) data/binding/sprintf.go:115— sprintfString.Set has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
glfw.itemForMenuItem (cognitive 32) internal/driver/glfw/driver_desktop.go:135— glfw.itemForMenuItem has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
canvas.tapMove (cognitive 32) internal/driver/mobile/canvas.go:286— canvas.tapMove has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 12). Of this number, 25 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WebGLDebugUtils.glFunctionArgToString (cognitive 32) cmd/fyne/internal/templates/data/webgl-debug.js:354— WebGLDebugUtils.glFunctionArgToString has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 19). 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.
Releaser.validate (cognitive 31) REDACTED:445— Releaser.validate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entryRenderer.Refresh (cognitive 31) widget/entry.go:1772— entryRenderer.Refresh has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, 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.
tableCellsRenderer.moveIndicators (cognitive 31) widget/table.go:1473— tableCellsRenderer.moveIndicators has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16, loops 6 (9 pts), boolean chains 6 (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.
driver.typeDownCanvas (cognitive 30) internal/driver/mobile/driver.go:761— driver.typeDownCanvas has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RichText.insertAt (cognitive 30) widget/richtext.go:516— RichText.insertAt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
software.drawShadow (cognitive 29) internal/painter/software/draw.go:493— software.drawShadow has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (5 pts), match/switch 2 (3 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.
textRenderer.Layout (cognitive 29) widget/richtext.go:1086— textRenderer.Layout has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
textRenderer.calculateMin (cognitive 29) widget/richtext.go:1238— textRenderer.calculateMin has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tableCellsRenderer.refreshForID (cognitive 29) widget/table.go:1317— tableCellsRenderer.refreshForID has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 9 (11 pts), boolean chains 3 (nesting depth added 5). Of this number, 21 points are the body's own statements and 8 belong to 2 function literals inside it that branch. 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.
mobile.parseBuildTarget (cognitive 28) cmd/fyne/internal/mobile/build.go:378— mobile.parseBuildTarget has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3, boolean chains 1 (nesting depth added 9). Of this number, 25 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
binres.buildXML (cognitive 28) cmd/fyne/internal/mobile/binres/binres.go:313— binres.buildXML has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 10, match/switch 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 369, 342). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Form.updateLabels (cognitive 28) widget/form.go:505— Form.updateLabels has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gridWrapLayout.updateGrid (cognitive 28) widget/gridwrap.go:673— gridWrapLayout.updateGrid has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
textGridRow.refreshCells (cognitive 28) widget/textgrid.go:783— textGridRow.refreshCells has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (9 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Image.Refresh (cognitive 27) canvas/image.go:133— Image.Refresh has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Packager.validate (cognitive 27) cmd/fyne/internal/commands/package.go:307— Packager.validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 4 (nesting depth added 4). Of this number, 26 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
widget.segmentsToMarkdown (cognitive 27) widget/richtextentry.go:839— widget.segmentsToMarkdown has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 13). None of this is in the body itself: all 27 points belong to 5 function literals inside it that branch (lines 912, 890, 847, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Builder.build (cognitive 26) cmd/fyne/internal/commands/build.go:167— Builder.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
commands.validateAppID (cognitive 26) cmd/fyne/internal/commands/package.go:454— commands.validateAppID has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
binres.resolveElements (cognitive 26) cmd/fyne/internal/mobile/binres/binres.go:434— binres.resolveElements has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5, boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 466, 438). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Pool.UnmarshalBinary (cognitive 26) cmd/fyne/internal/mobile/binres/pool.go:90— Pool.UnmarshalBinary has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
listLayout.updateList (cognitive 26) widget/list.go:805— listLayout.updateList has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tabButtonRenderer.Refresh (cognitive 25) container/tabs.go:696— tabButtonRenderer.Refresh has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, match/switch 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.
window.create (cognitive 25) internal/driver/glfw/window_desktop.go:808— window.create has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 5 (nesting depth added 3). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
driver.walkObjectTree (cognitive 25) internal/driver/util.go:137— driver.walkObjectTree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 8). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
painter.NormalizeBezierCurvePoints (cognitive 25) internal/painter/draw.go:479— painter.NormalizeBezierCurvePoints has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 9 (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.
painter.VectorPad (cognitive 25) internal/painter/vector.go:15— painter.VectorPad has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, match/switch 1 (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.
WebGLDebugUtils.makeDebugContext (cognitive 25) cmd/fyne/internal/templates/data/webgl-debug.js:453— WebGLDebugUtils.makeDebugContext has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (getError, a function literal at line 456, a function literal at line 474, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
binres.addAttributes (cognitive 24) cmd/fyne/internal/mobile/binres/binres.go:595— binres.addAttributes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sprintfString.DataChanged (cognitive 24) data/binding/sprintf.go:37— sprintfString.DataChanged has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Entry.TypedKey (cognitive 24) widget/entry.go:695— Entry.TypedKey has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, 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.
Table.visibleColumnWidths (cognitive 24) widget/table.go:919— Table.visibleColumnWidths has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Table.visibleRowHeights) 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.
Table.visibleRowHeights (cognitive 24) widget/table.go:1016— Table.visibleRowHeights has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Table.visibleColumnWidths) 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.
Tree.TypedKey (cognitive 24) widget/tree.go:399— Tree.TypedKey has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, match/switch 1 (nesting depth added 9). Of this number, 14 points are the body's own statements and 10 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Packager.packageWindows (cognitive 23) cmd/fyne/internal/commands/package-windows.go:25— Packager.packageWindows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (23 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.
window.triggersShortcut (cognitive 23) internal/driver/glfw/window.go:847— window.triggersShortcut has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Table.hoverAt (cognitive 23) widget/table.go:740— Table.hoverAt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
fileDialog.makeOpenButton (cognitive 22) dialog/file.go:274— fileDialog.makeOpenButton has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1 (nesting depth added 9). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 275). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
Runner.tickAnimation (cognitive 22) internal/animation/runner.go:129— Runner.tickAnimation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (22 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.
painter.CachedFontFace (cognitive 22) internal/painter/font.go:125— painter.CachedFontFace has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 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.
repository.GenericDeleteAll (cognitive 22) storage/repository/generic.go:161— repository.GenericDeleteAll has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.convertLists (cognitive 21) app/preferences.go:163— app.convertLists has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 14). 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.
Package.UnmarshalBinary (cognitive 21) REDACTED:258— Package.UnmarshalBinary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fileDialog.makeUI (cognitive 21) dialog/file.go:116— fileDialog.makeUI has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 2 (nesting depth added 2). Of this number, 13 points are the body's own statements and 8 belong to 3 function literals inside it that branch. 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.
painter.drawRoundArcUsingAdder (cognitive 21) internal/painter/draw.go:856— painter.drawRoundArcUsingAdder has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 1, loops 1 (nesting depth added 3). Of this number, 18 points are the body's own statements and 3 belong to one function literal inside it that branches. 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.
widget.renderNode (cognitive 21) widget/markdown.go:54— widget.renderNode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (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.
widget.flattenSegments (cognitive 21) widget/richtextentry.go:723— widget.flattenSegments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). Of this number, 19 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Entry.registerShortcut (cognitive 21) widget/entry.go:1113— Entry.registerShortcut has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 1136, 1184, 1166). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
RichTextEntry.TypedKey (cognitive 21) widget/richtextentry.go:221— RichTextEntry.TypedKey has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, match/switch 2 (nesting depth added 8). 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.
tableCellsRenderer.moveMarker (cognitive 21) widget/table.go:1590— tableCellsRenderer.moveMarker has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
Packager.doPackage (cognitive 20) cmd/fyne/internal/commands/package.go:242— Packager.doPackage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FileDialog.effectiveStartingDir (cognitive 20) dialog/file.go:633— FileDialog.effectiveStartingDir has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (20 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.
driver.FindObjectAtPositionMatching (cognitive 20) internal/driver/util.go:32— driver.FindObjectAtPositionMatching has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). Of this number, 10 points are the body's own statements and 10 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
widget.truncateLines (cognitive 20) widget/richtext.go:1781— widget.truncateLines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
listLayout.calculateVisibleRowHeights (cognitive 20) widget/list.go:498— listLayout.calculateVisibleRowHeights has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 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.
RichText.updateRowGeometry (cognitive 20) widget/richtext.go:777— RichText.updateRowGeometry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), match/switch 1 (3 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.
mobile.splitQuotedFields (cognitive 19) cmd/fyne/internal/mobile/strings_flag.go:24— mobile.splitQuotedFields has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), boolean chains 4 (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.
appTabsRenderer.buildTabButtons (cognitive 19) container/apptabs.go:349— appTabsRenderer.buildTabButtons has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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.
binding.stripFormatPrecision (cognitive 19) data/binding/convert_helper.go:56— binding.stripFormatPrecision has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FocusManager.Focus (cognitive 19) internal/app/focus_manager.go:20— FocusManager.Focus has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3 (nesting depth added 8). Of this number, 12 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Canvas.EnsureMinSize (cognitive 19) internal/driver/common/canvas.go:87— Canvas.EnsureMinSize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3 (nesting depth added 3). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 105, 97). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
touchCanvas.tapUp (cognitive 19) internal/driver/embedded/touchscreen.go:136— touchCanvas.tapUp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 pts) (nesting depth added 6). Of this number, 15 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
widget.renderEmphasis (cognitive 19) widget/markdown.go:205— widget.renderEmphasis has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
widget.renderHeading (cognitive 19) widget/markdown.go:247— widget.renderHeading has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RichText.lineSizeToColumn (cognitive 19) widget/richtext.go:595— RichText.lineSizeToColumn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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.
RichTextEntry.styleMarkdownInline (cognitive 19) widget/richtextentry.go:1058— RichTextEntry.styleMarkdownInline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mobile.buildAPK (cognitive 18) REDACTED:263— mobile.buildAPK has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
XML.kind (cognitive 18) cmd/fyne/internal/mobile/binres/binres.go:790— XML.kind 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.
appTabsRenderer.Layout (cognitive 18) container/apptabs.go:274— appTabsRenderer.Layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
boundList.doReload (cognitive 18) data/binding/lists.go:439— boundList.doReload has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
painter.shapeString (cognitive 18) internal/painter/font.go:457— painter.shapeString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InMemoryPreferences.set (cognitive 18) internal/preferences.go:286— InMemoryPreferences.set has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
accordionRenderer.updateObjects (cognitive 18) widget/accordion.go:233— accordionRenderer.updateObjects has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 6 (nesting depth added 4). Of this number, 15 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
entryRenderer.Layout (cognitive 18) widget/entry.go:1638— entryRenderer.Layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, loops 1 (nesting depth added 3). Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
RichTextEntry.recordUndo (cognitive 18) widget/richtextentry_undo.go:302— RichTextEntry.recordUndo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, 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.
Table.TypedKey (cognitive 18) widget/table.go:365— Table.TypedKey has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tableCellsRenderer.MinSize (cognitive 18) widget/table.go:1268— tableCellsRenderer.MinSize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 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.
textGridContentRenderer.addRowsIfRequired (cognitive 18) widget/textgrid.go:609— textGridContentRenderer.addRowsIfRequired has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Bundler.Run (cognitive 17) cmd/fyne/internal/commands/bundle.go:100— Bundler.Run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), 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.
mobile.rfc1034Label (cognitive 17) cmd/fyne/internal/mobile/build_iosapp.go:647— mobile.rfc1034Label has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
binres.handleTokens (cognitive 17) cmd/fyne/internal/mobile/binres/binres.go:516— binres.handleTokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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.
binres.apiResources (cognitive 17) REDACTED:17— binres.apiResources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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.
innerWindowRenderer.Refresh (cognitive 17) container/innerwindow.go:287— innerWindowRenderer.Refresh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1, 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.
boundTree.doReload (cognitive 17) data/binding/trees.go:498— boundTree.doReload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UnboundedChan.processing (cognitive 17) internal/async/chan.go:38— UnboundedChan.processing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
glfw.addMissingQuitForMainMenu (cognitive 17) internal/driver/glfw/menu_notweb.go:10— glfw.addMissingQuitForMainMenu has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). Of this number, 9 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GlyphAtlas.TextQuads (cognitive 17) internal/painter/atlas.go:110— GlyphAtlas.TextQuads has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), 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.
painter.drawText (cognitive 17) internal/painter/gl/draw.go:885— painter.drawText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
widget.getTextWhitespaceRegion (cognitive 17) widget/entry.go:2046— widget.getTextWhitespaceRegion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
widget.splitSegmentsAt (cognitive 17) widget/richtextentry.go:474— widget.splitSegmentsAt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, 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.
buttonRenderer.applyTheme (cognitive 17) widget/button.go:338— buttonRenderer.applyTheme has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2 (nesting depth added 8). 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.
GridWrap.TypedKey (cognitive 17) widget/gridwrap.go:291— GridWrap.TypedKey has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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.
Tree.walk (cognitive 17) widget/tree.go:556— Tree.walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
treeContentRenderer.refreshForID (cognitive 17) widget/tree.go:856— treeContentRenderer.refreshForID has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), boolean chains 3 (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.
commands.updateTranslationsHash (cognitive 16) cmd/fyne/internal/commands/translate.go:209— commands.updateTranslationsHash has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts) (nesting depth added 6). Of this number, 12 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
XML.RawValueByName (cognitive 16) cmd/fyne/internal/mobile/binres/binres.go:168— XML.RawValueByName has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
container.tabsAdjustedLocation (cognitive 16) container/tabs.go:104— container.tabsAdjustedLocation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (16 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fileDialog.refreshDir (cognitive 16) dialog/file.go:433— fileDialog.refreshDir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
window.fitContent (cognitive 16) internal/driver/glfw/window_desktop.go:270— window.fitContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
repository.ParseURI (cognitive 16) storage/repository/parse.go:47— repository.ParseURI has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
accordionRenderer.Layout (cognitive 16) widget/accordion.go:138— accordionRenderer.Layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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.
listLayout.updateSeparators (cognitive 16) widget/list.go:889— listLayout.updateSeparators has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Table.ScrollTo (cognitive 16) widget/table.go:492— Table.ScrollTo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
GoNativeActivity.updateSystemBarsAppearance (cognitive 16) internal/driver/mobile/app/GoNativeActivity.java:503— GoNativeActivity.updateSystemBarsAppearance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (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.
WebGLDebugUtils.makeLostContextSimulatingCanvas::freeResources (cognitive 16) cmd/fyne/internal/templates/data/webgl-debug.js:822— WebGLDebugUtils.makeLostContextSimulatingCanvas::freeResources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 1 (nesting depth added 3). 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.
D4 · Code Duplication· Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (8 members, 50+ identical tokens) internal/painter/gl/draw.go:209— internal/painter/gl/draw.go:209-270 | internal/painter/gl/draw.go:296-358 | internal/painter/gl/draw.go:360-440 | internal/painter/gl/draw.go:511-545 | internal/painter/gl/draw.go:596-687 | internal/painter/gl/draw.go:689-745 | internal/painter/gl/draw.go:747-807 | internal/painter/gl/draw.go:809-883 — 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) internal/painter/software/draw.go:48— internal/painter/software/draw.go:48-68 | internal/painter/software/draw.go:186-206 | internal/painter/software/draw.go:208-228 | internal/painter/software/draw.go:333-353 | internal/painter/software/draw.go:355-375 | internal/painter/software/draw.go:452-491 — 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· Edited copy of a member (65 corresponding lines) · ×1
Edited copy of a member (65 corresponding lines) widget/table.go:919— widget/table.go:919-983 | widget/table.go:1016-1080 — These two members are one piece of code written twice and then edited apart: 65 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 (33 corresponding lines) · ×1
Edited copy of a member (33 corresponding lines) internal/driver/embedded/driver.go:155— internal/driver/embedded/driver.go:155-187 | internal/driver/mobile/driver.go:489-524 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (39 corresponding lines) · ×1
Edited copy of a member (39 corresponding lines) internal/driver/glfw/canvas.go:245— internal/driver/glfw/canvas.go:245-283 | internal/driver/mobile/driver.go:386-429 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (51 corresponding lines) · ×1
Edited copy of a member (51 corresponding lines) widget/gridwrap.go:291— widget/gridwrap.go:291-345 | widget/table.go:365-415 — These two members are one piece of code written twice and then edited apart: 51 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 copies of one member (3 members, 26+ corresponding lines) · ×1
Edited copies of one member (3 members, 26+ corresponding lines) internal/painter/draw.go:190— internal/painter/draw.go:190-215 | internal/painter/draw.go:261-290 | internal/painter/draw.go:715-741 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (50 corresponding lines) · ×1
Edited copy of a member (50 corresponding lines) layout/boxlayout.go:59— layout/boxlayout.go:59-108 | layout/boxlayout.go:144-194 — These two members are one piece of code written twice and then edited apart: 50 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 (38 corresponding lines) · ×1
Edited copy of a member (38 corresponding lines) container/apptabs.go:349— container/apptabs.go:349-397 | container/doctabs.go:317-354 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (21 corresponding lines) · ×1
Edited copy of a member (21 corresponding lines) widget/check.go:298— widget/check.go:298-319 | widget/radio_item.go:130-150 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (46 corresponding lines) · ×1
Edited copy of a member (46 corresponding lines) storage/repository/generic.go:104— storage/repository/generic.go:104-149 | storage/repository/generic.go:240-299 — These two members are one piece of code written twice and then edited apart: 46 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 (26 corresponding lines) · ×1
Edited copy of a member (26 corresponding lines) widget/card.go:35— widget/card.go:35-60 | widget/menu.go:102-127 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (27 corresponding lines) · ×1
Edited copy of a member (27 corresponding lines) widget/check_group.go:177— widget/check_group.go:177-203 | widget/radio_group.go:158-184 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (24 corresponding lines) · ×1
Edited copy of a member (24 corresponding lines) widget/gridwrap.go:221— widget/gridwrap.go:221-244 | widget/list.go:307-330 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (30 corresponding lines) · ×1
Edited copy of a member (30 corresponding lines) widget/table.go:888— widget/table.go:888-917 | widget/table.go:985-1014 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (55 corresponding lines) · ×1
Edited copy of a member (55 corresponding lines) widget/gridwrap.go:19— widget/gridwrap.go:19-73 | widget/list.go:20-87 — These two members are one piece of code written twice and then edited apart: 55 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 (14 corresponding lines) · ×1
Edited copy of a member (14 corresponding lines) container/split.go:270— container/split.go:270-283 | container/tabs.go:788-804 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 copies of one member (3 members, 19+ corresponding lines) · ×1
Edited copies of one member (3 members, 19+ corresponding lines) widget/check.go:254— widget/check.go:254-272 | widget/select.go:343-361 | widget/slider.go:391-409 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×1
Edited copy of a member (9 corresponding lines) dialog/progress.go:31— dialog/progress.go:31-39 | dialog/progressinfinite.go:26-34 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 copies of one member (3 members, 4+ corresponding lines) · ×1
Edited copies of one member (3 members, 4+ corresponding lines) widget/date_entry.go:141— widget/date_entry.go:141-144 | widget/select.go:270-273 | widget/select_entry.go:92-95 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 15+ corresponding lines) · ×1
Edited copies of one member (3 members, 15+ corresponding lines) widget/check.go:238— widget/check.go:238-252 | widget/label.go:207-221 | widget/select.go:317-331 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (48 lines × 2) internal/driver/glfw/window.go:864— internal/driver/glfw/window.go:864-911 | internal/driver/mobile/driver.go:701-748 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/glfw/window.go:864` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (33 lines × 2) internal/painter/gl/shaders_core.go:11— internal/painter/gl/shaders_core.go:11-43 | internal/painter/gl/shaders_es.go:11-43 — 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 (30 lines × 2) internal/driver/embedded/touchscreen.go:210— internal/driver/embedded/touchscreen.go:210-239 | internal/driver/mobile/canvas.go:546-575 — before extracting anything, compare `internal/driver/embedded/touchscreen.go` and `internal/driver/mobile/canvas.go` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 90 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (29 lines × 2) internal/driver/embedded/driver.go:157— internal/driver/embedded/driver.go:157-185 | internal/driver/mobile/driver.go:495-523 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/embedded/driver.go:157` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (23 lines × 2) widget/table.go:940— widget/table.go:940-962 | widget/table.go:1037-1059 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `widget/table.go:940` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `float32` to `offX` in one and `offY` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (22 lines × 2) internal/painter/gl/draw.go:724— internal/painter/gl/draw.go:724-745 | internal/painter/gl/draw.go:786-807 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/gl/draw.go:724` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 2) widget/richtext.go:1644— widget/richtext.go:1644-1664 | widget/richtext.go:1689-1709 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `widget/richtext.go:1644` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (28 lines × 2) internal/painter/gl/draw.go:243— internal/painter/gl/draw.go:243-270 | internal/painter/gl/draw.go:856-883 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/gl/draw.go:243` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 8) internal/painter/gl/draw.go:215— internal/painter/gl/draw.go:215-228 | internal/painter/gl/draw.go:304-317 | internal/painter/gl/draw.go:368-381 | internal/painter/gl/draw.go:520-533 | internal/painter/gl/draw.go:611-624 | internal/painter/gl/draw.go:698-711 | internal/painter/gl/draw.go:755-768 | internal/painter/gl/draw.go:829-842 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `internal/painter/gl/draw.go:693` calls `Size` and `internal/painter/gl/draw.go:299` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 6) internal/painter/software/draw.go:56— internal/painter/software/draw.go:56-68 | internal/painter/software/draw.go:194-206 | internal/painter/software/draw.go:216-228 | internal/painter/software/draw.go:341-353 | internal/painter/software/draw.go:363-375 | internal/painter/software/draw.go:479-491 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/software/draw.go:56` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–12 lines × 2) internal/driver/glfw/canvas.go:273— internal/driver/glfw/canvas.go:273-283 | internal/driver/mobile/driver.go:418-429 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/glfw/canvas.go:273` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–10 lines × 2) dialog/custom.go:84— dialog/custom.go:84-93 | dialog/form.go:54-61 — 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–10 lines × 2) internal/driver/glfw/canvas.go:255— internal/driver/glfw/canvas.go:255-263 | internal/driver/mobile/driver.go:400-409 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `internal/driver/glfw/canvas.go:255` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `internal/driver/mobile/driver.go:411` calls `Painter`, `StopClipping` and `internal/driver/glfw/canvas.go:265` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 4) internal/painter/gl/draw.go:240— internal/painter/gl/draw.go:240-248 | internal/painter/gl/draw.go:730-738 | internal/painter/gl/draw.go:792-800 | internal/painter/gl/draw.go:853-861 — 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 (6 lines × 3) internal/painter/draw.go:198— internal/painter/draw.go:198-203 | internal/painter/draw.go:271-276 | internal/painter/draw.go:724-729 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `internal/painter/draw.go:198` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) widget/gridwrap.go:124— widget/gridwrap.go:124-130 | widget/list.go:165-171 | widget/table.go:228-234 — 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 (14 lines × 3) widget/gridwrap.go:371— widget/gridwrap.go:371-384 | widget/list.go:444-457 | widget/tree.go:477-490 — 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 (22 lines × 4) internal/theme/theme.go:48— internal/theme/theme.go:48-69 | internal/theme/theme.go:72-93 | theme/theme.go:247-268 | theme/theme.go:339-360 — there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart. Check import visibility before settling on that home: `internal/theme/theme.go` sits under a restricted `internal` directory, which only code inside its own subtree is permitted to import from — so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate.
Duplicated block (8 lines × 3) widget/check.go:64— widget/check.go:64-71 | widget/select.go:74-81 | widget/slider.go:74-81 — 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.
P12 · CI test-gate honesty· Coverage collected but not gated · ×1
Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
Orphaned file storage/repository/repository.go: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.
Orphaned file cmd/fyne/internal/commands/bundle.go: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.
Orphaned file dialog/dialog.go: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.
Orphaned file dialog/file_xdg_flatpak.go: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.
Orphaned file internal/driver/mobile/event/lifecycle/lifecycle.go: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.
Orphaned file layout/formlayout.go: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.
Orphaned file dialog/custom.go: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.
Orphaned file internal/driver/mobile/event/size/size.go: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.
Orphaned file internal/driver/mobile/app/doc.go: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.
Orphaned file REDACTED: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.
Orphaned file dialog/form.go: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.
Orphaned file layout/rowwrap.go: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.
Duplicated predicate internal/driver/embedded/touchscreen.go:89— `c.dragging == nil && (math.Abs(float64(deltaX)) < tapMoveThreshold && math.Abs(float64(deltaY)) < tapMoveThreshold)` appears character-identically in 2 files — internal/driver/embedded/touchscreen.go, internal/driver/mobile/canvas.go. 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 internal/driver/glfw/window.go:1031— `keyName == desktop.KeyShiftLeft || keyName == desktop.KeyShiftRight || keyName == desktop.KeyControlLeft || keyName == desktop.KeyControlRig…` appears character-identically in 2 files — internal/driver/glfw/window.go, internal/driver/mobile/driver.go. 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 widget/gridwrap.go:359— `len(l.selected) == 0 || l.selected[0] != id` appears character-identically in 2 files — widget/gridwrap.go, widget/list.go. 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 widget/gridwrap.go:222— `len(l.selected) > 0 && id == l.selected[0]` appears character-identically in 2 files — widget/gridwrap.go, widget/list.go. 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 internal/driver/embedded/driver.go:163— `math.Abs(float64(ev.Dragged.DX)) <= tapMoveEndThreshold && math.Abs(float64(ev.Dragged.DY)) <= tapMoveEndThreshold` appears character-identically in 2 files — internal/driver/embedded/driver.go, internal/driver/mobile/driver.go. 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 internal/driver/embedded/driver.go:169— `math.Abs(float64(ev.Dragged.DX)) > tapMoveEndThreshold || math.Abs(float64(ev.Dragged.DY)) > tapMoveEndThreshold` appears character-identically in 2 files — internal/driver/embedded/driver.go, internal/driver/mobile/driver.go. 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 widget/gridwrap.go:630— `previousIndicator != li.selected || li.hovered` appears character-identically in 2 files — widget/gridwrap.go, widget/list.go. 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 internal/driver/glfw/window.go:906— `shortcut == nil && modifier != 0 && !isKeyModifier(keyName) && modifier != fyne.KeyModifierShift` appears character-identically in 2 files — internal/driver/glfw/window.go, internal/driver/mobile/driver.go. 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 internal/painter/gl/draw.go:889— `text.TextStyle.Underline || text.TextStyle.Strikethrough` appears character-identically in 2 files — internal/painter/gl/draw.go, internal/painter/software/draw.go. 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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 8 significant file(s) lose their only recent owner: dialog/color.go, dialog/color_picker.go, internal/driver/mobile/gl/dll_windows.go, driver/software/windowless_canvas.go, internal/driver/glfw/menu_bar_item.go, internal/app/focus_manager.go, internal/driver/mobile/gl/types.go, internal/color/color.go. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 7 significant file(s) lose their only recent owner: app/secret_preferences.go, internal/scheduler/scheduler.go, cmd/fyne_demo/tutorials/shader.go, cmd/fyne_demo/tutorials/container.go, REDACTED, REDACTED, cmd/fyne_demo/tutorials/canvas.go. Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 6 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (23 single-owned of 234 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 234 of the 590 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: internal/painter/atlas.go, internal/painter/gl/atlas.go, data/binding/items.go, dialog/file_xdg_flatpak.go, internal/driver/mobile/app/x11.go, window.go, animation.go, storage/repository/parse.go.
No ADRs found internal/driver/mobile/app/doc.go:45— 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/`. ADRs are expected here because `internal/driver/mobile/app/doc.go` makes this repository a deployable product (line 45).
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 — 12 of 238 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; 238 of the 590 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: cmd/fyne/internal/commands/bundle.go, dialog/dialog.go, storage/repository/repository.go, dialog/file_xdg_flatpak.go, internal/driver/mobile/event/lifecycle/lifecycle.go, layout/formlayout.go, dialog/custom.go, internal/driver/mobile/event/size/size.go (and 4 more). 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.
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.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
X2 · Cancellation propagation· Not all functions that make a request accept a context.Context · ×1
Not all functions that make a request accept a context.Context — Only 0/5 functions that make a cancellable request (net/http, net.Dial) accept a context.Context or pass one on, so a request keeps running after whatever wanted it has given up — a cancelled request, a shutdown, an expired deadline. Take `ctx context.Context` as the first parameter and build the request with it (`http.NewRequestWithContext`, `DialContext`); where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X5 · Nullable reference types· Java packages are not null-marked everywhere · ×1
Java packages are not null-marked everywhere — 0/1 of this repository's Java package directories are under a non-null default: a `package-info.java` declaring `@NullMarked` (JSpecify) or `@NonNullApi`, `@ParametersAreNonnullByDefault`, `@NonNullByDefault`, `@DefaultQualifier(NonNull.class)`; a `module-info.java` declaring `@NullMarked`; every type in it `@NullMarked`; or a build that runs NullAway with the package in `AnnotatedPackages`, or the Checker Framework's `NullnessChecker`. Elsewhere every reference admits null and no checker warns on the dereference that throws a `NullPointerException`.
Silent fallback default on error storage/repository/uri.go:53— `MimeType` turns a non-nil `err` into `return "application/octet-stream"` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the `if` or in the doc comment, and the row stops firing.
Outdated: github.com/anthonynsimon/bild — `github.com/anthonynsimon/bild` is required at v0.14.0 in REDACTED, but v0.17.1 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/anthonynsimon/bild@v0.17.1 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: github.com/fsnotify/fsnotify — `github.com/fsnotify/fsnotify` is required at v1.9.0 in REDACTED, but v1.10.1 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/fsnotify/fsnotify@v1.10.1 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: github.com/godbus/dbus/v5 — `github.com/godbus/dbus/v5` is required at v5.2.2 in REDACTED, but v5.2.4 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/godbus/dbus/v5@v5.2.4 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: github.com/mattn/go-runewidth — `github.com/mattn/go-runewidth` is required at v0.0.24 in REDACTED, but v0.0.31 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/mattn/go-runewidth@v0.0.31 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: github.com/nicksnyder/go-i18n/v2 — `github.com/nicksnyder/go-i18n/v2` is required at v2.5.1 in REDACTED, but v2.7.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/nicksnyder/go-i18n/v2@v2.7.0 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: github.com/stretchr/testify — `github.com/stretchr/testify` is required at v1.11.1 in REDACTED, but v1.12.1 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/stretchr/testify@v1.12.1 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: github.com/yuin/goldmark — `github.com/yuin/goldmark` is required at v1.8.2 in REDACTED, but v1.8.7 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/yuin/goldmark@v1.8.7 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: golang.org/x/image — `golang.org/x/image` is required at v0.24.0 in REDACTED, but v0.48.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get golang.org/x/image@v0.48.0 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: golang.org/x/mod — `golang.org/x/mod` is required at v0.23.0 in REDACTED, but v0.43.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get golang.org/x/mod@v0.43.0 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: golang.org/x/sys — `golang.org/x/sys` is required at v0.30.0 in REDACTED, but v0.50.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get golang.org/x/sys@v0.50.0 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: golang.org/x/text — `golang.org/x/text` is required at v0.22.0 in REDACTED, but v0.44.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get golang.org/x/text@v0.44.0 && go mod tidy` and commit the updated REDACTED and go.sum.
Outdated: golang.org/x/tools — `golang.org/x/tools` is required at v0.30.0 in REDACTED, but v0.52.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get golang.org/x/tools@v0.52.0 && go mod tidy` and commit the updated REDACTED and go.sum.
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. semgrep could not parse 6 file(s) — `data/binding/convert.go`, `data/binding/items.go`, `data/binding/lists.go`, `data/binding/pref_helper.go`, `data/binding/preference.go`, … (+1 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a1d4e5-ac12-70a3-b78e-8ae0d0a46302 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 32 · Warnings: 609 · Recommendations: 155 · Info: 12 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 13-11-2026 @ 12:33 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.