Public report of GraphiteEditor/Graphite, published 26 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 26 October 2026, 03:27 UTC · Survey ID cd_d7671e0f20cd4efc98b731aa4f13db63
GraphiteEditor/Graphite
Measured 26 October 2026, 03:18 UTC, at code version 280105b
Regression: 2 dimensions fell since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
Down 2 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 221,114 lines of product code in 66 projects, tests not counted · Estimated rebuild effort: about 1.4 person-years · Weakest lens: Accessibility, 30
Findings by how serious they are
151 critical1736 serious157 minor
10 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
26 October 2026, 03:18 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
84of 84 dimensions measured by tools.
1961of 2044 findings point to an exact file and line, so you can open each one in the code. The other 83 concern the repository as a whole, such as missing documentation.
84dimensions across 9 lenses, read from 221,114 lines of product code in 66 projects.
GraphiteEditor/Graphite falls short of our standard for production, in part because it has controls that only work with a mouse. It scores 40 out of 100 and is rated Weak, and 90 of its 151 critical findings are security problems.
Accessibility, at 30, is the weakest lens and counts most in the score. The best first step for the work it takes is replacing each retired release, worth about 2 points. Making the controls keyboard-usable would lift Accessibility itself, worth about 4 points. Raising Accessibility to 70 would lift the score to about 47.
Sixty pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Fourteen known security holes in the packages the code depends on can be used by attackers, and twenty-two buttons or links have no name a screen reader can say. Pinning each tool to an exact version, updating the vulnerable packages and naming the buttons and links would close these risks. Passing outside input through environment variables would fix the eight pipeline steps that put outside input straight into a shell command, and limiting each secret to its own step would deal with the six secrets exposed to more of the pipeline than needed. The 18 sets of files in separate parts that keep changing together need that dependency made explicit.
The product code is 221,114 lines, about €200,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Accessibility rose from 30 to 70, the lowest score rated Strong, the score would rise from 40 to about 47.
Code composition: what the lines of code are
Product code 96%Tests 4%
New since the last survey: 343 findings
These 343 critical or serious findings weren't in the previous survey, on 12 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 360 findings
These 360 critical or serious findings were in the previous survey, on 12 October 2026, and are gone from this one. The first 100 are listed here.
€65,000 to €330,000, for 1,090 to 3,459 hours of work, about 1.4 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 40. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 221,114 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 Yanked release finding(s) in Dependency Hygiene.
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 3 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 €200,000 to build again, about 1.4 person-years of work. Its weakest lens is Accessibility, at 30 (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
Resolve the 1 Yanked release finding(s) in Dependency Hygiene. Of all the actions in this report, it raises the score most for the work it takes: about 2 points for low effort, because it clears the 1 Dependency Hygiene findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.5 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 4% to 9% on every change. The history of the code shows how much it changes: about 189,026 lines over the last 90 days, which is about 766,605 lines a year. At that pace, the extra work comes to an estimated 74.2 to 445.3 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
632 modules, with 2087 dependencies between them. 3 loops run through 210 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 592 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.
document_graph_storage.model uses document_graph_storage.ids, so a change to document_graph_storage.ids can break document_graph_storage.model, while a change to document_graph_storage.model can't break document_graph_storage.ids.
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.
4→17 graphite_editor.messages.portfolio.document.utility_types.document_metadata uses graphite_editor.messages.portfolio.document.utility_types.network_interfacepart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.
graphite_editor.messages.portfolio.document.utility_types.document_metadata uses graphite_editor.messages.portfolio.document.utility_types.network_interface, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can break graphite_editor.messages.portfolio.document.utility_types.document_metadata, while a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.
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.
4→34 graphite_editor.messages.portfolio.document.utility_types.document_metadata uses document_graph_storage.idspart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata uses a type in document_graph_storage.ids.
graphite_editor.messages.portfolio.document.utility_types.document_metadata uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.portfolio.document.utility_types.document_metadata, while a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can't break document_graph_storage.ids.
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.
4→36 graphite_editor.messages.portfolio.document.utility_types.document_metadata uses core_types.listpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata uses a type in core_types.list.
graphite_editor.messages.portfolio.document.utility_types.document_metadata uses core_types.list, so a change to core_types.list can break graphite_editor.messages.portfolio.document.utility_types.document_metadata, while a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can't break core_types.list.
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.
graphite_editor.messages.viewport.viewport_message_handler uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.viewport.viewport_message_handler, while a change to graphite_editor.messages.viewport.viewport_message_handler can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.viewport.viewport_message_handler uses a module listed above it, which is the healthy direction.
6→16 no_std_types.color.color_types uses graphic_types.graphicpart of a loop✕
Connections
2 pairs of types, where a type in no_std_types.color.color_types uses a type in graphic_types.graphic.
no_std_types.color.color_types uses graphic_types.graphic, so a change to graphic_types.graphic can break no_std_types.color.color_types, while a change to no_std_types.color.color_types can't break graphic_types.graphic.
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.
6→20 no_std_types.color.color_types uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handlerpart of a loop✕
Connections
2 pairs of types, where a type in no_std_types.color.color_types uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
no_std_types.color.color_types uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break no_std_types.color.color_types, while a change to no_std_types.color.color_types can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
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.
6→32 no_std_types.color.color_types uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
2 pairs of types, where a type in no_std_types.color.color_types uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
no_std_types.color.color_types uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break no_std_types.color.color_types, while a change to no_std_types.color.color_types can't break graphite_editor.messages.layout.utility_types.layout_widget.
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.
6→36 no_std_types.color.color_types uses core_types.listpart of a loop✕
Connections
1 pair of types, where a type in no_std_types.color.color_types uses a type in core_types.list.
no_std_types.color.color_types uses core_types.list, so a change to core_types.list can break no_std_types.color.color_types, while a change to no_std_types.color.color_types can't break core_types.list.
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.
graph_craft.document uses core_types.types, so a change to core_types.types can break graph_craft.document, while a change to graph_craft.document can't break core_types.types.
Position
Below the diagonal: graph_craft.document uses a module listed above it, which is the healthy direction.
graph_craft.document uses document_graph_storage.model, so a change to document_graph_storage.model can break graph_craft.document, while a change to graph_craft.document can't break document_graph_storage.model.
Position
Below the diagonal: graph_craft.document uses a module listed above it, which is the healthy direction.
7→34 graph_craft.document uses document_graph_storage.idspart of a loop✕
Connections
8 pairs of types, where a type in graph_craft.document uses a type in document_graph_storage.ids.
graph_craft.document uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graph_craft.document, while a change to graph_craft.document can't break document_graph_storage.ids.
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.
7→36 graph_craft.document uses core_types.listpart of a loop✕
Connections
1 pair of types, where a type in graph_craft.document uses a type in core_types.list.
graph_craft.document uses core_types.list, so a change to core_types.list can break graph_craft.document, while a change to graph_craft.document can't break core_types.list.
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.
1 pair of types, where a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler uses a type in graphite_editor.utility_traits.
graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, while a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, while a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in graphite_editor.messages.portfolio.document.overlays.utility_types_native uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.portfolio.document.overlays.utility_types_native uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.portfolio.document.overlays.utility_types_native, while a change to graphite_editor.messages.portfolio.document.overlays.utility_types_native can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.overlays.utility_types_native uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.overlays.utility_types_native uses a type in no_std_types.color.color_types.
graphite_editor.messages.portfolio.document.overlays.utility_types_native uses no_std_types.color.color_types, so a change to no_std_types.color.color_types can break graphite_editor.messages.portfolio.document.overlays.utility_types_native, while a change to graphite_editor.messages.portfolio.document.overlays.utility_types_native can't break no_std_types.color.color_types.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.overlays.utility_types_native uses a module listed above it, which is the healthy direction.
9→36 graphite_editor.messages.portfolio.document.overlays.utility_types_native uses core_types.listpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.overlays.utility_types_native uses a type in core_types.list.
graphite_editor.messages.portfolio.document.overlays.utility_types_native uses core_types.list, so a change to core_types.list can break graphite_editor.messages.portfolio.document.overlays.utility_types_native, while a change to graphite_editor.messages.portfolio.document.overlays.utility_types_native can't break core_types.list.
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.
vector_types.vector.misc uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break vector_types.vector.misc, while a change to vector_types.vector.misc can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: vector_types.vector.misc uses a module listed above it, which is the healthy direction.
10→13 vector_types.vector.misc uses vector_types.vector.vector_typespart of a loop✕
Connections
2 pairs of types, where a type in vector_types.vector.misc uses a type in vector_types.vector.vector_types.
vector_types.vector.misc uses vector_types.vector.vector_types, so a change to vector_types.vector.vector_types can break vector_types.vector.misc, while a change to vector_types.vector.misc can't break vector_types.vector.vector_types.
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.
10→20 vector_types.vector.misc uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handlerpart of a loop✕
Connections
2 pairs of types, where a type in vector_types.vector.misc uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
vector_types.vector.misc uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break vector_types.vector.misc, while a change to vector_types.vector.misc can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
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.
10→32 vector_types.vector.misc uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
2 pairs of types, where a type in vector_types.vector.misc uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
vector_types.vector.misc uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break vector_types.vector.misc, while a change to vector_types.vector.misc can't break graphite_editor.messages.layout.utility_types.layout_widget.
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.
10→36 vector_types.vector.misc uses core_types.listpart of a loop✕
Connections
3 pairs of types, where a type in vector_types.vector.misc uses a type in core_types.list.
vector_types.vector.misc uses core_types.list, so a change to core_types.list can break vector_types.vector.misc, while a change to vector_types.vector.misc can't break core_types.list.
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.
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a type in document_graph_storage.model.
graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses document_graph_storage.model, so a change to document_graph_storage.model can break graphite_editor.messages.portfolio.document.utility_types.network_interface.types, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can't break document_graph_storage.model.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a type in graph_craft.document.
graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses graph_craft.document, so a change to graph_craft.document can break graphite_editor.messages.portfolio.document.utility_types.network_interface.types, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can't break graph_craft.document.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a module listed above it, which is the healthy direction.
11→14 graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses graphite_editor.messages.portfolio.document.utility_types.network_interface.templatepart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.template.
graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses graphite_editor.messages.portfolio.document.utility_types.network_interface.template, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can break graphite_editor.messages.portfolio.document.utility_types.network_interface.types, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.template.
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.
11→25 graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses graphite_editor.messages.portfolio.document.utility_types.miscpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a type in graphite_editor.messages.portfolio.document.utility_types.misc.
graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses graphite_editor.messages.portfolio.document.utility_types.misc, so a change to graphite_editor.messages.portfolio.document.utility_types.misc can break graphite_editor.messages.portfolio.document.utility_types.network_interface.types, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can't break graphite_editor.messages.portfolio.document.utility_types.misc.
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.
11→34 graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses document_graph_storage.idspart of a loop✕
Connections
7 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a type in document_graph_storage.ids.
graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.portfolio.document.utility_types.network_interface.types, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can't break document_graph_storage.ids.
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.
11→36 graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses core_types.listpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses a type in core_types.list.
graphite_editor.messages.portfolio.document.utility_types.network_interface.types uses core_types.list, so a change to core_types.list can break graphite_editor.messages.portfolio.document.utility_types.network_interface.types, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can't break core_types.list.
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.
2 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.snap_session uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.tool.common_functionality.snap_session, while a change to graphite_editor.messages.tool.common_functionality.snap_session can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.snap_session uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.snap_session uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.tool.common_functionality.snap_session, while a change to graphite_editor.messages.tool.common_functionality.snap_session can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.snap_session uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.snap_session uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.messages.tool.common_functionality.snap_session, while a change to graphite_editor.messages.tool.common_functionality.snap_session can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.snap_session uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.snap_session uses a type in graphite_editor.messages.portfolio.document.overlays.utility_types_native.
graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.portfolio.document.overlays.utility_types_native, so a change to graphite_editor.messages.portfolio.document.overlays.utility_types_native can break graphite_editor.messages.tool.common_functionality.snap_session, while a change to graphite_editor.messages.tool.common_functionality.snap_session can't break graphite_editor.messages.portfolio.document.overlays.utility_types_native.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.snap_session uses a module listed above it, which is the healthy direction.
12→23 graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.tool.utility_typespart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.snap_session uses a type in graphite_editor.messages.tool.utility_types.
graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.tool.utility_types, so a change to graphite_editor.messages.tool.utility_types can break graphite_editor.messages.tool.common_functionality.snap_session, while a change to graphite_editor.messages.tool.common_functionality.snap_session can't break graphite_editor.messages.tool.utility_types.
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.
12→24 graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.portfolio.document.document_message_handlerpart of a loop✕
Connections
3 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.snap_session uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.tool.common_functionality.snap_session, while a change to graphite_editor.messages.tool.common_functionality.snap_session can't break graphite_editor.messages.portfolio.document.document_message_handler.
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.
12→25 graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.portfolio.document.utility_types.miscpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.snap_session uses a type in graphite_editor.messages.portfolio.document.utility_types.misc.
graphite_editor.messages.tool.common_functionality.snap_session uses graphite_editor.messages.portfolio.document.utility_types.misc, so a change to graphite_editor.messages.portfolio.document.utility_types.misc can break graphite_editor.messages.tool.common_functionality.snap_session, while a change to graphite_editor.messages.tool.common_functionality.snap_session can't break graphite_editor.messages.portfolio.document.utility_types.misc.
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.
vector_types.vector.vector_types uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break vector_types.vector.vector_types, while a change to vector_types.vector.vector_types can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: vector_types.vector.vector_types uses a module listed above it, which is the healthy direction.
vector_types.vector.vector_types uses vector_types.vector.misc, so a change to vector_types.vector.misc can break vector_types.vector.vector_types, while a change to vector_types.vector.vector_types can't break vector_types.vector.misc.
Position
Below the diagonal: vector_types.vector.vector_types uses a module listed above it, which is the healthy direction.
13→16 vector_types.vector.vector_types uses graphic_types.graphicpart of a loop✕
Connections
2 pairs of types, where a type in vector_types.vector.vector_types uses a type in graphic_types.graphic.
vector_types.vector.vector_types uses graphic_types.graphic, so a change to graphic_types.graphic can break vector_types.vector.vector_types, while a change to vector_types.vector.vector_types can't break graphic_types.graphic.
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.
13→20 vector_types.vector.vector_types uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handlerpart of a loop✕
Connections
2 pairs of types, where a type in vector_types.vector.vector_types uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
vector_types.vector.vector_types uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break vector_types.vector.vector_types, while a change to vector_types.vector.vector_types can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
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.
13→32 vector_types.vector.vector_types uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
1 pair of types, where a type in vector_types.vector.vector_types uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
vector_types.vector.vector_types uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break vector_types.vector.vector_types, while a change to vector_types.vector.vector_types can't break graphite_editor.messages.layout.utility_types.layout_widget.
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.
13→36 vector_types.vector.vector_types uses core_types.listpart of a loop✕
Connections
5 pairs of types, where a type in vector_types.vector.vector_types uses a type in core_types.list.
vector_types.vector.vector_types uses core_types.list, so a change to core_types.list can break vector_types.vector.vector_types, while a change to vector_types.vector.vector_types can't break core_types.list.
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.
13→37 vector_types.vector.vector_types uses brush_typespart of a loop✕
Connections
2 pairs of types, where a type in vector_types.vector.vector_types uses a type in brush_types.
vector_types.vector.vector_types uses brush_types, so a change to brush_types can break vector_types.vector.vector_types, while a change to vector_types.vector.vector_types can't break brush_types.
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.
graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses core_types.types, so a change to core_types.types can break graphite_editor.messages.portfolio.document.utility_types.network_interface.template, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can't break core_types.types.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a type in document_graph_storage.model.
graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses document_graph_storage.model, so a change to document_graph_storage.model can break graphite_editor.messages.portfolio.document.utility_types.network_interface.template, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can't break document_graph_storage.model.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a type in graph_craft.document.
graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses graph_craft.document, so a change to graph_craft.document can break graphite_editor.messages.portfolio.document.utility_types.network_interface.template, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can't break graph_craft.document.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a module listed above it, which is the healthy direction.
6 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types.
graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses graphite_editor.messages.portfolio.document.utility_types.network_interface.types, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can break graphite_editor.messages.portfolio.document.utility_types.network_interface.template, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.types.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a module listed above it, which is the healthy direction.
14→34 graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses document_graph_storage.idspart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses a type in document_graph_storage.ids.
graphite_editor.messages.portfolio.document.utility_types.network_interface.template uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.portfolio.document.utility_types.network_interface.template, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can't break document_graph_storage.ids.
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.
rendering.renderer uses no_std_types.color.color_types, so a change to no_std_types.color.color_types can break rendering.renderer, while a change to rendering.renderer can't break no_std_types.color.color_types.
Position
Below the diagonal: rendering.renderer uses a module listed above it, which is the healthy direction.
rendering.renderer uses vector_types.vector.vector_types, so a change to vector_types.vector.vector_types can break rendering.renderer, while a change to rendering.renderer can't break vector_types.vector.vector_types.
Position
Below the diagonal: rendering.renderer uses a module listed above it, which is the healthy direction.
15→16 rendering.renderer uses graphic_types.graphicpart of a loop✕
Connections
1 pair of types, where a type in rendering.renderer uses a type in graphic_types.graphic.
rendering.renderer uses graphic_types.graphic, so a change to graphic_types.graphic can break rendering.renderer, while a change to rendering.renderer can't break graphic_types.graphic.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→19 rendering.renderer uses vector_types.gradientpart of a loop✕
Connections
4 pairs of types, where a type in rendering.renderer uses a type in vector_types.gradient.
rendering.renderer uses vector_types.gradient, so a change to vector_types.gradient can break rendering.renderer, while a change to rendering.renderer can't break vector_types.gradient.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→28 rendering.renderer uses graphite_editor.messages.tool.common_functionality.shapes.arc_shapepart of a loop✕
Connections
1 pair of types, where a type in rendering.renderer uses a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
rendering.renderer uses graphite_editor.messages.tool.common_functionality.shapes.arc_shape, so a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can break rendering.renderer, while a change to rendering.renderer can't break graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→34 rendering.renderer uses document_graph_storage.idspart of a loop✕
Connections
3 pairs of types, where a type in rendering.renderer uses a type in document_graph_storage.ids.
rendering.renderer uses document_graph_storage.ids, so a change to document_graph_storage.ids can break rendering.renderer, while a change to rendering.renderer can't break document_graph_storage.ids.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
15→36 rendering.renderer uses core_types.listpart of a loop✕
Connections
3 pairs of types, where a type in rendering.renderer uses a type in core_types.list.
rendering.renderer uses core_types.list, so a change to core_types.list can break rendering.renderer, while a change to rendering.renderer can't break core_types.list.
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.
graphic_types.graphic uses no_std_types.color.color_types, so a change to no_std_types.color.color_types can break graphic_types.graphic, while a change to graphic_types.graphic can't break no_std_types.color.color_types.
Position
Below the diagonal: graphic_types.graphic uses a module listed above it, which is the healthy direction.
graphic_types.graphic uses vector_types.vector.vector_types, so a change to vector_types.vector.vector_types can break graphic_types.graphic, while a change to graphic_types.graphic can't break vector_types.vector.vector_types.
Position
Below the diagonal: graphic_types.graphic uses a module listed above it, which is the healthy direction.
graphic_types.graphic uses rendering.renderer, so a change to rendering.renderer can break graphic_types.graphic, while a change to graphic_types.graphic can't break rendering.renderer.
Position
Below the diagonal: graphic_types.graphic uses a module listed above it, which is the healthy direction.
16→19 graphic_types.graphic uses vector_types.gradientpart of a loop✕
Connections
1 pair of types, where a type in graphic_types.graphic uses a type in vector_types.gradient.
graphic_types.graphic uses vector_types.gradient, so a change to vector_types.gradient can break graphic_types.graphic, while a change to graphic_types.graphic can't break vector_types.gradient.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
16→20 graphic_types.graphic uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handlerpart of a loop✕
Connections
2 pairs of types, where a type in graphic_types.graphic uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
graphic_types.graphic uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break graphic_types.graphic, while a change to graphic_types.graphic can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
16→32 graphic_types.graphic uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
1 pair of types, where a type in graphic_types.graphic uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
graphic_types.graphic uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break graphic_types.graphic, while a change to graphic_types.graphic can't break graphite_editor.messages.layout.utility_types.layout_widget.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
16→34 graphic_types.graphic uses document_graph_storage.idspart of a loop✕
Connections
1 pair of types, where a type in graphic_types.graphic uses a type in document_graph_storage.ids.
graphic_types.graphic uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphic_types.graphic, while a change to graphic_types.graphic can't break document_graph_storage.ids.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
16→36 graphic_types.graphic uses core_types.listpart of a loop✕
Connections
7 pairs of types, where a type in graphic_types.graphic uses a type in core_types.list.
graphic_types.graphic uses core_types.list, so a change to core_types.list can break graphic_types.graphic, while a change to graphic_types.graphic can't break core_types.list.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
16→37 graphic_types.graphic uses brush_typespart of a loop✕
Connections
1 pair of types, where a type in graphic_types.graphic uses a type in brush_types.
graphic_types.graphic uses brush_types, so a change to brush_types can break graphic_types.graphic, while a change to graphic_types.graphic can't break brush_types.
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.
graphite_editor.messages.portfolio.document.utility_types.network_interface uses core_types.types, so a change to core_types.types can break graphite_editor.messages.portfolio.document.utility_types.network_interface, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can't break core_types.types.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface uses a type in document_graph_storage.model.
graphite_editor.messages.portfolio.document.utility_types.network_interface uses document_graph_storage.model, so a change to document_graph_storage.model can break graphite_editor.messages.portfolio.document.utility_types.network_interface, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can't break document_graph_storage.model.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.portfolio.document.utility_types.network_interface uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.portfolio.document.utility_types.network_interface, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface uses a module listed above it, which is the healthy direction.
graphite_editor.messages.portfolio.document.utility_types.network_interface uses graph_craft.document, so a change to graph_craft.document can break graphite_editor.messages.portfolio.document.utility_types.network_interface, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can't break graph_craft.document.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface uses a module listed above it, which is the healthy direction.
23 pairs of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.types.
graphite_editor.messages.portfolio.document.utility_types.network_interface uses graphite_editor.messages.portfolio.document.utility_types.network_interface.types, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.types can break graphite_editor.messages.portfolio.document.utility_types.network_interface, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.types.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.template.
graphite_editor.messages.portfolio.document.utility_types.network_interface uses graphite_editor.messages.portfolio.document.utility_types.network_interface.template, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can break graphite_editor.messages.portfolio.document.utility_types.network_interface, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.template.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.network_interface uses a module listed above it, which is the healthy direction.
17→34 graphite_editor.messages.portfolio.document.utility_types.network_interface uses document_graph_storage.idspart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.network_interface uses a type in document_graph_storage.ids.
graphite_editor.messages.portfolio.document.utility_types.network_interface uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.portfolio.document.utility_types.network_interface, while a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can't break document_graph_storage.ids.
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.
graphite_editor.messages.tool.common_functionality.edit_target uses core_types.types, so a change to core_types.types can break graphite_editor.messages.tool.common_functionality.edit_target, while a change to graphite_editor.messages.tool.common_functionality.edit_target can't break core_types.types.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.edit_target uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.edit_target uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.tool.common_functionality.edit_target uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.tool.common_functionality.edit_target, while a change to graphite_editor.messages.tool.common_functionality.edit_target can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.edit_target uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.edit_target uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.
graphite_editor.messages.tool.common_functionality.edit_target uses graphite_editor.messages.portfolio.document.utility_types.network_interface, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can break graphite_editor.messages.tool.common_functionality.edit_target, while a change to graphite_editor.messages.tool.common_functionality.edit_target can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.edit_target uses a module listed above it, which is the healthy direction.
18→34 graphite_editor.messages.tool.common_functionality.edit_target uses document_graph_storage.idspart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.edit_target uses a type in document_graph_storage.ids.
graphite_editor.messages.tool.common_functionality.edit_target uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.tool.common_functionality.edit_target, while a change to graphite_editor.messages.tool.common_functionality.edit_target can't break document_graph_storage.ids.
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.
vector_types.gradient uses no_std_types.color.color_types, so a change to no_std_types.color.color_types can break vector_types.gradient, while a change to vector_types.gradient can't break no_std_types.color.color_types.
Position
Below the diagonal: vector_types.gradient uses a module listed above it, which is the healthy direction.
vector_types.gradient uses graphic_types.graphic, so a change to graphic_types.graphic can break vector_types.gradient, while a change to vector_types.gradient can't break graphic_types.graphic.
Position
Below the diagonal: vector_types.gradient uses a module listed above it, which is the healthy direction.
19→20 vector_types.gradient uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handlerpart of a loop✕
Connections
2 pairs of types, where a type in vector_types.gradient uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
vector_types.gradient uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break vector_types.gradient, while a change to vector_types.gradient can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
19→32 vector_types.gradient uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
2 pairs of types, where a type in vector_types.gradient uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
vector_types.gradient uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break vector_types.gradient, while a change to vector_types.gradient can't break graphite_editor.messages.layout.utility_types.layout_widget.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
19→36 vector_types.gradient uses core_types.listpart of a loop✕
Connections
5 pairs of types, where a type in vector_types.gradient uses a type in core_types.list.
vector_types.gradient uses core_types.list, so a change to core_types.list can break vector_types.gradient, while a change to vector_types.gradient can't break core_types.list.
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.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a type in graphite_editor.utility_traits.
graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, while a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.
graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses graphite_editor.messages.portfolio.document.utility_types.network_interface, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, while a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a type in vector_types.gradient.
graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses vector_types.gradient, so a change to vector_types.gradient can break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, while a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can't break vector_types.gradient.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a module listed above it, which is the healthy direction.
20→28 graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses graphite_editor.messages.tool.common_functionality.shapes.arc_shapepart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses graphite_editor.messages.tool.common_functionality.shapes.arc_shape, so a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, while a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can't break graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
20→32 graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
4 pairs of types, where a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, while a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can't break graphite_editor.messages.layout.utility_types.layout_widget.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
20→34 graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses document_graph_storage.idspart of a loop✕
Connections
3 pairs of types, where a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a type in document_graph_storage.ids.
graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, while a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can't break document_graph_storage.ids.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
20→36 graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses core_types.listpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses a type in core_types.list.
graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler uses core_types.list, so a change to core_types.list can break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, while a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can't break core_types.list.
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.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.path_tool uses a module listed above it, which is the healthy direction.
4 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.path_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.path_tool uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.tool_messages.path_tool uses vector_types.vector.misc, so a change to vector_types.vector.misc can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break vector_types.vector.misc.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.path_tool uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.tool.common_functionality.snap_session.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.tool.common_functionality.snap_session, so a change to graphite_editor.messages.tool.common_functionality.snap_session can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.tool.common_functionality.snap_session.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.path_tool uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.portfolio.document.utility_types.network_interface, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.path_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.tool.common_functionality.edit_target.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.tool.common_functionality.edit_target, so a change to graphite_editor.messages.tool.common_functionality.edit_target can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.tool.common_functionality.edit_target.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.path_tool uses a module listed above it, which is the healthy direction.
21→22 graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.tool.common_functionality.shape_editorpart of a loop✕
Connections
9 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.tool.common_functionality.shape_editor.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.tool.common_functionality.shape_editor, so a change to graphite_editor.messages.tool.common_functionality.shape_editor can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.tool.common_functionality.shape_editor.
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.
21→23 graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.tool.utility_typespart of a loop✕
Connections
9 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.tool.utility_types.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.tool.utility_types, so a change to graphite_editor.messages.tool.utility_types can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.tool.utility_types.
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.
21→24 graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.portfolio.document.document_message_handlerpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.portfolio.document.document_message_handler.
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.
21→30 graphite_editor.messages.tool.tool_messages.path_tool uses document_format.layoutpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in document_format.layout.
graphite_editor.messages.tool.tool_messages.path_tool uses document_format.layout, so a change to document_format.layout can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break document_format.layout.
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.
21→32 graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.path_tool uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
graphite_editor.messages.tool.tool_messages.path_tool uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break graphite_editor.messages.tool.tool_messages.path_tool, while a change to graphite_editor.messages.tool.tool_messages.path_tool can't break graphite_editor.messages.layout.utility_types.layout_widget.
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.
5 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.shape_editor uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.tool.common_functionality.shape_editor uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.tool.common_functionality.shape_editor, while a change to graphite_editor.messages.tool.common_functionality.shape_editor can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shape_editor uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.common_functionality.shape_editor uses vector_types.vector.misc, so a change to vector_types.vector.misc can break graphite_editor.messages.tool.common_functionality.shape_editor, while a change to graphite_editor.messages.tool.common_functionality.shape_editor can't break vector_types.vector.misc.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shape_editor uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.shape_editor uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.
graphite_editor.messages.tool.common_functionality.shape_editor uses graphite_editor.messages.portfolio.document.utility_types.network_interface, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can break graphite_editor.messages.tool.common_functionality.shape_editor, while a change to graphite_editor.messages.tool.common_functionality.shape_editor can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shape_editor uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.shape_editor uses a type in graphite_editor.messages.tool.tool_messages.path_tool.
graphite_editor.messages.tool.common_functionality.shape_editor uses graphite_editor.messages.tool.tool_messages.path_tool, so a change to graphite_editor.messages.tool.tool_messages.path_tool can break graphite_editor.messages.tool.common_functionality.shape_editor, while a change to graphite_editor.messages.tool.common_functionality.shape_editor can't break graphite_editor.messages.tool.tool_messages.path_tool.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shape_editor uses a module listed above it, which is the healthy direction.
22→24 graphite_editor.messages.tool.common_functionality.shape_editor uses graphite_editor.messages.portfolio.document.document_message_handlerpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.shape_editor uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.tool.common_functionality.shape_editor uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.tool.common_functionality.shape_editor, while a change to graphite_editor.messages.tool.common_functionality.shape_editor can't break graphite_editor.messages.portfolio.document.document_message_handler.
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.
graphite_editor.messages.tool.utility_types uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.tool.utility_types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.utility_types uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.utility_types uses no_std_types.color.color_types, so a change to no_std_types.color.color_types can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break no_std_types.color.color_types.
Position
Below the diagonal: graphite_editor.messages.tool.utility_types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.utility_types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.tool.common_functionality.snap_session.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.tool.common_functionality.snap_session, so a change to graphite_editor.messages.tool.common_functionality.snap_session can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.tool.common_functionality.snap_session.
Position
Below the diagonal: graphite_editor.messages.tool.utility_types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.tool.common_functionality.edit_target.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.tool.common_functionality.edit_target, so a change to graphite_editor.messages.tool.common_functionality.edit_target can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.tool.common_functionality.edit_target.
Position
Below the diagonal: graphite_editor.messages.tool.utility_types uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.tool.common_functionality.shape_editor.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.tool.common_functionality.shape_editor, so a change to graphite_editor.messages.tool.common_functionality.shape_editor can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.tool.common_functionality.shape_editor.
Position
Below the diagonal: graphite_editor.messages.tool.utility_types uses a module listed above it, which is the healthy direction.
23→24 graphite_editor.messages.tool.utility_types uses graphite_editor.messages.portfolio.document.document_message_handlerpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.portfolio.document.document_message_handler.
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.
23→25 graphite_editor.messages.tool.utility_types uses graphite_editor.messages.portfolio.document.utility_types.miscpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.portfolio.document.utility_types.misc.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.portfolio.document.utility_types.misc, so a change to graphite_editor.messages.portfolio.document.utility_types.misc can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.portfolio.document.utility_types.misc.
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.
23→30 graphite_editor.messages.tool.utility_types uses document_format.layoutpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.tool.utility_types uses a type in document_format.layout.
graphite_editor.messages.tool.utility_types uses document_format.layout, so a change to document_format.layout can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break document_format.layout.
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.
23→32 graphite_editor.messages.tool.utility_types uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.utility_types uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
graphite_editor.messages.tool.utility_types uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break graphite_editor.messages.tool.utility_types, while a change to graphite_editor.messages.tool.utility_types can't break graphite_editor.messages.layout.utility_types.layout_widget.
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.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
4 pairs of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
graphite_editor.messages.portfolio.document.document_message_handler uses graph_craft.document, so a change to graph_craft.document can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graph_craft.document.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.portfolio.document.overlays.utility_types_native.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.portfolio.document.overlays.utility_types_native, so a change to graphite_editor.messages.portfolio.document.overlays.utility_types_native can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.portfolio.document.overlays.utility_types_native.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.portfolio.document.utility_types.network_interface, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.tool.common_functionality.edit_target.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.tool.common_functionality.edit_target, so a change to graphite_editor.messages.tool.common_functionality.edit_target can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.tool.common_functionality.edit_target.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.tool.utility_types.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.tool.utility_types, so a change to graphite_editor.messages.tool.utility_types can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.tool.utility_types.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.document_message_handler uses a module listed above it, which is the healthy direction.
24→25 graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.portfolio.document.utility_types.miscpart of a loop✕
Connections
6 pairs of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.portfolio.document.utility_types.misc.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.portfolio.document.utility_types.misc, so a change to graphite_editor.messages.portfolio.document.utility_types.misc can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.portfolio.document.utility_types.misc.
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.
24→32 graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
graphite_editor.messages.portfolio.document.document_message_handler uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break graphite_editor.messages.layout.utility_types.layout_widget.
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.
24→34 graphite_editor.messages.portfolio.document.document_message_handler uses document_graph_storage.idspart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in document_graph_storage.ids.
graphite_editor.messages.portfolio.document.document_message_handler uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break document_graph_storage.ids.
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.
24→36 graphite_editor.messages.portfolio.document.document_message_handler uses core_types.listpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.portfolio.document.document_message_handler uses a type in core_types.list.
graphite_editor.messages.portfolio.document.document_message_handler uses core_types.list, so a change to core_types.list can break graphite_editor.messages.portfolio.document.document_message_handler, while a change to graphite_editor.messages.portfolio.document.document_message_handler can't break core_types.list.
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.
1 pair of types, where a type in graphite_editor.messages.portfolio.document.utility_types.misc uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.portfolio.document.utility_types.misc uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.portfolio.document.utility_types.misc, while a change to graphite_editor.messages.portfolio.document.utility_types.misc can't break graphite_editor.messages.portfolio.document.document_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.document.utility_types.misc uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.frontend.utility_types uses a type in graphite_editor.messages.portfolio.document.utility_types.misc.
graphite_editor.messages.frontend.utility_types uses graphite_editor.messages.portfolio.document.utility_types.misc, so a change to graphite_editor.messages.portfolio.document.utility_types.misc can break graphite_editor.messages.frontend.utility_types, while a change to graphite_editor.messages.frontend.utility_types can't break graphite_editor.messages.portfolio.document.utility_types.misc.
Position
Below the diagonal: graphite_editor.messages.frontend.utility_types uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.tool_messages.shape_tool uses vector_types.vector.misc, so a change to vector_types.vector.misc can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break vector_types.vector.misc.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.tool.common_functionality.snap_session.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.tool.common_functionality.snap_session, so a change to graphite_editor.messages.tool.common_functionality.snap_session can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.tool.common_functionality.snap_session.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.tool.common_functionality.edit_target.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.tool.common_functionality.edit_target, so a change to graphite_editor.messages.tool.common_functionality.edit_target can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.tool.common_functionality.edit_target.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.tool.utility_types, so a change to graphite_editor.messages.tool.utility_types can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.tool.utility_types.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.portfolio.document.document_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.portfolio.document.utility_types.misc.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.portfolio.document.utility_types.misc, so a change to graphite_editor.messages.portfolio.document.utility_types.misc can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.portfolio.document.utility_types.misc.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.frontend.utility_types.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.frontend.utility_types, so a change to graphite_editor.messages.frontend.utility_types can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.frontend.utility_types.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.shape_tool uses a module listed above it, which is the healthy direction.
27→30 graphite_editor.messages.tool.tool_messages.shape_tool uses document_format.layoutpart of a loop✕
Connections
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in document_format.layout.
graphite_editor.messages.tool.tool_messages.shape_tool uses document_format.layout, so a change to document_format.layout can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break document_format.layout.
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.
27→32 graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.layout.utility_types.layout_widgetpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.shape_tool uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
graphite_editor.messages.tool.tool_messages.shape_tool uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break graphite_editor.messages.tool.tool_messages.shape_tool, while a change to graphite_editor.messages.tool.tool_messages.shape_tool can't break graphite_editor.messages.layout.utility_types.layout_widget.
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.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses document_graph_storage.model, so a change to document_graph_storage.model can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break document_graph_storage.model.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.portfolio.document.overlays.utility_types_native.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.portfolio.document.overlays.utility_types_native, so a change to graphite_editor.messages.portfolio.document.overlays.utility_types_native can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.portfolio.document.overlays.utility_types_native.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses vector_types.vector.misc, so a change to vector_types.vector.misc can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break vector_types.vector.misc.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
4 pairs of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.tool.common_functionality.snap_session.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.tool.common_functionality.snap_session, so a change to graphite_editor.messages.tool.common_functionality.snap_session can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.tool.common_functionality.snap_session.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.template.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.portfolio.document.utility_types.network_interface.template, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface.template can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.template.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.tool.common_functionality.shape_editor.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.tool.common_functionality.shape_editor, so a change to graphite_editor.messages.tool.common_functionality.shape_editor can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.tool.common_functionality.shape_editor.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.portfolio.document.document_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.frontend.utility_types.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.frontend.utility_types, so a change to graphite_editor.messages.frontend.utility_types can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.frontend.utility_types.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a type in graphite_editor.messages.tool.tool_messages.shape_tool.
graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses graphite_editor.messages.tool.tool_messages.shape_tool, so a change to graphite_editor.messages.tool.tool_messages.shape_tool can break graphite_editor.messages.tool.common_functionality.shapes.arc_shape, while a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can't break graphite_editor.messages.tool.tool_messages.shape_tool.
Position
Below the diagonal: graphite_editor.messages.tool.common_functionality.shapes.arc_shape uses a module listed above it, which is the healthy direction.
graphene_resource uses graphite_editor.messages.tool.common_functionality.shapes.arc_shape, so a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can break graphene_resource, while a change to graphene_resource can't break graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
Position
Below the diagonal: graphene_resource uses a module listed above it, which is the healthy direction.
document_format.layout uses graphene_resource, so a change to graphene_resource can break document_format.layout, while a change to document_format.layout can't break graphene_resource.
Position
Below the diagonal: document_format.layout uses a module listed above it, which is the healthy direction.
graphene_application_io uses graphene_resource, so a change to graphene_resource can break graphene_application_io, while a change to graphene_application_io can't break graphene_resource.
Position
Below the diagonal: graphene_application_io uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.layout.utility_types.layout_widget uses a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
graphite_editor.messages.layout.utility_types.layout_widget uses graphite_editor.messages.tool.common_functionality.shapes.arc_shape, so a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can break graphite_editor.messages.layout.utility_types.layout_widget, while a change to graphite_editor.messages.layout.utility_types.layout_widget can't break graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
Position
Below the diagonal: graphite_editor.messages.layout.utility_types.layout_widget uses a module listed above it, which is the healthy direction.
graphite_editor.messages.layout.utility_types.layout_widget uses document_format.layout, so a change to document_format.layout can break graphite_editor.messages.layout.utility_types.layout_widget, while a change to graphite_editor.messages.layout.utility_types.layout_widget can't break document_format.layout.
Position
Below the diagonal: graphite_editor.messages.layout.utility_types.layout_widget uses a module listed above it, which is the healthy direction.
32→36 graphite_editor.messages.layout.utility_types.layout_widget uses core_types.listpart of a loop✕
Connections
2 pairs of types, where a type in graphite_editor.messages.layout.utility_types.layout_widget uses a type in core_types.list.
graphite_editor.messages.layout.utility_types.layout_widget uses core_types.list, so a change to core_types.list can break graphite_editor.messages.layout.utility_types.layout_widget, while a change to graphite_editor.messages.layout.utility_types.layout_widget can't break core_types.list.
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.
wgpu_executor uses graphene_application_io, so a change to graphene_application_io can break wgpu_executor, while a change to wgpu_executor can't break graphene_application_io.
Position
Below the diagonal: wgpu_executor uses a module listed above it, which is the healthy direction.
33→36 wgpu_executor uses core_types.listpart of a loop✕
Connections
1 pair of types, where a type in wgpu_executor uses a type in core_types.list.
The types involved
wgpu_executor.WgpuExecutor → core_types.list.List
Direction
wgpu_executor uses core_types.list, so a change to core_types.list can break wgpu_executor, while a change to wgpu_executor can't break core_types.list.
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.
2 pairs of types, where a type in document_graph_storage.ids uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
document_graph_storage.ids uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break document_graph_storage.ids, while a change to document_graph_storage.ids can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
Position
Below the diagonal: document_graph_storage.ids uses a module listed above it, which is the healthy direction.
document_graph_storage.ids uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break document_graph_storage.ids, while a change to document_graph_storage.ids can't break graphite_editor.messages.layout.utility_types.layout_widget.
Position
Below the diagonal: document_graph_storage.ids uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.portfolio.document.utility_types.document_metadata.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.portfolio.document.utility_types.document_metadata, so a change to graphite_editor.messages.portfolio.document.utility_types.document_metadata can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.portfolio.document.utility_types.document_metadata.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.portfolio.document.overlays.utility_types_native.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.portfolio.document.overlays.utility_types_native, so a change to graphite_editor.messages.portfolio.document.overlays.utility_types_native can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.portfolio.document.overlays.utility_types_native.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.tool.common_functionality.snap_session.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.tool.common_functionality.snap_session, so a change to graphite_editor.messages.tool.common_functionality.snap_session can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.tool.common_functionality.snap_session.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.portfolio.document.utility_types.network_interface.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.portfolio.document.utility_types.network_interface, so a change to graphite_editor.messages.portfolio.document.utility_types.network_interface can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.portfolio.document.utility_types.network_interface.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.tool.common_functionality.edit_target.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.tool.common_functionality.edit_target, so a change to graphite_editor.messages.tool.common_functionality.edit_target can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.tool.common_functionality.edit_target.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.tool.utility_types, so a change to graphite_editor.messages.tool.utility_types can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.tool.utility_types.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.portfolio.document.document_message_handler.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.frontend.utility_types.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.frontend.utility_types, so a change to graphite_editor.messages.frontend.utility_types can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.frontend.utility_types.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
graphite_editor.messages.tool.tool_messages.select_tool uses document_format.layout, so a change to document_format.layout can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break document_format.layout.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.tool.tool_messages.select_tool uses a type in graphite_editor.messages.layout.utility_types.layout_widget.
graphite_editor.messages.tool.tool_messages.select_tool uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break graphite_editor.messages.tool.tool_messages.select_tool, while a change to graphite_editor.messages.tool.tool_messages.select_tool can't break graphite_editor.messages.layout.utility_types.layout_widget.
Position
Below the diagonal: graphite_editor.messages.tool.tool_messages.select_tool uses a module listed above it, which is the healthy direction.
core_types.list uses rendering.renderer, so a change to rendering.renderer can break core_types.list, while a change to core_types.list can't break rendering.renderer.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
core_types.list uses graphic_types.graphic, so a change to graphic_types.graphic can break core_types.list, while a change to core_types.list can't break graphic_types.graphic.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
core_types.list uses vector_types.gradient, so a change to vector_types.gradient can break core_types.list, while a change to core_types.list can't break vector_types.gradient.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
core_types.list uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break core_types.list, while a change to core_types.list can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
core_types.list uses graphite_editor.messages.tool.common_functionality.shapes.arc_shape, so a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can break core_types.list, while a change to core_types.list can't break graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
core_types.list uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break core_types.list, while a change to core_types.list can't break graphite_editor.messages.layout.utility_types.layout_widget.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in core_types.list uses a type in wgpu_executor.
The types involved
core_types.list.List → wgpu_executor.WgpuExecutor
Direction
core_types.list uses wgpu_executor, so a change to wgpu_executor can break core_types.list, while a change to core_types.list can't break wgpu_executor.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
core_types.list uses document_graph_storage.ids, so a change to document_graph_storage.ids can break core_types.list, while a change to core_types.list can't break document_graph_storage.ids.
Position
Below the diagonal: core_types.list uses a module listed above it, which is the healthy direction.
brush_types uses rendering.renderer, so a change to rendering.renderer can break brush_types, while a change to brush_types can't break rendering.renderer.
Position
Below the diagonal: brush_types uses a module listed above it, which is the healthy direction.
brush_types uses graphic_types.graphic, so a change to graphic_types.graphic can break brush_types, while a change to brush_types can't break graphic_types.graphic.
Position
Below the diagonal: brush_types uses a module listed above it, which is the healthy direction.
brush_types uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break brush_types, while a change to brush_types can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
Position
Below the diagonal: brush_types uses a module listed above it, which is the healthy direction.
vector_types.vector.path uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break vector_types.vector.path, while a change to vector_types.vector.path can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: vector_types.vector.path uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in vector_types.vector.path uses a type in graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
vector_types.vector.path uses graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler, so a change to graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler can break vector_types.vector.path, while a change to vector_types.vector.path can't break graphite_editor.messages.portfolio.document.data_panel.data_panel_message_handler.
Position
Below the diagonal: vector_types.vector.path uses a module listed above it, which is the healthy direction.
vector_types.vector.path uses graphite_editor.messages.layout.utility_types.layout_widget, so a change to graphite_editor.messages.layout.utility_types.layout_widget can break vector_types.vector.path, while a change to vector_types.vector.path can't break graphite_editor.messages.layout.utility_types.layout_widget.
Position
Below the diagonal: vector_types.vector.path uses a module listed above it, which is the healthy direction.
vector_types.vector.path uses core_types.list, so a change to core_types.list can break vector_types.vector.path, while a change to vector_types.vector.path can't break core_types.list.
Position
Below the diagonal: vector_types.vector.path uses a module listed above it, which is the healthy direction.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.utility_traits, so a change to graphite_editor.utility_traits can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.utility_traits.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.viewport.viewport_message_handler.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.tool.common_functionality.edit_target.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.tool.common_functionality.edit_target, so a change to graphite_editor.messages.tool.common_functionality.edit_target can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.tool.common_functionality.edit_target.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.tool.utility_types.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.tool.utility_types, so a change to graphite_editor.messages.tool.utility_types can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.tool.utility_types.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.portfolio.document.document_message_handler.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.portfolio.document.document_message_handler, so a change to graphite_editor.messages.portfolio.document.document_message_handler can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.portfolio.document.document_message_handler.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.portfolio.document.utility_types.misc.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.portfolio.document.utility_types.misc, so a change to graphite_editor.messages.portfolio.document.utility_types.misc can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.portfolio.document.utility_types.misc.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.frontend.utility_types.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.frontend.utility_types, so a change to graphite_editor.messages.frontend.utility_types can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.frontend.utility_types.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.messages.portfolio.portfolio_message_handler uses a type in graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphite_editor.messages.tool.common_functionality.shapes.arc_shape, so a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
graphite_editor.messages.portfolio.portfolio_message_handler uses graphene_application_io, so a change to graphene_application_io can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break graphene_application_io.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
graphite_editor.messages.portfolio.portfolio_message_handler uses document_graph_storage.ids, so a change to document_graph_storage.ids can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break document_graph_storage.ids.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
graphite_editor.messages.portfolio.portfolio_message_handler uses vector_types.vector.path, so a change to vector_types.vector.path can break graphite_editor.messages.portfolio.portfolio_message_handler, while a change to graphite_editor.messages.portfolio.portfolio_message_handler can't break vector_types.vector.path.
Position
Below the diagonal: graphite_editor.messages.portfolio.portfolio_message_handler uses a module listed above it, which is the healthy direction.
graphite_editor.dispatcher uses graphite_editor.messages.viewport.viewport_message_handler, so a change to graphite_editor.messages.viewport.viewport_message_handler can break graphite_editor.dispatcher, while a change to graphite_editor.dispatcher can't break graphite_editor.messages.viewport.viewport_message_handler.
Position
Below the diagonal: graphite_editor.dispatcher uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in graphite_editor.dispatcher uses a type in graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
graphite_editor.dispatcher uses graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler, so a change to graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler can break graphite_editor.dispatcher, while a change to graphite_editor.dispatcher can't break graphite_editor.messages.input_preprocessor.input_preprocessor_message_handler.
Position
Below the diagonal: graphite_editor.dispatcher uses a module listed above it, which is the healthy direction.
graphite_editor.dispatcher uses graphite_editor.messages.tool.common_functionality.shapes.arc_shape, so a change to graphite_editor.messages.tool.common_functionality.shapes.arc_shape can break graphite_editor.dispatcher, while a change to graphite_editor.dispatcher can't break graphite_editor.messages.tool.common_functionality.shapes.arc_shape.
Position
Below the diagonal: graphite_editor.dispatcher uses a module listed above it, which is the healthy direction.
graphite_editor.dispatcher uses graphite_editor.messages.portfolio.portfolio_message_handler, so a change to graphite_editor.messages.portfolio.portfolio_message_handler can break graphite_editor.dispatcher, while a change to graphite_editor.dispatcher can't break graphite_editor.messages.portfolio.portfolio_message_handler.
Position
Below the diagonal: graphite_editor.dispatcher uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 36% · Weak · gated by D2, R7, X3, X4 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
138
High / Critical
A03:2025 — Software Supply Chain Failures
50
High / Critical
Roadmap
First, ensure all interactive elements are fully keyboard-accessible and anchors have valid hrefs. Next, establish proper page structure by defining the language, title, and main landmark, while removing meta-refreshes. Then, eliminate dead code to reduce maintenance overhead and ensure every form control has a programmatic label. Finally, provide text alternatives for all images, media, and canvas elements to complete accessibility coverage.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Yanked release finding(s) in Dependency Hygiene.
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.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
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 — 151
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 — 1736
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 — 157
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 10
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 84 of 84 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 84 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, 1961 of 2044 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.rs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 175 test files), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 60 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Rust, Svelte components 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Rust, Svelte components 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.
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
R4 Test Coverage — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 62 further occurrence(s) are not listed individually; the score already reflects all 102.
R7 Dead Code — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 60 further occurrence(s) are not listed individually; the score already reflects all 100.
X4 Structured logging — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 48 further occurrence(s) are not listed individually; the score already reflects all 88.
Repo exclusion declarations: 2 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret 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 is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
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.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
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.
199 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was NodeGraphMessageHandler::process_message at 437. A further 36 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 graphite_desktop_wrapper::utils::menu::convert_labeled_keys_to_shortcut at 113 — they are counted neither in the figure above nor in this dimension's score. 17 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: desktop/wrapper/src/utils.rs (graphite_desktop_wrapper::utils::menu::convert_labeled_keys_to_shortcut at 113), frontend/wrapper/src/helpers.rs (graphite_wasm_wrapper::helpers::translate_key at 105), desktop/ui/src/internal/display_handler.rs (DisplayHandlerImpl::on_cursor_change at 54), desktop/wrapper/src/intercept_frontend_message.rs (graphite_desktop_wrapper::intercept_frontend_message::intercept_frontend_message at 33), tools/node-docs/src/utility.rs (node_docs::utility::category_description at 33), and 12 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 98 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 240 down to 240 or less in Cyclomatic Complexity — start with NodeGraphMessageHandler::process_message (cyclomatic 437), DocumentMessageHandler::process_message (cyclomatic 312), PathToolFsmState::transition (cyclomatic 269). — 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 4 together lifts Cyclomatic Complexity from 4.5 to about 5.1/10, projected with the scoring formula itself and assuming each lands exactly at 240; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 121 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 6 bodies over 240 down to 240 or less in Cognitive Complexity — start with NodeGraphMessageHandler::process_message (cognitive 757), PathToolFsmState::transition (cognitive 590), DocumentMessageHandler::process_message (cognitive 405). — 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 6 together lifts Cognitive Complexity from 2.0 to about 3.0/10, projected with the scoring formula itself and assuming each lands exactly at 240; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.6 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 61 FileTooLong finding(s) in God Classes — start with lib.rs (2), graphic.rs (2), document_message_handler.rs. — One of this dimension's main actionable groups (61 warning-level).
Resolve the 43 MethodTooLong finding(s) in God Classes — start with path_tool.rs (3), node_graph_message_handler.rs (2), gradient_tool.rs (2). — One of this dimension's main actionable groups (43 warning-level).
Resolve the 39 FunctionTooLong finding(s) in God Classes — start with node_inspector.rs (5), document_migration.rs (2), codegen.rs (2). — One of this dimension's main actionable groups (39 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
252 duplicated block group(s) detected. A further 7 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 61 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 47 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with utility_types_native.rs (6), document_migration.rs (5), select_tool.rs (3). — One of this dimension's main actionable groups (47 warning-level).
Resolve the 28 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with document_migration.rs (3), utility_types.rs (2), node_inspector.rs (2). — One of this dimension's main actionable groups (28 warning-level).
Resolve the 19 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with document_node_definitions.rs (3), clipboard_message_handler.rs, color_picker_message_handler.rs. — One of this dimension's main actionable groups (19 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.2 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
66 production modules (Cargo+npm), 0 dependency cycle(s), 5 unstable depended-on module(s). Read from the build's own module declarations; 9 module(s) off the main sequence, with abstractness counted on 48 of the 66 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: control-protocol · ×9
Unstable project graphic-nodes
Unstable project graphite-desktop-wrapper
Unstable project graphite-editor
Unstable project math-nodes
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 9 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 1 Unstable project graphic-nodes finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project graphite-desktop-wrapper finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) — start with document_metadata.rs, gradient.rs, vector_types.rs. — One of this dimension's main actionable groups (3 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the code respects its intended layering / architecture rules.
Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.
No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).
Resolve the 3 Classify ADR enforcement finding(s) in Architectural Integrity — start with async-execution-model.md, document-format.md, fine-grained-context-caching.md. — One of this dimension's main actionable groups (3 recommendation-level).
Enforce Architectural Integrity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d7_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
1842 test methods: 1758 unit, 84 integration, 0 BDD, 0 e2e. The Rust suite contributes 1842 `#[test]` function(s) across 175 file(s) declaring at least one; its unit/integration split is Cargo's own — 6 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
49 outdated, 1 yanked direct Cargo dependencies. 117 of 119 direct crates were graded against crates.io (0 not published there, 2 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Yanked release: spin
Outdated: anyhow · ×49
What to do
Resolve the 1 Yanked release 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 700 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. A further 5 crate(s) in the closure resolve from git, a path or a private registry and publish no licence this pass can read; they are outside this verdict. This repository publishes itself under MIT OR Apache-2.0, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares package.json, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 83 Hotspot finding(s) in Churn × Complexity Hotspots — start with lib.rs (3), document.rs (2), document_message_handler.rs. — One of this dimension's main actionable groups (83 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with opfs.rs. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.3 / 10Strong✓ 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.
84 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is libraries/math-parser/src/lib.rs. Counted over 486 of the 761 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×3
What to do
Resolve the 3 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (3 recommendation-level).
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.
436 deducted task-comment markers across 221114 LoC (0.2/KLoC) → score 9.6. 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.
TodoComment repeated across 19 filesnode-graph/nodes/text/src/font.rs:67
What to do
Resolve the 339 TodoComment finding(s) in Explicit Debt — start with graphic.rs (14), adjustments.rs (14), lib.rs (12). — One of this dimension's main actionable groups (339 warning-level).
Resolve the 3 HackComment finding(s) in Explicit Debt — start with color_types.rs, dynamic_executor.rs, input_mappings.rs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 TodoComment repeated across 19 files finding(s) in Explicit Debt — start with font.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
0 of 1 documentation facets pass in full; short on: F2 example. 10 document(s) read across 1 unit(s).
Documentation: no build, run or usage exampleREADME.md:1
What to do
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
0 of 3 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question). How well each record argues its case is not measured.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret 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.
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).
143 finding(s): 0 critical, 76 high, 67 medium, 0 low. 60 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 21 file(s) — `document/container/src/archive.rs` (lines 52–54), `editor/src/messages/portfolio/document/utility_types/network_interface/characterization_tests.rs` (line 2648), `editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs` (line 927, line 955, line 968), `editor/src/messages/portfolio/fonts/fonts_message_handler.rs` (line 48), `editor/src/messages/tool/tool_messages/select_tool.rs` (line 192, line 213, lines 225–241, …), … (+16 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 4 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
+ 9 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 7 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (6), REDACTED. — One of this dimension's main actionable groups (7 issue-level).
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
No action in Static Analysis (SAST) — all 60 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 (60 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 13 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (10), REDACTED (3). — One of this dimension's main actionable groups (13 issue-level).
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 8 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (8). — One of this dimension's main actionable groups (8 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.
18 of 486 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is libraries/rawkit/src/tiff/types.rs. Counted over 486 of the 761 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 18 Boundary-crossing change coupling finding(s) in Change Coupling — start with document_node_definitions.rs (5), handle_desktop_wrapper_message.rs (3), app.rs. — One of this dimension's main actionable groups (18 issue-level).
Resolve the 23 Change coupling finding(s) in Change Coupling — start with app.rs (2), frontend_message.rs (2), adjustments.rs (2). — One of this dimension's main actionable groups (23 warning-level).
Resolve the 3 Change-coupling hub finding(s) in Change Coupling — start with document_message_handler.rs, vector_nodes.rs, node_inspector.rs. — 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.
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 2 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ 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.
A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. (×2) — frontend/src/components/floating-menus/EyedropperPreview.svelte:60, frontend/src/components/panels/Document.svelte:703
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 & labels3.0 / 10Weak✓ 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.
A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). (×19) — frontend/src/components/panels/Layers.svelte:1206, frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:65, frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:69, …
This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. (×2) — frontend/src/components/panels/Layers.svelte:1237, frontend/src/components/panels/Layers.svelte:1411
This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×5) — frontend/src/components/views/Graph.svelte:598, frontend/src/components/views/Graph.svelte:666, frontend/src/components/views/Graph.svelte:883, …
This <div> carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to <button type="button"> — the right fix for its keyboard operability — does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label. (×2) — frontend/src/components/widgets/NodeSection.svelte:128, frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:75
This <img> carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to <button type="button"> — the right fix for its keyboard operability — does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label. — frontend/src/components/widgets/buttons/ImageButton.svelte:25
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.
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"). — frontend/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>. — frontend/index.html:2
user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta. — frontend/index.html:11
A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). — frontend/src/components/widgets/WidgetTable.svelte:14
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 interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".
A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler. (×4) — frontend/src/components/layout/LayoutCol.svelte:32, frontend/src/components/layout/LayoutRow.svelte:33, frontend/src/components/widgets/buttons/ImageButton.svelte:25, …
This <p> binds double-click and nothing else. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click. (×2) — frontend/src/components/views/Graph.svelte:609, frontend/src/components/views/Graph.svelte:678
This <svg> binds pointerdown and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click. — frontend/src/components/widgets/inputs/SliderInput.svelte:0
This <div> binds pointerdown and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click. (×2) — frontend/src/components/widgets/inputs/SliderInput.svelte:712, frontend/src/components/widgets/inputs/SliderInput.svelte:724
This <div> binds pointerdown, pointermove and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click. — frontend/src/components/widgets/inputs/TransferCurveInput.svelte:303
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
`body::after` moves (`animation: spinning-loading-indicator 1s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — frontend/index.html:48
`.donation-picker .picker-body .amount-entry input:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — website/sass/page/donate.scss:383
`.carousel.carousel .screenshot-details .carousel-controls button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — website/sass/component/carousel.scss:83
`:where(:focus-visible)` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — frontend/src/components/Editor.svelte:298
`.panel .tab-bar .tab-group .tab .name input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — frontend/src/components/window/Panel.svelte:579
`.field-input input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — frontend/src/components/widgets/inputs/FieldInput.svelte:241
`.math-expression-input .editor` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — frontend/src/components/widgets/inputs/MathExpressionInput.svelte:1168
`.working-colors-button .swatch > button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — frontend/src/components/widgets/inputs/WorkingColorsInput.svelte:84
`.graph .name-input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — frontend/src/components/views/Graph.svelte:1205
`.three-column-layout .chapters .wrapper-outer` moves (`transition: left 0.25s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — website/sass/template/book.scss:112
`.three-column-layout .chapters` moves (`transition: height 0.25s ease-in-out 0.25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — website/sass/template/book.scss:88
`.carousel.carousel:not(.dragging, .jostling) .carousel-slide :is(img, video)` moves (`transition: transform 500ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — website/sass/component/carousel.scss:37
`.image-comparison .slide-bar .arrows svg:nth-of-type(1)` moves (`animation: 3s infinite ease-out pulse-left, 3s infinite ease-out pulse-opacity`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — website/sass/component/image-comparison.scss:79
`.image-comparison .slide-bar .arrows svg:nth-of-type(2)` moves (`animation: 3s infinite ease-out pulse-right, 3s infinite ease-out pulse-opacity`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — website/sass/component/image-comparison.scss:84
`.panel .docking-ghost` moves (`transition: top 0.2s ease,
left 0.2s ease,
width 0.2s ease,
height 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — frontend/src/components/window/Panel.svelte:666
`.graph .redirect-dot .dot` moves (`transition: transform 0.1s,
background-color 0.1s,
outline-color 0.1s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — frontend/src/components/views/Graph.svelte:1725
`.graph .connector path` moves (`transition: fill 0.1s,
transform 0.1s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — frontend/src/components/views/Graph.svelte:1798
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
An a11y linter is configured (Documented) but there's no automated a11y test or CI gate. Add your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) to verify at runtime, then gate it in CI. What was searched, so you can tell an absence from a miss: the 60 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Accessibility linting is already configured — assert with your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) in tests, then gate axe/pa11y/Lighthouse in CI.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
`document_storage_io$module.load_legacy_document` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command. — editor/src/messages/portfolio/document_storage_io.rs:290
What to do
Keep query handlers read-only — move the writes/event-publishes into a command handler so reads stay safe to retry, cache, and route to a read replica.
Other · Event-Driven — Whether state changes and message publishes are atomic (a transactional outbox) rather than a crash-unsafe dual write.
Method: Roslyn semantic scan (event-driven gated): event-handler methods scanned for DB-save plus bus-publish without a transactional outbox reference. Deterministic, semantic-resolved.
`spawn$module.handle_message` performs two independent DURABLE writes — a durable state write (`died_reported.store`, :369) and an independent publish to an event bus (`events.send`, :372) — in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox). — desktop/ui/src/remote/spawn.rs:355
What to do
Adopt the transactional outbox pattern so DB writes and message publishes commit atomically — no lost or phantom events on a crash.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 61 of 67 project(s) that lack one — worth up to 1.8 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No 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
Grow the ADR log (currently 3) — reach 8 to raise the maturity tier; document significant decisions as they're made.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
1270/1805 types (70%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
What to do
Keep implementation types off the public surface (Rust: `pub(crate)`, or keep the module private) so internals can change without breaking consumers.
Do you agree with this assessment?
P2 · Observability6.6 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 23/27 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `desktop/bundle`, `desktop/platform/linux`, `desktop/platform/mac`, `desktop/platform/win`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Do you agree with this assessment?
R1 · Type Safety10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
frontend/src/stores/app-window.ts:20 · frontend/src/stores/document.ts:28 — the two spans are one implementation copied and then locally edited — 290 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — frontend/src/stores/app-window.ts:20
frontend/src/components/widgets/inputs/TextAreaInput.svelte:4 · frontend/src/components/widgets/inputs/TextInput.svelte:4 — the two spans are one implementation copied and then locally edited — 147 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — frontend/src/components/widgets/inputs/TextAreaInput.svelte:4
frontend/src/utility-functions/clipboard.ts:4 · frontend/src/utility-functions/clipboard.ts:55 — the two spans are one implementation copied and then locally edited — 176 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — frontend/src/utility-functions/clipboard.ts:4
frontend/src/components/layout/LayoutCol.svelte:4 · frontend/src/components/layout/LayoutRow.svelte:4 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — frontend/src/components/layout/LayoutCol.svelte:4
frontend/src/components/widgets/WidgetSpan.svelte:270 · frontend/src/components/widgets/WidgetSpan.svelte:288 — all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — frontend/src/components/widgets/WidgetSpan.svelte:270
frontend/src/components/panels/Inspector.svelte:26 · frontend/src/components/panels/Inspector.svelte:38 — 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. — frontend/src/components/panels/Inspector.svelte:26
frontend/src/components/panels/Inspector.svelte:81 · frontend/src/components/panels/Layers.svelte:743 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — frontend/src/components/panels/Inspector.svelte:81
frontend/src/components/widgets/inputs/ScrollbarInput.svelte:193 · frontend/src/components/widgets/inputs/TransferCurveInput.svelte:268 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — frontend/src/components/widgets/inputs/ScrollbarInput.svelte:193
frontend/src/components/widgets/inputs/SliderInput.svelte:585 · frontend/src/components/widgets/inputs/TransferCurveInput.svelte:250 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — frontend/src/components/widgets/inputs/SliderInput.svelte:585
frontend/vite.config.ts:40 · frontend/vite.config.ts:60 — the two spans are one implementation copied and then locally edited — 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — frontend/vite.config.ts:40
frontend/src/components/panels/Layers.svelte:173 · frontend/src/components/panels/Layers.svelte:191 · frontend/src/components/widgets/inputs/NumberInput.svelte:150 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — frontend/src/components/panels/Layers.svelte:173
frontend/src/components/widgets/inputs/CheckboxInput.svelte:6 · frontend/src/components/widgets/inputs/TextInput.svelte:4 — the two spans are one implementation copied and then locally edited — 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — frontend/src/components/widgets/inputs/CheckboxInput.svelte:6
frontend/src/components/widgets/inputs/DropdownInput.svelte:144 · frontend/src/utility-functions/input.ts:289 — the two spans are one implementation copied and then locally edited — 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — frontend/src/components/widgets/inputs/DropdownInput.svelte:144
frontend/src/components/widgets/inputs/SliderInput.svelte:623 · frontend/src/components/widgets/inputs/SliderInput.svelte:633 · frontend/src/components/widgets/inputs/VisualColorPickersInput.svelte:146 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — frontend/src/components/widgets/inputs/SliderInput.svelte:623
frontend/src/components/panels/Document.svelte:395 · frontend/src/components/panels/Document.svelte:531 — 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. — frontend/src/components/panels/Document.svelte:395
frontend/src/components/widgets/buttons/ImageButton.svelte:5 · frontend/src/components/widgets/labels/ImageLabel.svelte:4 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — frontend/src/components/widgets/buttons/ImageButton.svelte:5
frontend/src/components/window/Panel.svelte:373 · frontend/src/components/window/Panel.svelte:381 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — frontend/src/components/window/Panel.svelte:373
frontend/src/stores/app-window.ts:26 · frontend/src/stores/document.ts:34 · frontend/src/stores/fullscreen.ts:19 · frontend/src/stores/tooltip.ts:43 — the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — frontend/src/stores/app-window.ts:26
frontend/src/components/layout/FloatingMenu.svelte:91 · frontend/src/components/layout/LayoutCol.svelte:17 · frontend/src/components/layout/LayoutRow.svelte:18 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — frontend/src/components/layout/FloatingMenu.svelte:91
frontend/src/components/widgets/buttons/TextButton.svelte:30 · frontend/src/components/widgets/inputs/ColorInput.svelte:21 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited. — frontend/src/components/widgets/buttons/TextButton.svelte:30
frontend/src/managers/drag-toggle.ts:23 · frontend/src/managers/drag-toggle.ts:37 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — frontend/src/managers/drag-toggle.ts:23
frontend/src/stores/color-picker.ts:25 · frontend/src/stores/fullscreen.ts:12 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — frontend/src/stores/color-picker.ts:25
frontend/src/utility-functions/rasterization.ts:4 · frontend/src/utility-functions/rasterization.ts:65 — the two spans are one implementation copied and then locally edited — 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — frontend/src/utility-functions/rasterization.ts:4
frontend/src/components/layout/FloatingMenu.svelte:29 · frontend/src/components/layout/LayoutCol.svelte:4 · frontend/src/components/layout/LayoutRow.svelte:4 · frontend/src/components/widgets/inputs/FieldInput.svelte:14 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — frontend/src/components/layout/FloatingMenu.svelte:29
frontend/src/stores/app-window.ts:20 · frontend/src/stores/color-picker.ts:26 · frontend/src/stores/dialog.ts:28 · frontend/src/stores/document.ts:28 · +3 more site(s) not listed — the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — frontend/src/stores/app-window.ts:20
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
positionAndStyleFloatingMenu has cyclomatic complexity 58 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/layout/FloatingMenu.svelte:213
handleKey has cyclomatic complexity 42 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/floating-menus/MenuList.svelte:490
onKeyDown has cyclomatic complexity 37 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/widgets/inputs/MathExpressionInput.svelte:910
shouldRedirectKeyboardEventToBackend has cyclomatic complexity 33 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/utility-functions/input.ts:25
render has cyclomatic complexity 32 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/widgets/inputs/MathExpressionInput.svelte:145
onBeforeInput has cyclomatic complexity 30 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/widgets/inputs/MathExpressionInput.svelte:828
parseMarkdown has cyclomatic complexity 21 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:10
stepThroughBrackets has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/widgets/inputs/MathExpressionInput.svelte:535
dragPointerUp has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/window/Panel.svelte:210
getLocalizedScanCode has cyclomatic complexity 20 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/utility-functions/keyboard-entry.ts:41
dragPointerMove has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/window/Panel.svelte:134
pointerOver has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/floating-menus/MenuList.svelte:329
readAtCaret has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/utility-functions/clipboard.ts:4
tabBetweenTextFields has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/utility-functions/input.ts:387
keyboardHintIcon has cyclomatic complexity 17 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/widgets/labels/ShortcutLabel.svelte:59
resizePanel has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/window/PanelSubdivision.svelte:47
updateConstant has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/widgets/inputs/MathExpressionInput.svelte:346
draggingPointerMove has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/components/panels/Layers.svelte:896
onPointerDown has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — frontend/src/utility-functions/input.ts:135
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files5.4 / 10Adequate✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
frontend/src/components/views/Graph.svelte has 1734 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/views/Graph.svelte:1
frontend/src/components/panels/Layers.svelte has 1712 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/panels/Layers.svelte:1
frontend/src/components/widgets/inputs/NumberInput.svelte has 1143 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/widgets/inputs/NumberInput.svelte:1
frontend/src/components/widgets/inputs/MathExpressionInput.svelte has 1140 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/widgets/inputs/MathExpressionInput.svelte:1
frontend/src/icons.ts has 1031 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/icons.ts:1
frontend/src/components/panels/Document.svelte has 913 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/panels/Document.svelte:1
frontend/src/components/widgets/inputs/SliderInput.svelte has 858 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/widgets/inputs/SliderInput.svelte:1
frontend/src/components/floating-menus/MenuList.svelte has 764 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/floating-menus/MenuList.svelte:1
frontend/src/utility-functions/keyboard-entry.ts has 681 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/utility-functions/keyboard-entry.ts:1
frontend/src/components/layout/FloatingMenu.svelte has 662 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/layout/FloatingMenu.svelte:1
frontend/src/components/window/Panel.svelte has 614 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/window/Panel.svelte:1
frontend/src/components/widgets/NodeSection.svelte has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — frontend/src/components/widgets/NodeSection.svelte:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage0.1 / 10Critical✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×40) — frontend/src/components/panels/Layers.svelte:1, frontend/src/components/widgets/inputs/MathExpressionInput.svelte:1, frontend/src/icons.ts:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
What to do
Bump outdated dependencies to current versions to limit upgrade debt.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code0.0 / 10Critical✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Unreachable from the 6 application, 7 tooling and 2 test entry point(s) detected in this repo. Gate removals on `npm run check` — an undetected custom entry would make these reachable.
no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×39) — frontend/src/components/panels/Layers.svelte, frontend/src/components/widgets/inputs/MathExpressionInput.svelte, frontend/src/icons.ts, …
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Declared in frontend/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×3)
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
`forEach` ignores what its callback returns, so the Promise each `async` call returns is dropped: nothing can await it, the code after this loop runs before any of the awaited work has finished (a function that `await`s around this loop still returns early), and a rejection is never handled — in Node.js an unhandled rejection terminates the process by default, and in a browser it is lost. Iterate with `for (const item of items) { await … }` when the work must run in order, or `await Promise.all(items.map(async (item) => { … }))` when it may run concurrently, so the enclosing function finishes only when the work does and its failures reach the caller. Where firing and forgetting is genuinely intended, make the callback's whole body a `try { … } catch (e) { … }` that handles the failure, so it cannot escape. — frontend/src/utility-functions/input.ts:282
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether async functions that make a cancellable request accept or pass on an AbortSignal (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/3 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
`fetchJSON` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — website/static/js/page/contributor-guide/bisect-tool.js:13
`loadDemoArtwork` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — frontend/src/utility-functions/network.ts:38
`initWasm` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — frontend/src/utility-functions/wasm-loader.ts:6
What to do
Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×7) — frontend/src/service-worker.js:82, frontend/src/service-worker.js:192, frontend/src/utility-functions/network.ts:52, …
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`debug!` at line 32 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/delegate.rs:32
`error!` at line 13 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/dirs.rs:13
`error!` at line 41 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/dirs.rs:41
`error!` at line 73 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. (×2) — desktop/ui/src/ipc.rs:73, desktop/ui/src/remote/host.rs:73
`error!` at line 29 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. (×2) — desktop/ui/src/remote.rs:29, desktop/ui/src/internal/resource_request_handler.rs:29
`error!` at line 38 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/resources.rs:38
`warn!` at line 110 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/host.rs:110
`debug!` at line 41 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:41
`error!` at line 112 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:112
`error!` at line 129 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:129
`error!` at line 155 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:155
`info!` at line 213 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:213
`debug!` at line 287 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:287
`error!` at line 307 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:307
`error!` at line 368 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/remote/spawn.rs:368
`error!` at line 61 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/platform/mac.rs:61
`error!` at line 117 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/display_handler.rs:117
`warn!` at line 118 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/display_handler.rs:118
`info!` at line 119 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/display_handler.rs:119
`debug!` at line 120 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/display_handler.rs:120
`trace!` at line 121 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/display_handler.rs:121
`error!` at line 32 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/life_span_handler.rs:32
`error!` at line 78 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/render_process_handler.rs:78
`error!` at line 54 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/render_process_v8_handler.rs:54
`warn!` at line 26 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/internal/request_handler.rs:26
`error!` at line 31 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/plane.rs:31
`error!` at line 53 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/receive.rs:53
`error!` at line 57 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/receive.rs:57
`error!` at line 120 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/receive.rs:120
`debug!` at line 31 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/sink.rs:31
`debug!` at line 40 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/sink.rs:40
`warn!` at line 123 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/streamer.rs:123
`debug!` at line 127 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/streamer.rs:127
`debug!` at line 140 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/streamer.rs:140
`debug!` at line 151 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/streamer.rs:151
`error!` at line 85 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/surface.rs:85
`warn!` at line 57 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/plane/linux.rs:57
`error!` at line 65 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — desktop/ui/src/frames/plane/linux.rs:65
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 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 — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 23 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 10 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 46 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AX1 Captive dependencies — Not applicable: 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; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's TypeScript 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 — Not applicable: Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — no exported interface declares behaviour
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~10229 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Rust, TypeScript not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .rs, .ts, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — None of 0 binding record(s) states a rule in checkable form (a backticked element with a prohibition, or an `adr-rules` block), so conformance cannot be read from the code. Write the rule as an `adr-rules` block (`forbid:` a symbol, a package or a dependency) to make it checkable.
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 139 value object(s); 2 domain event(s); its domain events are published by services or handlers — no domain entity raises one
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript, Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
S1 Web-Security Posture — No web surface: 710 Rust file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X26 Unsynchronised callback handoff — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. Rust's compiler refuses the unsynchronised version: a collection shared between a callback's thread and the waiting body must be `Sync`, which a `Vec`, `VecDeque` or `HashMap` is only behind a `Mutex`/`RwLock`, so the race this check looks for cannot be written in safe Rust. TypeScript/JavaScript runs every callback on the one thread that owns its objects: a callback runs only when the body waiting on it has yielded, never alongside it, and a worker thread receives a COPY of what it is sent. A SharedArrayBuffer carries raw bytes, never an Array, Map or Set, so no collection is reachable from two threads at once. Not a gap in the analyzer and not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
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.
AC2 · Forms & labels· <button> with no accessible text · ×19
<button> with no accessible text frontend/src/components/panels/Layers.svelte:1206— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:65— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:69— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:71— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/NumberInput.svelte:1007— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/NumberInput.svelte:1014— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:27— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:28— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:29— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:30— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:31— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:32— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:33— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:34— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ReferencePointInput.svelte:35— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ScrollbarInput.svelte:210— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/ScrollbarInput.svelte:214— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/WorkingColorsInput.svelte:39— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
<button> with no accessible text frontend/src/components/widgets/inputs/WorkingColorsInput.svelte:52— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
Boundary-crossing change coupling: app.rs ↔ app_window_message_handler.rs desktop/src/app.rs:1— `desktop/src/app.rs` (context desktop) and `editor/src/messages/app_window/app_window_message_handler.rs` (context editor) sit in DIFFERENT parts of the tree yet change together 90% of the time (9 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `63725ea6` Desktop: Make input routing aware of floating menus (#4498); `d97fe835` Desktop: Focus app window when loading a document (#4124); `95d35562` Replace globals with editor environment (#3656) — run `git show` on any of them.
Boundary-crossing change coupling: intercept_frontend_message.rs ↔ app_window_message_handler.rs desktop/wrapper/src/intercept_frontend_message.rs:1— `desktop/wrapper/src/intercept_frontend_message.rs` (context desktop) and `editor/src/messages/app_window/app_window_message_handler.rs` (context editor) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `63725ea6` Desktop: Make input routing aware of floating menus (#4498); `d97fe835` Desktop: Focus app window when loading a document (#4124); `07fbcd48` Desktop: Add fullscreen window mode (#3625) — run `git show` on any of them.
Boundary-crossing change coupling: handle_desktop_wrapper_message.rs ↔ editor_wrapper.rs desktop/wrapper/src/handle_desktop_wrapper_message.rs:1— `desktop/wrapper/src/handle_desktop_wrapper_message.rs` (context desktop) and `frontend/wrapper/src/editor_wrapper.rs` (context wrapper) sit in DIFFERENT parts of the tree yet change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `78679a5b` Implement editor level future message handler (#4182); `b100892b` Add support for persistent storage of panel layouts, sizes, and activ…; `2be7790d` Improve UX of importing vs. opening files (#3661) (at that commit the file was still `frontend/wasm/src/editor_api.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: data_panel_message_handler.rs ↔ lib.rs editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:1— `editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs` (context editor) and `node-graph/libraries/graphic-types/src/lib.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `daa8b6a5` Delete the vestigial region domain, reverting to naive logic for mesh…; `4b01abe3` Add a "Cyclic" gradient option that closes the ramp into a seamless l…; `fd01d660` Add a gradient interpolation space attribute with sRGB Gamma (existin… — run `git show` on any of them.
Boundary-crossing change coupling: app_window_message_handler.rs ↔ editor_wrapper.rs editor/src/messages/app_window/app_window_message_handler.rs:1— `editor/src/messages/app_window/app_window_message_handler.rs` (context editor) and `frontend/wrapper/src/editor_wrapper.rs` (context wrapper) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `95d35562` Replace globals with editor environment (#3656) (at that commit the file was still `frontend/wasm/src/editor_api.rs`); `07fbcd48` Desktop: Add fullscreen window mode (#3625) (at that commit the file was still `frontend/wasm/src/editor_api.rs`); `73682b48` Desktop: Implement pointer lock for NumberInput (#3638) (at that commit the file was still `frontend/wasm/src/editor_api.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: portfolio_message.rs ↔ editor_wrapper.rs editor/src/messages/portfolio/portfolio_message.rs:1— `editor/src/messages/portfolio/portfolio_message.rs` (context editor) and `frontend/wrapper/src/editor_wrapper.rs` (context wrapper) sit in DIFFERENT parts of the tree yet change together 62% of the time (29 of the 47 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 29 shared commits counted here, the most recent 3 are `8a38af5b` Rework clipboard handling to carry embedded resources across document…; `83d03ad6` Fix panel docking bugs and polish its behavior (#4087); `d44b0cd3` Make documents fall back to "Untitled Document" (+ number suffix) if … — run `git show` on any of them.
Boundary-crossing change coupling: document_node_definitions.rs ↔ text.rs editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1— `editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs` (context editor) and `node-graph/nodes/gstd/src/text.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `c91d0cd5` Update all node parameters with appropriate attributes of #[unit(...)…; `f05a644b` Revamp the syntax to #[hard(a..b)] and #[soft(a..b)] bounds on node d…; `3b55064f` Add tooltip documentation to the Text node and tidy up node catalog c… — run `git show` on any of them.
Boundary-crossing change coupling: document_node_definitions.rs ↔ repeat_nodes.rs editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1— `editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs` (context editor) and `node-graph/nodes/repeat/src/repeat_nodes.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `8ef7432e` Rework 'Split Vec2' and 'Split Channels' as multi-output nodes and me…; `c91d0cd5` Update all node parameters with appropriate attributes of #[unit(...)…; `0eab6aa9` Rename the nodes 'Length' -> 'Magnitude', 'Flatten Path' -> 'Combine … — run `git show` on any of them.
Boundary-crossing change coupling: document_node_definitions.rs ↔ lib.rs editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1— `editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs` (context editor) and `node-graph/interpreted-executor/src/lib.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 57% of the time (12 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `21e5e06b` Clean up document message wrappers around proto nodes so they're now …; `d9cbf975` Deprecate automatic composition (#3088); `69ed80b7` Add `::IDENTITY` to node macro to return a `ProtoNodeIdentifier` that… — run `git show` on any of them.
Boundary-crossing change coupling: node_graph_message.rs ↔ editor_wrapper.rs editor/src/messages/portfolio/document/node_graph/node_graph_message.rs:1— `editor/src/messages/portfolio/document/node_graph/node_graph_message.rs` (context editor) and `frontend/wrapper/src/editor_wrapper.rs` (context wrapper) sit in DIFFERENT parts of the tree yet change together 53% of the time (27 of the 51 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 27 shared commits counted here, the most recent 3 are `1648e33c` Implement dragging to reorder Properties panel node sections (#4299); `8a38af5b` Rework clipboard handling to carry embedded resources across document…; `6b11b477` Improve the Data panel with type-specific detail pages and nested-lay… — run `git show` on any of them.
Boundary-crossing change coupling: node_inspector.rs ↔ blending_nodes.rs editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1— `editor/src/messages/portfolio/document/node_graph/node_inspector.rs` (context editor) and `node-graph/nodes/raster/src/blending_nodes.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `c91d0cd5` Update all node parameters with appropriate attributes of #[unit(...)… (at that commit the file was still `editor/src/messages/portfolio/document/node_graph/node_properties.rs`); `2941c740` Replace all node usages of f32 with f64 (#4581) (at that commit the file was still `editor/src/messages/portfolio/document/node_graph/node_properties.rs`); `951339a6` Move the adjustment nodes to 64-bit precision number parameters (#4579) (at that commit the file was still `editor/src/messages/portfolio/document/node_graph/node_properties.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: node_graph_executor.rs ↔ lib.rs editor/src/node_graph_executor.rs:1— `editor/src/node_graph_executor.rs` (context editor) and `node-graph/interpreted-executor/src/lib.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `180b78ce` Improve performance of vector data operations (#4781); `d9cbf975` Deprecate automatic composition (#3088); `69ed80b7` Add `::IDENTITY` to node macro to return a `ProtoNodeIdentifier` that… — run `git show` on any of them.
Boundary-crossing change coupling: document_node_definitions.rs ↔ lib.rs editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1— `editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs` (context editor) and `node-graph/libraries/raster-types/src/lib.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 51% of the time (25 of the 49 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are `a182a734` Extract `gbrush` (#2784) (at that commit the file was still `node-graph/gcore/src/raster.rs`); `a8e209e4` Remove the old node macro and fix/clean up several raster nodes (#2650) (at that commit the file was still `node-graph/gcore/src/raster.rs`); `a696aae0` Instance tables refactor part 5: unwrap GraphicGroup as multi-row Ins… (at that commit the file was still `node-graph/gcore/src/raster.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: document_node_definitions.rs ↔ graphene_compiler.rs editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1— `editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs` (context editor) and `node-graph/graph-craft/src/graphene_compiler.rs` (context node-graph) sit in DIFFERENT parts of the tree yet change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `21e5e06b` Clean up document message wrappers around proto nodes so they're now …; `da13f214` Add profiling metrics for, and speed up, Graphene graph compilation (… (at that commit the file was still `editor/src/messages/portfolio/document/node_graph/document_node_types.rs`); `1bfbe306` Fix image loading and remove resolve_empty_stacks() function (#1746) (at that commit the file was still `editor/src/messages/portfolio/document/node_graph/document_node_types.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: misc.rs ↔ editor_wrapper.rs editor/src/messages/input_mapper/utility_types/misc.rs:1— `editor/src/messages/input_mapper/utility_types/misc.rs` (context editor) and `frontend/wrapper/src/editor_wrapper.rs` (context wrapper) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `07fbcd48` Desktop: Add fullscreen window mode (#3625) (at that commit the file was still `frontend/wasm/src/editor_api.rs`); `2ee8e56c` Fix sending platform-specific shortcut keys to frontend before editor… (at that commit the file was still `frontend/wasm/src/editor_api.rs`); `f2994970` Add shaking input gesture to disconnect a node being dragged (#2889) (at that commit the file was still `frontend/wasm/src/editor_api.rs`) — run `git show` on any of them.
Boundary-crossing change coupling: document_message_handler.rs ↔ editor_commands.rs editor/src/messages/portfolio/document/document_message_handler.rs:1— `editor/src/messages/portfolio/document/document_message_handler.rs` (context editor) and `frontend/wrapper/src/editor_commands.rs` (context wrapper) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `c6ac909d` Add virtual scrolling to the Layers panel, sending details and thumbn…; `70a51a5f` Fix renaming layers in the node graph and hiding nodes from the Inspe…; `1f1cab1b` Add expandable node chain rows to the Layers panel (#4674) — run `git show` on any of them.
Boundary-crossing change coupling: handle_desktop_wrapper_message.rs ↔ dispatcher.rs desktop/wrapper/src/handle_desktop_wrapper_message.rs:1— `desktop/wrapper/src/handle_desktop_wrapper_message.rs` (context desktop) and `editor/src/dispatcher.rs` (context editor) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `78679a5b` Implement editor level future message handler (#4182); `b100892b` Add support for persistent storage of panel layouts, sizes, and activ…; `2be7790d` Improve UX of importing vs. opening files (#3661) — run `git show` on any of them.
Boundary-crossing change coupling: handle_desktop_wrapper_message.rs ↔ app_window_message_handler.rs desktop/wrapper/src/handle_desktop_wrapper_message.rs:1— `desktop/wrapper/src/handle_desktop_wrapper_message.rs` (context desktop) and `editor/src/messages/app_window/app_window_message_handler.rs` (context editor) sit in DIFFERENT parts of the tree yet 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 — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `95d35562` Replace globals with editor environment (#3656); `73682b48` Desktop: Implement pointer lock for NumberInput (#3638); `bb4516e3` Desktop: Add app menu for Mac (#3428) — run `git show` on any of them.
AC2 · Forms & labels· <input> without a programmatic label · ×7
<input> without a programmatic label frontend/src/components/panels/Layers.svelte:1237— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label frontend/src/components/panels/Layers.svelte:1411— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label frontend/src/components/views/Graph.svelte:598— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label frontend/src/components/views/Graph.svelte:666— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label frontend/src/components/views/Graph.svelte:883— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label frontend/src/components/widgets/inputs/NumberInput.svelte:1023— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label frontend/src/components/window/Panel.svelte:431— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC4 · Keyboard semantics· Click handler on a non-interactive <div> · ×3
Click handler on a non-interactive <div> frontend/src/components/layout/LayoutCol.svelte:32— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <div> frontend/src/components/layout/LayoutRow.svelte:33— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <div> frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:75— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
AC4 · Keyboard semantics· Double-click handler on a non-interactive <div> · ×3
Double-click handler on a non-interactive <div> frontend/src/components/widgets/inputs/SliderInput.svelte:712— This <div> binds pointerdown and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
Double-click handler on a non-interactive <div> frontend/src/components/widgets/inputs/SliderInput.svelte:724— This <div> binds pointerdown and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
Double-click handler on a non-interactive <div> frontend/src/components/widgets/inputs/TransferCurveInput.svelte:303— This <div> binds pointerdown, pointermove and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
AC2 · Forms & labels· Custom control with no accessible name on <div> · ×2
Custom control with no accessible name on <div> frontend/src/components/widgets/NodeSection.svelte:128— This <div> carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to <button type="button"> — the right fix for its keyboard operability — does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label.
Custom control with no accessible name on <div> frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:75— This <div> carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to <button type="button"> — the right fix for its keyboard operability — does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label.
AC4 · Keyboard semantics· Double-click handler on a non-interactive <p> · ×2
Double-click handler on a non-interactive <p> frontend/src/components/views/Graph.svelte:609— This <p> binds double-click and nothing else. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
Double-click handler on a non-interactive <p> frontend/src/components/views/Graph.svelte:678— This <p> binds double-click and nothing else. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
AC2 · Forms & labels· Custom control with no accessible name on <img> · ×1
Custom control with no accessible name on <img> frontend/src/components/widgets/buttons/ImageButton.svelte:25— This <img> carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to <button type="button"> — the right fix for its keyboard operability — does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label.
<html> without a lang frontend/index.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
Viewport restricts zoom frontend/index.html:11— user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta.
AC4 · Keyboard semantics· Click handler on a non-interactive <img> · ×1
Click handler on a non-interactive <img> frontend/src/components/widgets/buttons/ImageButton.svelte:25— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
AC4 · Keyboard semantics· Double-click handler on a non-interactive <svg> · ×1
Double-click handler on a non-interactive <svg> frontend/src/components/widgets/inputs/SliderInput.svelte— This <svg> binds pointerdown and double-click — pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabindex="0", so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native <button> or <a href>. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role + tabindex="0" + a key handler alongside the double-click.
AX9 · CQS / query purity· Query writes persistent state on the read path · ×1
Query writes persistent state on the read path: document_storage_io$module.load_legacy_document editor/src/messages/portfolio/document_storage_io.rs:290— `document_storage_io$module.load_legacy_document` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command.
Dual write (no outbox): spawn$module.handle_message desktop/ui/src/remote/spawn.rs:355— `spawn$module.handle_message` performs two independent DURABLE writes — a durable state write (`died_reported.store`, :369) and an independent publish to an event bus (`events.send`, :372) — in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox).
TodoComment tools/node-docs/src/main.rs:17— // TODO: Also obtain document nodes, not only proto nodes — 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 tools/cargo-run/internal/download/src/main.rs:79— // TODO: support other compression/archive formats — 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 node-graph/nodes/vector/src/vector_nodes.rs:1962— // TODO: Make this node support stroke align, which it currently ignores — 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 node-graph/nodes/vector/src/vector_nodes.rs:2498— // TODO: apply transform to points instead of modifying the paths — 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 node-graph/nodes/vector/src/vector_nodes.rs:3771— // TODO: Return i64 instead of f64 once automatic type conversion is implemented for nodes with generic type inputs, so an integer output doesn't wall this count off from the generic math nodes. — 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 node-graph/nodes/text/src/lib.rs:894— // TODO: Return i64 instead of f64 once automatic type conversion is implemented for nodes with generic type inputs, so an integer output doesn't wall this count off from the generic math nodes. — 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 node-graph/nodes/vector/src/vector_nodes.rs:3772— // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) — 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 node-graph/nodes/text/src/lib.rs:895— // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) — 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 node-graph/nodes/graphic/src/graphic.rs:245— // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) — 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 node-graph/nodes/gcore/src/context.rs:83— // TODO: (Currently automatic type conversion only works for concrete types, via the Graphene preprocessor and not the full Graphene type system.) — 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 node-graph/nodes/transform/src/transform_nodes.rs:32— // TODO: Replace this pair of shear angles with a single `f64` skew angle — 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 node-graph/nodes/text/src/path_builder.rs:141— // TODO: This can be cached for better performance — 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 node-graph/nodes/text/src/path_builder.rs:178— // TODO: Remove this hack and move the attribute up to the parent return value when <https://github.com/GraphiteEditor/Graphite/issues/3779> is done.
TodoComment node-graph/nodes/repeat/src/repeat_nodes.rs:77— // TODO: When using a custom Inspector layout in document_node_definitions.rs and this default is set, the widget weirdly doesn't show up in the Inspector. Investigation is needed. — 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 node-graph/nodes/raster/src/adjustments.rs:297— // TODO: A Lab-only mode once Graphite supports the CIE Lab color space. — 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 node-graph/nodes/raster/src/adjustments.rs:1020— // TODO: Residuals in 8-bit PSD interop: the byte-hue colorize table, the colorize lightness slider (up to 2.5 levels), and the range edges (a few tenths of a degree) — 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 node-graph/nodes/raster/src/adjustments.rs:1458— // TODO: Full PSD interop needs a compatibility variant of `GradientInterpolation` with its own midpoint semantics, position warp, — 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 node-graph/nodes/raster/src/adjustments.rs:1459— // TODO: and smoothing (a `gradient_smoothness` attribute), plus noise gradients, which we don't yet support. — 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 node-graph/nodes/raster/src/adjustments.rs:1460— // TODO: Its axes differ from ours: its midpoint is always a knee in the position warp and its smoothness blends the curve over — 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 node-graph/nodes/raster/src/adjustments.rs:1461— // TODO: that fixed warp, while each variant here picks warp and curve together, so neither end of the blend is Linear or Smooth. — 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 node-graph/nodes/raster/src/adjustments.rs:1462— // TODO: Per channel in the gradient space (measured on gamma RGB): — 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 node-graph/nodes/raster/src/adjustments.rs:1463— // TODO: - Position t maps to a parameter p by a piecewise-linear knee through (stop position, index) and (midpoint, index - 0.5). — 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 node-graph/nodes/raster/src/adjustments.rs:1464— // TODO: - Linear lerps the interval's stop colors by the fraction of p. Smooth is a cubic Hermite over the stop index with tangent — 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 node-graph/nodes/raster/src/adjustments.rs:1465— // TODO: `(c[i + 1] - c[i - 1]) / 2`, the end stops repeated past the ends, so two stops give `0.5 p + 1.5 p^2 - p^3`. — 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 node-graph/nodes/raster/src/adjustments.rs:1466— // TODO: - The ramp is `(1 - s) * linear + s * smooth` for smoothness s, clamped per interval to its two stop colors. — 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.
Hotspot: editor/src/messages/portfolio/document/document_message_handler.rs editor/src/messages/portfolio/document/document_message_handler.rs:251— editor/src/messages/portfolio/document/document_message_handler.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 312 in DocumentMessageHandler::process_message at line 251. 8 of those changes were fix/bug commits, and the other 50 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/document/document_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/portfolio/document_migration.rs editor/src/messages/portfolio/document_migration.rs:1828— editor/src/messages/portfolio/document_migration.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 256 in graphite_editor::messages::portfolio::document_migration::migrate_node at line 1828. 3 of those changes were fix/bug commits, and the other 52 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/document_migration.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:144— editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 437 in NodeGraphMessageHandler::process_message at line 144. 7 of those changes were fix/bug commits, and the other 25 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: node-graph/nodes/vector/src/vector_nodes.rs node-graph/nodes/vector/src/vector_nodes.rs:2756— node-graph/nodes/vector/src/vector_nodes.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in vector_nodes::vector_nodes::morph at line 2756. 2 of those changes were fix/bug commits, and the other 46 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- node-graph/nodes/vector/src/vector_nodes.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/tool/tool_messages/path_tool.rs editor/src/messages/tool/tool_messages/path_tool.rs:1581— editor/src/messages/tool/tool_messages/path_tool.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 269 in PathToolFsmState::transition at line 1581. 2 of those changes were fix/bug commits, and the other 17 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/tool/tool_messages/path_tool.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/portfolio/document/node_graph/node_inspector.rs editor/src/messages/portfolio/document/node_graph/node_inspector.rs:286— editor/src/messages/portfolio/document/node_graph/node_inspector.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/document/node_graph/node_inspector.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/tool/tool_messages/gradient_tool.rs editor/src/messages/tool/tool_messages/gradient_tool.rs:911— editor/src/messages/tool/tool_messages/gradient_tool.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in GradientToolFsmState::transition at line 911. 4 of those changes were fix/bug commits, and the other 26 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/tool/tool_messages/gradient_tool.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/portfolio/portfolio_message_handler.rs editor/src/messages/portfolio/portfolio_message_handler.rs:72— editor/src/messages/portfolio/portfolio_message_handler.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 156 in PortfolioMessageHandler::process_message at line 72. 1 of those changes was a fix/bug commit, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/portfolio_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/tool/tool_messages/select_tool.rs editor/src/messages/tool/tool_messages/select_tool.rs:901— editor/src/messages/tool/tool_messages/select_tool.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 189 in SelectToolFsmState::transition at line 901. 3 of those changes were fix/bug commits, and the other 12 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/tool/tool_messages/select_tool.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: node-graph/libraries/rendering/src/renderer.rs node-graph/libraries/rendering/src/renderer.rs:1726— node-graph/libraries/rendering/src/renderer.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in rendering::renderer::render_vector_item_to_vello at line 1726. 6 of those changes were fix/bug commits, and the other 31 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- node-graph/libraries/rendering/src/renderer.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/tool/tool_messages/pen_tool.rs editor/src/messages/tool/tool_messages/pen_tool.rs:1496— editor/src/messages/tool/tool_messages/pen_tool.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 135 in PenToolFsmState::transition at line 1496. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/tool/tool_messages/pen_tool.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/tool/tool_messages/shape_tool.rs editor/src/messages/tool/tool_messages/shape_tool.rs:871— editor/src/messages/tool/tool_messages/shape_tool.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in ShapeToolFsmState::transition at line 871. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/tool/tool_messages/shape_tool.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libraries/math-parser/src/constants.rs libraries/math-parser/src/constants.rs:465— libraries/math-parser/src/constants.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 151 in math_parser::constants::builtin_function at line 465. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- libraries/math-parser/src/constants.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:34— editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in GraphOperationMessageHandler::process_message at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/layout/layout_message_handler.rs editor/src/messages/layout/layout_message_handler.rs:205— editor/src/messages/layout/layout_message_handler.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in LayoutMessageHandler::handle_widget_callback at line 205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/layout/layout_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: node-graph/node-macro/src/codegen.rs node-graph/node-macro/src/codegen.rs:13— node-graph/node-macro/src/codegen.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in node_macro::codegen::generate_node_code at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- node-graph/node-macro/src/codegen.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:112— editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in TransformLayerMessageHandler::process_message at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:899— editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector at line 899. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: libraries/math-parser/src/lexer.rs libraries/math-parser/src/lexer.rs:484— libraries/math-parser/src/lexer.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Lexer::next_token at line 484. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- libraries/math-parser/src/lexer.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: node-graph/graph-craft/src/document/value.rs node-graph/graph-craft/src/document/value.rs:769— node-graph/graph-craft/src/document/value.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in graph_craft::document::value::deserialize_tagged_value_with_legacy_migration at line 769. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- node-graph/graph-craft/src/document/value.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/clipboard/clipboard_message_handler.rs editor/src/messages/clipboard/clipboard_message_handler.rs:36— editor/src/messages/clipboard/clipboard_message_handler.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in ClipboardMessageHandler::process_message at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/clipboard/clipboard_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/color_picker/color_picker_message_handler.rs editor/src/messages/color_picker/color_picker_message_handler.rs:73— editor/src/messages/color_picker/color_picker_message_handler.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ColorPickerMessageHandler::process_message at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/color_picker/color_picker_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/dispatcher.rs editor/src/dispatcher.rs:159— editor/src/dispatcher.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Dispatcher::handle_message at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/dispatcher.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: node-graph/nodes/path-bool/src/lib.rs node-graph/nodes/path-bool/src/lib.rs:188— node-graph/nodes/path-bool/src/lib.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in path_bool_nodes::flatten_vector at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- node-graph/nodes/path-bool/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:605— editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Graphic::identifier at line 605. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
FileTooLong: document/document_message_handler.rs editor/src/messages/portfolio/document/document_message_handler.rs— FileTooLong — 2911 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 2411 over it, 5.82× 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: node_graph/node_graph_message_handler.rs editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs— FileTooLong — 2732 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 97% of them inside a single declaration: NodeGraphMessageHandler (5 blocks, 58-4071). The bar is 500 significant lines; this is 2232 over it, 5.46× 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: node_graph/node_inspector.rs editor/src/messages/portfolio/document/node_graph/node_inspector.rs— FileTooLong — 2699 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 80 free functions. The bar is 500 significant lines; this is 2199 over it, 5.40× 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: tool_messages/path_tool.rs editor/src/messages/tool/tool_messages/path_tool.rs— FileTooLong — 2505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 2005 over it, 5.01× 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: portfolio/document_migration.rs editor/src/messages/portfolio/document_migration.rs— FileTooLong — 2445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1945 over it, 4.89× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/vector_nodes.rs node-graph/nodes/vector/src/vector_nodes.rs— FileTooLong — 2354 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 63 free functions. The bar is 500 significant lines; this is 1854 over it, 4.71× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/renderer.rs node-graph/libraries/rendering/src/renderer.rs— FileTooLong — 2138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 66 free functions. The bar is 500 significant lines; this is 1638 over it, 4.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: src/adjustments.rs node-graph/nodes/raster/src/adjustments.rs— FileTooLong — 1999 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 36 free functions. The bar is 500 significant lines; this is 1499 over it, 4.00× 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: tool_messages/select_tool.rs editor/src/messages/tool/tool_messages/select_tool.rs— FileTooLong — 1551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1051 over it, 3.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: tool_messages/pen_tool.rs editor/src/messages/tool/tool_messages/pen_tool.rs— FileTooLong — 1546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1046 over it, 3.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: common_functionality/shape_editor.rs editor/src/messages/tool/common_functionality/shape_editor.rs— FileTooLong — 1355 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: ShapeState (2 blocks, 157-2310). The bar is 500 significant lines; this is 855 over it, 2.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: tool_messages/gradient_tool.rs editor/src/messages/tool/tool_messages/gradient_tool.rs— FileTooLong — 1347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 847 over it, 2.69× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/documentation.rs libraries/math-parser/src/documentation.rs— FileTooLong — 1277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 777 over it, 2.55× 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: node_graph/document_node_definitions.rs editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs— FileTooLong — 1211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 711 over it, 2.42× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/lib.rs node-graph/nodes/math/src/lib.rs— FileTooLong — 1191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 87 free functions. The bar is 500 significant lines; this is 691 over it, 2.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: algorithms/concave_hull.rs node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs— FileTooLong — 1172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 31 free functions. The bar is 500 significant lines; this is 672 over it, 2.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/gradient.rs node-graph/libraries/vector-types/src/gradient.rs— FileTooLong — 1101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 601 over it, 2.20× 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: tool_messages/shape_tool.rs editor/src/messages/tool/tool_messages/shape_tool.rs— FileTooLong — 1090 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 590 over it, 2.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: src/icons.ts frontend/src/icons.ts— FileTooLong — 1015 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 515 over it, 2.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.
FileTooLong: src/codegen.rs node-graph/node-macro/src/codegen.rs— FileTooLong — 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 505 over it, 2.01× 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_panel/data_panel_message_handler.rs editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs— FileTooLong — 925 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 425 over it, 1.85× 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: network_interface/layout.rs editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs— FileTooLong — 900 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 100% of them inside a single declaration: NodeNetworkInterface (3-1578). The bar is 500 significant lines; this is 400 over it, 1.80× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/list.rs node-graph/libraries/core-types/src/list.rs— FileTooLong — 888 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 388 over it, 1.78× 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: network_interface/mutations.rs editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs— FileTooLong — 879 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 100% of them inside a single declaration: NodeNetworkInterface (4-1529). The bar is 500 significant lines; this is 379 over it, 1.76× 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: portfolio/portfolio_message_handler.rs editor/src/messages/portfolio/portfolio_message_handler.rs— FileTooLong — 878 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 94% of them inside a single declaration: PortfolioMessageHandler (3 blocks, 51-1303). The bar is 500 significant lines; this is 378 over it, 1.76× 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.
Duplicated block (5 lines × 2) editor/src/messages/portfolio/document/document_message_handler.rs:3050— editor/src/messages/portfolio/document/document_message_handler.rs:3050-3054 | editor/src/messages/tool/tool_messages/select_tool.rs:788-793 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:219— editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:219-223 | editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:230-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 (5 lines × 2) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3986— editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3986-3990 | editor/src/messages/tool/tool_messages/select_tool.rs:2070-2074 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1149— editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1149-1153 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1175-1179 — 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) editor/src/messages/portfolio/document/overlays/utility_functions.rs:93— editor/src/messages/portfolio/document/overlays/utility_functions.rs:93-97 | editor/src/messages/portfolio/document/overlays/utility_functions.rs:145-149 — 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) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1006— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1006-1010 | editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1015-1019 — 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) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1229— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1229-1233 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1120-1124 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1240— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1240-1244 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1131-1135 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_web.rs:224— editor/src/messages/portfolio/document/overlays/utility_types_web.rs:224-228 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:801-805 — 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) editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:393— editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:393-397 | editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:437-441 — 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) editor/src/messages/portfolio/document_migration.rs:1247— editor/src/messages/portfolio/document_migration.rs:1247-1251 | editor/src/messages/portfolio/document_migration.rs:1309-1313 — 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) editor/src/messages/portfolio/document_migration.rs:1324— editor/src/messages/portfolio/document_migration.rs:1324-1328 | editor/src/messages/portfolio/document_migration.rs:1509-1513 — 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) editor/src/messages/portfolio/document_migration.rs:3722— editor/src/messages/portfolio/document_migration.rs:3722-3726 | editor/src/messages/portfolio/document_migration.rs:3734-3738 — 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) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:252— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:252-256 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:282-286 — 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) editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:37— editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:37-41 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:55-59 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:42— editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:42-46 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:60-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 (5 lines × 2) editor/src/messages/tool/common_functionality/utility_functions.rs:147— editor/src/messages/tool/common_functionality/utility_functions.rs:147-151 | editor/src/messages/tool/common_functionality/utility_functions.rs:172-176 — 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) editor/src/messages/tool/tool_messages/artboard_tool.rs:438— editor/src/messages/tool/tool_messages/artboard_tool.rs:438-442 | editor/src/messages/tool/tool_messages/artboard_tool.rs:457-461 — 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) editor/src/messages/tool/tool_messages/gradient_tool.rs:439— editor/src/messages/tool/tool_messages/gradient_tool.rs:439-443 | editor/src/messages/tool/tool_messages/gradient_tool.rs:454-458 — 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) editor/src/messages/tool/tool_messages/gradient_tool.rs:1332— editor/src/messages/tool/tool_messages/gradient_tool.rs:1332-1336 | editor/src/messages/tool/tool_messages/gradient_tool.rs:1839-1843 — 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) editor/src/messages/tool/tool_messages/path_tool.rs:2399— editor/src/messages/tool/tool_messages/path_tool.rs:2399-2403 | editor/src/messages/tool/tool_messages/path_tool.rs:2642-2646 — 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) editor/src/messages/tool/tool_messages/pen_tool.rs:1693— editor/src/messages/tool/tool_messages/pen_tool.rs:1693-1697 | editor/src/messages/tool/tool_messages/pen_tool.rs:1814-1818 — 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) editor/src/messages/tool/tool_messages/select_tool.rs:589— editor/src/messages/tool/tool_messages/select_tool.rs:589-593 | editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:764-768 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) editor/src/messages/tool/tool_messages/select_tool.rs:2173— editor/src/messages/tool/tool_messages/select_tool.rs:2173-2177 | editor/src/messages/tool/tool_messages/select_tool.rs:2235-2239 — 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) node-graph/libraries/core-types/src/list.rs:927— node-graph/libraries/core-types/src/list.rs:927-931 | node-graph/libraries/core-types/src/list.rs:942-946 — 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.
MethodTooLong: NodeGraphMessageHandler.process_message editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:144— MethodTooLong — process_message runs 1679 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1579 over it, 16.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PathToolFsmState.transition editor/src/messages/tool/tool_messages/path_tool.rs:1581— MethodTooLong — transition runs 1107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1007 over it, 11.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SelectToolFsmState.transition editor/src/messages/tool/tool_messages/select_tool.rs:901— MethodTooLong — transition runs 738 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 638 over it, 7.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PortfolioMessageHandler.process_message editor/src/messages/portfolio/portfolio_message_handler.rs:72— MethodTooLong — process_message runs 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 556 over it, 6.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MenuBarMessageHandler.layout editor/src/messages/menu_bar/menu_bar_message_handler.rs:48— MethodTooLong — layout runs 649 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 549 over it, 6.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PenToolFsmState.transition editor/src/messages/tool/tool_messages/pen_tool.rs:1496— MethodTooLong — transition runs 533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 433 over it, 5.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: GradientToolFsmState.transition editor/src/messages/tool/tool_messages/gradient_tool.rs:911— MethodTooLong — transition runs 497 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 397 over it, 4.97× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TransformLayerMessageHandler.process_message editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:112— MethodTooLong — process_message runs 383 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 283 over it, 3.83× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: GraphOperationMessageHandler.process_message editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:34— MethodTooLong — process_message runs 346 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 246 over it, 3.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PreferencesDialogMessageHandler.layout editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:54— MethodTooLong — layout runs 324 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 224 over it, 3.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TextToolFsmState.transition editor/src/messages/tool/tool_messages/text_tool.rs:644— MethodTooLong — transition runs 314 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 214 over it, 3.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ClipboardMessageHandler.process_message editor/src/messages/clipboard/clipboard_message_handler.rs:36— MethodTooLong — process_message runs 312 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 212 over it, 3.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: NavigationMessageHandler.process_message editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:41— MethodTooLong — process_message runs 308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 208 over it, 3.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: LayoutMessageHandler.handle_widget_callback editor/src/messages/layout/layout_message_handler.rs:205— MethodTooLong — handle_widget_callback runs 234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 134 over it, 2.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ToolMessageHandler.handle_message editor/src/messages/tool/tool_message_handler.rs:44— MethodTooLong — handle_message runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ArtboardToolFsmState.transition editor/src/messages/tool/tool_messages/artboard_tool.rs:323— MethodTooLong — transition runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Dispatcher.handle_message editor/src/dispatcher.rs:159— MethodTooLong — handle_message runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ColorPickerMessageHandler.details_layout editor/src/messages/color_picker/color_picker_message_handler.rs:585— MethodTooLong — details_layout runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: WorkspaceMessageHandler.process_message editor/src/messages/portfolio/workspace/workspace_message_handler.rs:21— MethodTooLong — process_message runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SplineToolFsmState.transition editor/src/messages/tool/tool_messages/spline_tool.rs:329— MethodTooLong — transition runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ColorPickerMessageHandler.process_message editor/src/messages/color_picker/color_picker_message_handler.rs:73— MethodTooLong — process_message runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Preprocessor.new node-graph/preprocessor/src/lib.rs:152— MethodTooLong — new runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PathToolData.mouse_down editor/src/messages/tool/tool_messages/path_tool.rs:748— MethodTooLong — mouse_down runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: CompositeBackground.create node-graph/nodes/gstd/src/render_background.rs:153— MethodTooLong — create runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: NodeFnAttributes.parse node-graph/node-macro/src/parsing.rs:447— MethodTooLong — parse runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× 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.
graphite_editor::messages::portfolio::document_migration::migrate_node (cognitive 380) editor/src/messages/portfolio/document_migration.rs:1828— graphite_editor::messages::portfolio::document_migration::migrate_node has cognitive complexity 380 (threshold 15). Drivers by points: if/else 135 (205 pts), boolean chains 75, match/switch 24 (54 pts), loops 25 (46 pts) (nesting depth added 121). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::portfolio::document_migration::document_migration_upgrades (cognitive 187) editor/src/messages/portfolio/document_migration.rs:1198— graphite_editor::messages::portfolio::document_migration::document_migration_upgrades has cognitive complexity 187 (threshold 15). Drivers by points: if/else 58 (122 pts), loops 19 (33 pts), match/switch 9 (21 pts), boolean chains 11 (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path (cognitive 121) editor/src/messages/portfolio/document/utility_types/wires.rs:148— graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path has cognitive complexity 121 (threshold 15). Drivers by points: if/else 40 (90 pts), boolean chains 31 (nesting depth added 50). 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.
graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays (cognitive 87) editor/src/messages/portfolio/document/overlays/utility_functions.rs:332— graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays has cognitive complexity 87 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 7 (24 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints (cognitive 75) editor/src/messages/tool/tool_messages/path_tool.rs:3557— graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints has cognitive complexity 75 (threshold 15). Drivers by points: if/else 28 (63 pts), boolean chains 7, match/switch 3 (5 pts) (nesting depth added 37). 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.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector (cognitive 50) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:3102— graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments (cognitive 47) editor/src/messages/portfolio/document_migration.rs:3495— graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 9 (16 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays (cognitive 42) editor/src/messages/portfolio/document/overlays/utility_functions.rs:488— graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 8 (12 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section (cognitive 40) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1884— graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 5, loops 4 (5 pts), match/switch 3 (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.
graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays (cognitive 39) editor/src/messages/portfolio/document/overlays/utility_functions.rs:193— graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (10 pts), match/switch 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath (cognitive 37) editor/src/messages/portfolio/document/utility_types/wires.rs:472— graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25 (33 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector (cognitive 35) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:899— graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24 (26 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection (cognitive 31) editor/src/messages/tool/tool_messages/shape_tool.rs:316— graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 8, 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.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector (cognitive 29) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:3316— graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 9 (14 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.
graphite_editor::messages::tool::common_functionality::shapes::grid_shape::calculate_grid_params (cognitive 28) editor/src/messages/tool/common_functionality/shapes/grid_shape.rs:154— graphite_editor::messages::tool::common_functionality::shapes::grid_shape::calculate_grid_params has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector (cognitive 27) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:2061— graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 6 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions (cognitive 27) editor/src/messages/portfolio/document_migration.rs:3646— graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, loops 3 (6 pts), match/switch 3 (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.
graphite_editor::messages::portfolio::document::utility_types::network_interface::storage_metadata::apply_entries_into_tree (cognitive 26) editor/src/messages/portfolio/document/utility_types/network_interface/storage_metadata.rs:324— graphite_editor::messages::portfolio::document::utility_types::network_interface::storage_metadata::apply_entries_into_tree has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (4 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.
graphite_editor::messages::tool::tool_messages::gradient_tool::detect_hover_target (cognitive 26) editor/src/messages/tool/tool_messages/gradient_tool.rs:1835— graphite_editor::messages::tool::tool_messages::gradient_tool::detect_hover_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (7 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.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type (cognitive 25) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:286— graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 9, boolean chains 4 (nesting depth added 6). 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.
graphite_editor::messages::portfolio::document::utility_types::network_interface::editor_delta::construct_structural_additions (cognitive 25) editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs:349— graphite_editor::messages::portfolio::document::utility_types::network_interface::editor_delta::construct_structural_additions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_editor::messages::tool::common_functionality::utility_functions::transforming_transform_cage (cognitive 25) editor/src/messages/tool/common_functionality/utility_functions.rs:395— graphite_editor::messages::tool::common_functionality::utility_functions::transforming_transform_cage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 1 (nesting depth added 13). 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.
graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options (cognitive 24) editor/src/messages/tool/common_functionality/color_selector.rs:225— graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
graphite_editor::messages::portfolio::document::document_diff::diff_registries (cognitive 22) editor/src/messages/portfolio/document/document_diff.rs:7— graphite_editor::messages::portfolio::document::document_diff::diff_registries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
graphite_editor::messages::portfolio::document::document_diff::diff_networks (cognitive 22) editor/src/messages/portfolio/document/document_diff.rs:201— graphite_editor::messages::portfolio::document::document_diff::diff_networks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 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.
+ 15 more in this group — see findings.md.
R4 · Test Coverage· No test reaches this file · ×40
No test reaches this file frontend/src/components/panels/Layers.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/MathExpressionInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/icons.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/NumberInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/utility-functions/keyboard-entry.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/floating-menus/MenuList.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/SliderInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/panels/Document.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/layout/FloatingMenu.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/utility-functions/input.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/window/Panel.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/WidgetSpan.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/views/Graph.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/stores/node-graph.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/TransferCurveInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/utility-functions/persistence.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/utility-functions/colors.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/stores/portfolio.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/ScrollbarInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/panels/Inspector.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/RulerInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/VisualColorPickersInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/window/PanelSubdivision.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/components/widgets/inputs/DropdownInput.svelte:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file frontend/src/utility-functions/clipboard.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
FunctionTooLong: graphite_editor::messages::portfolio::document_migration::migrate_node editor/src/messages/portfolio/document_migration.rs:1828— FunctionTooLong — graphite_editor::messages::portfolio::document_migration::migrate_node runs 1040 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 940 over it, 10.40× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: node_macro::codegen::generate_node_code node-graph/node-macro/src/codegen.rs:13— FunctionTooLong — node_macro::codegen::generate_node_code runs 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 650 over it, 7.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::document_node_definitions editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:153— FunctionTooLong — graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::document_node_definitions runs 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 441 over it, 5.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:899— FunctionTooLong — graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector runs 435 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 335 over it, 4.35× 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: interpreted_executor::node_registry::node_registry node-graph/interpreted-executor/src/node_registry.rs:37— FunctionTooLong — interpreted_executor::node_registry::node_registry runs 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 330 over it, 4.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: vector_nodes::vector_nodes::morph node-graph/nodes/vector/src/vector_nodes.rs:2756— FunctionTooLong — vector_nodes::vector_nodes::morph runs 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 312 over it, 4.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: graphite_editor::messages::input_mapper::input_mappings::input_mappings editor/src/messages/input_mapper/input_mappings.rs:25— FunctionTooLong — graphite_editor::messages::input_mapper::input_mappings::input_mappings runs 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 305 over it, 4.05× 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: graphite_editor::messages::portfolio::document_migration::document_migration_upgrades editor/src/messages/portfolio/document_migration.rs:1198— FunctionTooLong — graphite_editor::messages::portfolio::document_migration::document_migration_upgrades runs 398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 298 over it, 3.98× 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: bisect-tool.document.addEventListener("DOMContentLoaded") website/static/js/page/contributor-guide/bisect-tool.js:1— FunctionTooLong — document.addEventListener("DOMContentLoaded") runs 384 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 284 over it, 3.84× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: math_parser::constants::builtin_function libraries/math-parser/src/constants.rs:465— FunctionTooLong — math_parser::constants::builtin_function runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rendering::renderer::render_vector_item_to_vello node-graph/libraries/rendering/src/renderer.rs:1726— FunctionTooLong — rendering::renderer::render_vector_item_to_vello runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.46× 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: graphite_editor::messages::portfolio::document::overlays::grid_overlays::overlay_options editor/src/messages/portfolio/document/overlays/grid_overlays.rs:199— FunctionTooLong — graphite_editor::messages::portfolio::document::overlays::grid_overlays::overlay_options runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× 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: graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path editor/src/messages/portfolio/document/utility_types/wires.rs:148— FunctionTooLong — graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× 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: graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector editor/src/messages/portfolio/document/node_graph/node_inspector.rs:3316— FunctionTooLong — graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: node_macro::parsing::parse_field node-graph/node-macro/src/parsing.rs:859— FunctionTooLong — node_macro::parsing::parse_field runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64× 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: node_macro::destructure::derive_destructure_impl node-graph/node-macro/src/destructure.rs:32— FunctionTooLong — node_macro::destructure::derive_destructure_impl runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60× 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: math_parser::completion::completions libraries/math-parser/src/completion.rs:84— FunctionTooLong — math_parser::completion::completions runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: vector_nodes::vector_nodes::bevel_algorithm node-graph/nodes/vector/src/vector_nodes.rs:3436— FunctionTooLong — vector_nodes::vector_nodes::bevel_algorithm runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints editor/src/messages/tool/tool_messages/path_tool.rs:3557— FunctionTooLong — graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52× 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: rendering::renderer::render_vector_shape_svg node-graph/libraries/rendering/src/renderer.rs:1472— FunctionTooLong — rendering::renderer::render_vector_shape_svg runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector editor/src/messages/portfolio/document/node_graph/node_inspector.rs:2061— FunctionTooLong — graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: vector_types::vector::algorithms::concave_hull::refine_cycle node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1390— FunctionTooLong — vector_types::vector::algorithms::concave_hull::refine_cycle runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× 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: graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1884— FunctionTooLong — graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 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: graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type editor/src/messages/portfolio/document/node_graph/node_inspector.rs:286— FunctionTooLong — graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× 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: crate-hierarchy.document.addEventListener("DOMContentLoaded") website/static/js/page/contributor-guide/crate-hierarchy.js:1— FunctionTooLong — document.addEventListener("DOMContentLoaded") runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× 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.
Duplicated block (6 lines × 2) editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:115— editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:115-120 | editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:126-131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/portfolio/document/graph_operation/utility_types.rs:224— editor/src/messages/portfolio/document/graph_operation/utility_types.rs:224-229 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:287-292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:598— editor/src/messages/portfolio/document/node_graph/node_inspector.rs:598-603 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:619-624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1705— editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1705-1710 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1728-1733 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/portfolio/document/overlays/grid_overlays.rs:125— editor/src/messages/portfolio/document/overlays/grid_overlays.rs:125-130 | editor/src/messages/portfolio/document/overlays/grid_overlays.rs:145-150 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:528— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:528-533 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:213-218 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) editor/src/messages/portfolio/document_migration.rs:3614— editor/src/messages/portfolio/document_migration.rs:3614-3619 | editor/src/messages/portfolio/document_storage_io.rs:329-334 — 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) editor/src/messages/tool/common_functionality/graph_modification_utils.rs:179— editor/src/messages/tool/common_functionality/graph_modification_utils.rs:179-184 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:186-191 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:243— editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:243-248 | editor/src/messages/tool/tool_messages/select_tool.rs:955-960 — 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) editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:328— editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:328-333 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:356-361 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:2809— editor/src/messages/tool/tool_messages/path_tool.rs:2809-2814 | editor/src/messages/tool/tool_messages/path_tool.rs:3020-3025 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/tool/tool_messages/pen_tool.rs:1325— editor/src/messages/tool/tool_messages/pen_tool.rs:1325-1330 | editor/src/messages/tool/tool_messages/pen_tool.rs:1419-1425 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) node-graph/libraries/rendering/src/renderer.rs:2033— node-graph/libraries/rendering/src/renderer.rs:2033-2038 | node-graph/libraries/rendering/src/renderer.rs:2047-2052 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:182— node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:182-187 | node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:192-197 — 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) node-graph/nodes/text/src/lib.rs:626— node-graph/nodes/text/src/lib.rs:626-631 | node-graph/nodes/text/src/lib.rs:638-643 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) node-graph/nodes/text/src/regex.rs:25— node-graph/nodes/text/src/regex.rs:25-30 | node-graph/nodes/text/src/regex.rs:68-73 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) node-graph/nodes/gstd/src/platform_application_io.rs:166— node-graph/nodes/gstd/src/platform_application_io.rs:166-171 | node-graph/nodes/raster/src/std_nodes.rs:198-203 — 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) editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:64— editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:64-69 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:64-69 — before extracting anything, compare `editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs` and `editor/src/messages/tool/common_functionality/shapes/star_shape.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:218— editor/src/messages/tool/tool_messages/path_tool.rs:218-223 | editor/src/messages/tool/tool_messages/path_tool.rs:234-239 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:131— editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:131-136 | editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:107-112 — 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) editor/src/messages/portfolio/document_migration.rs:3173— editor/src/messages/portfolio/document_migration.rs:3173-3178 | editor/src/messages/portfolio/document_migration.rs:3192-3197 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/tool/tool_messages/gradient_tool.rs:1695— editor/src/messages/tool/tool_messages/gradient_tool.rs:1695-1700 | editor/src/messages/tool/tool_messages/gradient_tool.rs:1708-1713 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/portfolio/document_migration.rs:1847— editor/src/messages/portfolio/document_migration.rs:1847-1852 | editor/src/messages/portfolio/document_migration.rs:1858-1863 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) editor/src/messages/frontend/utility_types.rs:128— editor/src/messages/frontend/utility_types.rs:128-133 | node-graph/graphene-cli/src/export.rs:160-165 — 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) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:834— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:834-839 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:733-738 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
NodeNetworkInterface::load_stack_dependents_for_nodes (cognitive 68) editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:122— NodeNetworkInterface::load_stack_dependents_for_nodes has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 11 (21 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::load_structure (cognitive 58) editor/src/messages/portfolio/document/utility_types/network_interface/structure.rs:59— NodeNetworkInterface::load_structure has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 7 (17 pts) (nesting depth added 37). 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.
NodeNetworkInterface::delete_nodes_leaving_dots (cognitive 38) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:970— NodeNetworkInterface::delete_nodes_leaving_dots has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 6 (11 pts), boolean chains 4 (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.
NodeNetworkInterface::set_input (cognitive 35) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:543— NodeNetworkInterface::set_input has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 8, match/switch 4 (5 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::compute_node_click_targets (cognitive 34) editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:10— NodeNetworkInterface::compute_node_click_targets has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::resolve_position (cognitive 34) editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:58— NodeNetworkInterface::resolve_position has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 4 (9 pts), loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::toggle_preview (cognitive 34) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:1442— NodeNetworkInterface::toggle_preview has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
NodeNetworkInterface::upstream_nodes_below_layer (cognitive 31) editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs:520— NodeNetworkInterface::upstream_nodes_below_layer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::move_layer_to_stack (cognitive 30) editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:937— NodeNetworkInterface::move_layer_to_stack has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
NodeNetworkInterface::check_collision_with_stack_dependents (cognitive 29) editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:730— NodeNetworkInterface::check_collision_with_stack_dependents has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::copy_nodes (cognitive 29) editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs:280— NodeNetworkInterface::copy_nodes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::output_type (cognitive 29) editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:644— NodeNetworkInterface::output_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 16). 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.
NodeNetworkInterface::valid_upstream_chain_nodes (cognitive 27) editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:195— NodeNetworkInterface::valid_upstream_chain_nodes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::set_to_node_or_layer (cognitive 26) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:1347— NodeNetworkInterface::set_to_node_or_layer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 2, 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.
NodeNetworkInterface::selection_with_bridging_dots (cognitive 24) editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs:230— NodeNetworkInterface::selection_with_bridging_dots has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::is_sole_dependent (cognitive 23) editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs:409— NodeNetworkInterface::is_sole_dependent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 2 (6 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.
NodeNetworkInterface::complete_valid_input_types (cognitive 23) editor/src/messages/portfolio/document/utility_types/network_interface/resolved_types.rs:576— NodeNetworkInterface::complete_valid_input_types has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 4 (8 pts) (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
NodeNetworkInterface::mirror (cognitive 21) editor/src/messages/portfolio/document/utility_types/network_interface/apply.rs:18— NodeNetworkInterface::mirror has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (7 pts) (nesting depth added 10). 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.
NodeNetworkInterface::try_set_upstream_to_chain (cognitive 20) editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:247— NodeNetworkInterface::try_set_upstream_to_chain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::remove_references_from_network (cognitive 20) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:1092— NodeNetworkInterface::remove_references_from_network has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::post_node_with_index (cognitive 20) editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs:465— NodeNetworkInterface::post_node_with_index has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 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.
NodeNetworkInterface::combined_document_bounds (cognitive 17) editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs:834— NodeNetworkInterface::combined_document_bounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 2, match/switch 1 (2 pts), 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.
NodeNetworkInterface::compute_outward_wires (cognitive 16) editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:469— NodeNetworkInterface::compute_outward_wires has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 6 (8 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetworkInterface::shift_node (cognitive 16) editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:810— NodeNetworkInterface::shift_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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.
ClassTooLong: NodeGraphMessageHandler editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:58— ClassTooLong — 2659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 38 methods, 5 blocks, lines 58-4071. The bar is 400 significant lines; this is 2259 over it, 6.65× 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: PathToolFsmState editor/src/messages/tool/tool_messages/path_tool.rs:562— ClassTooLong — 1120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods, 2 blocks, lines 562-3305. The bar is 400 significant lines; this is 720 over it, 2.80× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ShapeState editor/src/messages/tool/common_functionality/shape_editor.rs:157— ClassTooLong — 1101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 61 methods, 2 blocks, lines 157-2310. The bar is 400 significant lines; this is 701 over it, 2.75× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: SelectToolFsmState editor/src/messages/tool/tool_messages/select_tool.rs:485— ClassTooLong — 838 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods, 3 blocks, lines 485-2141. The bar is 400 significant lines; this is 438 over it, 2.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: PortfolioMessageHandler editor/src/messages/portfolio/portfolio_message_handler.rs:51— ClassTooLong — 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 3 blocks, lines 51-1303. The bar is 400 significant lines; this is 424 over it, 2.06× 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: PenToolData editor/src/messages/tool/tool_messages/pen_tool.rs:407— ClassTooLong — 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 35 methods, 2 blocks, lines 407-1490. The bar is 400 significant lines; this is 301 over it, 1.75× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: MenuBarMessageHandler editor/src/messages/menu_bar/menu_bar_message_handler.rs:9— ClassTooLong — 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods, 3 blocks, lines 9-792. The bar is 400 significant lines; this is 278 over it, 1.70× 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: OverlayContext editor/src/messages/portfolio/document/overlays/utility_types_web.rs:195— ClassTooLong — 635 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 45 methods, 3 blocks, lines 195-1171. The bar is 400 significant lines; this is 235 over it, 1.59× 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: PathToolData editor/src/messages/tool/tool_messages/path_tool.rs:587— ClassTooLong — 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 26 methods, 2 blocks, lines 587-1575. The bar is 400 significant lines; this is 234 over it, 1.59× 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: ModifyInputsContext editor/src/messages/portfolio/document/graph_operation/utility_types.rs:33— ClassTooLong — 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 48 methods, 2 blocks, lines 33-1014. The bar is 400 significant lines; this is 205 over it, 1.51× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ColorPickerMessageHandler editor/src/messages/color_picker/color_picker_message_handler.rs:15— ClassTooLong — 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 12 methods, 4 blocks, lines 15-823. The bar is 400 significant lines; this is 192 over it, 1.48× 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: PenToolFsmState editor/src/messages/tool/tool_messages/pen_tool.rs:112— ClassTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods, 2 blocks, lines 112-2392. The bar is 400 significant lines; this is 190 over it, 1.48× 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: GradientToolFsmState editor/src/messages/tool/tool_messages/gradient_tool.rs:332— ClassTooLong — 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods, 3 blocks, lines 332-1774. The bar is 400 significant lines; this is 156 over it, 1.39× 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: NodeGraphExecutor editor/src/node_graph_executor.rs:71— ClassTooLong — 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 17 methods, 2 blocks, lines 71-886. The bar is 400 significant lines; this is 110 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: OverlayContextInternal editor/src/messages/portfolio/document/overlays/utility_types_native.rs:488— ClassTooLong — 493 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 46 methods, 3 blocks, lines 488-1280. The bar is 400 significant lines; this is 93 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: App desktop/src/app.rs:31— ClassTooLong — 476 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 10 methods, 3 blocks, lines 31-729. The bar is 400 significant lines; this is 76 over it, 1.19× 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: Color node-graph/libraries/no-std-types/src/color/color_types.rs:265— ClassTooLong — 464 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 68 methods, 11 blocks, lines 212-1044. The bar is 400 significant lines; this is 64 over it, 1.16× 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: TransformLayerMessageHandler editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:80— ClassTooLong — 443 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 4 methods, 3 blocks, lines 80-726. The bar is 400 significant lines; this is 43 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.
ClassTooLong: Lattice node-graph/nodes/vector/src/grid_topology.rs:98— ClassTooLong — 425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 31 methods, 2 blocks, lines 98-796. The bar is 400 significant lines; this is 25 over it, 1.06× 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: Vector node-graph/libraries/vector-types/src/vector/vector_types.rs:22— ClassTooLong — 419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 71 methods, 12 blocks, lines 24-967. The bar is 400 significant lines; this is 19 over it, 1.05× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ShapeToolFsmState editor/src/messages/tool/tool_messages/shape_tool.rs:779— ClassTooLong — 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods, 3 blocks, lines 779-1460. The bar is 400 significant lines; this is 12 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Gradient node-graph/libraries/vector-types/src/gradient.rs:24— ClassTooLong — 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 47 methods, 11 blocks, lines 72-1906. The bar is 400 significant lines; this is 2 over it, 1.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: NodeNetwork node-graph/graph-craft/src/document.rs:538— ClassTooLong — 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 6 blocks, lines 538-1295. The bar is 400 significant lines; this is 1 over it, 1.00× 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.
Change coupling: app.rs ↔ handle_desktop_wrapper_message.rs desktop/src/app.rs:1— `desktop/src/app.rs` and `desktop/wrapper/src/handle_desktop_wrapper_message.rs` change together 100% of the time (12 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `78679a5b` Implement editor level future message handler (#4182); `b100892b` Add support for persistent storage of panel layouts, sizes, and activ…; `2be7790d` Improve UX of importing vs. opening files (#3661) — run `git show` on any of them.
Change coupling: frontend_message.rs ↔ node-graph.ts editor/src/messages/frontend/frontend_message.rs:1— `editor/src/messages/frontend/frontend_message.rs` and `frontend/src/stores/node-graph.ts` change together 95% of the time (19 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are `c6ac909d` Add virtual scrolling to the Layers panel, sending details and thumbn…; `730861f3` Make dragged nodes move smoothly between grid cells (#4766); `0e70f7dd` Improve node graph connector hover feedback, click targets, and impor… — run `git show` on any of them.
Change coupling: app.rs ↔ intercept_frontend_message.rs desktop/src/app.rs:1— `desktop/src/app.rs` and `desktop/wrapper/src/intercept_frontend_message.rs` change together 78% of the time (18 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are `63725ea6` Desktop: Make input routing aware of floating menus (#4498); `78679a5b` Implement editor level future message handler (#4182); `d97fe835` Desktop: Focus app window when loading a document (#4124) — run `git show` on any of them.
Change coupling: handle_desktop_wrapper_message.rs ↔ intercept_frontend_message.rs desktop/wrapper/src/handle_desktop_wrapper_message.rs:1— `desktop/wrapper/src/handle_desktop_wrapper_message.rs` and `desktop/wrapper/src/intercept_frontend_message.rs` change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `78679a5b` Implement editor level future message handler (#4182); `b100892b` Add support for persistent storage of panel layouts, sizes, and activ…; `2be7790d` Improve UX of importing vs. opening files (#3661) — run `git show` on any of them.
Change coupling: graphic.rs ↔ repeat_nodes.rs node-graph/nodes/graphic/src/graphic.rs:1— `node-graph/nodes/graphic/src/graphic.rs` and `node-graph/nodes/repeat/src/repeat_nodes.rs` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 7 shared commits counted here, the most recent 3 are `c91d0cd5` Update all node parameters with appropriate attributes of #[unit(...)…; `2941c740` Replace all node usages of f32 with f64 (#4581); `69585b25` Rename the Graphic enum wrapper variants with a "List" suffix (#4434) — run `git show` on any of them.
Change coupling: portfolio_message_handler.rs ↔ Welcome.svelte editor/src/messages/portfolio/portfolio_message_handler.rs:1— `editor/src/messages/portfolio/portfolio_message_handler.rs` and `frontend/src/components/panels/Welcome.svelte` change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `95c1ab81` Prep for the RC6 release of the desktop app; `ab7f59ca` Prep for the RC5 release of the desktop app; `83d03ad6` Fix panel docking bugs and polish its behavior (#4087) — run `git show` on any of them.
Change coupling: Layers.svelte ↔ IconButton.svelte frontend/src/components/panels/Layers.svelte:1— `frontend/src/components/panels/Layers.svelte` and `frontend/src/components/widgets/buttons/IconButton.svelte` change together 62% of the time (13 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `a024a810` Add node chains as selectable, draggable icons in the Layers panel (#…; `06e2a049` Implement dragging layers into the group/new/delete buttons in the La…; `938a688f` Polish up the Layers panel design — run `git show` on any of them.
Change coupling: adjustments.rs ↔ image_color_palette.rs node-graph/nodes/raster/src/adjustments.rs:1— `node-graph/nodes/raster/src/adjustments.rs` and `node-graph/nodes/raster/src/image_color_palette.rs` change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `f05a644b` Revamp the syntax to #[hard(a..b)] and #[soft(a..b)] bounds on node d…; `f42d12da` Improve type handling for ints/floats with the #[hard/soft_min/max(..…; `fdb09e33` Improve the categorization across many nodes (at that commit the files were still `node-graph/gcore/src/raster/adjustments.rs` and `node-graph/gstd/src/image_color_palette.rs`) — run `git show` on any of them.
Change coupling: adjustments.rs ↔ blending_nodes.rs node-graph/nodes/raster/src/adjustments.rs:1— `node-graph/nodes/raster/src/adjustments.rs` and `node-graph/nodes/raster/src/blending_nodes.rs` change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `c91d0cd5` Update all node parameters with appropriate attributes of #[unit(...)…; `951339a6` Move the adjustment nodes to 64-bit precision number parameters (#4579); `506690d1` Fix the 'Mix' and 'Color Overlay' nodes to use spec-compliant math fo… — run `git show` on any of them.
Change coupling: new_document_dialog_message_handler.rs ↔ portfolio_message_handler.rs editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:1— `editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs` and `editor/src/messages/portfolio/portfolio_message_handler.rs` change together 55% of the time (11 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 11 shared commits counted here, the most recent 3 are `83d03ad6` Fix panel docking bugs and polish its behavior (#4087); `ba63c26c` Replace the Artboard struct with a Table<Table<Graphic>> shape (#4077); `da45ab2f` Add a checkered background to transparent artboards and the infinite … — run `git show` on any of them.
Change coupling: render_cache.rs ↔ render_node.rs node-graph/nodes/gstd/src/render_cache.rs:1— `node-graph/nodes/gstd/src/render_cache.rs` and `node-graph/nodes/gstd/src/render_node.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `58b8aeb0` Fix viewport zoom perf regression caused by #3848 (#4749); `a040362d` Change footprint to always be in physical instead of logical space (#…; `29f6e686` Reimplement checkered background rendering (#4034) — run `git show` on any of them.
Change coupling: transform_utils.rs ↔ document_node_definitions.rs editor/src/messages/portfolio/document/graph_operation/transform_utils.rs:1— `editor/src/messages/portfolio/document/graph_operation/transform_utils.rs` and `editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `332088bc` Make the Transform node use angles in degrees instead of radians for …; `a6af5d48` Memoize hashing (#1876) (at that commit the file was still `editor/src/messages/portfolio/document/node_graph/document_node_types.rs`); `5bca9318` Rename handle mirroring to colinear (at that commit the files were still `editor/src/messages/portfolio/document/node_graph/graph_operation_message_handler/transform_utils.rs` and `editor/src/messages/portfolio/document/node_graph/node_graph_message_handler/document_node_types.rs`) — run `git show` on any of them.
Change coupling: frontend_message.rs ↔ files.ts editor/src/messages/frontend/frontend_message.rs:1— `editor/src/messages/frontend/frontend_message.rs` and `frontend/src/utility-functions/files.ts` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `c2afc07a` Move file filter creation from frontend to editor (#4351); `2be7790d` Improve UX of importing vs. opening files (#3661); `96a1b12a` Desktop: Unify save file handling and add file dialog for export (#3008) — run `git show` on any of them.
Change coupling: layout_message_handler.rs ↔ WidgetSpan.svelte editor/src/messages/layout/layout_message_handler.rs:1— `editor/src/messages/layout/layout_message_handler.rs` and `frontend/src/components/widgets/WidgetSpan.svelte` change together 53% of the time (23 of the 43 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are `76039460` Turn the Properties panel into a tree of the chains feeding each node…; `23e6b0f1` Make the dropdown widget's file drop a callback and keep stray file d…; `eb4a1223` Rename the SpectrumInput widget to SliderInput (#4541) — run `git show` on any of them.
Change coupling: Document.svelte ↔ IconButton.svelte frontend/src/components/panels/Document.svelte:1— `frontend/src/components/panels/Document.svelte` and `frontend/src/components/widgets/buttons/IconButton.svelte` change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `01499de8` Make the tool shelf adapt to multiple columns and improve panel scrol…; `e877eea4` Fix all remaining Vue/TS errors flagged in Volar (at that commit the files were still `frontend/src/components/panels/Document.vue` and `frontend/src/components/widgets/buttons/IconButton.vue`); `5518384e` Vue/TS bug and bad typing fixes (at that commit the files were still `frontend/src/components/panels/Document.vue` and `frontend/src/components/widgets/buttons/IconButton.vue`) — run `git show` on any of them.
Change coupling: node_registry.rs ↔ lib.rs node-graph/interpreted-executor/src/node_registry.rs:1— `node-graph/interpreted-executor/src/node_registry.rs` and `node-graph/libraries/raster-types/src/lib.rs` change together 51% of the time (25 of the 49 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are `e238753a` Implement clipping masks, stroke align, and stroke paint order (#2644) (at that commit the file was still `node-graph/gcore/src/raster.rs`); `a8e209e4` Remove the old node macro and fix/clean up several raster nodes (#2650) (at that commit the file was still `node-graph/gcore/src/raster.rs`); `349ec5da` Add MemoizeImpure node and cache image base64 in graph (#1595) (at that commit the file was still `node-graph/gcore/src/raster.rs`) — run `git show` on any of them.
Change coupling: freehand_tool.rs ↔ spline_tool.rs editor/src/messages/tool/tool_messages/freehand_tool.rs:1— `editor/src/messages/tool/tool_messages/freehand_tool.rs` and `editor/src/messages/tool/tool_messages/spline_tool.rs` change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `5612b636` Extend open paths from endpoints with the Freehand tool and skip hidd…; `97430120` Revert #1594 and #1623 so the Freehand tool no longer extends existin…; `525e49f7` Make the Shape tool's modes' parameter controls sync with the selecte… — run `git show` on any of them.
Change coupling: freehand_tool.rs ↔ pen_tool.rs editor/src/messages/tool/tool_messages/freehand_tool.rs:1— `editor/src/messages/tool/tool_messages/freehand_tool.rs` and `editor/src/messages/tool/tool_messages/pen_tool.rs` change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `525e49f7` Make the Shape tool's modes' parameter controls sync with the selecte…; `93880abc` Experimental vector meshes (#2223); `ed119ad3` Add Freehand tool drawing new subpaths on an existing layer with Shif… — run `git show` on any of them.
Change coupling: context_modification.rs ↔ graphic.rs node-graph/nodes/gcore/src/context_modification.rs:1— `node-graph/nodes/gcore/src/context_modification.rs` and `node-graph/nodes/graphic/src/graphic.rs` change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `2941c740` Replace all node usages of f32 with f64 (#4581); `644e9cf9` New nodes: 'Attach Attribute' and 'Read Attribute *' (#4100); `a0d5f418` Replace Table<Table<Graphic>> with Table<Artboard> where Artboard is … — run `git show` on any of them.
Change coupling: animation.rs ↔ context_modification.rs node-graph/nodes/gcore/src/animation.rs:1— `node-graph/nodes/gcore/src/animation.rs` and `node-graph/nodes/gcore/src/context_modification.rs` change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `02a60ce5` Add animation curves and animation curve node input preprocessing (#…; `2941c740` Replace all node usages of f32 with f64 (#4581); `a0d5f418` Replace Table<Table<Graphic>> with Table<Artboard> where Artboard is … — run `git show` on any of them.
Change coupling: color_picker_message_handler.rs ↔ gradient_tool.rs editor/src/messages/color_picker/color_picker_message_handler.rs:1— `editor/src/messages/color_picker/color_picker_message_handler.rs` and `editor/src/messages/tool/tool_messages/gradient_tool.rs` change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `681b4033` Add a gradient interpolation attribute with Stepped, Linear (existing…; `4b01abe3` Add a "Cyclic" gradient option that closes the ramp into a seamless l…; `3f082c88` Make gradient evaluation follow the ramp's interpolation space attrib… — run `git show` on any of them.
Change coupling: artboard.rs ↔ lib.rs node-graph/libraries/graphic-types/src/artboard.rs:1— `node-graph/libraries/graphic-types/src/artboard.rs` and `node-graph/nodes/blending/src/lib.rs` 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 — 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 `4474de46` Replace the AlphaBlending struct with separate attributes (#4086); `0847d7b0` Centralize attribute strings in consts and rename "editor:layer" to "…; `6d669ad7` Add documentation to many nodes (#3338) (at that commit the files were still `node-graph/gcore/src/artboard.rs` and `node-graph/gcore/src/blending_nodes.rs`) — run `git show` on any of them.
Change coupling: document_migration.rs ↔ icons.ts editor/src/messages/portfolio/document_migration.rs:1— `editor/src/messages/portfolio/document_migration.rs` and `frontend/src/icons.ts` 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 — 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `c7bca0ca` Remove the 'Serialize', 'Empty Image', and 'Sample Image' nodes (#4786); `205e570f` Rename 'List Length' to 'Count', 'Auto-Tangents' to 'Smooth Anchors',…; `bdec449e` Add a 'Reverse Paths' node and pluralize 'Separate Paths' and 'Close … — run `git show` on any of them.
graphite_editor::messages::portfolio::document_migration::migrate_node (cyclomatic 256) editor/src/messages/portfolio/document_migration.rs:1828— graphite_editor::messages::portfolio::document_migration::migrate_node has cyclomatic complexity 256 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
graphite_editor::messages::portfolio::document_migration::document_migration_upgrades (cyclomatic 98) editor/src/messages/portfolio/document_migration.rs:1198— graphite_editor::messages::portfolio::document_migration::document_migration_upgrades has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type (cyclomatic 72) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:286— graphite_editor::messages::portfolio::document::node_graph::node_inspector::inspector_row_from_type has cyclomatic complexity 72 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path (cyclomatic 72) editor/src/messages/portfolio/document/utility_types/wires.rs:148— graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_path has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints (cyclomatic 36) editor/src/messages/tool/tool_messages/path_tool.rs:3557— graphite_editor::messages::tool::tool_messages::path_tool::update_dynamic_hints has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector (cyclomatic 33) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:899— graphite_editor::messages::portfolio::document::node_graph::document_node_definitions::static_input_inspector has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector (cyclomatic 32) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:2061— graphite_editor::messages::portfolio::document::node_graph::node_inspector::hue_saturation_inspector has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays (cyclomatic 31) editor/src/messages/portfolio/document/overlays/utility_functions.rs:332— graphite_editor::messages::portfolio::document::overlays::utility_functions::path_marker_overlays has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section (cyclomatic 29) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1884— graphite_editor::messages::portfolio::document::node_graph::node_inspector::build_shared_slider_section 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.
graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection (cyclomatic 26) editor/src/messages/tool/tool_messages/shape_tool.rs:316— graphite_editor::messages::tool::tool_messages::shape_tool::sync_shape_options_from_selection 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.
graphite_editor::messages::tool::tool_messages::shape_tool::update_dynamic_hints (cyclomatic 26) editor/src/messages/tool/tool_messages/shape_tool.rs:1495— graphite_editor::messages::tool::tool_messages::shape_tool::update_dynamic_hints has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments (cyclomatic 24) editor/src/messages/portfolio/document_migration.rs:3495— graphite_editor::messages::portfolio::document_migration::modifications_following_turned_segments 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.
graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays (cyclomatic 23) editor/src/messages/portfolio/document/overlays/utility_functions.rs:488— graphite_editor::messages::portfolio::document::overlays::utility_functions::index_label_overlays 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.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector (cyclomatic 22) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:3102— graphite_editor::messages::portfolio::document::node_graph::node_inspector::generate_node_inspector has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions (cyclomatic 22) editor/src/messages/portfolio/document_migration.rs:3646— graphite_editor::messages::portfolio::document_migration::migrate_removed_catalog_definitions has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector (cyclomatic 21) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:3316— graphite_editor::messages::portfolio::document::node_graph::node_inspector::fill_inspector has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath (cyclomatic 20) editor/src/messages/portfolio/document/utility_types/wires.rs:472— graphite_editor::messages::portfolio::document::utility_types::wires::straight_wire_to_bezpath 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.
graphite_editor::messages::tool::common_functionality::measure::measurement_marks (cyclomatic 19) editor/src/messages/tool/common_functionality/measure.rs:267— graphite_editor::messages::tool::common_functionality::measure::measurement_marks has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options (cyclomatic 17) editor/src/messages/tool/common_functionality/color_selector.rs:225— graphite_editor::messages::tool::common_functionality::color_selector::sync_color_options 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.
graphite_editor::messages::portfolio::document::document_diff::diff_registries (cyclomatic 16) editor/src/messages/portfolio/document/document_diff.rs:7— graphite_editor::messages::portfolio::document::document_diff::diff_registries 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.
graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays (cyclomatic 16) editor/src/messages/portfolio/document/overlays/utility_functions.rs:193— graphite_editor::messages::portfolio::document::overlays::utility_functions::path_overlays 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.
TooManyMethods: NodeNetworkInterface editor/src/messages/portfolio/document/utility_types/network_interface.rs:70— TooManyMethods — 352 methods, declared across 14 files: network_interface/queries.rs (87), network_interface/caches.rs (64), network_interface/mutations.rs (56), network_interface/layout.rs (55), +10 more file(s). The bar is 30 methods; this is 322 over it, 11.73× 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: DocumentMessageHandler editor/src/messages/portfolio/document/document_message_handler.rs:88— TooManyMethods — 73 methods. The bar is 30 methods; this is 43 over it, 2.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Vector node-graph/libraries/vector-types/src/vector/vector_types.rs:22— TooManyMethods — 71 methods, declared across 2 files: vector/vector_types.rs (60), vector/vector_attributes.rs (11). The bar is 30 methods; this is 41 over it, 2.37× 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: Color node-graph/libraries/no-std-types/src/color/color_types.rs:265— TooManyMethods — 68 methods. The bar is 30 methods; this is 38 over it, 2.27× 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: ShapeState editor/src/messages/tool/common_functionality/shape_editor.rs:157— TooManyMethods — 61 methods. The bar is 30 methods; this is 31 over it, 2.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: VectorGeometry node-graph/libraries/vector-types/src/vector/geometry.rs:14— TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Session document/graph-storage/src/session.rs:16— TooManyMethods — 50 methods. The bar is 30 methods; this is 20 over it, 1.67× 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: Gdd document/format/src/lib.rs:70— TooManyMethods — 49 methods, declared across 4 files: src/persist.rs (20), src/lib.rs (18), src/resource.rs (7), src/export.rs (4). The bar is 30 methods; this is 19 over it, 1.63× 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: ModifyInputsContext editor/src/messages/portfolio/document/graph_operation/utility_types.rs:33— TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Gradient node-graph/libraries/vector-types/src/gradient.rs:24— TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: OverlayContextInternal editor/src/messages/portfolio/document/overlays/utility_types_native.rs:488— TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: NetworkView editor/src/messages/portfolio/document/utility_types/network_interface/view.rs:23— TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: OverlayContext editor/src/messages/portfolio/document/overlays/utility_types_web.rs:195— 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: OverlayContext editor/src/messages/portfolio/document/overlays/utility_types_native.rs:209— TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× 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: NodeGraphMessageHandler editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:58— TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× 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: DocumentMetadata editor/src/messages/portfolio/document/utility_types/document_metadata.rs:28— TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PenToolData editor/src/messages/tool/tool_messages/pen_tool.rs:407— TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Matrix libraries/math-parser/src/matrix.rs:10— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: List node-graph/libraries/core-types/src/list.rs:1342— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Curve libraries/snapping/src/curve.rs:41— 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: Lattice node-graph/nodes/vector/src/grid_topology.rs:98— 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.
vector_nodes::vector_nodes::morph (cognitive 120) node-graph/nodes/vector/src/vector_nodes.rs:2756— vector_nodes::vector_nodes::morph has cognitive complexity 120 (threshold 15). Drivers by points: if/else 81 (110 pts), loops 16 (24 pts), match/switch 9 (15 pts), boolean chains 10 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (vector_nodes::vector_nodes::morph::lerp_appearance) 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.
vector_nodes::merge_qr_squares::merge_qr_squares (cognitive 102) node-graph/nodes/vector/src/merge_qr_squares.rs:8— vector_nodes::merge_qr_squares::merge_qr_squares has cognitive complexity 102 (threshold 15). Drivers by points: if/else 11 (46 pts), loops 13 (44 pts), match/switch 1 (7 pts), boolean chains 5 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::grid_topology::fewest_trails (cognitive 63) node-graph/nodes/vector/src/grid_topology.rs:884— vector_nodes::grid_topology::fewest_trails has cognitive complexity 63 (threshold 15). Drivers by points: loops 16 (31 pts), if/else 7 (18 pts), match/switch 3 (11 pts), boolean chains 3 (nesting depth added 34). 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.
vector_nodes::vector_nodes::smooth_anchors (cognitive 43) node-graph/nodes/vector/src/vector_nodes.rs:1327— vector_nodes::vector_nodes::smooth_anchors has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::vector_nodes::replace_with_polygons (cognitive 37) node-graph/nodes/vector/src/vector_nodes.rs:1664— vector_nodes::vector_nodes::replace_with_polygons has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (13 pts), match/switch 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::grid_topology::pair_odd_points (cognitive 33) node-graph/nodes/vector/src/grid_topology.rs:1025— vector_nodes::grid_topology::pair_odd_points has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 8 (13 pts), boolean chains 5 (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.
vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments (cognitive 31) node-graph/nodes/vector/src/vector_nodes.rs:3585— vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split, vector_nodes::vector_nodes::bevel_algorithm::sort_segments) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
vector_nodes::vector_nodes::decimate (cognitive 29) node-graph/nodes/vector/src/vector_nodes.rs:2219— vector_nodes::vector_nodes::decimate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 2 function items inside it that branch (rdp_simplify, perpendicular_distance). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
vector_nodes::vector_nodes::spline (cognitive 24) node-graph/nodes/vector/src/vector_nodes.rs:2527— vector_nodes::vector_nodes::spline has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 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.
vector_nodes::vector_nodes::copy_to_points (cognitive 23) node-graph/nodes/vector/src/vector_nodes.rs:527— vector_nodes::vector_nodes::copy_to_points has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::vector_nodes::fill (cognitive 22) node-graph/nodes/vector/src/vector_nodes.rs:358— vector_nodes::vector_nodes::fill has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (6 pts), match/switch 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::vector_nodes::round_subpath_corners (cognitive 22) node-graph/nodes/vector/src/vector_nodes.rs:679— vector_nodes::vector_nodes::round_subpath_corners has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split (cognitive 21) node-graph/nodes/vector/src/vector_nodes.rs:3478— vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (vector_nodes::vector_nodes::bevel_algorithm::sort_segments, vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
vector_nodes::vector_nodes::pack_strips (cognitive 19) node-graph/nodes/vector/src/vector_nodes.rs:1204— vector_nodes::vector_nodes::pack_strips has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4, loops 2 (3 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.
vector_nodes::grid_topology::gilbert_curve (cognitive 18) node-graph/nodes/vector/src/grid_topology.rs:831— vector_nodes::grid_topology::gilbert_curve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (generate). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
vector_nodes::voronoi::clip_to_convex (cognitive 17) node-graph/nodes/vector/src/voronoi.rs:218— vector_nodes::voronoi::clip_to_convex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::vector_nodes::assign_colors (cognitive 16) node-graph/nodes/vector/src/vector_nodes.rs:269— vector_nodes::vector_nodes::assign_colors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::vector_nodes::morph::lerp_appearance (cognitive 16) node-graph/nodes/vector/src/vector_nodes.rs:2951— vector_nodes::vector_nodes::morph::lerp_appearance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (vector_nodes::vector_nodes::morph) 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.
vector_nodes::vector_nodes::bevel_algorithm::sort_segments (cognitive 16) node-graph/nodes/vector/src/vector_nodes.rs:3553— vector_nodes::vector_nodes::bevel_algorithm::sort_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (vector_nodes::vector_nodes::bevel_algorithm::calculate_distance_to_split, vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
vector_types::vector::flatten::chain_order (cognitive 85) node-graph/libraries/vector-types/src/vector/flatten.rs:313— vector_types::vector::flatten::chain_order has cognitive complexity 85 (threshold 15). Drivers by points: if/else 25 (58 pts), loops 9 (15 pts), boolean chains 9, match/switch 1 (3 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_types::vector::algorithms::concave_hull::refine_cycle (cognitive 66) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1390— vector_types::vector::algorithms::concave_hull::refine_cycle has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 8 (11 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_types::vector::algorithms::concave_hull::trace_hull (cognitive 43) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:946— vector_types::vector::algorithms::concave_hull::trace_hull has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 10 (14 pts), boolean chains 7 (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.
vector_types::vector::algorithms::concave_hull::emit_cycle (cognitive 40) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1648— vector_types::vector::algorithms::concave_hull::emit_cycle has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (10 pts), loops 7 (9 pts), boolean chains 4 (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.
vector_types::vector::algorithms::concave_hull::end_candidates (cognitive 37) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1217— vector_types::vector::algorithms::concave_hull::end_candidates has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_types::vector::algorithms::concave_hull::solve_span (cognitive 37) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1271— vector_types::vector::algorithms::concave_hull::solve_span has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (8 pts), boolean chains 7, match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_types::vector::algorithms::offset_bezpath::offset_bezpath (cognitive 37) node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.rs:14— vector_types::vector::algorithms::offset_bezpath::offset_bezpath has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 2 (6 pts), boolean chains 2, 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.
vector_types::vector::algorithms::weld::weld_nearby_points (cognitive 37) node-graph/libraries/vector-types/src/vector/algorithms/weld.rs:385— vector_types::vector::algorithms::weld::weld_nearby_points has cognitive complexity 37 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 8 (16 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_types::vector::contour::contours_with (cognitive 35) node-graph/libraries/vector-types/src/vector/contour.rs:94— vector_types::vector::contour::contours_with has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_types::vector::algorithms::convex_hull::refine_transitions (cognitive 31) node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:486— vector_types::vector::algorithms::convex_hull::refine_transitions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (7 pts), loops 3 (5 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.
vector_types::vector::algorithms::concave_hull::extract_pieces (cognitive 27) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1099— vector_types::vector::algorithms::concave_hull::extract_pieces has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (8 pts), boolean chains 2, 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.
vector_types::vector::algorithms::poisson_disk::poisson_disk_sample (cognitive 25) node-graph/libraries/vector-types/src/vector/algorithms/poisson_disk.rs:11— vector_types::vector::algorithms::poisson_disk::poisson_disk_sample has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, 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.
vector_types::vector::algorithms::convex_hull::normalize_geometry (cognitive 24) node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:145— vector_types::vector::algorithms::convex_hull::normalize_geometry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_types::vector::vector_attributes::reverse_spans_in_place (cognitive 21) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:917— vector_types::vector::vector_attributes::reverse_spans_in_place has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 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.
vector_types::vector::algorithms::concave_hull::normalize_geometry (cognitive 20) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:147— vector_types::vector::algorithms::concave_hull::normalize_geometry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), match/switch 2 (4 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.
vector_types::vector::algorithms::convex_hull::extract_contacts (cognitive 20) node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:413— vector_types::vector::algorithms::convex_hull::extract_contacts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), match/switch 3 (4 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.
vector_types::vector::algorithms::concave_hull::strand_partners (cognitive 18) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1841— vector_types::vector::algorithms::concave_hull::strand_partners has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), match/switch 3 (6 pts), boolean chains 3, loops 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.
vector_types::gradient::hue_delta (cognitive 17) node-graph/libraries/vector-types/src/gradient.rs:488— vector_types::gradient::hue_delta has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 4). 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.
vector_types::vector::algorithms::bezpath_algorithms::compute_sample_locations (cognitive 17) node-graph/libraries/vector-types/src/vector/algorithms/bezpath_algorithms.rs:87— vector_types::vector::algorithms::bezpath_algorithms::compute_sample_locations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 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.
Duplicated block (8 lines × 2) editor/src/messages/clipboard/clipboard_message_handler.rs:453— editor/src/messages/clipboard/clipboard_message_handler.rs:453-460 | editor/src/messages/tool/tool_messages/path_tool.rs:2898-2907 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) editor/src/messages/color_picker/color_picker_message_handler.rs:82— editor/src/messages/color_picker/color_picker_message_handler.rs:82-89 | editor/src/messages/color_picker/color_picker_message_handler.rs:92-99 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:85— editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs:85-92 | editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs:74-81 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:344— editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:344-351 | editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:378-385 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) editor/src/messages/portfolio/document_migration.rs:3630— editor/src/messages/portfolio/document_migration.rs:3630-3637 | editor/src/messages/portfolio/document_storage_io.rs:346-354 — 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) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:109— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:109-116 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:127-134 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) editor/src/messages/tool/common_functionality/graph_modification_utils.rs:549— editor/src/messages/tool/common_functionality/graph_modification_utils.rs:549-556 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:569-576 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:64— editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:64-71 | editor/src/messages/tool/common_functionality/shapes/line_shape.rs:78-85 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) editor/src/messages/tool/common_functionality/utility_functions.rs:406— editor/src/messages/tool/common_functionality/utility_functions.rs:406-413 | editor/src/messages/tool/tool_messages/text_tool.rs:751-758 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:2788— editor/src/messages/tool/tool_messages/path_tool.rs:2788-2795 | editor/src/messages/tool/tool_messages/path_tool.rs:2993-3000 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) node-graph/libraries/core-types/src/list.rs:782— node-graph/libraries/core-types/src/list.rs:782-789 | node-graph/libraries/core-types/src/list.rs:1312-1319 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) node-graph/libraries/rendering/src/renderer.rs:850— node-graph/libraries/rendering/src/renderer.rs:850-857 | node-graph/libraries/rendering/src/renderer.rs:1693-1700 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:190— node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:190-197 | node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:250-257 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) document/container/src/backends/opfs.rs:224— document/container/src/backends/opfs.rs:224-231 | node-graph/graph-craft/src/application_io/resource/opfs.rs:119-127 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:719— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:719-726 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:634-641 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) editor/src/messages/tool/tool_messages/fill_tool.rs:109— editor/src/messages/tool/tool_messages/fill_tool.rs:109-116 | editor/src/messages/tool/tool_messages/path_tool.rs:524-531 — 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) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1286— editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1286-1293 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1297-1304 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1139— editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1139-1146 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1161-1168 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1249— editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1249-1256 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1260-1267 — 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) editor/src/messages/portfolio/document/graph_operation/utility_types.rs:163— editor/src/messages/portfolio/document/graph_operation/utility_types.rs:163-169 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:172-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.
Duplicated block (7 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_web.rs:500— editor/src/messages/portfolio/document/overlays/utility_types_web.rs:500-506 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:608-615 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:63— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:63-69 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:78-84 — 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) editor/src/messages/tool/tool_messages/path_tool.rs:2404— editor/src/messages/tool/tool_messages/path_tool.rs:2404-2410 | editor/src/messages/tool/tool_messages/path_tool.rs:2647-2653 — 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) editor/src/messages/tool/tool_messages/text_tool.rs:989— editor/src/messages/tool/tool_messages/text_tool.rs:989-995 | editor/src/messages/tool/tool_messages/text_tool.rs:1030-1036 — 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) node-graph/libraries/rendering/src/renderer.rs:2466— node-graph/libraries/rendering/src/renderer.rs:2466-2472 | node-graph/libraries/rendering/src/renderer.rs:2607-2613 — 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) node-graph/node-macro/src/codegen.rs:620— node-graph/node-macro/src/codegen.rs:620-626 | node-graph/node-macro/src/codegen.rs:656-662 — 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) node-graph/nodes/math/src/lib.rs:1185— node-graph/nodes/math/src/lib.rs:1185-1191 | node-graph/nodes/math/src/lib.rs:1203-1209 — 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) node-graph/nodes/raster/src/filter.rs:234— node-graph/nodes/raster/src/filter.rs:234-240 | node-graph/nodes/raster/src/filter.rs:280-286 — 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) proc-macros/src/message_handler_data_attr.rs:54— proc-macros/src/message_handler_data_attr.rs:54-60 | proc-macros/src/message_handler_data_attr.rs:86-92 — 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) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1255— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1255-1261 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1146-1152 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1263— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1263-1269 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1154-1160 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1309— editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1309-1315 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1367-1374 — 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) node-graph/node-macro/src/validation.rs:304— node-graph/node-macro/src/validation.rs:304-310 | node-graph/node-macro/src/validation.rs:326-332 — 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) editor/src/messages/portfolio/document_storage_io.rs:74— editor/src/messages/portfolio/document_storage_io.rs:74-80 | editor/src/messages/portfolio/document_storage_io.rs:158-164 — 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) editor/src/messages/tool/tool_messages/artboard_tool.rs:668— editor/src/messages/tool/tool_messages/artboard_tool.rs:668-674 | editor/src/messages/tool/tool_messages/text_tool.rs:1145-1151 — 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) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1273— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1273-1279 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1164-1170 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) document/graph-storage/src/document.rs:235— document/graph-storage/src/document.rs:235-244 | document/graph-storage/src/document.rs:292-301 — 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) editor/src/messages/layout/utility_types/layout_widget.rs:285— editor/src/messages/layout/utility_types/layout_widget.rs:285-294 | editor/src/messages/layout/utility_types/layout_widget.rs:337-346 — 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) editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:707— editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:707-716 | node-graph/libraries/rendering/src/renderer.rs:2410-2419 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) editor/src/messages/portfolio/document/document_message_handler.rs:3805— editor/src/messages/portfolio/document/document_message_handler.rs:3805-3814 | editor/src/messages/portfolio/document/document_message_handler.rs:3827-3836 — 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) editor/src/messages/portfolio/portfolio_message_handler.rs:967— editor/src/messages/portfolio/portfolio_message_handler.rs:967-976 | editor/src/messages/portfolio/portfolio_message_handler.rs:998-1007 — 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) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:204— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:204-213 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:217-226 — 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) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:230— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:230-239 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/grid_rows_columns_gizmo.rs:243-252 — 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) editor/src/messages/tool/tool_messages/shape_tool.rs:1201— editor/src/messages/tool/tool_messages/shape_tool.rs:1201-1210 | editor/src/messages/tool/tool_messages/shape_tool.rs:1216-1225 — 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) libraries/math-parser/src/executer.rs:387— libraries/math-parser/src/executer.rs:387-396 | libraries/math-parser/src/executer.rs:543-552 — 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) libraries/rawkit/src/tiff/types.rs:314— libraries/rawkit/src/tiff/types.rs:314-323 | libraries/rawkit/src/tiff/types.rs:339-348 — 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) node-graph/nodes/brush/src/basic_brush/convert.rs:66— node-graph/nodes/brush/src/basic_brush/convert.rs:66-75 | node-graph/nodes/brush/src/basic_brush/pipeline.rs:394-403 — 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) node-graph/nodes/gstd/src/platform_application_io.rs:61— node-graph/nodes/gstd/src/platform_application_io.rs:61-70 | node-graph/nodes/gstd/src/platform_application_io.rs:98-107 — 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) document/container/src/lib.rs:106— document/container/src/lib.rs:106-115 | node-graph/graph-craft/src/application_io/resource/mmap.rs:150-159 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:35— editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:35-44 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:35-44 — before extracting anything, compare `editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs` and `editor/src/messages/tool/common_functionality/shapes/star_shape.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:687— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:687-696 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:560-569 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:954— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:954-963 | editor/src/messages/portfolio/document/overlays/utility_types_native.rs:966-975 — 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) editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:178— editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:178-186 | editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:268-276 — 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) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1190— editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1190-1198 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1205-1213 — 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) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:465— editor/src/messages/portfolio/document/node_graph/node_inspector.rs:465-473 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:535-543 — 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) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:659— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:659-667 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:523-531 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) editor/src/messages/portfolio/document_migration.rs:3271— editor/src/messages/portfolio/document_migration.rs:3271-3279 | editor/src/messages/portfolio/document_migration.rs:3332-3340 — 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) editor/src/messages/portfolio/workspace/workspace_message_handler.rs:71— editor/src/messages/portfolio/workspace/workspace_message_handler.rs:71-79 | editor/src/messages/portfolio/workspace/workspace_message_handler.rs:214-222 — 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) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/spiral_turns_handle.rs:261— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/spiral_turns_handle.rs:261-269 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/spiral_turns_handle.rs:274-282 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:3703— editor/src/messages/tool/tool_messages/path_tool.rs:3703-3711 | editor/src/messages/tool/tool_messages/path_tool.rs:3713-3721 — 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) editor/src/messages/tool/tool_messages/text_tool.rs:349— editor/src/messages/tool/tool_messages/text_tool.rs:349-357 | editor/src/messages/tool/tool_messages/text_tool.rs:364-372 — 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) node-graph/libraries/vector-types/src/vector/style.rs:262— node-graph/libraries/vector-types/src/vector/style.rs:262-270 | node-graph/nodes/vector/src/vector_nodes.rs:3211-3219 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:46— editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:46-54 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:46-54 — before extracting anything, compare `editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs` and `editor/src/messages/tool/common_functionality/shapes/star_shape.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:78— editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:78-86 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:78-86 — before extracting anything, compare `editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs` and `editor/src/messages/tool/common_functionality/shapes/star_shape.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) editor/src/messages/clipboard/clipboard_message_handler.rs:257— editor/src/messages/clipboard/clipboard_message_handler.rs:257-265 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:1901-1910 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) node-graph/nodes/brush/src/basic_brush/pipeline.rs:178— node-graph/nodes/brush/src/basic_brush/pipeline.rs:178-186 | node-graph/nodes/brush/src/basic_brush/pipeline.rs:282-290 — 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) node-graph/nodes/gstd/src/render_background.rs:212— node-graph/nodes/gstd/src/render_background.rs:212-220 | node-graph/nodes/gstd/src/render_background.rs:241-249 — 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.
ShapeState::convert_selected_manipulators_to_colinear_handles (cognitive 86) editor/src/messages/tool/common_functionality/shape_editor.rs:1116— ShapeState::convert_selected_manipulators_to_colinear_handles has cognitive complexity 86 (threshold 15). Drivers by points: if/else 22 (72 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::delete_selected_points (cognitive 72) editor/src/messages/tool/common_functionality/shape_editor.rs:1441— ShapeState::delete_selected_points has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 7 (19 pts), boolean chains 5, match/switch 1 (3 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.
ShapeState::get_inside_points_and_segments (cognitive 61) editor/src/messages/tool/common_functionality/shape_editor.rs:2193— ShapeState::get_inside_points_and_segments has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 5 (19 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::move_selected_points_and_segments (cognitive 56) editor/src/messages/tool/common_functionality/shape_editor.rs:1242— ShapeState::move_selected_points_and_segments has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (48 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::alternate_selected_handles (cognitive 42) editor/src/messages/tool/common_functionality/shape_editor.rs:1920— ShapeState::alternate_selected_handles has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::flip_smooth_sharp (cognitive 40) editor/src/messages/tool/common_functionality/shape_editor.rs:2050— ShapeState::flip_smooth_sharp has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 4 (14 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::break_path_at_selected_point (cognitive 36) editor/src/messages/tool/common_functionality/shape_editor.rs:1604— ShapeState::break_path_at_selected_point has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 4 (10 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::convert_manipulator_handles_to_colinear (cognitive 30) editor/src/messages/tool/common_functionality/shape_editor.rs:1021— ShapeState::convert_manipulator_handles_to_colinear has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::select_connected (cognitive 27) editor/src/messages/tool/common_functionality/shape_editor.rs:693— ShapeState::select_connected has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::select_all_in_shape (cognitive 26) editor/src/messages/tool/common_functionality/shape_editor.rs:2120— ShapeState::select_all_in_shape has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeState::close_selected_path (cognitive 19) editor/src/messages/tool/common_functionality/shape_editor.rs:491— ShapeState::close_selected_path 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.
ShapeState::disable_colinear_handles_state_on_selected (cognitive 19) editor/src/messages/tool/common_functionality/shape_editor.rs:1687— ShapeState::disable_colinear_handles_state_on_selected has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 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.
ShapeState::select_handles_and_anchor_connected_to_current_handle (cognitive 17) editor/src/messages/tool/common_functionality/shape_editor.rs:1980— ShapeState::select_handles_and_anchor_connected_to_current_handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_macro::codegen::generate_node_code (cognitive 105) node-graph/node-macro/src/codegen.rs:13— node_macro::codegen::generate_node_code has cognitive complexity 105 (threshold 15). Drivers by points: match/switch 42 (49 pts), if/else 30 (40 pts), boolean chains 10, loops 2 (6 pts) (nesting depth added 21). 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.
node_macro::codegen::generate_register_node_impl (cognitive 46) node-graph/node-macro/src/codegen.rs:1300— node_macro::codegen::generate_register_node_impl has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 5 (18 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_macro::validation::ranked_input_violations (cognitive 46) node-graph/node-macro/src/validation.rs:134— node_macro::validation::ranked_input_violations has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 3 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_macro::parsing::parse_field (cognitive 30) node-graph/node-macro/src/parsing.rs:859— node_macro::parsing::parse_field has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (25 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_macro::destructure::derive_destructure_impl (cognitive 29) node-graph/node-macro/src/destructure.rs:32— node_macro::destructure::derive_destructure_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 3 (4 pts), loops 2, 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.
node_macro::validation::validate_implementations_for_generics (cognitive 25) node-graph/node-macro/src/validation.rs:401— node_macro::validation::validate_implementations_for_generics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (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.
node_macro::parsing::parse_node_type (cognitive 23) node-graph/node-macro/src/parsing.rs:1098— node_macro::parsing::parse_node_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). 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.
node_macro::parsing::parse_inputs (cognitive 21) node-graph/node-macro/src/parsing.rs:741— node_macro::parsing::parse_inputs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (4 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.
node_macro::validation::validate_min_max (cognitive 19) node-graph/node-macro/src/validation.rs:293— node_macro::validation::validate_min_max has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_macro::validation::validate_no_item_parameters (cognitive 18) node-graph/node-macro/src/validation.rs:30— node_macro::validation::validate_no_item_parameters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_macro::derive_choice_type::derive_enum (cognitive 16) node-graph/node-macro/src/derive_choice_type.rs:69— node_macro::derive_choice_type::derive_enum has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 5, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
vector_nodes::vector_nodes::morph (cyclomatic 78) node-graph/nodes/vector/src/vector_nodes.rs:2756— vector_nodes::vector_nodes::morph has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (vector_nodes::vector_nodes::morph::lerp_appearance) 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.
vector_nodes::merge_qr_squares::merge_qr_squares (cyclomatic 34) node-graph/nodes/vector/src/merge_qr_squares.rs:8— vector_nodes::merge_qr_squares::merge_qr_squares has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
vector_nodes::grid_topology::fewest_trails (cyclomatic 32) node-graph/nodes/vector/src/grid_topology.rs:884— vector_nodes::grid_topology::fewest_trails has cyclomatic complexity 32 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
vector_nodes::vector_nodes::smooth_anchors (cyclomatic 21) node-graph/nodes/vector/src/vector_nodes.rs:1327— vector_nodes::vector_nodes::smooth_anchors 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.
vector_nodes::grid_topology::pair_odd_points (cyclomatic 20) node-graph/nodes/vector/src/grid_topology.rs:1025— vector_nodes::grid_topology::pair_odd_points 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.
vector_nodes::vector_nodes::round_subpath_corners (cyclomatic 18) node-graph/nodes/vector/src/vector_nodes.rs:679— vector_nodes::vector_nodes::round_subpath_corners has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
vector_nodes::vector_nodes::decimate (cyclomatic 17) node-graph/nodes/vector/src/vector_nodes.rs:2219— vector_nodes::vector_nodes::decimate has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body's own statements and 8 belong to 2 function items 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.
vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments (cyclomatic 17) node-graph/nodes/vector/src/vector_nodes.rs:3585— vector_nodes::vector_nodes::bevel_algorithm::update_existing_segments 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.
vector_nodes::vector_nodes::fill (cyclomatic 16) node-graph/nodes/vector/src/vector_nodes.rs:358— vector_nodes::vector_nodes::fill 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.
vector_nodes::vector_nodes::morph::lerp_appearance (cyclomatic 16) node-graph/nodes/vector/src/vector_nodes.rs:2951— vector_nodes::vector_nodes::morph::lerp_appearance has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (vector_nodes::vector_nodes::morph) 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.
math_parser::constants::builtin_function (cognitive 126) libraries/math-parser/src/constants.rs:465— math_parser::constants::builtin_function has cognitive complexity 126 (threshold 15). Drivers by points: if/else 51 (100 pts), match/switch 9 (16 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 58). 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.
math_parser::highlight::highlight (cognitive 49) libraries/math-parser/src/highlight.rs:63— math_parser::highlight::highlight has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 4 (11 pts), boolean chains 6, loops 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
math_parser::completion::completions (cognitive 39) libraries/math-parser/src/completion.rs:84— math_parser::completion::completions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 7, loops 4 (5 pts), match/switch 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
math_parser::constants::combinatorial (cognitive 30) libraries/math-parser/src/constants.rs:308— math_parser::constants::combinatorial has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 3, match/switch 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.
math_parser::highlight::mark_exponents (cognitive 19) libraries/math-parser/src/highlight.rs:336— math_parser::highlight::mark_exponents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 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.
math_parser::constants::clamp_to_region (cognitive 18) libraries/math-parser/src/constants.rs:1001— math_parser::constants::clamp_to_region has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 5). 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.
math_parser::executer::value_of_matrix (cognitive 18) libraries/math-parser/src/executer.rs:450— math_parser::executer::value_of_matrix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 pts), match/switch 2 (3 pts) (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.
math_parser::highlight::draw_literals (cognitive 16) libraries/math-parser/src/highlight.rs:260— math_parser::highlight::draw_literals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
math_parser::lexer::classify_bars (cognitive 16) libraries/math-parser/src/lexer.rs:253— math_parser::lexer::classify_bars has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
math_parser::parser::oversized (cognitive 16) libraries/math-parser/src/parser.rs:185— math_parser::parser::oversized has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 5). Of this number, 14 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (11 lines × 2) editor/src/messages/layout/layout_message_handler.rs:154— editor/src/messages/layout/layout_message_handler.rs:154-164 | editor/src/messages/layout/layout_message_handler.rs:182-192 — 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) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:845— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:845-855 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:744-754 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:98— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:98-108 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:177-187 — 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) editor/src/messages/tool/common_functionality/shape_editor.rs:2267— editor/src/messages/tool/common_functionality/shape_editor.rs:2267-2277 | editor/src/messages/tool/common_functionality/shape_editor.rs:2292-2302 — 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) editor/src/messages/tool/tool_messages/path_tool.rs:1634— editor/src/messages/tool/tool_messages/path_tool.rs:1634-1644 | editor/src/messages/tool/tool_messages/path_tool.rs:1686-1697 — 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) editor/src/messages/tool/tool_messages/path_tool.rs:1659— editor/src/messages/tool/tool_messages/path_tool.rs:1659-1669 | editor/src/messages/tool/tool_messages/path_tool.rs:1712-1722 — 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) editor/src/messages/tool/tool_messages/spline_tool.rs:475— editor/src/messages/tool/tool_messages/spline_tool.rs:475-485 | editor/src/messages/tool/tool_messages/spline_tool.rs:511-521 — 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) node-graph/node-macro/src/codegen.rs:878— node-graph/node-macro/src/codegen.rs:878-888 | node-graph/node-macro/src/codegen.rs:891-901 — 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) editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:88— editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:88-98 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:93-103 — before extracting anything, compare `editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs` and `editor/src/messages/tool/common_functionality/shapes/star_shape.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:311— editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:311-321 | editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:332-344 — 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.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×9
Animation without a prefers-reduced-motion guard frontend/index.html:48— `body::after` moves (`animation: spinning-loading-indicator 1s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard website/sass/template/book.scss:112— `.three-column-layout .chapters .wrapper-outer` moves (`transition: left 0.25s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard website/sass/template/book.scss:88— `.three-column-layout .chapters` moves (`transition: height 0.25s ease-in-out 0.25s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard website/sass/component/carousel.scss:37— `.carousel.carousel:not(.dragging, .jostling) .carousel-slide :is(img, video)` moves (`transition: transform 500ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard website/sass/component/image-comparison.scss:79— `.image-comparison .slide-bar .arrows svg:nth-of-type(1)` moves (`animation: 3s infinite ease-out pulse-left, 3s infinite ease-out pulse-opacity`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard website/sass/component/image-comparison.scss:84— `.image-comparison .slide-bar .arrows svg:nth-of-type(2)` moves (`animation: 3s infinite ease-out pulse-right, 3s infinite ease-out pulse-opacity`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard frontend/src/components/window/Panel.svelte:666— `.panel .docking-ghost` moves (`transition: top 0.2s ease,
left 0.2s ease,
width 0.2s ease,
height 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard frontend/src/components/views/Graph.svelte:1725— `.graph .redirect-dot .dot` moves (`transition: transform 0.1s,
background-color 0.1s,
outline-color 0.1s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard frontend/src/components/views/Graph.svelte:1798— `.graph .connector path` moves (`transition: fill 0.1s,
transform 0.1s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
vector_types::vector::flatten::chain_order (cyclomatic 41) node-graph/libraries/vector-types/src/vector/flatten.rs:313— vector_types::vector::flatten::chain_order has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
vector_types::vector::algorithms::concave_hull::refine_cycle (cyclomatic 37) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1390— vector_types::vector::algorithms::concave_hull::refine_cycle has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
vector_types::vector::algorithms::concave_hull::trace_hull (cyclomatic 29) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:946— vector_types::vector::algorithms::concave_hull::trace_hull 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.
vector_types::vector::algorithms::concave_hull::emit_cycle (cyclomatic 27) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1648— vector_types::vector::algorithms::concave_hull::emit_cycle has cyclomatic complexity 27 (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.
vector_types::vector::algorithms::concave_hull::solve_span (cyclomatic 26) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1271— vector_types::vector::algorithms::concave_hull::solve_span 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.
vector_types::vector::algorithms::offset_bezpath::offset_bezpath (cyclomatic 22) node-graph/libraries/vector-types/src/vector/algorithms/offset_bezpath.rs:14— vector_types::vector::algorithms::offset_bezpath::offset_bezpath has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
vector_types::vector::algorithms::convex_hull::refine_transitions (cyclomatic 19) node-graph/libraries/vector-types/src/vector/algorithms/convex_hull.rs:486— vector_types::vector::algorithms::convex_hull::refine_transitions 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.
vector_types::vector::contour::contours_with (cyclomatic 17) node-graph/libraries/vector-types/src/vector/contour.rs:94— vector_types::vector::contour::contours_with 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.
vector_types::vector::algorithms::concave_hull::end_candidates (cyclomatic 16) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:1217— vector_types::vector::algorithms::concave_hull::end_candidates 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.
rendering::renderer::render_vector_item_to_vello (cognitive 76) node-graph/libraries/rendering/src/renderer.rs:1726— rendering::renderer::render_vector_item_to_vello has cognitive complexity 76 (threshold 15). Drivers by points: if/else 41 (50 pts), match/switch 8 (13 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 17). 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.
rendering::renderer::render_vector_shape_svg (cognitive 37) node-graph/libraries/rendering/src/renderer.rs:1472— rendering::renderer::render_vector_shape_svg has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20, boolean chains 10, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rendering::renderer::collect_vector_items_metadata (cognitive 29) node-graph/libraries/rendering/src/renderer.rs:2090— rendering::renderer::collect_vector_items_metadata has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rendering::convert_usvg_path::convert_usvg_path (cognitive 24) node-graph/libraries/rendering/src/convert_usvg_path.rs:3— rendering::convert_usvg_path::convert_usvg_path 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.
rendering::renderer::render_graphic_item_to_vello (cognitive 22) node-graph/libraries/rendering/src/renderer.rs:890— rendering::renderer::render_graphic_item_to_vello has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rendering::renderer::render_raster_cpu_item_svg (cognitive 22) node-graph/libraries/rendering/src/renderer.rs:2362— rendering::renderer::render_raster_cpu_item_svg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (22 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.
rendering::renderer::render_gradient_item_svg_with_thumbnail_rect (cognitive 21) node-graph/libraries/rendering/src/renderer.rs:2794— rendering::renderer::render_gradient_item_svg_with_thumbnail_rect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 pts), loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
rendering::render_ext::render_gradient_paint (cognitive 20) node-graph/libraries/rendering/src/render_ext.rs:86— rendering::render_ext::render_gradient_paint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rendering::renderer::render_graphic_item_svg (cognitive 17) node-graph/libraries/rendering/src/renderer.rs:818— rendering::renderer::render_graphic_item_svg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 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, 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.
Vector::weld_flow_ends (cognitive 63) node-graph/libraries/vector-types/src/vector/algorithms/weld.rs:152— Vector::weld_flow_ends has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 14 (24 pts), boolean chains 3 (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.
Vector::unweld (cognitive 42) node-graph/libraries/vector-types/src/vector/algorithms/weld.rs:299— Vector::unweld has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 8, loops 5 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vector::anchor_tangents (cognitive 35) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:561— Vector::anchor_tangents has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 4 (10 pts), match/switch 2 (6 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vector::normalize_winding_directions (cognitive 35) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:805— Vector::normalize_winding_directions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 5 (7 pts), boolean chains 4 (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.
Vector::stroke_manipulator_groups_and_anchor_indices (cognitive 28) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:746— Vector::stroke_manipulator_groups_and_anchor_indices has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vector::weld_connected (cognitive 27) node-graph/libraries/vector-types/src/vector/algorithms/weld.rs:28— Vector::weld_connected has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vector::concat (cognitive 25) node-graph/libraries/vector-types/src/vector/vector_types.rs:798— Vector::concat has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vector::auto_join_paths (cognitive 22) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:622— Vector::auto_join_paths has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Vector::connected_points (cognitive 16) node-graph/libraries/vector-types/src/vector/vector_types.rs:497— Vector::connected_points has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
raster_nodes::dehaze::compute_dark_channel (cognitive 25) node-graph/nodes/raster/src/dehaze.rs:68— raster_nodes::dehaze::compute_dark_channel has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (11 pts), boolean chains 1 (nesting depth added 16). 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.
raster_nodes::color_lookup_table::format_csp::parse (cognitive 24) node-graph/nodes/raster/src/color_lookup_table/format_csp.rs:7— raster_nodes::color_lookup_table::format_csp::parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
raster_nodes::filter::gaussian_separable (cognitive 23) node-graph/nodes/raster/src/filter.rs:206— raster_nodes::filter::gaussian_separable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (10 pts), match/switch 1 (2 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.
raster_nodes::std_nodes::channels_to_image (cognitive 20) node-graph/nodes/raster/src/std_nodes.rs:34— raster_nodes::std_nodes::channels_to_image has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3, loops 2 (3 pts), boolean chains 2 (nesting depth added 9). 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.
raster_nodes::std_nodes::noise_pattern (cognitive 20) node-graph/nodes/raster/src/std_nodes.rs:208— raster_nodes::std_nodes::noise_pattern has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (5 pts), match/switch 5, 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.
raster_nodes::color_lookup_table::format_3dl::parse (cognitive 19) REDACTED:7— raster_nodes::color_lookup_table::format_3dl::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
raster_nodes::adjustments::selective_color (cognitive 17) node-graph/nodes/raster/src/adjustments.rs:1893— raster_nodes::adjustments::selective_color has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 4 (6 pts), boolean chains 4, 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.
raster_nodes::filter::box_separable (cognitive 17) node-graph/nodes/raster/src/filter.rs:256— raster_nodes::filter::box_separable has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
raster_nodes::image_color_palette::image_color_palette (cognitive 16) node-graph/nodes/raster/src/image_color_palette.rs:18— raster_nodes::image_color_palette::image_color_palette has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (13 lines × 2) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:601— editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:601-613 | editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:630-642 — 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) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:990— editor/src/messages/portfolio/document/node_graph/node_inspector.rs:990-1002 | editor/src/messages/tool/tool_messages/text_tool.rs:124-136 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) editor/src/messages/portfolio/document_migration.rs:2121— editor/src/messages/portfolio/document_migration.rs:2121-2133 | editor/src/messages/portfolio/document_migration.rs:2173-2185 — 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) editor/src/messages/portfolio/portfolio_message_handler.rs:92— editor/src/messages/portfolio/portfolio_message_handler.rs:92-104 | editor/src/messages/portfolio/portfolio_message_handler.rs:189-201 — 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) editor/src/messages/tool/tool_messages/path_tool.rs:2344— editor/src/messages/tool/tool_messages/path_tool.rs:2344-2356 | editor/src/messages/tool/tool_messages/path_tool.rs:2437-2449 — 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) editor/src/messages/tool/utility_types.rs:177— editor/src/messages/tool/utility_types.rs:177-189 | editor/src/messages/tool/utility_types.rs:198-210 — 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) node-graph/nodes/raster/src/filter.rs:214— node-graph/nodes/raster/src/filter.rs:214-226 | node-graph/nodes/raster/src/filter.rs:262-274 — 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) node-graph/nodes/text/src/json.rs:141— node-graph/nodes/text/src/json.rs:141-153 | node-graph/nodes/text/src/json.rs:160-172 — 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) editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:93— editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:93-105 | editor/src/messages/dialog/preferences_dialog/preferences_dialog_message_handler.rs:276-288 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) document/container/src/archive/xz.rs:45— document/container/src/archive/xz.rs:45-56 | document/container/src/archive/zip.rs:40-51 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:361— editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:361-372 | editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs:420-431 — 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) editor/src/messages/portfolio/document_migration.rs:2206— editor/src/messages/portfolio/document_migration.rs:2206-2217 | editor/src/messages/portfolio/document_migration.rs:2249-2260 — 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) editor/src/messages/tool/common_functionality/utility_functions.rs:293— editor/src/messages/tool/common_functionality/utility_functions.rs:293-304 | editor/src/messages/tool/common_functionality/utility_functions.rs:379-390 — 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) editor/src/messages/tool/tool_messages/gradient_tool.rs:1908— editor/src/messages/tool/tool_messages/gradient_tool.rs:1908-1919 | editor/src/messages/tool/tool_messages/gradient_tool.rs:1963-1974 — 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) node-graph/node-macro/src/codegen.rs:913— node-graph/node-macro/src/codegen.rs:913-924 | node-graph/node-macro/src/codegen.rs:933-944 — 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) node-graph/nodes/brush/src/basic_brush/convert.rs:41— node-graph/nodes/brush/src/basic_brush/convert.rs:41-52 | node-graph/nodes/brush/src/basic_brush/pipeline.rs:304-315 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) node-graph/nodes/graphic/src/graphic.rs:983— node-graph/nodes/graphic/src/graphic.rs:983-994 | node-graph/nodes/vector/src/vector_nodes.rs:1846-1857 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) proc-macros/src/combined_message_attrs.rs:81— proc-macros/src/combined_message_attrs.rs:81-92 | proc-macros/src/combined_message_attrs.rs:105-116 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Off the main sequence: control-protocol — control-protocol: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: ipsum — ipsum: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: snapping — snapping: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: wgpu-sync — wgpu-sync: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: math-parser — math-parser: abstractness 0.06, instability 0.00, distance 0.94 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: graphic-nodes — graphic-nodes: abstractness 1.00, instability 0.88, distance 0.88 — zone of uselessness — abstract and unstable, so it's likely unused.
Off the main sequence: cargo-run — cargo-run: abstractness 0.25, instability 0.00, distance 0.75 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: document-container — document-container: abstractness 0.28, instability 0.00, distance 0.72 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: vector-types — vector-types: abstractness 0.07, instability 0.22, distance 0.71 — zone of pain — concrete and depended on by 14 project(s), so it's rigid to change.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×8
Focus outline removed in CSS without a :focus replacement website/sass/page/donate.scss:383— `.donation-picker .picker-body .amount-entry input:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement website/sass/component/carousel.scss:83— `.carousel.carousel .screenshot-details .carousel-controls button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement frontend/src/components/Editor.svelte:298— `:where(:focus-visible)` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement frontend/src/components/window/Panel.svelte:579— `.panel .tab-bar .tab-group .tab .name input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement frontend/src/components/widgets/inputs/FieldInput.svelte:241— `.field-input input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement frontend/src/components/widgets/inputs/MathExpressionInput.svelte:1168— `.math-expression-input .editor` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement frontend/src/components/widgets/inputs/WorkingColorsInput.svelte:84— `.working-colors-button .swatch > button` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement frontend/src/components/views/Graph.svelte:1205— `.graph .name-input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
NodeNetworkInterface::set_input (cyclomatic 32) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:543— NodeNetworkInterface::set_input has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NodeNetworkInterface::load_stack_dependents_for_nodes (cyclomatic 29) editor/src/messages/portfolio/document/utility_types/network_interface/caches.rs:122— NodeNetworkInterface::load_stack_dependents_for_nodes 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.
NodeNetworkInterface::mirror (cyclomatic 28) editor/src/messages/portfolio/document/utility_types/network_interface/apply.rs:18— NodeNetworkInterface::mirror has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
NodeNetworkInterface::move_layer_to_stack (cyclomatic 25) editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs:937— NodeNetworkInterface::move_layer_to_stack 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.
NodeNetworkInterface::delete_nodes_leaving_dots (cyclomatic 23) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:970— NodeNetworkInterface::delete_nodes_leaving_dots 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.
NodeNetworkInterface::load_structure (cyclomatic 19) editor/src/messages/portfolio/document/utility_types/network_interface/structure.rs:59— NodeNetworkInterface::load_structure 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.
NodeNetworkInterface::set_to_node_or_layer (cyclomatic 17) editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs:1347— NodeNetworkInterface::set_to_node_or_layer 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.
NodeNetworkInterface::compute_node_click_targets (cyclomatic 16) editor/src/messages/portfolio/document/utility_types/network_interface/geometry.rs:10— NodeNetworkInterface::compute_node_click_targets 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.
ShapeState::convert_selected_manipulators_to_colinear_handles (cyclomatic 28) editor/src/messages/tool/common_functionality/shape_editor.rs:1116— ShapeState::convert_selected_manipulators_to_colinear_handles has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ShapeState::delete_selected_points (cyclomatic 27) editor/src/messages/tool/common_functionality/shape_editor.rs:1441— ShapeState::delete_selected_points 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.
ShapeState::move_selected_points_and_segments (cyclomatic 22) editor/src/messages/tool/common_functionality/shape_editor.rs:1242— ShapeState::move_selected_points_and_segments has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ShapeState::get_inside_points_and_segments (cyclomatic 22) editor/src/messages/tool/common_functionality/shape_editor.rs:2193— ShapeState::get_inside_points_and_segments has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ShapeState::select_connected (cyclomatic 17) editor/src/messages/tool/common_functionality/shape_editor.rs:693— ShapeState::select_connected 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.
ShapeState::convert_manipulator_handles_to_colinear (cyclomatic 17) editor/src/messages/tool/common_functionality/shape_editor.rs:1021— ShapeState::convert_manipulator_handles_to_colinear 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.
ShapeState::alternate_selected_handles (cyclomatic 16) editor/src/messages/tool/common_functionality/shape_editor.rs:1920— ShapeState::alternate_selected_handles 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.
ShapeState::select_all_in_shape (cyclomatic 16) editor/src/messages/tool/common_functionality/shape_editor.rs:2120— ShapeState::select_all_in_shape 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.
snapping::constructions::find_constructions (cognitive 50) libraries/snapping/src/constructions.rs:98— snapping::constructions::find_constructions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 7 (18 pts), match/switch 2 (5 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
snapping::solve::resolve_freely (cognitive 38) libraries/snapping/src/solve.rs:454— snapping::solve::resolve_freely has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 8, loops 5 (8 pts), match/switch 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.
snapping::spacing::find_equal_sizes (cognitive 28) libraries/snapping/src/spacing.rs:319— snapping::spacing::find_equal_sizes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
snapping::spacing::find_spacing (cognitive 27) libraries/snapping/src/spacing.rs:251— snapping::spacing::find_spacing has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 1, 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.
snapping::find::find_near_probe (cognitive 24) libraries/snapping/src/find.rs:69— snapping::find::find_near_probe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
snapping::snap::snap_features (cognitive 20) libraries/snapping/src/snap.rs:89— snapping::snap::snap_features has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
snapping::solve::solve (cognitive 19) libraries/snapping/src/solve.rs:320— snapping::solve::solve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 6 (7 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
snapping::curve::roots_between (cognitive 16) libraries/snapping/src/curve.rs:678— snapping::curve::roots_between has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×8
text_nodes::json::parse_json_path (cognitive 100) node-graph/nodes/text/src/json.rs:284— text_nodes::json::parse_json_path has cognitive complexity 100 (threshold 15). Drivers by points: if/else 21 (56 pts), loops 6 (27 pts), match/switch 2 (14 pts), boolean chains 3 (nesting depth added 68). 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.
text_nodes::format_number (cognitive 32) node-graph/nodes/text/src/lib.rs:341— text_nodes::format_number has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 4, loops 2 (4 pts), match/switch 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.
text_nodes::string_capitalization (cognitive 21) node-graph/nodes/text/src/lib.rs:802— text_nodes::string_capitalization has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_nodes::text_context::for_each_styled_glyph_run (cognitive 19) node-graph/nodes/text/src/text_context.rs:19— text_nodes::text_context::for_each_styled_glyph_run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_nodes::string_pad (cognitive 17) node-graph/nodes/text/src/lib.rs:589— text_nodes::string_pad has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_nodes::json::strip_trailing_commas (cognitive 17) node-graph/nodes/text/src/json.rs:60— text_nodes::json::strip_trailing_commas has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 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.
text_nodes::string_occurrences (cognitive 16) node-graph/nodes/text/src/lib.rs:730— text_nodes::string_occurrences has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×7
Duplicated block (16 lines × 2) editor/src/messages/layout/utility_types/layout_widget.rs:583— editor/src/messages/layout/utility_types/layout_widget.rs:583-598 | editor/src/messages/layout/utility_types/layout_widget.rs:599-614 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) editor/src/messages/portfolio/document/node_graph/node_inspector.rs:638— editor/src/messages/portfolio/document/node_graph/node_inspector.rs:638-653 | editor/src/messages/portfolio/document/node_graph/node_inspector.rs:774-789 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:258— editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:258-273 | editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:288-303 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) node-graph/libraries/rendering/src/renderer.rs:1879— node-graph/libraries/rendering/src/renderer.rs:1879-1894 | node-graph/libraries/rendering/src/renderer.rs:1969-1984 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) node-graph/nodes/repeat/src/repeat_nodes.rs:100— node-graph/nodes/repeat/src/repeat_nodes.rs:100-115 | node-graph/nodes/repeat/src/repeat_nodes.rs:157-172 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) node-graph/nodes/text/src/regex.rs:115— node-graph/nodes/text/src/regex.rs:115-130 | node-graph/nodes/text/src/regex.rs:187-202 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) node-graph/nodes/transform/src/transform_nodes.rs:41— node-graph/nodes/transform/src/transform_nodes.rs:41-56 | node-graph/nodes/transform/src/transform_nodes.rs:73-88 — 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.
Swallowed exception (empty catch) frontend/src/service-worker.js:82— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) frontend/src/service-worker.js:192— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) frontend/src/utility-functions/network.ts:52— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) frontend/src/utility-functions/persistence.ts:125— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) frontend/src/stores/dialog.ts:94— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) frontend/src/stores/portfolio.ts:115— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) frontend/src/components/widgets/inputs/ColorPresetsInput.svelte:57— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
node_macro::codegen::generate_node_code (cyclomatic 89) node-graph/node-macro/src/codegen.rs:13— node_macro::codegen::generate_node_code has cyclomatic complexity 89 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
node_macro::codegen::generate_register_node_impl (cyclomatic 22) node-graph/node-macro/src/codegen.rs:1300— node_macro::codegen::generate_register_node_impl has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
node_macro::parsing::parse_field (cyclomatic 22) node-graph/node-macro/src/parsing.rs:859— node_macro::parsing::parse_field has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
node_macro::destructure::derive_destructure_impl (cyclomatic 19) node-graph/node-macro/src/destructure.rs:32— node_macro::destructure::derive_destructure_impl 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.
node_macro::validation::ranked_input_violations (cyclomatic 18) node-graph/node-macro/src/validation.rs:134— node_macro::validation::ranked_input_violations 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.
node_macro::validation::validate_no_item_parameters (cyclomatic 16) node-graph/node-macro/src/validation.rs:30— node_macro::validation::validate_no_item_parameters 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.
PathToolData::mouse_down (cognitive 81) editor/src/messages/tool/tool_messages/path_tool.rs:748— PathToolData::mouse_down has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (57 pts), loops 4 (13 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 44). 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.
PathToolData::drag (cognitive 45) editor/src/messages/tool/tool_messages/path_tool.rs:1435— PathToolData::drag has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 6, match/switch 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PathToolData::update_colinear (cognitive 26) editor/src/messages/tool/tool_messages/path_tool.rs:1070— PathToolData::update_colinear has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, match/switch 1 (nesting depth added 13). 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.
PathToolData::start_dragging_point (cognitive 24) editor/src/messages/tool/tool_messages/path_tool.rs:961— PathToolData::start_dragging_point has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PathToolData::start_sliding_point (cognitive 23) editor/src/messages/tool/tool_messages/path_tool.rs:1289— PathToolData::start_sliding_point has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PathToolData::slide_point (cognitive 18) editor/src/messages/tool/tool_messages/path_tool.rs:1331— PathToolData::slide_point has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. 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.
math_parser::constants::builtin_function (cyclomatic 151) libraries/math-parser/src/constants.rs:465— math_parser::constants::builtin_function has cyclomatic complexity 151 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
math_parser::highlight::highlight (cyclomatic 39) libraries/math-parser/src/highlight.rs:63— math_parser::highlight::highlight has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
math_parser::completion::completions (cyclomatic 29) libraries/math-parser/src/completion.rs:84— math_parser::completion::completions 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.
math_parser::documentation::matrix_literal_tooltip (cyclomatic 17) libraries/math-parser/src/documentation.rs:1442— math_parser::documentation::matrix_literal_tooltip has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: Operator::doc (cyclomatic 20) 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.
math_parser::lexer::classify_bars (cyclomatic 16) libraries/math-parser/src/lexer.rs:253— math_parser::lexer::classify_bars has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file's highest cyclomatic complexity: Token::fmt (cyclomatic 35) 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.
DocumentMessageHandler::process_message (cognitive 405) editor/src/messages/portfolio/document/document_message_handler.rs:251— DocumentMessageHandler::process_message has cognitive complexity 405 (threshold 15). Drivers by points: if/else 166 (322 pts), loops 20 (44 pts), match/switch 12 (23 pts), boolean chains 16 (nesting depth added 191). 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.
DocumentMessageHandler::selected_layers_reverse (cognitive 29) editor/src/messages/portfolio/document/document_message_handler.rs:3961— DocumentMessageHandler::selected_layers_reverse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 7 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DocumentMessageHandler::has_selected_descendant_in_graph (cognitive 18) editor/src/messages/portfolio/document/document_message_handler.rs:2683— DocumentMessageHandler::has_selected_descendant_in_graph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 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.
DocumentMessageHandler::collect_descendant_tree_paths (cognitive 17) editor/src/messages/portfolio/document/document_message_handler.rs:2761— DocumentMessageHandler::collect_descendant_tree_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 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.
DocumentMessageHandler::group_selected_layers (cognitive 16) editor/src/messages/portfolio/document/document_message_handler.rs:3192— DocumentMessageHandler::group_selected_layers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 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.
PenToolData::drag_handle (cognitive 26) editor/src/messages/tool/tool_messages/pen_tool.rs:1033— PenToolData::drag_handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PenToolData::place_handle_or_segment (cognitive 18) editor/src/messages/tool/tool_messages/pen_tool.rs:797— PenToolData::place_handle_or_segment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PenToolData::adjust_handle_length (cognitive 18) editor/src/messages/tool/tool_messages/pen_tool.rs:1131— PenToolData::adjust_handle_length has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (nesting depth added 10). 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.
PenToolData::bend_from_previous_point (cognitive 16) editor/src/messages/tool/tool_messages/pen_tool.rs:705— PenToolData::bend_from_previous_point has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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.
PenToolData::swap_handles (cognitive 16) editor/src/messages/tool/tool_messages/pen_tool.rs:928— PenToolData::swap_handles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (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.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×5
Vector::weld_flow_ends (cyclomatic 33) node-graph/libraries/vector-types/src/vector/algorithms/weld.rs:152— Vector::weld_flow_ends has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Vector::unweld (cyclomatic 25) node-graph/libraries/vector-types/src/vector/algorithms/weld.rs:299— Vector::unweld 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.
Vector::normalize_winding_directions (cyclomatic 20) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:805— Vector::normalize_winding_directions 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.
Vector::anchor_tangents (cyclomatic 17) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:561— Vector::anchor_tangents 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.
raster_nodes::std_nodes::noise_pattern (cyclomatic 33) node-graph/nodes/raster/src/std_nodes.rs:208— raster_nodes::std_nodes::noise_pattern has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
raster_nodes::adjustments::selective_color (cyclomatic 22) node-graph/nodes/raster/src/adjustments.rs:1893— raster_nodes::adjustments::selective_color has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
raster_nodes::color_lookup_table::format_3dl::parse (cyclomatic 16) REDACTED:7— raster_nodes::color_lookup_table::format_3dl::parse 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.
raster_nodes::color_lookup_table::format_csp::parse (cyclomatic 16) node-graph/nodes/raster/src/color_lookup_table/format_csp.rs:7— raster_nodes::color_lookup_table::format_csp::parse 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.
snapping::solve::resolve_freely (cyclomatic 25) libraries/snapping/src/solve.rs:454— snapping::solve::resolve_freely 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.
snapping::constructions::find_constructions (cyclomatic 20) libraries/snapping/src/constructions.rs:98— snapping::constructions::find_constructions 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.
snapping::find::find_near_probe (cyclomatic 19) libraries/snapping/src/find.rs:69— snapping::find::find_near_probe 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.
snapping::solve::solve (cyclomatic 17) libraries/snapping/src/solve.rs:320— snapping::solve::solve has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
NodeGraphMessageHandler::process_message (cognitive 757) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:144— NodeGraphMessageHandler::process_message has cognitive complexity 757 (threshold 15). Drivers by points: if/else 245 (573 pts), loops 33 (85 pts), boolean chains 51, match/switch 17 (48 pts) (nesting depth added 411). 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.
NodeGraphMessageHandler::collate_inspector_sections (cognitive 61) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3491— NodeGraphMessageHandler::collate_inspector_sections has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 4 (8 pts), boolean chains 5, match/switch 1 (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.
NodeGraphMessageHandler::wire_to_insert_on (cognitive 17) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3166— NodeGraphMessageHandler::wire_to_insert_on has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
NodeGraphMessageHandler::update_graph_bar_left (cognitive 16) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3271— NodeGraphMessageHandler::update_graph_bar_left has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, loops 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.
Lattice::loop_route (cognitive 43) node-graph/nodes/vector/src/grid_topology.rs:711— Lattice::loop_route has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Lattice::spiral (cognitive 23) node-graph/nodes/vector/src/grid_topology.rs:643— Lattice::spiral has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 6 (8 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.
Lattice::new (cognitive 20) node-graph/nodes/vector/src/grid_topology.rs:115— Lattice::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Lattice::chain_outline (cognitive 17) node-graph/nodes/vector/src/grid_topology.rs:590— Lattice::chain_outline has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_proc_macros::helpers::clean_rust_type_syntax (cognitive 40) proc-macros/src/helpers.rs:45— graphite_proc_macros::helpers::clean_rust_type_syntax has cognitive complexity 40 (threshold 15). Drivers by points: loops 10 (31 pts), if/else 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 26). 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.
graphite_proc_macros::editor_commands::editor_commands_impl (cognitive 29) proc-macros/src/editor_commands.rs:7— graphite_proc_macros::editor_commands::editor_commands_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_proc_macros::discriminant::derive_discriminant_impl (cognitive 21) proc-macros/src/discriminant.rs:6— graphite_proc_macros::discriminant::derive_discriminant_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (9 pts), loops 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.
graphite_proc_macros::message_handler_data_attr::message_handler_data_attr_impl (cognitive 20) proc-macros/src/message_handler_data_attr.rs:6— graphite_proc_macros::message_handler_data_attr::message_handler_data_attr_impl has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TooManyFields: PathToolData editor/src/messages/tool/tool_messages/path_tool.rs:587— TooManyFields — 48 stored fields beside 26 methods. The bar is 30 stored fields; this is 18 over it, 1.60× 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: NodeGraphMessageHandler editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:58— TooManyFields — 41 stored fields beside 38 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: DocumentMessageHandler editor/src/messages/portfolio/document/document_message_handler.rs:88— TooManyFields — 33 stored fields beside 73 methods. The bar is 30 stored fields; this is 3 over it, 1.10× 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: PenToolData editor/src/messages/tool/tool_messages/pen_tool.rs:407— TooManyFields — 33 stored fields beside 35 methods. The bar is 30 stored fields; this is 3 over it, 1.10× 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.
Duplicated block (14 lines × 2) document/container/src/backends/opfs.rs:375— document/container/src/backends/opfs.rs:375-388 | document/container/src/backends/opfs.rs:412-425 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) editor/src/messages/portfolio/document_migration.rs:3281— editor/src/messages/portfolio/document_migration.rs:3281-3294 | editor/src/messages/portfolio/document_migration.rs:3342-3355 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:658— editor/src/messages/tool/tool_messages/path_tool.rs:658-671 | editor/src/messages/tool/tool_messages/select_tool.rs:718-731 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) editor/src/messages/tool/tool_messages/select_tool.rs:2029— editor/src/messages/tool/tool_messages/select_tool.rs:2029-2042 | editor/src/messages/tool/utility_types.rs:78-91 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12–13 lines × 2) editor/src/messages/clipboard/clipboard_message_handler.rs:480— editor/src/messages/clipboard/clipboard_message_handler.rs:480-491 | editor/src/messages/tool/tool_messages/path_tool.rs:2918-2930 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12–13 lines × 2) editor/src/messages/tool/tool_messages/text_tool.rs:871— editor/src/messages/tool/tool_messages/text_tool.rs:871-883 | editor/src/messages/tool/tool_messages/text_tool.rs:941-952 — 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) node-graph/libraries/rendering/src/renderer.rs:1480— node-graph/libraries/rendering/src/renderer.rs:1480-1492 | node-graph/libraries/rendering/src/renderer.rs:1744-1755 — 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) node-graph/nodes/brush/src/basic_brush/convert.rs:68— node-graph/nodes/brush/src/basic_brush/convert.rs:68-79 | node-graph/nodes/gstd/src/render_pixel_preview.rs:215-227 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 3) editor/src/messages/tool/tool_messages/freehand_tool.rs:109— editor/src/messages/tool/tool_messages/freehand_tool.rs:109-116 | editor/src/messages/tool/tool_messages/pen_tool.rs:172-179 | editor/src/messages/tool/tool_messages/spline_tool.rs:116-123 — 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 (8 lines × 3) node-graph/libraries/rendering/src/renderer.rs:2432— node-graph/libraries/rendering/src/renderer.rs:2432-2439 | node-graph/libraries/rendering/src/renderer.rs:2680-2688 | node-graph/libraries/rendering/src/renderer.rs:2866-2874 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) node-graph/nodes/vector/src/vector_nodes.rs:1793— node-graph/nodes/vector/src/vector_nodes.rs:1793-1800 | node-graph/nodes/vector/src/vector_nodes.rs:2163-2170 | node-graph/nodes/vector/src/vector_nodes.rs:2338-2345 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) node-graph/nodes/gstd/src/render_background.rs:214— node-graph/nodes/gstd/src/render_background.rs:214-221 | node-graph/nodes/gstd/src/render_background.rs:243-250 | node-graph/nodes/gstd/src/render_background.rs:285-292 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 2 locations) frontend/src/components/panels/Inspector.svelte:26— frontend/src/components/panels/Inspector.svelte:26 · frontend/src/components/panels/Inspector.svelte:38 — 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 locations) frontend/src/components/panels/Inspector.svelte:81— frontend/src/components/panels/Inspector.svelte:81 · frontend/src/components/panels/Layers.svelte:743 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (11 lines × 2 locations) frontend/src/components/widgets/inputs/ScrollbarInput.svelte:193— frontend/src/components/widgets/inputs/ScrollbarInput.svelte:193 · frontend/src/components/widgets/inputs/TransferCurveInput.svelte:268 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (11 lines × 2 locations) frontend/src/components/widgets/inputs/SliderInput.svelte:585— frontend/src/components/widgets/inputs/SliderInput.svelte:585 · frontend/src/components/widgets/inputs/TransferCurveInput.svelte:250 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
rendering::renderer::render_vector_item_to_vello (cyclomatic 60) node-graph/libraries/rendering/src/renderer.rs:1726— rendering::renderer::render_vector_item_to_vello has cyclomatic complexity 60 (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.
rendering::renderer::render_vector_shape_svg (cyclomatic 29) node-graph/libraries/rendering/src/renderer.rs:1472— rendering::renderer::render_vector_shape_svg has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rendering::renderer::render_graphic_item_to_vello (cyclomatic 16) node-graph/libraries/rendering/src/renderer.rs:890— rendering::renderer::render_graphic_item_to_vello 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.
App::handle_desktop_frontend_message (cyclomatic 56) desktop/src/app.rs:217— App::handle_desktop_frontend_message has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
App::window_event (cyclomatic 32) desktop/src/app.rs:572— App::window_event has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
App::user_event (cyclomatic 27) desktop/src/app.rs:442— App::user_event 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.
Graphic::collect_metadata (cyclomatic 38) node-graph/libraries/rendering/src/renderer.rs:1120— Graphic::collect_metadata has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Graphic::is_guaranteed_fully_transparent (cyclomatic 24) node-graph/libraries/graphic-types/src/graphic.rs:631— Graphic::is_guaranteed_fully_transparent has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Graphic::is_guaranteed_fully_opaque (cyclomatic 21) node-graph/libraries/graphic-types/src/graphic.rs:587— Graphic::is_guaranteed_fully_opaque has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
text_nodes::json::parse_json_path (cyclomatic 37) node-graph/nodes/text/src/json.rs:284— text_nodes::json::parse_json_path has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
text_nodes::format_number (cyclomatic 20) node-graph/nodes/text/src/lib.rs:341— text_nodes::format_number 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.
text_nodes::string_capitalization (cyclomatic 19) node-graph/nodes/text/src/lib.rs:802— text_nodes::string_capitalization has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_desktop_ui::input::process (cyclomatic 32) desktop/ui/src/input.rs:29— graphite_desktop_ui::input::process has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_desktop_ui::resources::load (cyclomatic 27) desktop/ui/src/resources.rs:36— graphite_desktop_ui::resources::load has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_desktop_ui::remote::spawn::spawn_host (cyclomatic 16) desktop/ui/src/remote/spawn.rs:87— graphite_desktop_ui::remote::spawn::spawn_host 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.
document_graph_storage::prior::restore (cyclomatic 26) document/graph-storage/src/prior.rs:193— document_graph_storage::prior::restore has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
document_graph_storage::delta::compute_deltas (cyclomatic 18) document/graph-storage/src/delta.rs:17— document_graph_storage::delta::compute_deltas has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
document_graph_storage::registry::collect_timestamps (cyclomatic 18) document/graph-storage/src/registry.rs:179— document_graph_storage::registry::collect_timestamps has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
HackComment node-graph/libraries/no-std-types/src/color/color_types.rs:25— /// hack around half still masking out impl Debug for f16 on spirv — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment node-graph/interpreted-executor/src/dynamic_executor.rs:149— // Hack to undo rank promotion while traversing the graph — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment editor/src/messages/input_mapper/input_mappings.rs:55— // Hack to prevent Left Click + Accel + Z combo (this effectively blocks you from making a double undo with AbortTransaction) — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
LayoutMessageHandler::handle_widget_callback (cognitive 125) editor/src/messages/layout/layout_message_handler.rs:205— LayoutMessageHandler::handle_widget_callback has cognitive complexity 125 (threshold 15). Drivers by points: if/else 26 (76 pts), match/switch 24 (45 pts), loops 1 (4 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LayoutMessageHandler::get_widget_path (cognitive 38) editor/src/messages/layout/layout_message_handler.rs:145— LayoutMessageHandler::get_widget_path has cognitive complexity 38 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 5 (16 pts), match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LayoutMessageHandler::process_message (cognitive 26) editor/src/messages/layout/layout_message_handler.rs:27— LayoutMessageHandler::process_message has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
App::handle_desktop_frontend_message (cognitive 60) desktop/src/app.rs:217— App::handle_desktop_frontend_message has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 29). 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.
App::window_event (cognitive 39) desktop/src/app.rs:572— App::window_event has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 6 (14 pts), boolean chains 3, loops 1 (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.
App::user_event (cognitive 30) desktop/src/app.rs:442— App::user_event has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ColorPickerMessageHandler::apply_gradient_update (cognitive 49) editor/src/messages/color_picker/color_picker_message_handler.rs:385— ColorPickerMessageHandler::apply_gradient_update has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (44 pts), boolean chains 4, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ColorPickerMessageHandler::process_message (cognitive 37) editor/src/messages/color_picker/color_picker_message_handler.rs:73— ColorPickerMessageHandler::process_message has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 5 (9 pts) (nesting depth added 18). 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.
ColorPickerMessageHandler::pickers_and_gradient_layout (cognitive 21) editor/src/messages/color_picker/color_picker_message_handler.rs:500— ColorPickerMessageHandler::pickers_and_gradient_layout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetwork::flatten_with_fns (cognitive 36) node-graph/graph-craft/src/document.rs:910— NodeNetwork::flatten_with_fns has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (8 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NodeNetwork::remove_dead_nodes (cognitive 20) node-graph/graph-craft/src/document.rs:853— NodeNetwork::remove_dead_nodes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 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.
NodeNetwork::replace_node_with_its_exports (cognitive 17) node-graph/graph-craft/src/document.rs:1047— NodeNetwork::replace_node_with_its_exports has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (5 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Preprocessor::new (cognitive 33) node-graph/preprocessor/src/lib.rs:152— Preprocessor::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (9 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Preprocessor::replace_inputs_with_producer_nodes (cognitive 16) node-graph/preprocessor/src/lib.rs:62— Preprocessor::replace_inputs_with_producer_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Preprocessor::expand_network (cognitive 16) node-graph/preprocessor/src/lib.rs:120— Preprocessor::expand_network has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_desktop_ui::input::process (cognitive 31) desktop/ui/src/input.rs:29— graphite_desktop_ui::input::process has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 5 (11 pts), boolean chains 1 (nesting depth added 16). 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.
graphite_desktop_ui::remote::spawn::spawn_host (cognitive 22) desktop/ui/src/remote/spawn.rs:87— graphite_desktop_ui::remote::spawn::spawn_host has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphite_desktop_ui::remote::spawn::event_receiver_loop (cognitive 17) desktop/ui/src/remote/spawn.rs:311— graphite_desktop_ui::remote::spawn::event_receiver_loop 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.
rawkit::postprocessing::gamma_correction::generate_gamma_curve (cognitive 30) libraries/rawkit/src/postprocessing/gamma_correction.rs:28— rawkit::postprocessing::gamma_correction::generate_gamma_curve has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rawkit::metadata::camera_data::pseudoinverse (cognitive 29) libraries/rawkit/src/metadata/camera_data.rs:65— rawkit::metadata::camera_data::pseudoinverse has cognitive complexity 29 (threshold 15). Drivers by points: loops 11 (22 pts), if/else 3 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
rawkit::decoder::arw2::sony_arw2_load_raw (cognitive 17) libraries/rawkit/src/decoder/arw2.rs:74— rawkit::decoder::arw2::sony_arw2_load_raw has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 10). 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.
document_graph_storage::delta::compute_deltas (cognitive 29) document/graph-storage/src/delta.rs:17— document_graph_storage::delta::compute_deltas has cognitive complexity 29 (threshold 15). Drivers by points: loops 13 (20 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 12). 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.
document_graph_storage::registry::collect_timestamps (cognitive 27) document/graph-storage/src/registry.rs:179— document_graph_storage::registry::collect_timestamps has cognitive complexity 27 (threshold 15). Drivers by points: loops 17 (27 pts) (nesting depth added 10). 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.
document_graph_storage::prior::restore (cognitive 26) document/graph-storage/src/prior.rs:193— document_graph_storage::prior::restore has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 4 (11 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PanelLayoutSubdivision::prune (cognitive 24) editor/src/messages/portfolio/utility_types.rs:484— PanelLayoutSubdivision::prune has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PanelLayoutSubdivision::insert_split_adjacent (cognitive 23) editor/src/messages/portfolio/utility_types.rs:645— PanelLayoutSubdivision::insert_split_adjacent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (23 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.
PanelLayoutSubdivision::recalculate_default_sizes (cognitive 18) editor/src/messages/portfolio/utility_types.rs:739— PanelLayoutSubdivision::recalculate_default_sizes 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.
SelectedEdges::new_size (cognitive 19) editor/src/messages/tool/common_functionality/transformation_cage.rs:99— SelectedEdges::new_size has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
SelectedEdges::skew_transform (cognitive 19) editor/src/messages/tool/common_functionality/transformation_cage.rs:301— SelectedEdges::skew_transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 6. 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.
SelectedEdges::snap_stretch (cognitive 17) editor/src/messages/tool/common_functionality/transformation_cage.rs:178— SelectedEdges::snap_stretch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 5, loops 2, match/switch 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Change-coupling hub: document_message_handler.rs → export_dialog_message_handler.rs, new_document_dialog_message_handler.rs, node-graph.ts editor/src/messages/portfolio/document/document_message_handler.rs— `editor/src/messages/portfolio/document/document_message_handler.rs` changes together with 3 other files — `editor/src/messages/dialog/export_dialog/export_dialog_message_handler.rs`, `editor/src/messages/dialog/new_document_dialog/new_document_dialog_message_handler.rs`, `frontend/src/stores/node-graph.ts` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
Change-coupling hub: vector_nodes.rs → artboard.rs, lib.rs, context_modification.rs, filter.rs, transform_nodes.rs node-graph/nodes/vector/src/vector_nodes.rs— `node-graph/nodes/vector/src/vector_nodes.rs` changes together with 5 other files — `node-graph/libraries/graphic-types/src/artboard.rs`, `node-graph/nodes/blending/src/lib.rs`, `node-graph/nodes/gcore/src/context_modification.rs`, `node-graph/nodes/raster/src/filter.rs`, `node-graph/nodes/transform/src/transform_nodes.rs` — none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5.
Change-coupling hub: node_inspector.rs → color_picker_message_handler.rs, graph_operation_message.rs, transform_utils.rs editor/src/messages/portfolio/document/node_graph/node_inspector.rs— `editor/src/messages/portfolio/document/node_graph/node_inspector.rs` changes together with 3 other files — `editor/src/messages/color_picker/color_picker_message_handler.rs`, `editor/src/messages/portfolio/document/graph_operation/graph_operation_message.rs`, `editor/src/messages/portfolio/document/graph_operation/transform_utils.rs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
Duplicated block (10 lines × 3) editor/src/messages/menu_bar/menu_bar_message_handler.rs:743— editor/src/messages/menu_bar/menu_bar_message_handler.rs:743-752 | editor/src/messages/menu_bar/menu_bar_message_handler.rs:757-766 | editor/src/messages/menu_bar/menu_bar_message_handler.rs:771-780 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) node-graph/nodes/text/src/regex.rs:119— node-graph/nodes/text/src/regex.rs:119-128 | node-graph/nodes/text/src/regex.rs:191-200 | node-graph/nodes/text/src/regex.rs:237-246 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) desktop/ui/src/internal/display_handler.rs:132— desktop/ui/src/internal/display_handler.rs:132-141 | desktop/ui/src/internal/load_handler.rs:37-46 | desktop/ui/src/internal/scheme_handler_factory.rs:51-60 — 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 (7 lines × 3) editor/src/messages/portfolio/document/document_message_handler.rs:1828— editor/src/messages/portfolio/document/document_message_handler.rs:1828-1834 | editor/src/messages/portfolio/document/document_message_handler.rs:1857-1863 | editor/src/messages/portfolio/document/document_message_handler.rs:1871-1877 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) editor/src/messages/tool/common_functionality/utility_functions.rs:294— editor/src/messages/tool/common_functionality/utility_functions.rs:294-300 | editor/src/messages/tool/common_functionality/utility_functions.rs:341-350 | editor/src/messages/tool/common_functionality/utility_functions.rs:380-386 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1165— editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1165-1171 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1182-1188 | editor/src/messages/portfolio/document/node_graph/document_node_definitions.rs:1197-1203 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) editor/src/messages/portfolio/document_migration.rs:2691— editor/src/messages/portfolio/document_migration.rs:2691-2695 | editor/src/messages/portfolio/document_migration.rs:3048-3052 | editor/src/messages/portfolio/document_migration.rs:3061-3065 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) libraries/math-parser/src/executer.rs:389— libraries/math-parser/src/executer.rs:389-393 | libraries/math-parser/src/executer.rs:493-497 | libraries/math-parser/src/executer.rs:545-549 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) node-graph/libraries/rendering/src/renderer.rs:3060— node-graph/libraries/rendering/src/renderer.rs:3060-3064 | node-graph/libraries/rendering/src/renderer.rs:3181-3185 | node-graph/libraries/rendering/src/renderer.rs:3262-3266 — 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.
Low cohesion: LayerNodeIdentifier (LCOM4 4) editor/src/messages/portfolio/document/utility_types/document_metadata.rs:400— LayerNodeIdentifier'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: Gradient (LCOM4 4) node-graph/libraries/vector-types/src/gradient.rs:24— Gradient'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: Vector (LCOM4 4) node-graph/libraries/vector-types/src/vector/vector_types.rs:22— Vector'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 locations) frontend/src/components/panels/Document.svelte:395— frontend/src/components/panels/Document.svelte:395 · frontend/src/components/panels/Document.svelte:531 — 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 locations) frontend/src/components/widgets/buttons/ImageButton.svelte:5— frontend/src/components/widgets/buttons/ImageButton.svelte:5 · frontend/src/components/widgets/labels/ImageLabel.svelte:4 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
Duplicated block (7 lines × 2 locations) frontend/src/components/window/Panel.svelte:373— frontend/src/components/window/Panel.svelte:373 · frontend/src/components/window/Panel.svelte:381 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2 locations) frontend/src/components/widgets/buttons/TextButton.svelte:30— frontend/src/components/widgets/buttons/TextButton.svelte:30 · frontend/src/components/widgets/inputs/ColorInput.svelte:21 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2 locations) frontend/src/managers/drag-toggle.ts:23— frontend/src/managers/drag-toggle.ts:23 · frontend/src/managers/drag-toggle.ts:37 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (6 lines × 2 locations) frontend/src/stores/color-picker.ts:25— frontend/src/stores/color-picker.ts:25 · frontend/src/stores/fullscreen.ts:12 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
X2 · Cancellation propagation· Async function without AbortSignal · ×3
Async function without AbortSignal: fetchJSON website/static/js/page/contributor-guide/bisect-tool.js:13— `fetchJSON` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: loadDemoArtwork frontend/src/utility-functions/network.ts:38— `loadDemoArtwork` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: initWasm frontend/src/utility-functions/wasm-loader.ts:6— `initWasm` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
AC1 · Text alternatives· <canvas> without a text alternative · ×2
<canvas> without a text alternative frontend/src/components/floating-menus/EyedropperPreview.svelte:60— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative frontend/src/components/panels/Document.svelte:703— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
NodeGraphMessageHandler::process_message (cyclomatic 437) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:144— NodeGraphMessageHandler::process_message has cyclomatic complexity 437 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NodeGraphMessageHandler::collate_inspector_sections (cyclomatic 30) editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3491— NodeGraphMessageHandler::collate_inspector_sections has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DocumentMessageHandler::process_message (cyclomatic 312) editor/src/messages/portfolio/document/document_message_handler.rs:251— DocumentMessageHandler::process_message has cyclomatic complexity 312 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DocumentMessageHandler::selected_layers_reverse (cyclomatic 16) editor/src/messages/portfolio/document/document_message_handler.rs:3961— DocumentMessageHandler::selected_layers_reverse 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.
LayoutMessageHandler::handle_widget_callback (cyclomatic 80) editor/src/messages/layout/layout_message_handler.rs:205— LayoutMessageHandler::handle_widget_callback has cyclomatic complexity 80 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
LayoutMessageHandler::process_message (cyclomatic 23) editor/src/messages/layout/layout_message_handler.rs:27— LayoutMessageHandler::process_message 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.
Lexer::next_token (cyclomatic 52) libraries/math-parser/src/lexer.rs:484— Lexer::next_token has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Lexer::lex_number (cyclomatic 19) libraries/math-parser/src/lexer.rs:402— Lexer::lex_number 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. This is NOT this file's highest cyclomatic complexity: Token::fmt (cyclomatic 35) 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.
cargo_run::requirements::check (cyclomatic 42) tools/cargo-run/src/requirements.rs:103— cargo_run::requirements::check has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cargo_run::run_task (cyclomatic 21) tools/cargo-run/src/main.rs:104— cargo_run::run_task has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ColorPickerMessageHandler::process_message (cyclomatic 39) editor/src/messages/color_picker/color_picker_message_handler.rs:73— ColorPickerMessageHandler::process_message has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ColorPickerMessageHandler::apply_gradient_update (cyclomatic 33) editor/src/messages/color_picker/color_picker_message_handler.rs:385— ColorPickerMessageHandler::apply_gradient_update has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NodeRuntime::handle_requests (cyclomatic 36) editor/src/node_graph_executor/runtime.rs:151— NodeRuntime::handle_requests has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NodeRuntime::process_monitor_nodes (cyclomatic 20) editor/src/node_graph_executor/runtime.rs:425— NodeRuntime::process_monitor_nodes 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.
PathToolData::mouse_down (cyclomatic 35) editor/src/messages/tool/tool_messages/path_tool.rs:748— PathToolData::mouse_down has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PathToolData::drag (cyclomatic 23) editor/src/messages/tool/tool_messages/path_tool.rs:1435— PathToolData::drag 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.
PointRadiusHandle::overlays (cyclomatic 27) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:154— PointRadiusHandle::overlays 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.
PointRadiusHandle::handle_actions (cyclomatic 19) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:62— PointRadiusHandle::handle_actions 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.
editor_message_tree::write_tree_txt_node (cyclomatic 21) tools/editor-message-tree/src/main.rs:49— editor_message_tree::write_tree_txt_node 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.
editor_message_tree::write_tree_html_node (cyclomatic 18) tools/editor-message-tree/src/main.rs:172— editor_message_tree::write_tree_html_node has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SelectedEdges::snap_stretch (cyclomatic 20) editor/src/messages/tool/common_functionality/transformation_cage.rs:178— SelectedEdges::snap_stretch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
SelectedEdges::new_size (cyclomatic 18) editor/src/messages/tool/common_functionality/transformation_cage.rs:99— SelectedEdges::new_size has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
VectorModification::chain_legacy_segments (cyclomatic 20) node-graph/libraries/vector-types/src/vector/vector_modification.rs:898— VectorModification::chain_legacy_segments 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.
VectorModification::modify (cyclomatic 16) node-graph/libraries/vector-types/src/vector/vector_modification.rs:824— VectorModification::modify 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.
Sorter::sort (cyclomatic 19) libraries/math-parser/src/sort.rs:300— Sorter::sort has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Sorter::call (cyclomatic 16) libraries/math-parser/src/sort.rs:471— Sorter::call 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.
Lattice::loop_route (cyclomatic 18) node-graph/nodes/vector/src/grid_topology.rs:711— Lattice::loop_route 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.
Lattice::spiral (cyclomatic 17) node-graph/nodes/vector/src/grid_topology.rs:643— Lattice::spiral has cyclomatic complexity 17 (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.
graphite_proc_macros::editor_commands::editor_commands_impl (cyclomatic 18) proc-macros/src/editor_commands.rs:7— graphite_proc_macros::editor_commands::editor_commands_impl 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.
graphite_proc_macros::helpers::clean_rust_type_syntax (cyclomatic 18) proc-macros/src/helpers.rs:45— graphite_proc_macros::helpers::clean_rust_type_syntax has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
cargo_run::requirements::check (cognitive 90) tools/cargo-run/src/requirements.rs:103— cargo_run::requirements::check has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (45 pts), match/switch 8 (29 pts), loops 6 (10 pts), boolean chains 6 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cargo_run::cmd::supervise (cognitive 24) tools/cargo-run/src/cmd.rs:194— cargo_run::cmd::supervise has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 8 (11 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.
PointRadiusHandle::overlays (cognitive 64) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:154— PointRadiusHandle::overlays has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 39). 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.
PointRadiusHandle::handle_actions (cognitive 46) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/point_radius_handle.rs:62— PointRadiusHandle::handle_actions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 28). 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.
NodeRuntime::handle_requests (cognitive 59) editor/src/node_graph_executor/runtime.rs:151— NodeRuntime::handle_requests has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (37 pts), match/switch 5 (13 pts), boolean chains 7, loops 2 (nesting depth added 29). 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.
NodeRuntime::process_monitor_nodes (cognitive 36) editor/src/node_graph_executor/runtime.rs:425— NodeRuntime::process_monitor_nodes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Lexer::next_token (cognitive 42) libraries/math-parser/src/lexer.rs:484— Lexer::next_token has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 7, match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 14). 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.
Lexer::lex_number (cognitive 20) libraries/math-parser/src/lexer.rs:402— Lexer::lex_number has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
editor_message_tree::write_tree_txt_node (cognitive 42) tools/editor-message-tree/src/main.rs:49— editor_message_tree::write_tree_txt_node has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 4 (9 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.
editor_message_tree::write_tree_html_node (cognitive 24) tools/editor-message-tree/src/main.rs:172— editor_message_tree::write_tree_html_node has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PointModification::apply (cognitive 32) node-graph/libraries/vector-types/src/vector/vector_modification.rs:31— PointModification::apply has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (6 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.
PointModification::move_in_place (cognitive 22) node-graph/libraries/vector-types/src/vector/vector_modification.rs:107— PointModification::move_in_place has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SnapSession::snap_features (cognitive 29) editor/src/messages/tool/common_functionality/snap_session.rs:206— SnapSession::snap_features has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SnapSession::draw_overlays (cognitive 16) editor/src/messages/tool/common_functionality/snap_session/presenter.rs:16— SnapSession::draw_overlays has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NumberOfPointsDial::overlays (cognitive 27) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:101— NumberOfPointsDial::overlays has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
NumberOfPointsDial::handle_actions (cognitive 18) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/number_of_points_dial.rs:53— NumberOfPointsDial::handle_actions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, match/switch 1 (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.
document_container::backends::opfs::drain_queue (cognitive 25) document/container/src/backends/opfs.rs:241— document_container::backends::opfs::drain_queue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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.
document_container::backends::opfs::list_entries (cognitive 17) document/container/src/backends/opfs.rs:446— document_container::backends::opfs::list_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VectorModification::chain_legacy_segments (cognitive 25) node-graph/libraries/vector-types/src/vector/vector_modification.rs:898— VectorModification::chain_legacy_segments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4, match/switch 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.
VectorModification::follow_segments_turned_elsewhere (cognitive 19) node-graph/libraries/vector-types/src/vector/vector_modification.rs:1040— VectorModification::follow_segments_turned_elsewhere has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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.
SegmentGraph::face_orbits (cognitive 23) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:323— SegmentGraph::face_orbits has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 3 (10 pts) (nesting depth added 13). 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.
SegmentGraph::construct_faces (cognitive 22) node-graph/libraries/vector-types/src/vector/vector_attributes.rs:465— SegmentGraph::construct_faces has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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.
graphene_std::render_background::render_background (cognitive 23) node-graph/nodes/gstd/src/render_background.rs:15— graphene_std::render_background::render_background has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 13). 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.
graphene_std::render_cache::split_oversized_region (cognitive 20) node-graph/nodes/gstd/src/render_cache.rs:243— graphene_std::render_cache::split_oversized_region has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 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.
graphite_desktop::socket::run (cognitive 22) desktop/src/socket.rs:56— graphite_desktop::socket::run has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (9 pts), loops 1 (nesting depth added 12). 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.
graphite_desktop::start (cognitive 21) desktop/src/lib.rs:30— graphite_desktop::start has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 8 (9 pts), boolean chains 1, loops 1 (nesting depth added 4). 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.
SweepAngleGizmo::overlays (cognitive 22) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/sweep_angle_gizmo.rs:97— SweepAngleGizmo::overlays has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (21 pts), 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.
SweepAngleGizmo::handle_actions (cognitive 17) editor/src/messages/tool/common_functionality/gizmos/shape_gizmos/sweep_angle_gizmo.rs:61— SweepAngleGizmo::handle_actions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 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.
graphite_wasm_wrapper::helpers::render_image_data_to_canvases (cognitive 19) frontend/wrapper/src/helpers.rs:94— graphite_wasm_wrapper::helpers::render_image_data_to_canvases has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (4 pts), boolean chains 2, 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.
graphite_wasm_wrapper::native_communication::receive_native_message (cognitive 18) frontend/wrapper/src/native_communication.rs:12— graphite_wasm_wrapper::native_communication::receive_native_message has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 1 (4 pts), loops 1 (2 pts) (nesting depth added 12). 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.
Sorter::clause (cognitive 18) libraries/math-parser/src/sort.rs:683— Sorter::clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (7 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.
Sorter::call (cognitive 16) libraries/math-parser/src/sort.rs:471— Sorter::call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (4 members, 50+ identical tokens) editor/src/messages/portfolio/document/graph_operation/utility_types.rs:777— editor/src/messages/portfolio/document/graph_operation/utility_types.rs:777-787 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:800-810 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:828-838 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:841-851 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) node-graph/libraries/rendering/src/renderer.rs:1472— node-graph/libraries/rendering/src/renderer.rs:1472-1674 | node-graph/libraries/rendering/src/renderer.rs:2362-2440 | node-graph/libraries/rendering/src/renderer.rs:2662-2688 | node-graph/libraries/rendering/src/renderer.rs:2794-2874 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (23 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:103— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:103-125 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:90-112 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (23 lines × 2) editor/src/messages/tool/common_functionality/graph_modification_utils.rs:925— editor/src/messages/tool/common_functionality/graph_modification_utils.rs:925-947 | editor/src/messages/tool/common_functionality/graph_modification_utils.rs:964-986 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (21 lines × 2) editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:135— editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:135-155 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:139-159 — before extracting anything, compare `editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs` and `editor/src/messages/tool/common_functionality/shapes/star_shape.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 2) editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:535— editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:535-555 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:564-584 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) editor/src/messages/portfolio/document/overlays/utility_types_web.rs:406— editor/src/messages/portfolio/document/overlays/utility_types_web.rs:406-420 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:469-483 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) editor/src/messages/tool/common_functionality/utility_functions.rs:440— editor/src/messages/tool/common_functionality/utility_functions.rs:440-454 | editor/src/messages/tool/common_functionality/utility_functions.rs:475-489 — 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 × 3) editor/src/messages/tool/common_functionality/shapes/arc_shape.rs:166— editor/src/messages/tool/common_functionality/shapes/arc_shape.rs:166-178 | editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:142-154 | editor/src/messages/tool/common_functionality/shapes/star_shape.rs:146-158 — before extracting anything, compare `editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs` and `editor/src/messages/tool/common_functionality/shapes/star_shape.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 3) frontend/wrapper/src/editor_commands.rs:308— frontend/wrapper/src/editor_commands.rs:308-320 | frontend/wrapper/src/editor_commands.rs:346-358 | frontend/wrapper/src/editor_commands.rs:376-388 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:801— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:801-811 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:706-716 | node-graph/libraries/vector-types/src/vector/algorithms/shapes.rs:139-149 — before extracting anything, compare `editor/src/messages/portfolio/document/overlays/utility_types_native.rs` and `editor/src/messages/portfolio/document/overlays/utility_types_web.rs` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) node-graph/libraries/wgpu-executor/src/vello_render.rs:296— node-graph/libraries/wgpu-executor/src/vello_render.rs:296-306 | node-graph/libraries/wgpu-executor/src/vello_render.rs:452-462 | node-graph/nodes/gstd/src/render_background.rs:404-414 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (9–10 lines × 2) editor/src/messages/portfolio/document_migration.rs:2262— editor/src/messages/portfolio/document_migration.rs:2262-2270 | editor/src/messages/portfolio/document_migration.rs:2283-2292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) node-graph/libraries/rendering/src/render_ext.rs:90— node-graph/libraries/rendering/src/render_ext.rs:90-98 | node-graph/libraries/rendering/src/renderer.rs:668-677 — 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–9 lines × 3) editor/src/messages/portfolio/document_migration.rs:1475— editor/src/messages/portfolio/document_migration.rs:1475-1482 | editor/src/messages/portfolio/document_migration.rs:1536-1543 | editor/src/messages/portfolio/document_migration.rs:1594-1602 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–9 lines × 3) node-graph/libraries/rendering/src/render_ext.rs:284— node-graph/libraries/rendering/src/render_ext.rs:284-292 | node-graph/libraries/rendering/src/renderer.rs:1885-1892 | node-graph/libraries/rendering/src/renderer.rs:1975-1982 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (6–8 lines × 2) editor/src/messages/portfolio/document/graph_operation/utility_types.rs:161— editor/src/messages/portfolio/document/graph_operation/utility_types.rs:161-166 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:213-220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6–8 lines × 2) editor/src/messages/portfolio/document_migration.rs:2134— editor/src/messages/portfolio/document_migration.rs:2134-2141 | editor/src/messages/portfolio/document_migration.rs:2186-2191 — 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 × 4) editor/src/messages/color_picker/color_picker_message_handler.rs:221— editor/src/messages/color_picker/color_picker_message_handler.rs:221-227 | editor/src/messages/color_picker/color_picker_message_handler.rs:243-249 | editor/src/messages/color_picker/color_picker_message_handler.rs:252-258 | editor/src/messages/color_picker/color_picker_message_handler.rs:261-267 — 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 (7 lines × 4) node-graph/libraries/rendering/src/renderer.rs:1652— node-graph/libraries/rendering/src/renderer.rs:1652-1659 | node-graph/libraries/rendering/src/renderer.rs:2432-2438 | node-graph/libraries/rendering/src/renderer.rs:2680-2687 | node-graph/libraries/rendering/src/renderer.rs:2866-2873 — 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) node-graph/libraries/graphic-types/src/graphic.rs:694— node-graph/libraries/graphic-types/src/graphic.rs:694-699 | node-graph/libraries/graphic-types/src/graphic.rs:713-718 | node-graph/libraries/graphic-types/src/graphic.rs:737-742 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) editor/src/messages/portfolio/document/graph_operation/utility_types.rs:162— editor/src/messages/portfolio/document/graph_operation/utility_types.rs:162-167 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:171-176 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:181-186 — 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.
Dead file (~103 LoC) frontend/src/stores/document.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~103 LoC) frontend/src/utility-functions/widgets.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark frontend/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>.
AC3 · Page structure· Data table has no header cells · ×1
Data table has no header cells frontend/src/components/widgets/WidgetTable.svelte:14— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
PathToolFsmState::transition (cyclomatic 269) editor/src/messages/tool/tool_messages/path_tool.rs:1581— PathToolFsmState::transition has cyclomatic complexity 269 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SelectToolFsmState::transition (cyclomatic 189) editor/src/messages/tool/tool_messages/select_tool.rs:901— SelectToolFsmState::transition has cyclomatic complexity 189 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PortfolioMessageHandler::process_message (cyclomatic 156) editor/src/messages/portfolio/portfolio_message_handler.rs:72— PortfolioMessageHandler::process_message has cyclomatic complexity 156 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GradientToolFsmState::transition (cyclomatic 136) editor/src/messages/tool/tool_messages/gradient_tool.rs:911— GradientToolFsmState::transition has cyclomatic complexity 136 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PenToolFsmState::transition (cyclomatic 135) editor/src/messages/tool/tool_messages/pen_tool.rs:1496— PenToolFsmState::transition has cyclomatic complexity 135 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ShapeToolFsmState::transition (cyclomatic 103) editor/src/messages/tool/tool_messages/shape_tool.rs:871— ShapeToolFsmState::transition has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TransformLayerMessageHandler::process_message (cyclomatic 100) editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:112— TransformLayerMessageHandler::process_message has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ClipboardMessageHandler::process_message (cyclomatic 94) editor/src/messages/clipboard/clipboard_message_handler.rs:36— ClipboardMessageHandler::process_message has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GraphOperationMessageHandler::process_message (cyclomatic 81) editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:34— GraphOperationMessageHandler::process_message has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NavigationMessageHandler::process_message (cyclomatic 80) editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:41— NavigationMessageHandler::process_message has cyclomatic complexity 80 (threshold 15). Of this number, 77 points are the body's own statements and 3 belong to 2 function items 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.
WorkspaceMessageHandler::process_message (cyclomatic 70) editor/src/messages/portfolio/workspace/workspace_message_handler.rs:21— WorkspaceMessageHandler::process_message has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TextToolFsmState::transition (cyclomatic 65) editor/src/messages/tool/tool_messages/text_tool.rs:644— TextToolFsmState::transition has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ToolMessageHandler::handle_message (cyclomatic 50) editor/src/messages/tool/tool_message_handler.rs:44— ToolMessageHandler::handle_message has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Key::fmt (cyclomatic 49) editor/src/messages/input_mapper/utility_types/keyboard.rs:248— Key::fmt has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
InputState::process (cyclomatic 46) desktop/src/input.rs:95— InputState::process has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ArtboardToolFsmState::transition (cyclomatic 45) editor/src/messages/tool/tool_messages/artboard_tool.rs:323— ArtboardToolFsmState::transition has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Dispatcher::handle_message (cyclomatic 42) editor/src/dispatcher.rs:159— Dispatcher::handle_message has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Document::apply_op_with (cyclomatic 40) document/graph-storage/src/document.rs:190— Document::apply_op_with has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SegmentModification::apply (cyclomatic 39) node-graph/libraries/vector-types/src/vector/vector_modification.rs:234— SegmentModification::apply has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SplineToolFsmState::transition (cyclomatic 36) editor/src/messages/tool/tool_messages/spline_tool.rs:329— SplineToolFsmState::transition has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NodeGraphExecutor::poll_node_graph_evaluation (cyclomatic 35) editor/src/node_graph_executor.rs:378— NodeGraphExecutor::poll_node_graph_evaluation has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
WorkingVector::reweave (cyclomatic 35) node-graph/libraries/vector-types/src/vector/flatten.rs:98— WorkingVector::reweave has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
input.shouldRedirectKeyboardEventToBackend (cyclomatic 33) frontend/src/utility-functions/input.ts:25— input.shouldRedirectKeyboardEventToBackend has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
ShapeTool::process_message (cyclomatic 31) editor/src/messages/tool/tool_messages/shape_tool.rs:541— ShapeTool::process_message has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ValueNode::eval_in (cyclomatic 31) libraries/math-parser/src/executer.rs:334— ValueNode::eval_in has cyclomatic complexity 31 (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.
NodeFnAttributes::parse (cyclomatic 29) node-graph/node-macro/src/parsing.rs:447— NodeFnAttributes::parse 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.
path_bool_nodes::flatten_vector (cyclomatic 29) node-graph/nodes/path-bool/src/lib.rs:188— path_bool_nodes::flatten_vector has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
ResourceMessageHandler::process_message (cyclomatic 28) editor/src/messages/portfolio/document/resource/resource_message_handler.rs:28— ResourceMessageHandler::process_message has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GradientTool::process_message (cyclomatic 28) editor/src/messages/tool/tool_messages/gradient_tool.rs:89— GradientTool::process_message has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SelectedGradient::update_gradient (cyclomatic 28) editor/src/messages/tool/tool_messages/gradient_tool.rs:614— SelectedGradient::update_gradient has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DiffUpdate::apply_keyboard_shortcut (cyclomatic 27) editor/src/messages/layout/utility_types/layout_widget.rs:1017— DiffUpdate::apply_keyboard_shortcut has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body's own statements and 6 belong to 3 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
EditorSession::dispatch (cyclomatic 26) tools/web-editor-driver/src/session.rs:160— EditorSession::dispatch has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
TextTool::process_message (cyclomatic 25) editor/src/messages/tool/tool_messages/text_tool.rs:284— TextTool::process_message 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.
NodeNetwork::flatten_with_fns (cyclomatic 25) node-graph/graph-craft/src/document.rs:910— NodeNetwork::flatten_with_fns 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.
graphic_types::graphic::flatten_graphic_list::flatten_recursive (cyclomatic 25) node-graph/libraries/graphic-types/src/graphic.rs:192— graphic_types::graphic::flatten_graphic_list::flatten_recursive 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.
InputPreprocessorMessageHandler::process_message (cyclomatic 24) editor/src/messages/input_preprocessor/input_preprocessor_message_handler.rs:38— InputPreprocessorMessageHandler::process_message has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
BoundingBoxManager::check_selected_edges (cyclomatic 24) editor/src/messages/tool/common_functionality/transformation_cage.rs:669— BoundingBoxManager::check_selected_edges 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.
MatrixNode::eval_in (cyclomatic 23) libraries/math-parser/src/executer.rs:517— MatrixNode::eval_in has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphite_desktop::start (cyclomatic 22) desktop/src/lib.rs:30— graphite_desktop::start has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Gdd::stream_entries (cyclomatic 22) document/format/src/export.rs:140— Gdd::stream_entries has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DialogMessageHandler::process_message (cyclomatic 22) editor/src/messages/dialog/dialog_message_handler.rs:25— DialogMessageHandler::process_message has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Curve::subdivision_intersections (cyclomatic 22) libraries/snapping/src/curve.rs:396— Curve::subdivision_intersections has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TypingContext::infer (cyclomatic 22) node-graph/graph-craft/src/proto.rs:789— TypingContext::infer has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SelectTool::process_message (cyclomatic 21) editor/src/messages/tool/tool_messages/select_tool.rs:351— SelectTool::process_message has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graph_craft::document::value::deserialize_tagged_value_with_legacy_migration (cyclomatic 21) node-graph/graph-craft/src/document/value.rs:769— graph_craft::document::value::deserialize_tagged_value_with_legacy_migration 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.
Lut::apply (cyclomatic 21) node-graph/nodes/raster/src/color_lookup_table.rs:274— Lut::apply has cyclomatic complexity 21 (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.
markdown.parseMarkdown (cyclomatic 21) REDACTED:10— markdown.parseMarkdown 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.
SnapSession::snap_features (cyclomatic 20) editor/src/messages/tool/common_functionality/snap_session.rs:206— SnapSession::snap_features 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.
PenToolData::drag_handle (cyclomatic 20) editor/src/messages/tool/tool_messages/pen_tool.rs:1033— PenToolData::drag_handle 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.
input.tabBetweenTextFields (cyclomatic 20) frontend/src/utility-functions/input.ts:387— input.tabBetweenTextFields has cyclomatic complexity 20 (threshold 15). Of this number, 17 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.
keyboard-entry.getLocalizedScanCode (cyclomatic 20) frontend/src/utility-functions/keyboard-entry.ts:41— keyboard-entry.getLocalizedScanCode 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.
IngestMessageHandler::process_message (cyclomatic 19) editor/src/messages/portfolio/ingest/ingest_message_handler.rs:20— IngestMessageHandler::process_message has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
graphene_cli::main (cyclomatic 19) node-graph/graphene-cli/src/main.rs:96— graphene_cli::main 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.
navbar.setRipples (cyclomatic 19) website/static/js/navbar.js:180— navbar.setRipples has cyclomatic complexity 19 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
RenderState::render (cyclomatic 18) desktop/src/render/state.rs:245— RenderState::render has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Gradient::interpolated_samples (cyclomatic 18) node-graph/libraries/vector-types/src/gradient.rs:1451— Gradient::interpolated_samples has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (linear_samples, subdivide). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
Preprocessor::new (cyclomatic 18) node-graph/preprocessor/src/lib.rs:152— Preprocessor::new 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.
clipboard.readAtCaret (cyclomatic 18) frontend/src/utility-functions/clipboard.ts:4— clipboard.readAtCaret 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.
AnimationMessageHandler::process_message (cyclomatic 17) editor/src/messages/animation/animation_message_handler.rs:62— AnimationMessageHandler::process_message has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
EditorDelta::construct (cyclomatic 17) editor/src/messages/portfolio/document/utility_types/network_interface/editor_delta.rs:144— EditorDelta::construct has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
BrushToolFsmState::transition (cyclomatic 17) editor/src/messages/tool/tool_messages/brush_tool.rs:430— BrushToolFsmState::transition 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.
FreehandToolFsmState::transition (cyclomatic 17) editor/src/messages/tool/tool_messages/freehand_tool.rs:248— FreehandToolFsmState::transition 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.
PointModification::apply (cyclomatic 17) node-graph/libraries/vector-types/src/vector/vector_modification.rs:31— PointModification::apply 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.
navbar.initializeRipples (cyclomatic 17) website/static/js/navbar.js:45— navbar.initializeRipples has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 69, 87, 83). 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.
bisect-tool.document.addEventListener("DOMContentLoaded")::presentCommit (cyclomatic 17) website/static/js/page/contributor-guide/bisect-tool.js:308— bisect-tool.document.addEventListener("DOMContentLoaded")::presentCommit 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.
KeyboardHandlerImpl::on_key_event (cyclomatic 16) desktop/ui/src/internal/keyboard_handler.rs:38— KeyboardHandlerImpl::on_key_event has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
TransformOperation::hints (cyclomatic 16) editor/src/messages/portfolio/document/utility_types/transformation.rs:427— TransformOperation::hints 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.
BrushTool::process_message (cyclomatic 16) editor/src/messages/tool/tool_messages/brush_tool.rs:202— BrushTool::process_message has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FillToolFsmState::transition (cyclomatic 16) editor/src/messages/tool/tool_messages/fill_tool.rs:131— FillToolFsmState::transition 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.
brush_nodes::basic_brush::render::render (cyclomatic 16) node-graph/nodes/brush/src/basic_brush/render.rs:136— brush_nodes::basic_brush::render::render has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
persistence.migrateToNewFormat (cyclomatic 16) frontend/src/utility-functions/persistence.ts:147— persistence.migrateToNewFormat has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 159). 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.
book.trackScrollHeadingInTOC::updateVisibleHeading (cyclomatic 16) website/static/js/template/book.js:8— book.trackScrollHeadingInTOC::updateVisibleHeading 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.
Yanked release: spin — `spin` resolves to 0.10.0 in the committed REDACTED, and crates.io reports that release as YANKED. A yanked release is one the publisher has withdrawn and asked you to stop using; it keeps resolving only so existing locks do not break. The current stable release is 0.12.3. Run `cargo update -p spin` and commit the updated lock.
Repeated repair: node-graph/graph-craft/src/application_io/resource/opfs.rs node-graph/graph-craft/src/application_io/resource/opfs.rs:220— node-graph/graph-craft/src/application_io/resource/opfs.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is graph_craft::application_io::resource::opfs::read_from_opfs at line 220), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix several bugs causing warning spam in the console (#4547)”; “Improve fix for corrupted font resource loading in older documents (#4482)”; “Fix corrupted font resource loading in older documents”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 20:12:56 -07:00' --until='2026-10-25 20:12:56 -07:00' --full-history --no-merges -- node-graph/graph-craft/src/application_io/resource/opfs.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
TodoComment repeated across 19 files node-graph/nodes/text/src/font.rs:67— The identical TodoComment appears in 19 files (94 occurrences) — almost certainly one boilerplate line from a single migration or decision, not 94 independent debts. Fix the systemic cause once rather than file-by-file. Text: "// TODO: Eventually remove this document upgrade code". Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)
PathToolFsmState::transition (cognitive 590) editor/src/messages/tool/tool_messages/path_tool.rs:1581— PathToolFsmState::transition has cognitive complexity 590 (threshold 15). Drivers by points: if/else 147 (407 pts), loops 31 (103 pts), boolean chains 42, match/switch 16 (38 pts) (nesting depth added 354). 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.
SelectToolFsmState::transition (cognitive 369) editor/src/messages/tool/tool_messages/select_tool.rs:901— SelectToolFsmState::transition has cognitive complexity 369 (threshold 15). Drivers by points: if/else 116 (278 pts), match/switch 17 (42 pts), boolean chains 36, loops 4 (13 pts) (nesting depth added 196). 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.
GradientToolFsmState::transition (cognitive 304) editor/src/messages/tool/tool_messages/gradient_tool.rs:911— GradientToolFsmState::transition has cognitive complexity 304 (threshold 15). Drivers by points: if/else 80 (218 pts), match/switch 12 (36 pts), loops 9 (28 pts), boolean chains 22 (nesting depth added 181). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PortfolioMessageHandler::process_message (cognitive 237) editor/src/messages/portfolio/portfolio_message_handler.rs:72— PortfolioMessageHandler::process_message has cognitive complexity 237 (threshold 15). Drivers by points: if/else 76 (173 pts), loops 14 (34 pts), boolean chains 15, match/switch 8 (15 pts) (nesting depth added 124). 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.
PenToolFsmState::transition (cognitive 223) editor/src/messages/tool/tool_messages/pen_tool.rs:1496— PenToolFsmState::transition has cognitive complexity 223 (threshold 15). Drivers by points: if/else 85 (183 pts), boolean chains 18, loops 4 (11 pts), match/switch 6 (11 pts) (nesting depth added 110). 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.
ClipboardMessageHandler::process_message (cognitive 204) editor/src/messages/clipboard/clipboard_message_handler.rs:36— ClipboardMessageHandler::process_message has cognitive complexity 204 (threshold 15). Drivers by points: if/else 40 (110 pts), loops 18 (55 pts), match/switch 11 (32 pts), boolean chains 7 (nesting depth added 128). 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.
TransformLayerMessageHandler::process_message (cognitive 190) editor/src/messages/tool/transform_layer/transform_layer_message_handler.rs:112— TransformLayerMessageHandler::process_message has cognitive complexity 190 (threshold 15). Drivers by points: if/else 66 (157 pts), boolean chains 16, match/switch 6 (12 pts), loops 2 (5 pts) (nesting depth added 100). 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.
WorkspaceMessageHandler::process_message (cognitive 125) editor/src/messages/portfolio/workspace/workspace_message_handler.rs:21— WorkspaceMessageHandler::process_message has cognitive complexity 125 (threshold 15). Drivers by points: if/else 43 (96 pts), loops 10 (21 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 65). 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.
NavigationMessageHandler::process_message (cognitive 119) editor/src/messages/portfolio/document/navigation/navigation_message_handler.rs:41— NavigationMessageHandler::process_message has cognitive complexity 119 (threshold 15). Drivers by points: if/else 59 (105 pts), boolean chains 8, match/switch 3 (6 pts) (nesting depth added 49). Of this number, 113 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeToolFsmState::transition (cognitive 118) editor/src/messages/tool/tool_messages/shape_tool.rs:871— ShapeToolFsmState::transition has cognitive complexity 118 (threshold 15). Drivers by points: if/else 43 (94 pts), boolean chains 15, match/switch 5 (9 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GraphOperationMessageHandler::process_message (cognitive 100) editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:34— GraphOperationMessageHandler::process_message has cognitive complexity 100 (threshold 15). Drivers by points: if/else 40 (78 pts), loops 5 (13 pts), match/switch 4 (9 pts) (nesting depth added 51). 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.
TextToolFsmState::transition (cognitive 99) editor/src/messages/tool/tool_messages/text_tool.rs:644— TextToolFsmState::transition has cognitive complexity 99 (threshold 15). Drivers by points: if/else 40 (87 pts), boolean chains 8, loops 1 (3 pts), match/switch 1 (nesting depth added 49). 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.
NodeGraphExecutor::poll_node_graph_evaluation (cognitive 83) editor/src/node_graph_executor.rs:378— NodeGraphExecutor::poll_node_graph_evaluation has cognitive complexity 83 (threshold 15). Drivers by points: if/else 18 (49 pts), match/switch 7 (22 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graphic_types::graphic::flatten_graphic_list::flatten_recursive (cognitive 77) node-graph/libraries/graphic-types/src/graphic.rs:192— graphic_types::graphic::flatten_graphic_list::flatten_recursive has cognitive complexity 77 (threshold 15). Drivers by points: if/else 12 (48 pts), loops 6 (21 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ArtboardToolFsmState::transition (cognitive 67) editor/src/messages/tool/tool_messages/artboard_tool.rs:323— ArtboardToolFsmState::transition has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (49 pts), match/switch 4 (11 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InputState::process (cognitive 57) desktop/src/input.rs:95— InputState::process has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 16 (35 pts), if/else 8 (18 pts), boolean chains 4 (nesting depth added 29). 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.
WorkingVector::reweave (cognitive 57) node-graph/libraries/vector-types/src/vector/flatten.rs:98— WorkingVector::reweave has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 7 (11 pts), boolean chains 9, match/switch 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ToolMessageHandler::handle_message (cognitive 55) editor/src/messages/tool/tool_message_handler.rs:44— ToolMessageHandler::handle_message has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (49 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 28). 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.
SegmentModification::apply (cognitive 54) node-graph/libraries/vector-types/src/vector/vector_modification.rs:234— SegmentModification::apply has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 6 (14 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ResourceMessageHandler::process_message (cognitive 53) editor/src/messages/portfolio/document/resource/resource_message_handler.rs:28— ResourceMessageHandler::process_message has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 7 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 30). Of this number, 51 points are the body's own statements and 2 belong to one function item inside it that branches. 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.
SplineToolFsmState::transition (cognitive 52) editor/src/messages/tool/tool_messages/spline_tool.rs:329— SplineToolFsmState::transition has cognitive complexity 52 (threshold 15). Drivers by points: if/else 25 (47 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SelectedGradient::update_gradient (cognitive 44) editor/src/messages/tool/tool_messages/gradient_tool.rs:614— SelectedGradient::update_gradient has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 4, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Document::apply_op_with (cognitive 43) document/graph-storage/src/document.rs:190— Document::apply_op_with has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 21). 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.
NodeFnAttributes::parse (cognitive 43) node-graph/node-macro/src/parsing.rs:447— NodeFnAttributes::parse has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (40 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ValueNode::eval_in (cognitive 42) libraries/math-parser/src/executer.rs:334— ValueNode::eval_in has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 6 (11 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 18). 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.
Dispatcher::handle_message (cognitive 40) editor/src/dispatcher.rs:159— Dispatcher::handle_message has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 6, match/switch 1 (2 pts), loops 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.
BoundingBoxManager::check_selected_edges (cognitive 40) editor/src/messages/tool/common_functionality/transformation_cage.rs:669— BoundingBoxManager::check_selected_edges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 11 (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.
GradientTool::process_message (cognitive 39) editor/src/messages/tool/tool_messages/gradient_tool.rs:89— GradientTool::process_message has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (31 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 19). 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.
Curve::subdivision_intersections (cognitive 39) libraries/snapping/src/curve.rs:396— Curve::subdivision_intersections has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 8, loops 4 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
path_bool_nodes::flatten_vector (cognitive 38) node-graph/nodes/path-bool/src/lib.rs:188— path_bool_nodes::flatten_vector has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (12 pts), boolean chains 4, match/switch 2 (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.
TypingContext::infer (cognitive 37) node-graph/graph-craft/src/proto.rs:789— TypingContext::infer has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (7 pts), boolean chains 2, match/switch 2 (nesting depth added 18). Of this number, 33 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
markdown.parseMarkdown (cognitive 37) REDACTED:10— markdown.parseMarkdown has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 6, ternaries 1 (3 pts), loops 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.
Gdd::stream_entries (cognitive 36) document/format/src/export.rs:140— Gdd::stream_entries has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 6 (9 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.
keyboard-entry.getLocalizedScanCode (cognitive 33) frontend/src/utility-functions/keyboard-entry.ts:41— keyboard-entry.getLocalizedScanCode has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 1 (3 pts), ternaries 1 (3 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.
input.shouldRedirectKeyboardEventToBackend (cognitive 31) frontend/src/utility-functions/input.ts:25— input.shouldRedirectKeyboardEventToBackend has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 13, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OriginalTransforms::update (cognitive 30) editor/src/messages/portfolio/document/utility_types/transformation.rs:63— OriginalTransforms::update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 18). 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.
graph_craft::document::value::deserialize_tagged_value_with_legacy_migration (cognitive 30) node-graph/graph-craft/src/document/value.rs:769— graph_craft::document::value::deserialize_tagged_value_with_legacy_migration has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TextTool::process_message (cognitive 29) editor/src/messages/tool/tool_messages/text_tool.rs:284— TextTool::process_message has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 5, match/switch 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.
graphene_cli::main (cognitive 26) node-graph/graphene-cli/src/main.rs:96— graphene_cli::main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (4 pts), match/switch 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.
Lut::apply (cognitive 26) node-graph/nodes/raster/src/color_lookup_table.rs:274— Lut::apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (6 pts), boolean chains 5, match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NetworkView::connected_to_output (cognitive 25) editor/src/messages/portfolio/document/utility_types/network_interface/view.rs:332— NetworkView::connected_to_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Graphic::collect_metadata (cognitive 25) node-graph/libraries/rendering/src/renderer.rs:1120— Graphic::collect_metadata has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bisect-tool.document.addEventListener("DOMContentLoaded")::presentCommit (cognitive 25) website/static/js/page/contributor-guide/bisect-tool.js:308— bisect-tool.document.addEventListener("DOMContentLoaded")::presentCommit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (24 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.
FillToolFsmState::transition (cognitive 24) editor/src/messages/tool/tool_messages/fill_tool.rs:131— FillToolFsmState::transition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapeTool::process_message (cognitive 24) editor/src/messages/tool/tool_messages/shape_tool.rs:541— ShapeTool::process_message has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, 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.
MmapResourceStorage::garbage_collect (cognitive 24) node-graph/graph-craft/src/application_io/resource/mmap.rs:116— MmapResourceStorage::garbage_collect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TargetPath::from_contours_and_faces (cognitive 24) node-graph/libraries/vector-types/src/vector/click_target.rs:137— TargetPath::from_contours_and_faces has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
brush_nodes::basic_brush::render::render (cognitive 24) node-graph/nodes/brush/src/basic_brush/render.rs:136— brush_nodes::basic_brush::render::render has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (3 pts), boolean chains 2, match/switch 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.
cargo_run_internal_watch::watch (cognitive 24) tools/cargo-run/internal/watch/src/main.rs:43— cargo_run_internal_watch::watch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 15). 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.
core_types::types::rewrite_ranked_type_wrappers (cognitive 23) node-graph/libraries/core-types/src/types.rs:444— core_types::types::rewrite_ranked_type_wrappers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Gradient::interpolated_samples (cognitive 23) node-graph/libraries/vector-types/src/gradient.rs:1451— Gradient::interpolated_samples has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 7). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (linear_samples, subdivide). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
Selected::revert_operation (cognitive 22) editor/src/messages/portfolio/document/utility_types/transformation.rs:690— Selected::revert_operation has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (8 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
IngestMessageHandler::process_message (cognitive 22) editor/src/messages/portfolio/ingest/ingest_message_handler.rs:20— IngestMessageHandler::process_message has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
FreehandToolFsmState::transition (cognitive 22) editor/src/messages/tool/tool_messages/freehand_tool.rs:248— FreehandToolFsmState::transition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
carousel.initializeCarousel (cognitive 22) website/static/js/component/carousel.js:27— carousel.initializeCarousel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, ternaries 1 (nesting depth added 8). None of this is in the body itself: all 22 points belong to 8 function literals inside it that branch (lines 94, 36, 88, …). 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.
navbar.setRipples (cognitive 22) website/static/js/navbar.js:180— navbar.setRipples has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 6). Of this number, 18 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.
InputPreprocessorMessageHandler::process_message (cognitive 21) editor/src/messages/input_preprocessor/input_preprocessor_message_handler.rs:38— InputPreprocessorMessageHandler::process_message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). 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.
Resize::snap_box (cognitive 21) editor/src/messages/tool/common_functionality/resize.rs:75— Resize::snap_box has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
crate_hierarchy_viz::main (cognitive 21) tools/crate-hierarchy-viz/src/main.rs:87— crate_hierarchy_viz::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 pts), match/switch 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.
persistence.migrateToNewFormat (cognitive 21) frontend/src/utility-functions/persistence.ts:147— persistence.migrateToNewFormat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 159). 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.
BrushToolFsmState::transition (cognitive 20) editor/src/messages/tool/tool_messages/brush_tool.rs:430— BrushToolFsmState::transition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (5 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.
HintData::to_layout (cognitive 20) editor/src/messages/tool/utility_types.rs:543— HintData::to_layout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MatrixNode::eval_in (cognitive 20) libraries/math-parser/src/executer.rs:517— MatrixNode::eval_in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
EditorSession::dispatch (cognitive 20) tools/web-editor-driver/src/session.rs:160— EditorSession::dispatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (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.
clipboard.readAtCaret (cognitive 20) frontend/src/utility-functions/clipboard.ts:4— clipboard.readAtCaret has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
book.trackScrollHeadingInTOC::updateVisibleHeading (cognitive 20) website/static/js/template/book.js:8— book.trackScrollHeadingInTOC::updateVisibleHeading has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransformOperation::hints (cognitive 19) editor/src/messages/portfolio/document/utility_types/transformation.rs:427— TransformOperation::hints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Mesh::locate (cognitive 19) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:538— Mesh::locate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ObstacleGrid::nearest (cognitive 19) node-graph/libraries/vector-types/src/vector/algorithms/concave_hull.rs:908— ObstacleGrid::nearest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
input.tabBetweenTextFields (cognitive 19) frontend/src/utility-functions/input.ts:387— input.tabBetweenTextFields has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 5 (6 pts) (nesting depth added 1). Of this number, 16 points are the body's own statements and 3 belong to one function literal inside it that branches. 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.
DiffUpdate::apply_keyboard_shortcut (cognitive 18) editor/src/messages/layout/utility_types/layout_widget.rs:1017— DiffUpdate::apply_keyboard_shortcut has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), match/switch 4 (nesting depth added 6). Of this number, 10 points are the body's own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OverlaysMessageHandler::process_message (cognitive 18) editor/src/messages/portfolio/document/overlays/overlays_message_handler.rs:22— OverlaysMessageHandler::process_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 10). 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.
carousel.updateVideoSyncForTransitions (cognitive 18) website/static/js/component/carousel.js:288— carousel.updateVideoSyncForTransitions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function items inside it that branch (syncTornVideos, a function literal at line 297). 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.
PlaneReceiver::recv (cognitive 17) desktop/ui/src/frames/plane/linux.rs:171— PlaneReceiver::recv has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FrameStreamer::publish (cognitive 17) desktop/ui/src/frames/streamer.rs:105— FrameStreamer::publish has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (4 pts), boolean chains 2, 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.
ModifyInputsContext::gradient_stops_set (cognitive 17) editor/src/messages/portfolio/document/graph_operation/utility_types.rs:589— ModifyInputsContext::gradient_stops_set 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.
Connectivity::build (cognitive 17) node-graph/libraries/vector-types/src/vector/connectivity.rs:35— Connectivity::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (7 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.
LayoutGroup::diff (cognitive 16) editor/src/messages/layout/utility_types/layout_widget.rs:553— LayoutGroup::diff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (5 pts), boolean chains 1, 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.
FlowIter::next (cognitive 16) editor/src/messages/portfolio/document/utility_types/network_interface/types.rs:107— FlowIter::next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (3 pts), boolean chains 2, 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.
FontsMessageHandler::process_message (cognitive 16) editor/src/messages/portfolio/fonts/fonts_message_handler.rs:34— FontsMessageHandler::process_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 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.
NavigateToolFsmState::transition (cognitive 16) editor/src/messages/tool/tool_messages/navigate_tool.rs:98— NavigateToolFsmState::transition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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.
cargo_run_internal_download::extract_tar_gz (cognitive 16) tools/cargo-run/internal/download/src/main.rs:80— cargo_run_internal_download::extract_tar_gz has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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.
D4 · Code Duplication· Near-duplicate member family (4 members, 29 shared lines) · ×1
Near-duplicate member family (4 members, 29 shared lines) editor/src/messages/portfolio/document/overlays/utility_types_web.rs:244— editor/src/messages/portfolio/document/overlays/utility_types_web.rs:244-300 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:307-352 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:369-426 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:438-489 — These 4 members are variants of one another: a block of 29 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Near-duplicate member pair (21 shared lines) editor/src/messages/portfolio/document_migration.rs:3613— editor/src/messages/portfolio/document_migration.rs:3613-3638 | editor/src/messages/portfolio/document_storage_io.rs:290-360 — These two members are variants of one another: 21 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (29 corresponding lines) · ×1
Edited copy of a member (29 corresponding lines) editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1225— editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1225-1253 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:1116-1144 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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) node-graph/nodes/transform/src/transform_nodes.rs:36— node-graph/nodes/transform/src/transform_nodes.rs:36-56 | node-graph/nodes/transform/src/transform_nodes.rs:68-88 — 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 (14 corresponding lines) · ×1
Edited copy of a member (14 corresponding lines) node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:183— node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:183-197 | node-graph/libraries/vector-types/src/vector/algorithms/intersection.rs:243-257 — 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.
Duplicated block (31 lines × 2) editor/src/messages/portfolio/document/utility_types/wires.rs:496— editor/src/messages/portfolio/document/utility_types/wires.rs:496-526 | editor/src/messages/portfolio/document/utility_types/wires.rs:535-565 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (28–29 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:2365— editor/src/messages/tool/tool_messages/path_tool.rs:2365-2393 | editor/src/messages/tool/tool_messages/path_tool.rs:2466-2493 — 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 (4–25 lines × 3) editor/src/messages/tool/common_functionality/compass_rose.rs:16— editor/src/messages/tool/common_functionality/compass_rose.rs:16-40 | editor/src/messages/tool/common_functionality/pivot.rs:232-256 | editor/src/messages/tool/common_functionality/shapes/shape_utility.rs:226-229 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (24 lines × 3) editor/src/messages/tool/tool_messages/path_tool.rs:2092— editor/src/messages/tool/tool_messages/path_tool.rs:2092-2115 | editor/src/messages/tool/tool_messages/path_tool.rs:2216-2239 | editor/src/messages/tool/tool_messages/path_tool.rs:2315-2338 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (2–24 lines × 16) editor/src/messages/portfolio/document_migration.rs:2076— editor/src/messages/portfolio/document_migration.rs:2076-2080 | editor/src/messages/portfolio/document_migration.rs:2514-2518 | editor/src/messages/portfolio/document_migration.rs:2527-2529 | editor/src/messages/portfolio/document_migration.rs:2543-2545 | editor/src/messages/portfolio/document_migration.rs:2555-2557 | editor/src/messages/portfolio/document_migration.rs:2767-2769 | editor/src/messages/portfolio/document_migration.rs:2828-2832 | editor/src/messages/portfolio/document_migration.rs:2843-2845 | editor/src/messages/portfolio/document_migration.rs:2856-2858 | editor/src/messages/portfolio/document_migration.rs:2886-2888 | editor/src/messages/portfolio/document_migration.rs:3159-3160 | editor/src/messages/portfolio/document_migration.rs:3234-3257 | editor/src/messages/portfolio/document_migration.rs:3299-3322 | editor/src/messages/portfolio/document_migration.rs:3359-3360 | editor/src/messages/portfolio/document_migration.rs:3372-3373 | editor/src/messages/portfolio/document_migration.rs:3411-3412 — all 16 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 (22–23 lines × 2) editor/src/messages/tool/tool_messages/pen_tool.rs:2106— editor/src/messages/tool/tool_messages/pen_tool.rs:2106-2128 | editor/src/messages/tool/tool_messages/pen_tool.rs:2145-2166 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) editor/src/messages/tool/tool_messages/gradient_tool.rs:700— editor/src/messages/tool/tool_messages/gradient_tool.rs:700-721 | editor/src/messages/tool/tool_messages/gradient_tool.rs:746-767 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–19 lines × 2) editor/src/messages/portfolio/document/document_message_handler.rs:1033— editor/src/messages/portfolio/document/document_message_handler.rs:1033-1051 | editor/src/messages/portfolio/document/document_message_handler.rs:1094-1111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17–18 lines × 2) editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:1026— editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:1026-1043 | editor/src/messages/portfolio/document/graph_operation/graph_operation_message_handler.rs:1055-1071 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 4) editor/src/messages/portfolio/document/overlays/utility_types_web.rs:252— editor/src/messages/portfolio/document/overlays/utility_types_web.rs:252-268 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:311-327 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:375-391 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:449-465 — 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 (13–15 lines × 2) editor/src/messages/portfolio/document/document_message_handler.rs:3918— editor/src/messages/portfolio/document/document_message_handler.rs:3918-3930 | editor/src/messages/portfolio/document/node_graph/node_graph_message_handler.rs:3356-3370 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 3) editor/src/messages/tool/tool_messages/select_tool.rs:1906— editor/src/messages/tool/tool_messages/select_tool.rs:1906-1919 | editor/src/messages/tool/tool_messages/select_tool.rs:2206-2219 | editor/src/messages/tool/tool_messages/select_tool.rs:2266-2279 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11–14 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:2949— editor/src/messages/tool/tool_messages/path_tool.rs:2949-2962 | editor/src/messages/tool/tool_messages/path_tool.rs:3065-3075 — 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–13 lines × 2) editor/src/messages/portfolio/document/document_message_handler.rs:703— editor/src/messages/portfolio/document/document_message_handler.rs:703-712 | editor/src/messages/portfolio/document/document_message_handler.rs:724-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.
Duplicated block (12 lines × 4) editor/src/messages/portfolio/document/overlays/utility_types_web.rs:289— editor/src/messages/portfolio/document/overlays/utility_types_web.rs:289-300 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:341-352 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:415-426 | editor/src/messages/portfolio/document/overlays/utility_types_web.rs:478-489 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11–12 lines × 2) node-graph/libraries/rendering/src/renderer.rs:1860— node-graph/libraries/rendering/src/renderer.rs:1860-1871 | node-graph/libraries/rendering/src/renderer.rs:1949-1959 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 4) node-graph/nodes/brush/src/basic_brush/pipeline.rs:303— node-graph/nodes/brush/src/basic_brush/pipeline.rs:303-313 | node-graph/nodes/gstd/src/render_background.rs:231-241 | node-graph/nodes/gstd/src/render_background.rs:260-270 | node-graph/nodes/gstd/src/render_background.rs:302-312 — 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.
Duplicated block (9–11 lines × 2) editor/src/messages/tool/common_functionality/shape_editor.rs:1473— editor/src/messages/tool/common_functionality/shape_editor.rs:1473-1483 | editor/src/messages/tool/tool_messages/path_tool.rs:845-853 — 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 (4–11 lines × 3) node-graph/libraries/rendering/src/renderer.rs:993— node-graph/libraries/rendering/src/renderer.rs:993-1001 | node-graph/libraries/rendering/src/renderer.rs:1041-1051 | node-graph/libraries/rendering/src/renderer.rs:1056-1059 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–10 lines × 2) editor/src/messages/portfolio/document/document_message_handler.rs:2843— editor/src/messages/portfolio/document/document_message_handler.rs:2843-2852 | editor/src/messages/portfolio/document/document_message_handler.rs:2871-2878 — 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 × 4) node-graph/nodes/text/src/regex.rs:68— node-graph/nodes/text/src/regex.rs:68-76 | node-graph/nodes/text/src/regex.rs:119-127 | node-graph/nodes/text/src/regex.rs:191-199 | node-graph/nodes/text/src/regex.rs:237-245 — 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 (3–9 lines × 4) editor/src/messages/portfolio/document_migration.rs:1981— editor/src/messages/portfolio/document_migration.rs:1981-1983 | editor/src/messages/portfolio/document_migration.rs:2605-2609 | editor/src/messages/portfolio/document_migration.rs:3071-3079 | editor/src/messages/portfolio/document_migration.rs:3085-3093 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–9 lines × 2) editor/src/messages/tool/common_functionality/utility_functions.rs:124— editor/src/messages/tool/common_functionality/utility_functions.rs:124-132 | editor/src/messages/tool/common_functionality/utility_functions.rs:167-174 — 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–9 lines × 2) editor/src/messages/tool/tool_messages/path_tool.rs:2917— editor/src/messages/tool/tool_messages/path_tool.rs:2917-2925 | editor/src/messages/tool/tool_messages/path_tool.rs:3032-3038 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 4) editor/src/messages/portfolio/document/graph_operation/utility_types.rs:778— editor/src/messages/portfolio/document/graph_operation/utility_types.rs:778-785 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:801-808 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:829-836 | editor/src/messages/portfolio/document/graph_operation/utility_types.rs:842-849 — 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 (7–8 lines × 2) editor/src/messages/portfolio/document_migration.rs:3621— editor/src/messages/portfolio/document_migration.rs:3621-3627 | editor/src/messages/portfolio/document_storage_io.rs:336-343 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5–8 lines × 3) node-graph/libraries/core-types/src/types.rs:453— node-graph/libraries/core-types/src/types.rs:453-460 | node-graph/libraries/core-types/src/types.rs:463-470 | node-graph/libraries/core-types/src/types.rs:472-476 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5–7 lines × 6) node-graph/nodes/raster/src/adjustments.rs:1307— node-graph/nodes/raster/src/adjustments.rs:1307-1313 | node-graph/nodes/raster/src/adjustments.rs:1314-1320 | node-graph/nodes/raster/src/adjustments.rs:1321-1327 | node-graph/nodes/raster/src/adjustments.rs:1328-1334 | node-graph/nodes/raster/src/adjustments.rs:1335-1341 | node-graph/nodes/raster/src/adjustments.rs:1342-1346 — 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.
Duplicated block (2–7 lines × 7) editor/src/messages/portfolio/document_migration.rs:2664— editor/src/messages/portfolio/document_migration.rs:2664-2667 | editor/src/messages/portfolio/document_migration.rs:2677-2679 | editor/src/messages/portfolio/document_migration.rs:2683-2689 | editor/src/messages/portfolio/document_migration.rs:2697-2703 | editor/src/messages/portfolio/document_migration.rs:2738-2740 | editor/src/messages/portfolio/document_migration.rs:3692-3693 | editor/src/messages/portfolio/document_migration.rs:3708-3709 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (1–6 lines × 3) node-graph/nodes/raster/src/adjustments.rs:1810— node-graph/nodes/raster/src/adjustments.rs:1810-1815 | node-graph/nodes/raster/src/adjustments.rs:1817-1822 | node-graph/nodes/raster/src/adjustments.rs:2094-2094 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (2–5 lines × 5) editor/src/messages/portfolio/document_migration.rs:2680— editor/src/messages/portfolio/document_migration.rs:2680-2684 | editor/src/messages/portfolio/document_migration.rs:2705-2709 | editor/src/messages/portfolio/document_migration.rs:2741-2745 | editor/src/messages/portfolio/document_migration.rs:3693-3694 | editor/src/messages/portfolio/document_migration.rs:3709-3710 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (36 lines × 2) desktop/ui/src/internal/browser_process_handler.rs:9— desktop/ui/src/internal/browser_process_handler.rs:9-44 | desktop/ui/src/internal/context_menu_handler.rs:9-65 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (18 lines × 2) node-graph/node-macro/src/validation.rs:164— node-graph/node-macro/src/validation.rs:164-181 | node-graph/node-macro/src/validation.rs:210-227 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 3) editor/src/messages/layout/layout_message_handler.rs:460— editor/src/messages/layout/layout_message_handler.rs:460-471 | editor/src/messages/layout/layout_message_handler.rs:490-501 | editor/src/messages/layout/layout_message_handler.rs:540-551 — 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.
Unstable project path-bool-nodes — path-bool-nodes has instability 0.83 with 1 dependents.
R10 · Code Duplication· Duplicated block with local edits (46 matched lines × 2 locations) · ×1
Duplicated block with local edits (46 matched lines × 2 locations) frontend/src/stores/app-window.ts:20— frontend/src/stores/app-window.ts:20 · frontend/src/stores/document.ts:28 — the two spans are one implementation copied and then locally edited — 290 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (26 matched lines × 2 locations) · ×1
Duplicated block with local edits (26 matched lines × 2 locations) frontend/src/components/widgets/inputs/TextAreaInput.svelte:4— frontend/src/components/widgets/inputs/TextAreaInput.svelte:4 · frontend/src/components/widgets/inputs/TextInput.svelte:4 — the two spans are one implementation copied and then locally edited — 147 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (20 matched lines × 2 locations) · ×1
Duplicated block with local edits (20 matched lines × 2 locations) frontend/src/utility-functions/clipboard.ts:4— frontend/src/utility-functions/clipboard.ts:4 · frontend/src/utility-functions/clipboard.ts:55 — the two spans are one implementation copied and then locally edited — 176 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (19 lines × 2 locations) frontend/src/components/layout/LayoutCol.svelte:4— frontend/src/components/layout/LayoutCol.svelte:4 · frontend/src/components/layout/LayoutRow.svelte:4 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
Duplicated block (12 lines × 2 locations) frontend/src/components/widgets/WidgetSpan.svelte:270— frontend/src/components/widgets/WidgetSpan.svelte:270 · frontend/src/components/widgets/WidgetSpan.svelte:288 — all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
R10 · Code Duplication· Duplicated block with local edits (11 matched lines × 2 locations) · ×1
Duplicated block with local edits (11 matched lines × 2 locations) frontend/vite.config.ts:40— frontend/vite.config.ts:40 · frontend/vite.config.ts:60 — the two spans are one implementation copied and then locally edited — 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (9 lines × 3 locations) frontend/src/components/panels/Layers.svelte:173— frontend/src/components/panels/Layers.svelte:173 · frontend/src/components/panels/Layers.svelte:191 · frontend/src/components/widgets/inputs/NumberInput.svelte:150 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication· Duplicated block with local edits (9 matched lines × 2 locations) · ×1
Duplicated block with local edits (9 matched lines × 2 locations) frontend/src/components/widgets/inputs/CheckboxInput.svelte:6— frontend/src/components/widgets/inputs/CheckboxInput.svelte:6 · frontend/src/components/widgets/inputs/TextInput.svelte:4 — the two spans are one implementation copied and then locally edited — 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (8 matched lines × 2 locations) · ×1
Duplicated block with local edits (8 matched lines × 2 locations) frontend/src/components/widgets/inputs/DropdownInput.svelte:144— frontend/src/components/widgets/inputs/DropdownInput.svelte:144 · frontend/src/utility-functions/input.ts:289 — the two spans are one implementation copied and then locally edited — 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (8 lines × 3 locations) frontend/src/components/widgets/inputs/SliderInput.svelte:623— frontend/src/components/widgets/inputs/SliderInput.svelte:623 · frontend/src/components/widgets/inputs/SliderInput.svelte:633 · frontend/src/components/widgets/inputs/VisualColorPickersInput.svelte:146 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
Duplicated block (7 lines × 4 locations) frontend/src/stores/app-window.ts:26— frontend/src/stores/app-window.ts:26 · frontend/src/stores/document.ts:34 · frontend/src/stores/fullscreen.ts:19 · frontend/src/stores/tooltip.ts:43 — the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
Duplicated block (6 lines × 3 locations) frontend/src/components/layout/FloatingMenu.svelte:91— frontend/src/components/layout/FloatingMenu.svelte:91 · frontend/src/components/layout/LayoutCol.svelte:17 · frontend/src/components/layout/LayoutRow.svelte:18 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication· Duplicated block with local edits (6 matched lines × 2 locations) · ×1
Duplicated block with local edits (6 matched lines × 2 locations) frontend/src/utility-functions/rasterization.ts:4— frontend/src/utility-functions/rasterization.ts:4 · frontend/src/utility-functions/rasterization.ts:65 — the two spans are one implementation copied and then locally edited — 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (5 lines × 5 locations) frontend/src/components/layout/FloatingMenu.svelte:29— frontend/src/components/layout/FloatingMenu.svelte:29 · frontend/src/components/layout/LayoutCol.svelte:4 · frontend/src/components/layout/LayoutRow.svelte:4 · frontend/src/components/widgets/inputs/FieldInput.svelte:14 · +1 more site(s) not listed — the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (5 lines × 7 locations) frontend/src/stores/app-window.ts:20— frontend/src/stores/app-window.ts:20 · frontend/src/stores/color-picker.ts:26 · frontend/src/stores/dialog.ts:28 · frontend/src/stores/document.ts:28 · +3 more site(s) not listed — the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Complex function positionAndStyleFloatingMenu (cyclomatic 58, cognitive 79) frontend/src/components/layout/FloatingMenu.svelte:213— positionAndStyleFloatingMenu has cyclomatic complexity 58 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function handleKey (cyclomatic 42, cognitive 51) frontend/src/components/floating-menus/MenuList.svelte:490— handleKey has cyclomatic complexity 42 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onKeyDown (cyclomatic 37, cognitive 46) frontend/src/components/widgets/inputs/MathExpressionInput.svelte:910— onKeyDown has cyclomatic complexity 37 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function shouldRedirectKeyboardEventToBackend (cyclomatic 33, cognitive 30) frontend/src/utility-functions/input.ts:25— shouldRedirectKeyboardEventToBackend has cyclomatic complexity 33 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function render (cyclomatic 32, cognitive 54) frontend/src/components/widgets/inputs/MathExpressionInput.svelte:145— render has cyclomatic complexity 32 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onBeforeInput (cyclomatic 30, cognitive 29) frontend/src/components/widgets/inputs/MathExpressionInput.svelte:828— onBeforeInput has cyclomatic complexity 30 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parseMarkdown (cyclomatic 21, cognitive 37) REDACTED:10— parseMarkdown has cyclomatic complexity 21 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function stepThroughBrackets (cyclomatic 21, cognitive 30) frontend/src/components/widgets/inputs/MathExpressionInput.svelte:535— stepThroughBrackets has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function dragPointerUp (cyclomatic 21, cognitive 25) frontend/src/components/window/Panel.svelte:210— dragPointerUp has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function getLocalizedScanCode (cyclomatic 20, cognitive 33) frontend/src/utility-functions/keyboard-entry.ts:41— getLocalizedScanCode has cyclomatic complexity 20 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function dragPointerMove (cyclomatic 20, cognitive 22) frontend/src/components/window/Panel.svelte:134— dragPointerMove has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function pointerOver (cyclomatic 19, cognitive 17) frontend/src/components/floating-menus/MenuList.svelte:329— pointerOver has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function readAtCaret (cyclomatic 18, cognitive 21) frontend/src/utility-functions/clipboard.ts:4— readAtCaret has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function tabBetweenTextFields (cyclomatic 17, cognitive 16) frontend/src/utility-functions/input.ts:387— tabBetweenTextFields has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function keyboardHintIcon (cyclomatic 17, cognitive 9) frontend/src/components/widgets/labels/ShortcutLabel.svelte:59— keyboardHintIcon has cyclomatic complexity 17 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function resizePanel (cyclomatic 16, cognitive 16) frontend/src/components/window/PanelSubdivision.svelte:47— resizePanel has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function updateConstant (cyclomatic 16, cognitive 14) frontend/src/components/widgets/inputs/MathExpressionInput.svelte:346— updateConstant has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function draggingPointerMove (cyclomatic 15, cognitive 19) frontend/src/components/panels/Layers.svelte:896— draggingPointerMove has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function onPointerDown (cyclomatic 15, cognitive 16) frontend/src/utility-functions/input.ts:135— onPointerDown has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· frontend/src/components/views/Graph.svelte · ×1
frontend/src/components/views/Graph.svelte: 1734 lines of code frontend/src/components/views/Graph.svelte:1— frontend/src/components/views/Graph.svelte has 1734 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/panels/Layers.svelte · ×1
frontend/src/components/panels/Layers.svelte: 1712 lines of code frontend/src/components/panels/Layers.svelte:1— frontend/src/components/panels/Layers.svelte has 1712 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/widgets/inputs/NumberInput.svelte · ×1
frontend/src/components/widgets/inputs/NumberInput.svelte: 1143 lines of code frontend/src/components/widgets/inputs/NumberInput.svelte:1— frontend/src/components/widgets/inputs/NumberInput.svelte has 1143 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/widgets/inputs/MathExpressionInput.svelte · ×1
frontend/src/components/widgets/inputs/MathExpressionInput.svelte: 1140 lines of code frontend/src/components/widgets/inputs/MathExpressionInput.svelte:1— frontend/src/components/widgets/inputs/MathExpressionInput.svelte has 1140 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
frontend/src/icons.ts: 1031 lines of code frontend/src/icons.ts:1— frontend/src/icons.ts has 1031 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/panels/Document.svelte · ×1
frontend/src/components/panels/Document.svelte: 913 lines of code frontend/src/components/panels/Document.svelte:1— frontend/src/components/panels/Document.svelte has 913 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/widgets/inputs/SliderInput.svelte · ×1
frontend/src/components/widgets/inputs/SliderInput.svelte: 858 lines of code frontend/src/components/widgets/inputs/SliderInput.svelte:1— frontend/src/components/widgets/inputs/SliderInput.svelte has 858 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/floating-menus/MenuList.svelte · ×1
frontend/src/components/floating-menus/MenuList.svelte: 764 lines of code frontend/src/components/floating-menus/MenuList.svelte:1— frontend/src/components/floating-menus/MenuList.svelte has 764 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/utility-functions/keyboard-entry.ts · ×1
frontend/src/utility-functions/keyboard-entry.ts: 681 lines of code frontend/src/utility-functions/keyboard-entry.ts:1— frontend/src/utility-functions/keyboard-entry.ts has 681 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/layout/FloatingMenu.svelte · ×1
frontend/src/components/layout/FloatingMenu.svelte: 662 lines of code frontend/src/components/layout/FloatingMenu.svelte:1— frontend/src/components/layout/FloatingMenu.svelte has 662 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/window/Panel.svelte · ×1
frontend/src/components/window/Panel.svelte: 614 lines of code frontend/src/components/window/Panel.svelte:1— frontend/src/components/window/Panel.svelte has 614 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· frontend/src/components/widgets/NodeSection.svelte · ×1
frontend/src/components/widgets/NodeSection.svelte: 492 lines of code frontend/src/components/widgets/NodeSection.svelte:1— frontend/src/components/widgets/NodeSection.svelte has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
Dead file (~1144 LoC) frontend/src/components/panels/Layers.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~1056 LoC) frontend/src/components/widgets/inputs/MathExpressionInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~1045 LoC) frontend/src/icons.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~963 LoC) frontend/src/components/widgets/inputs/NumberInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~739 LoC) frontend/src/utility-functions/keyboard-entry.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~679 LoC) frontend/src/components/floating-menus/MenuList.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~668 LoC) frontend/src/components/widgets/inputs/SliderInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~577 LoC) frontend/src/components/panels/Document.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~533 LoC) frontend/src/components/layout/FloatingMenu.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~457 LoC) frontend/src/utility-functions/input.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~387 LoC) frontend/src/components/window/Panel.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~361 LoC) frontend/src/components/widgets/WidgetSpan.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~330 LoC) frontend/src/components/views/Graph.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~305 LoC) frontend/src/stores/node-graph.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~299 LoC) frontend/src/components/widgets/inputs/TransferCurveInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~266 LoC) frontend/src/utility-functions/persistence.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~227 LoC) frontend/src/utility-functions/colors.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~216 LoC) frontend/src/stores/portfolio.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~206 LoC) frontend/src/components/widgets/inputs/ScrollbarInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~202 LoC) frontend/src/components/panels/Inspector.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~201 LoC) frontend/src/components/widgets/inputs/RulerInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~189 LoC) frontend/src/components/widgets/inputs/VisualColorPickersInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~187 LoC) frontend/src/components/window/PanelSubdivision.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~173 LoC) frontend/src/components/widgets/inputs/DropdownInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~166 LoC) frontend/src/utility-functions/clipboard.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~165 LoC) frontend/src/utility-functions/decimal.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~147 LoC) frontend/src/stores/tooltip.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~134 LoC) frontend/src/managers/drag-toggle.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~132 LoC) frontend/src/stores/dialog.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~126 LoC) frontend/src/utility-functions/auto-scroll.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~120 LoC) frontend/src/stores/color-picker.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~117 LoC) REDACTED— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~108 LoC) frontend/src/managers/input.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~107 LoC) frontend/src/components/widgets/inputs/FieldInput.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~105 LoC) frontend/src/components/widgets/labels/ShortcutLabel.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~102 LoC) frontend/src/subscriptions-router.ts— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~94 LoC) frontend/src/components/floating-menus/NodeCatalog.svelte— no import path from any entry point (6 application, 7 tooling, 2 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Unused dependency '@fontsource/stix-two-math' — Declared in frontend/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'license-checker-rseidelsohn' — Declared in frontend/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'source-code-pro' — Declared in frontend/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
`async` callback passed to `forEach` frontend/src/utility-functions/input.ts:282— `forEach` ignores what its callback returns, so the Promise each `async` call returns is dropped: nothing can await it, the code after this loop runs before any of the awaited work has finished (a function that `await`s around this loop still returns early), and a rejection is never handled — in Node.js an unhandled rejection terminates the process by default, and in a browser it is lost. Iterate with `for (const item of items) { await … }` when the work must run in order, or `await Promise.all(items.map(async (item) => { … }))` when it may run concurrently, so the enclosing function finishes only when the work does and its failures reach the caller. Where firing and forgetting is genuinely intended, make the callback's whole body a `try { … } catch (e) { … }` that handles the failure, so it cannot escape.
Interpolated log message defeats structured logging desktop/ui/src/delegate.rs:32— `debug!` at line 32 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/dirs.rs:13— `error!` at line 13 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/dirs.rs:41— `error!` at line 41 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/ipc.rs:73— `error!` at line 73 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote.rs:29— `error!` at line 29 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/resources.rs:38— `error!` at line 38 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/host.rs:73— `error!` at line 73 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/host.rs:110— `warn!` at line 110 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:41— `debug!` at line 41 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:112— `error!` at line 112 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:129— `error!` at line 129 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:155— `error!` at line 155 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:213— `info!` at line 213 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:287— `debug!` at line 287 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:307— `error!` at line 307 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/remote/spawn.rs:368— `error!` at line 368 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/platform/mac.rs:61— `error!` at line 61 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/display_handler.rs:117— `error!` at line 117 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/display_handler.rs:118— `warn!` at line 118 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/display_handler.rs:119— `info!` at line 119 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/display_handler.rs:120— `debug!` at line 120 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/display_handler.rs:121— `trace!` at line 121 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/life_span_handler.rs:32— `error!` at line 32 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/render_process_handler.rs:78— `error!` at line 78 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging desktop/ui/src/internal/render_process_v8_handler.rs:54— `error!` at line 54 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Duplicated predicate libraries/rawkit/src/decoder/arw2.rs:37— `cfa_pattern_width == 2 && cfa_pattern_height == 2` appears character-identically in 2 files — libraries/rawkit/src/decoder/arw2.rs, libraries/rawkit/src/decoder/uncompressed.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate desktop/ui/src/frames/plane/linux.rs:64— `coded_size.width <= 0 || coded_size.height <= 0` appears character-identically in 3 files — desktop/ui/src/frames/plane/linux.rs, desktop/ui/src/frames/plane/mac.rs, desktop/ui/src/frames/plane/win.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/tool/tool_messages/artboard_tool.rs:68— `in_gesture && self.fsm_state != previous_state` appears character-identically in 3 files — editor/src/messages/tool/tool_messages/artboard_tool.rs, editor/src/messages/tool/tool_messages/shape_tool.rs, editor/src/messages/tool/tool_messages/text_tool.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs:93— `is_dragged || (pos - mouse_position).length_squared() < BOUNDS_SELECT_THRESHOLD.powi(2)` appears character-identically in 2 files — editor/src/messages/tool/common_functionality/shapes/arrow_shape.rs, editor/src/messages/tool/common_functionality/shapes/line_shape.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/tool/tool_messages/select_tool.rs:2617— `min.distance(expected[0]) < 1e-6 && max.distance(expected[1]) < 1e-6` appears character-identically in 2 files — editor/src/messages/tool/tool_messages/select_tool.rs, editor/src/messages/tool/tool_messages/shape_tool.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/document_message_handler.rs:4901— `min.distance(expected_min) < 1e-6 && max.distance(expected_max) < 1e-6` appears character-identically in 5 files — editor/src/messages/portfolio/document/document_message_handler.rs, editor/src/messages/tool/common_functionality/resize.rs, editor/src/messages/tool/tool_messages/artboard_tool.rs, editor/src/messages/tool/tool_messages/select_tool.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate node-graph/libraries/graphic-types/src/graphic.rs:264— `parent_has_fill || item.attribute::<f64>(ATTR_OPACITY_FILL).is_some()` appears character-identically in 2 files — node-graph/libraries/graphic-types/src/graphic.rs, node-graph/nodes/path-bool/src/lib.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate node-graph/libraries/graphic-types/src/graphic.rs:260— `parent_has_opacity || item.attribute::<f64>(ATTR_OPACITY).is_some()` appears character-identically in 2 files — node-graph/libraries/graphic-types/src/graphic.rs, node-graph/nodes/path-bool/src/lib.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate node-graph/libraries/graphic-types/src/graphic.rs:256— `parent_has_transform || item.attribute::<DAffine2>(ATTR_TRANSFORM).is_some()` appears character-identically in 2 files — node-graph/libraries/graphic-types/src/graphic.rs, node-graph/nodes/path-bool/src/lib.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate node-graph/nodes/vector/src/vector_nodes.rs:4136— `point.x >= -1e-6 && point.x <= 10. + 1e-6` appears character-identically in 2 files — node-graph/nodes/vector/src/vector_nodes.rs, node-graph/nodes/vector/src/voronoi.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate node-graph/nodes/vector/src/vector_nodes.rs:4137— `point.y >= -1e-6 && point.y <= 10. + 1e-6` appears character-identically in 2 files — node-graph/nodes/vector/src/vector_nodes.rs, node-graph/nodes/vector/src/voronoi.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/overlays/utility_types_native.rs:203— `self.all && self.anchors && self.curvature_comb` appears character-identically in 2 files — editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/overlays/utility_types_native.rs:183— `self.all && self.anchors && self.handles` appears character-identically in 2 files — editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/overlays/utility_types_native.rs:199— `self.all && self.anchors && self.path_direction` appears character-identically in 2 files — editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/overlays/utility_types_native.rs:191— `self.all && self.anchors && self.path_ends` appears character-identically in 2 files — editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/overlays/utility_types_native.rs:195— `self.all && self.anchors && self.path_index` appears character-identically in 2 files — editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/overlays/utility_types_native.rs:187— `self.all && self.anchors && self.point_index` appears character-identically in 2 files — editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:89— `self.number_of_points_dial.is_dragging() || self.number_of_points_dial.is_hovering()` appears character-identically in 2 files — editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs, editor/src/messages/tool/common_functionality/shapes/star_shape.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:27— `self.number_of_points_dial.is_hovering() || self.point_radius_handle.hovered()` appears character-identically in 2 files — editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs, editor/src/messages/tool/common_functionality/shapes/star_shape.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs:93— `self.point_radius_handle.is_dragging_or_snapped() || self.point_radius_handle.hovered()` appears character-identically in 2 files — editor/src/messages/tool/common_functionality/shapes/polygon_shape.rs, editor/src/messages/tool/common_functionality/shapes/star_shape.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/tool/tool_messages/path_tool.rs:660— `self.selection_mode.is_none() && above_threshold` appears character-identically in 2 files — editor/src/messages/tool/tool_messages/path_tool.rs, editor/src/messages/tool/tool_messages/select_tool.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate node-graph/nodes/vector/src/generator_nodes.rs:435— `staggered && topology.supports_staggered()` appears character-identically in 2 files — node-graph/nodes/vector/src/generator_nodes.rs, node-graph/nodes/vector/src/grid_topology.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate editor/src/messages/portfolio/document/overlays/utility_types_native.rs:1249— `translation.x.abs() > 1e-3 && translation.y.abs() > 1e-3` appears character-identically in 2 files — editor/src/messages/portfolio/document/overlays/utility_types_native.rs, editor/src/messages/portfolio/document/overlays/utility_types_web.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Orphaned file libraries/rawkit/src/tiff/types.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file node-graph/libraries/no-std-types/src/color/discrete_srgb.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/lib.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file node-graph/node-macro/src/derive_choice_type.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/tiff/tags.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file proc-macros/src/helper_structs.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file proc-macros/src/hierarchical_tree.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/decoder/arw2.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/tiff/mod.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/tiff/file.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file proc-macros/src/helpers.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file node-graph/libraries/core-types/src/math/bbox.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/decoder/arw1.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file editor/src/messages/tool/common_functionality/auto_panning.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/rawkit-proc-macros/src/build_camera_data.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/metadata/camera_data.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/tiff/values.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file libraries/rawkit/src/postprocessing/gamma_correction.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Silent fallback default on Err desktop/src/preferences.rs:14— `read` turns every `Err` into `Preferences::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err editor/src/messages/portfolio/document/utility_types/network_interface/queries.rs:664— `output_description` turns every `Err` into `String::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gcore/src/context.rs:11— `read_graphic` turns every `Err` into `Default::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gcore/src/context.rs:19— `read_vector` turns every `Err` into `Default::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gcore/src/context.rs:27— `read_raster` turns every `Err` into `Default::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gcore/src/context.rs:35— `read_color` turns every `Err` into `Default::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gcore/src/context.rs:43— `read_gradient` turns every `Err` into `Default::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gcore/src/context.rs:52— `read_number` turns every `Err` into `Default::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gstd/src/platform_application_io.rs:66— `get_request` turns every `Err` into `Item::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err node-graph/nodes/gstd/src/platform_application_io.rs:103— `post_request` turns every `Err` into `Item::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 46 significant file(s) lose their only recent owner: libraries/math-parser/src/lib.rs, node-graph/nodes/math/src/lib.rs, editor/src/messages/portfolio/document/utility_types/network_interface/layout.rs, frontend/src/icons.ts, editor/src/messages/portfolio/document/utility_types/network_interface/mutations.rs, node-graph/interpreted-executor/src/dynamic_executor/test.rs, editor/src/messages/portfolio/document/data_panel/data_panel_message_handler.rs, libraries/math-parser/src/constants.rs (+38 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 32 significant file(s) lose their only recent owner: desktop/src/input.rs, desktop/src/window/win/native_handle.rs, desktop/ui/src/context.rs, desktop/bundle/src/mac.rs, desktop/ui/src/input.rs, node-graph/nodes/gstd/src/render_pixel_preview.rs, tools/third-party-licenses/src/main.rs, desktop/ui/src/frames/import.rs (+24 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 6 significant file(s) lose their only recent owner: document/graph-storage/src/document.rs, document/graph-storage/src/registry.rs, document/graph-storage/src/crdt.rs, document/container/src/archive.rs, document/container/src/archive/xz.rs, node-graph/libraries/core-types/src/memo.rs. Pair on, review, or document these before any departure.
Classify ADR enforcement: Summary node-graph/rfcs/async-execution-model.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: Summary node-graph/rfcs/document-format.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: Summary node-graph/rfcs/fine-grained-context-caching.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — An a11y linter is configured (Documented) but there's no automated a11y test or CI gate. Add your test runner's axe binding (jest-axe, vitest-axe, cypress-axe or @axe-core/playwright) to verify at runtime, then gate it in CI. What was searched, so you can tell an absence from a miss: the 60 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
Documentation: no build, run or usage example README.md:1— the repository holds project manifests and neither `README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 66 project(s) overshoot their size bounds, lowering Project Cohesion to 9.7/10. The most over is `editor` (97178 LoC, 682 module-visible types across 57 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 18 of 486 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; 486 of the 761 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: libraries/rawkit/src/tiff/types.rs, node-graph/libraries/no-std-types/src/color/discrete_srgb.rs, libraries/rawkit/src/lib.rs, node-graph/node-macro/src/derive_choice_type.rs, libraries/rawkit/src/tiff/tags.rs, proc-macros/src/helper_structs.rs, libraries/rawkit/src/decoder/arw2.rs, proc-macros/src/hierarchical_tree.rs (and 10 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.
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.
P10 · Library API & versioning· Large public API surface · ×1
Large public API surface — 1270/1805 types (70%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
Logging is not universal — Only 23/27 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `desktop/bundle`, `desktop/platform/linux`, `desktop/platform/mac`, `desktop/platform/win`.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
X2 · Cancellation propagation· Not all async functions that make a request accept an AbortSignal · ×1
Not all async functions that make a request accept an AbortSignal — Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
Outdated: anyhow — `anyhow` is locked at 1.0.99 but 1.0.104 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in tools/crate-hierarchy-viz/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p anyhow` and commit the updated REDACTED.
Outdated: blake3 — `blake3` is locked at 1.8.5 but 1.8.7 is the current stable release on crates.io, and it already satisfies the `"1.5"` requirement declared in document/graph-storage/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p blake3` and commit the updated REDACTED.
Outdated: bytemuck — `bytemuck` is locked at 1.25.0 but 1.25.2 is the current stable release on crates.io, and it already satisfies the `"1.13"` requirement declared in desktop/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bytemuck` and commit the updated REDACTED.
Outdated: cef — `cef` is locked at 156.1.0+156.0.8 but 156.2.0+156.0.14 is the current stable release on crates.io, and it already satisfies the `"156"` requirement declared in desktop/ui/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p cef` and commit the updated REDACTED.
Outdated: cef-dll-sys — `cef-dll-sys` is locked at 156.1.0+156.0.8 but 156.2.0+156.0.14 is the current stable release on crates.io, and it already satisfies the `"156"` requirement declared in desktop/bundle/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p cef-dll-sys` and commit the updated REDACTED.
Outdated: chrono — `chrono` is locked at 0.4.41 but 0.4.45 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in node-graph/graphene-cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p chrono` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.5.46 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.5"` requirement declared in desktop/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: ctrlc — `ctrlc` is locked at 3.5.1 but 3.5.2 is the current stable release on crates.io, and it already satisfies the `"3.5.1"` requirement declared in desktop/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ctrlc` and commit the updated REDACTED.
Outdated: duct — `duct` is locked at 1.1.1 but 1.1.2 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in tools/cargo-run/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p duct` and commit the updated REDACTED.
Outdated: env_logger — `env_logger` is locked at 0.11.8 but 0.11.11 is the current stable release on crates.io, and it already satisfies the `"0.11"` requirement declared in node-graph/nodes/raster/shaders/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p env_logger` and commit the updated REDACTED.
Outdated: flate2 — `flate2` is locked at 1.1.2 but 1.1.10 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in tools/cargo-run/internal/download/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p flate2` and commit the updated REDACTED.
Outdated: futures — `futures` is locked at 0.3.31 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in desktop/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p futures` and commit the updated REDACTED.
Outdated: glob — `glob` is locked at 0.3.3 but 0.3.4 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in tools/crate-hierarchy-viz/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p glob` and commit the updated REDACTED.
Outdated: half — `half` is locked at 2.6.0 but 2.7.1 is the current stable release on crates.io, and it already satisfies the `"2.4"` requirement declared in node-graph/libraries/no-std-types/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p half` and commit the updated REDACTED.
Outdated: image — `image` is locked at 0.25.6 but 0.25.10 is the current stable release on crates.io, and it already satisfies the `"0.25"` requirement declared in editor/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p image` and commit the updated REDACTED.
Outdated: indoc — `indoc` is locked at 2.0.7 but 2.0.8 is the current stable release on crates.io, and it already satisfies the `"2.0.5"` requirement declared in node-graph/node-macro/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p indoc` and commit the updated REDACTED.
Outdated: interprocess — `interprocess` is locked at 2.4.2 but 2.4.7 is the current stable release on crates.io, and it already satisfies the `"2.4.2"` requirement declared in desktop/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p interprocess` and commit the updated REDACTED.
Outdated: keyboard-types — `keyboard-types` is locked at 0.8.1 but 0.8.3 is the current stable release on crates.io, and it already satisfies the `"0.8"` requirement declared in desktop/wrapper/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p keyboard-types` and commit the updated REDACTED.
Outdated: libc — `libc` is locked at 0.2.189 but 0.2.191 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in desktop/ui/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libc` and commit the updated REDACTED.
Outdated: log — `log` is locked at 0.4.29 but 0.4.34 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in editor/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p log` and commit the updated REDACTED.
Outdated: lyon_geom — `lyon_geom` is locked at 1.0.6 but 1.0.20 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in node-graph/libraries/core-types/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p lyon_geom` and commit the updated REDACTED.
Outdated: notify — `notify` is locked at 8.2.0 but 8.2.1 is the current stable release on crates.io, and it already satisfies the `"8.2.0"` requirement declared in tools/cargo-run/internal/watch/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p notify` and commit the updated REDACTED.
Outdated: num_enum — `num_enum` is locked at 0.7.4 but 0.7.6 is the current stable release on crates.io, and it already satisfies the `"0.7"` requirement declared in editor/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p num_enum` and commit the updated REDACTED.
Outdated: objc2 — `objc2` is locked at 0.6.3 but 0.6.5 is the current stable release on crates.io, and it already satisfies the `"0.6.1"` requirement declared in desktop/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p objc2` and commit the updated REDACTED.
Outdated: open — `open` is locked at 5.3.2 but 5.4.5 is the current stable release on crates.io, and it already satisfies the `"5.3"` requirement declared in desktop/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p open` and commit the updated REDACTED.
+ 24 more in this group — see findings.md.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
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 01a17637-ab7e-751e-b2c3-00e807167e56 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 151 · Warnings: 1736 · Recommendations: 108 · Info: 49 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 26-10-2026 @ 03:18 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.