Public report of h4ckf0r0day/obscura, 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:26 UTC · Survey ID cd_5fe0f250f5a1463d95b0da995ff0064b
h4ckf0r0day/obscura
Measured 26 October 2026, 03:23 UTC, at code version 8b3dd47
Regression: 1 dimension fell since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
No change 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: 159,282 lines of product code in 11 projects, tests not counted · Estimated rebuild effort: about 1.2 person-years · Weakest lens: Accessibility, 32
Findings by how serious they are
38 critical1091 serious115 minor
13 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:23 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 ▸
74of 74 dimensions measured by tools.
1211of 1244 findings point to an exact file and line, so you can open each one in the code. The other 33 concern the repository as a whole, such as missing documentation.
74dimensions across 8 lenses, read from 159,282 lines of product code in 11 projects.
h4ckf0r0day/obscura falls short of our standard for a preview release, in part because it has pages that don't say their language. It scores 44 out of 100 and is rated Weak, and one of its 38 critical findings is a security problem in its servers and containers.
Accessibility, at 32, is the weakest lens and counts most in the score. The best first step is making the controls keyboard-usable, worth about 6 points. Structuring the pages comes next, worth about 4 points. Raising Accessibility to 65 would lift the score to about 53.
One setting leaves the servers or containers unsafe. Correcting the unsafe settings would close this risk. The 15 pages that don't say their language need their language set.
The product code is 159,282 lines, about €180,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 32 to 65, the lowest score rated Strong, the score would rise from 44 to about 53.
Code composition: what the lines of code are
Product code 89%Tests 11%
New since the last survey: 136 findings
These 136 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: 124 findings
These 124 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.
Page structure · Page without a main landmark render-repros/font-shorthand.html
Page structure · <html> without a lang render-repros/forced-line-breaks.html
Page structure · Page without a main landmark render-repros/forced-line-breaks.html
Page structure · <html> without a lang render-repros/form-control-geometry.html
Page structure · Page without a main landmark render-repros/form-control-geometry.html
Page structure · <html> without a lang render-repros/form-control-quirks.html
Page structure · Page without a main landmark render-repros/form-control-quirks.html
Page structure · <html> without a lang render-repros/grid-auto-repeat.html
Page structure · Page without a main landmark render-repros/grid-auto-repeat.html
Page structure · <html> without a lang render-repros/grid-shorthand.html
Page structure · Page without a main landmark render-repros/grid-shorthand.html
Page structure · <html> without a lang render-repros/img-density-and-alt.html
Page structure · Page without a main landmark render-repros/img-density-and-alt.html
Page structure · <html> without a lang render-repros/inline-block-flex-items.html
Page structure · Page without a main landmark render-repros/inline-block-flex-items.html
Page structure · Data table has no header cells render-repros/inline-block-flex-items.html
Page structure · <html> without a lang render-repros/inline-replaced-flow.html
Page structure · Page without a main landmark render-repros/inline-replaced-flow.html
Page structure · Data table has no header cells render-repros/inline-replaced-flow.html
Page structure · <html> without a lang render-repros/item-self-alignment.html
Page structure · Page without a main landmark render-repros/item-self-alignment.html
Page structure · <html> without a lang render-repros/legacy-center.html
Page structure · Page without a main landmark render-repros/legacy-center.html
Page structure · <html> without a lang render-repros/list-indentation.html
Page structure · Page without a main landmark render-repros/list-indentation.html
Page structure · Page without a main landmark render-repros/live-form-state.html
Page structure · <html> without a lang render-repros/max-height-replaced.html
Page structure · Page without a main landmark render-repros/max-height-replaced.html
Page structure · Page without a main landmark render-repros/media-text-track.html
Page structure · <html> without a lang render-repros/mixed-content-block.html
Page structure · Page without a main landmark render-repros/mixed-content-block.html
Page structure · <html> without a lang render-repros/mixed-float-run.html
Page structure · Page without a main landmark render-repros/mixed-float-run.html
Page structure · <html> without a lang render-repros/modern-containing-block-triggers.html
Page structure · Page without a main landmark render-repros/modern-containing-block-triggers.html
Page structure · Page without a main landmark render-repros/modern-streams.html
Page structure · <html> without a lang render-repros/nested-float-clearance.html
Page structure · Page without a main landmark render-repros/nested-float-clearance.html
Page structure · <html> without a lang render-repros/opposing-header-floats.html
Page structure · Page without a main landmark render-repros/opposing-header-floats.html
Page structure · <html> without a lang render-repros/ratio-only-inline-images.html
Page structure · Page without a main landmark render-repros/ratio-only-inline-images.html
Page structure · <html> without a lang render-repros/relative-box-edges.html
Page structure · Page without a main landmark render-repros/relative-box-edges.html
Page structure · <html> without a lang render-repros/replaced-block-wrapper.html
Page structure · Page without a main landmark render-repros/replaced-block-wrapper.html
Page structure · <html> without a lang render-repros/replaced-grid-order.html
Page structure · Page without a main landmark render-repros/replaced-grid-order.html
Page structure · <html> without a lang render-repros/right-float-navigation.html
Page structure · Page without a main landmark render-repros/right-float-navigation.html
Page structure · <html> without a lang render-repros/table-row-geometry.html
Page structure · Page without a main landmark render-repros/table-row-geometry.html
Page structure · Data table has no header cells render-repros/table-row-geometry.html
Page structure · Data table has no header cells render-repros/table-row-geometry.html
Page structure · Data table has no header cells render-repros/table-row-geometry.html
Page structure · Data table has no header cells render-repros/table-row-geometry.html
Page structure · Data table has no header cells render-repros/table-row-geometry.html
Page structure · Data table has no header cells render-repros/table-row-geometry.html
Page structure · Data table has no header cells render-repros/table-row-geometry.html
Page structure · <html> without a lang render-repros/table-track-geometry.html
Rebuild cost: about €180,000 · Estimate
Cost to rebuild
€60,000 to €300,000, for 996 to 3,161 hours of work, about 1.2 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 44. 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: 159,282 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
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
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 4 points · Medium effort · Page structure
3
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 3 points · Medium effort · Text alternatives
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 €180,000 to build again, about 1.2 person-years of work. Its weakest lens is Accessibility, at 32 (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
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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 5.8 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 6% to 13% on every change. The history of the code shows how much it changes: about 209,057 lines over the last 90 days, which is about 847,842 lines a year. At that pace, the extra work comes to an estimated 118.3 to 709.8 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.
149 modules, with 389 dependencies between them. 3 loops run through 41 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 109 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.
cosmic_text.edit uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.edit, while a change to cosmic_text.edit can't break cosmic_text.font.system.
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.
3→28 cosmic_text.edit uses cosmic_text.bufferpart of a loop✕
Connections
1 pair of types, where a type in cosmic_text.edit uses a type in cosmic_text.buffer.
cosmic_text.edit uses cosmic_text.buffer, so a change to cosmic_text.buffer can break cosmic_text.edit, while a change to cosmic_text.edit can't break cosmic_text.buffer.
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.
3→29 cosmic_text.edit uses cosmic_text.attrspart of a loop✕
Connections
1 pair of types, where a type in cosmic_text.edit uses a type in cosmic_text.attrs.
cosmic_text.edit uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.edit, while a change to cosmic_text.edit can't break cosmic_text.attrs.
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→26 cosmic_text.swash uses cosmic_text.font.systempart of a loop✕
Connections
2 pairs of types, where a type in cosmic_text.swash uses a type in cosmic_text.font.system.
cosmic_text.swash uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.swash, while a change to cosmic_text.swash can't break cosmic_text.font.system.
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→29 cosmic_text.swash uses cosmic_text.attrspart of a loop✕
Connections
1 pair of types, where a type in cosmic_text.swash uses a type in cosmic_text.attrs.
cosmic_text.swash uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.swash, while a change to cosmic_text.swash can't break cosmic_text.attrs.
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→21 obscura_dom.tree uses obscura_renderpart of a loop✕
Connections
2 pairs of types, where a type in obscura_dom.tree uses a type in obscura_render.
obscura_dom.tree uses obscura_render, so a change to obscura_render can break obscura_dom.tree, while a change to obscura_dom.tree can't break obscura_render.
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.
obscura_net.client uses obscura_net.cookies, so a change to obscura_net.cookies can break obscura_net.client, while a change to obscura_net.client can't break obscura_net.cookies.
Position
Below the diagonal: obscura_net.client uses a module listed above it, which is the healthy direction.
7→15 taffy.tree.layout uses taffy.geometrypart of a loop✕
Connections
7 pairs of types, where a type in taffy.tree.layout uses a type in taffy.geometry.
taffy.tree.layout uses taffy.geometry, so a change to taffy.geometry can break taffy.tree.layout, while a change to taffy.tree.layout can't break taffy.geometry.
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→21 taffy.tree.layout uses obscura_renderpart of a loop✕
Connections
1 pair of types, where a type in taffy.tree.layout uses a type in obscura_render.
The types involved
taffy.tree.layout.Layout → obscura_render.Rect
Direction
taffy.tree.layout uses obscura_render, so a change to obscura_render can break taffy.tree.layout, while a change to taffy.tree.layout can't break obscura_render.
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.
8→21 taffy.util.parse uses obscura_renderpart of a loop✕
Connections
1 pair of types, where a type in taffy.util.parse uses a type in obscura_render.
taffy.util.parse uses obscura_render, so a change to obscura_render can break taffy.util.parse, while a change to taffy.util.parse can't break obscura_render.
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.
taffy.style.alignment uses taffy.util.parse, so a change to taffy.util.parse can break taffy.style.alignment, while a change to taffy.style.alignment can't break taffy.util.parse.
Position
Below the diagonal: taffy.style.alignment uses a module listed above it, which is the healthy direction.
taffy.style.dimension uses taffy.util.parse, so a change to taffy.util.parse can break taffy.style.dimension, while a change to taffy.style.dimension can't break taffy.util.parse.
Position
Below the diagonal: taffy.style.dimension uses a module listed above it, which is the healthy direction.
taffy.style.block uses taffy.util.parse, so a change to taffy.util.parse can break taffy.style.block, while a change to taffy.style.block can't break taffy.util.parse.
Position
Below the diagonal: taffy.style.block uses a module listed above it, which is the healthy direction.
taffy.style.block uses taffy.style.alignment, so a change to taffy.style.alignment can break taffy.style.block, while a change to taffy.style.block can't break taffy.style.alignment.
Position
Below the diagonal: taffy.style.block uses a module listed above it, which is the healthy direction.
11→13 taffy.style.block uses taffy.stylepart of a loop✕
Connections
2 pairs of types, where a type in taffy.style.block uses a type in taffy.style.
taffy.style.block uses taffy.style, so a change to taffy.style can break taffy.style.block, while a change to taffy.style.block can't break taffy.style.
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→21 taffy.style.block uses obscura_renderpart of a loop✕
Connections
2 pairs of types, where a type in taffy.style.block uses a type in obscura_render.
taffy.style.block uses obscura_render, so a change to obscura_render can break taffy.style.block, while a change to taffy.style.block can't break obscura_render.
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.
taffy.style.grid uses taffy.util.parse, so a change to taffy.util.parse can break taffy.style.grid, while a change to taffy.style.grid can't break taffy.util.parse.
Position
Below the diagonal: taffy.style.grid uses a module listed above it, which is the healthy direction.
taffy.style.grid uses taffy.style.alignment, so a change to taffy.style.alignment can break taffy.style.grid, while a change to taffy.style.grid can't break taffy.style.alignment.
Position
Below the diagonal: taffy.style.grid uses a module listed above it, which is the healthy direction.
taffy.style.grid uses taffy.style.dimension, so a change to taffy.style.dimension can break taffy.style.grid, while a change to taffy.style.grid can't break taffy.style.dimension.
Position
Below the diagonal: taffy.style.grid uses a module listed above it, which is the healthy direction.
12→13 taffy.style.grid uses taffy.stylepart of a loop✕
Connections
2 pairs of types, where a type in taffy.style.grid uses a type in taffy.style.
taffy.style.grid uses taffy.geometry, so a change to taffy.geometry can break taffy.style.grid, while a change to taffy.style.grid can't break taffy.geometry.
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→21 taffy.style.grid uses obscura_renderpart of a loop✕
Connections
3 pairs of types, where a type in taffy.style.grid uses a type in obscura_render.
taffy.style.grid uses obscura_render, so a change to obscura_render can break taffy.style.grid, while a change to taffy.style.grid can't break obscura_render.
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.
taffy.style uses taffy.style.alignment, so a change to taffy.style.alignment can break taffy.style, while a change to taffy.style can't break taffy.style.alignment.
Position
Below the diagonal: taffy.style uses a module listed above it, which is the healthy direction.
taffy.style uses taffy.style.block, so a change to taffy.style.block can break taffy.style, while a change to taffy.style can't break taffy.style.block.
Position
Below the diagonal: taffy.style uses a module listed above it, which is the healthy direction.
taffy.style.flex uses taffy.util.parse, so a change to taffy.util.parse can break taffy.style.flex, while a change to taffy.style.flex can't break taffy.util.parse.
Position
Below the diagonal: taffy.style.flex uses a module listed above it, which is the healthy direction.
taffy.style.flex uses taffy.style.alignment, so a change to taffy.style.alignment can break taffy.style.flex, while a change to taffy.style.flex can't break taffy.style.alignment.
Position
Below the diagonal: taffy.style.flex uses a module listed above it, which is the healthy direction.
taffy.style.flex uses taffy.geometry, so a change to taffy.geometry can break taffy.style.flex, while a change to taffy.style.flex can't break taffy.geometry.
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.
14→21 taffy.style.flex uses obscura_renderpart of a loop✕
Connections
1 pair of types, where a type in taffy.style.flex uses a type in obscura_render.
taffy.style.flex uses obscura_render, so a change to obscura_render can break taffy.style.flex, while a change to taffy.style.flex can't break obscura_render.
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.
taffy.geometry uses taffy.tree.layout, so a change to taffy.tree.layout can break taffy.geometry, while a change to taffy.geometry can't break taffy.tree.layout.
Position
Below the diagonal: taffy.geometry uses a module listed above it, which is the healthy direction.
taffy.geometry uses taffy.style.dimension, so a change to taffy.style.dimension can break taffy.geometry, while a change to taffy.geometry can't break taffy.style.dimension.
Position
Below the diagonal: taffy.geometry uses a module listed above it, which is the healthy direction.
taffy.geometry uses taffy.style.flex, so a change to taffy.style.flex can break taffy.geometry, while a change to taffy.geometry can't break taffy.style.flex.
Position
Below the diagonal: taffy.geometry uses a module listed above it, which is the healthy direction.
15→21 taffy.geometry uses obscura_renderpart of a loop✕
Connections
1 pair of types, where a type in taffy.geometry uses a type in obscura_render.
The types involved
taffy.geometry.Rect → obscura_render.Rect
Direction
taffy.geometry uses obscura_render, so a change to obscura_render can break taffy.geometry, while a change to taffy.geometry can't break obscura_render.
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.
taffy.compute.block uses obscura_dom.tree, so a change to obscura_dom.tree can break taffy.compute.block, while a change to taffy.compute.block can't break obscura_dom.tree.
Position
Below the diagonal: taffy.compute.block uses a module listed above it, which is the healthy direction.
taffy.compute.block uses taffy.tree.layout, so a change to taffy.tree.layout can break taffy.compute.block, while a change to taffy.compute.block can't break taffy.tree.layout.
Position
Below the diagonal: taffy.compute.block uses a module listed above it, which is the healthy direction.
taffy.compute.block uses taffy.style.block, so a change to taffy.style.block can break taffy.compute.block, while a change to taffy.compute.block can't break taffy.style.block.
Position
Below the diagonal: taffy.compute.block uses a module listed above it, which is the healthy direction.
taffy.compute.block uses taffy.style, so a change to taffy.style can break taffy.compute.block, while a change to taffy.compute.block can't break taffy.style.
Position
Below the diagonal: taffy.compute.block uses a module listed above it, which is the healthy direction.
taffy.compute.block uses taffy.geometry, so a change to taffy.geometry can break taffy.compute.block, while a change to taffy.compute.block can't break taffy.geometry.
Position
Below the diagonal: taffy.compute.block uses a module listed above it, which is the healthy direction.
16→21 taffy.compute.block uses obscura_renderpart of a loop✕
Connections
5 pairs of types, where a type in taffy.compute.block uses a type in obscura_render.
taffy.compute.block uses obscura_render, so a change to obscura_render can break taffy.compute.block, while a change to taffy.compute.block can't break obscura_render.
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.
taffy.compute.grid uses obscura_dom.tree, so a change to obscura_dom.tree can break taffy.compute.grid, while a change to taffy.compute.grid can't break obscura_dom.tree.
Position
Below the diagonal: taffy.compute.grid uses a module listed above it, which is the healthy direction.
taffy.compute.grid uses taffy.tree.layout, so a change to taffy.tree.layout can break taffy.compute.grid, while a change to taffy.compute.grid can't break taffy.tree.layout.
Position
Below the diagonal: taffy.compute.grid uses a module listed above it, which is the healthy direction.
taffy.compute.grid uses taffy.geometry, so a change to taffy.geometry can break taffy.compute.grid, while a change to taffy.compute.grid can't break taffy.geometry.
Position
Below the diagonal: taffy.compute.grid uses a module listed above it, which is the healthy direction.
taffy.compute.grid.placement uses obscura_dom.tree, so a change to obscura_dom.tree can break taffy.compute.grid.placement, while a change to taffy.compute.grid.placement can't break obscura_dom.tree.
Position
Below the diagonal: taffy.compute.grid.placement uses a module listed above it, which is the healthy direction.
taffy.compute.grid.placement uses taffy.style.alignment, so a change to taffy.style.alignment can break taffy.compute.grid.placement, while a change to taffy.compute.grid.placement can't break taffy.style.alignment.
Position
Below the diagonal: taffy.compute.grid.placement uses a module listed above it, which is the healthy direction.
taffy.compute.grid.placement uses taffy.style.grid, so a change to taffy.style.grid can break taffy.compute.grid.placement, while a change to taffy.compute.grid.placement can't break taffy.style.grid.
Position
Below the diagonal: taffy.compute.grid.placement uses a module listed above it, which is the healthy direction.
taffy.compute.grid.placement uses taffy.style, so a change to taffy.style can break taffy.compute.grid.placement, while a change to taffy.compute.grid.placement can't break taffy.style.
Position
Below the diagonal: taffy.compute.grid.placement uses a module listed above it, which is the healthy direction.
taffy.compute.grid.placement uses taffy.geometry, so a change to taffy.geometry can break taffy.compute.grid.placement, while a change to taffy.compute.grid.placement can't break taffy.geometry.
Position
Below the diagonal: taffy.compute.grid.placement uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses obscura_dom.tree, so a change to obscura_dom.tree can break taffy.tree.traits, while a change to taffy.tree.traits can't break obscura_dom.tree.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses taffy.tree.layout, so a change to taffy.tree.layout can break taffy.tree.traits, while a change to taffy.tree.traits can't break taffy.tree.layout.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses taffy.style.block, so a change to taffy.style.block can break taffy.tree.traits, while a change to taffy.tree.traits can't break taffy.style.block.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses taffy.style.grid, so a change to taffy.style.grid can break taffy.tree.traits, while a change to taffy.tree.traits can't break taffy.style.grid.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses taffy.style.flex, so a change to taffy.style.flex can break taffy.tree.traits, while a change to taffy.tree.traits can't break taffy.style.flex.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses taffy.geometry, so a change to taffy.geometry can break taffy.tree.traits, while a change to taffy.tree.traits can't break taffy.geometry.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses taffy.compute.block, so a change to taffy.compute.block can break taffy.tree.traits, while a change to taffy.tree.traits can't break taffy.compute.block.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.traits uses taffy.compute.grid, so a change to taffy.compute.grid can break taffy.tree.traits, while a change to taffy.tree.traits can't break taffy.compute.grid.
Position
Below the diagonal: taffy.tree.traits uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses obscura_dom.tree, so a change to obscura_dom.tree can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break obscura_dom.tree.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.tree.layout, so a change to taffy.tree.layout can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.tree.layout.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.style.block, so a change to taffy.style.block can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.style.block.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.style.grid, so a change to taffy.style.grid can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.style.grid.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.style, so a change to taffy.style can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.style.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.style.flex, so a change to taffy.style.flex can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.style.flex.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.geometry, so a change to taffy.geometry can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.geometry.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.compute.block, so a change to taffy.compute.block can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.compute.block.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.compute.grid, so a change to taffy.compute.grid can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.compute.grid.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
taffy.tree.taffy_tree uses taffy.tree.traits, so a change to taffy.tree.traits can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break taffy.tree.traits.
Position
Below the diagonal: taffy.tree.taffy_tree uses a module listed above it, which is the healthy direction.
20→21 taffy.tree.taffy_tree uses obscura_renderpart of a loop✕
Connections
1 pair of types, where a type in taffy.tree.taffy_tree uses a type in obscura_render.
taffy.tree.taffy_tree uses obscura_render, so a change to obscura_render can break taffy.tree.taffy_tree, while a change to taffy.tree.taffy_tree can't break obscura_render.
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.
obscura_render uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_render, while a change to obscura_render can't break obscura_dom.tree.
Position
Below the diagonal: obscura_render uses a module listed above it, which is the healthy direction.
obscura_render uses taffy.style.alignment, so a change to taffy.style.alignment can break obscura_render, while a change to obscura_render can't break taffy.style.alignment.
Position
Below the diagonal: obscura_render uses a module listed above it, which is the healthy direction.
obscura_render uses taffy.style.dimension, so a change to taffy.style.dimension can break obscura_render, while a change to obscura_render can't break taffy.style.dimension.
Position
Below the diagonal: obscura_render uses a module listed above it, which is the healthy direction.
obscura_render uses taffy.style.grid, so a change to taffy.style.grid can break obscura_render, while a change to obscura_render can't break taffy.style.grid.
Position
Below the diagonal: obscura_render uses a module listed above it, which is the healthy direction.
obscura_render uses taffy.style.flex, so a change to taffy.style.flex can break obscura_render, while a change to obscura_render can't break taffy.style.flex.
Position
Below the diagonal: obscura_render uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in obscura_render uses a type in taffy.geometry.
The types involved
obscura_render.LayoutStyle → taffy.geometry.Line
Direction
obscura_render uses taffy.geometry, so a change to taffy.geometry can break obscura_render, while a change to obscura_render can't break taffy.geometry.
Position
Below the diagonal: obscura_render uses a module listed above it, which is the healthy direction.
obscura_render uses taffy.tree.taffy_tree, so a change to taffy.tree.taffy_tree can break obscura_render, while a change to obscura_render can't break taffy.tree.taffy_tree.
Position
Below the diagonal: obscura_render uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in cosmic_text.layout uses a type in obscura_render.
The types involved
cosmic_text.layout.Align → obscura_render.Display
cosmic_text.layout.Wrap → obscura_render.Display
Direction
cosmic_text.layout uses obscura_render, so a change to obscura_render can break cosmic_text.layout, while a change to cosmic_text.layout can't break obscura_render.
Position
Below the diagonal: cosmic_text.layout uses a module listed above it, which is the healthy direction.
22→29 cosmic_text.layout uses cosmic_text.attrspart of a loop✕
Connections
1 pair of types, where a type in cosmic_text.layout uses a type in cosmic_text.attrs.
cosmic_text.layout uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.layout, while a change to cosmic_text.layout can't break cosmic_text.attrs.
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.
obscura_render.css uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_render.css, while a change to obscura_render.css can't break obscura_dom.tree.
Position
Below the diagonal: obscura_render.css uses a module listed above it, which is the healthy direction.
obscura_render.css uses obscura_render, so a change to obscura_render can break obscura_render.css, while a change to obscura_render.css can't break obscura_render.
Position
Below the diagonal: obscura_render.css uses a module listed above it, which is the healthy direction.
cosmic_text.shape uses taffy.style, so a change to taffy.style can break cosmic_text.shape, while a change to cosmic_text.shape can't break taffy.style.
Position
Below the diagonal: cosmic_text.shape uses a module listed above it, which is the healthy direction.
cosmic_text.shape uses cosmic_text.layout, so a change to cosmic_text.layout can break cosmic_text.shape, while a change to cosmic_text.shape can't break cosmic_text.layout.
Position
Below the diagonal: cosmic_text.shape uses a module listed above it, which is the healthy direction.
24→26 cosmic_text.shape uses cosmic_text.font.systempart of a loop✕
Connections
5 pairs of types, where a type in cosmic_text.shape uses a type in cosmic_text.font.system.
cosmic_text.shape uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.shape, while a change to cosmic_text.shape can't break cosmic_text.font.system.
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→28 cosmic_text.shape uses cosmic_text.bufferpart of a loop✕
Connections
2 pairs of types, where a type in cosmic_text.shape uses a type in cosmic_text.buffer.
cosmic_text.shape uses cosmic_text.buffer, so a change to cosmic_text.buffer can break cosmic_text.shape, while a change to cosmic_text.shape can't break cosmic_text.buffer.
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→29 cosmic_text.shape uses cosmic_text.attrspart of a loop✕
Connections
8 pairs of types, where a type in cosmic_text.shape uses a type in cosmic_text.attrs.
cosmic_text.shape uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.shape, while a change to cosmic_text.shape can't break cosmic_text.attrs.
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.
cosmic_text.font.fallback uses cosmic_text.shape, so a change to cosmic_text.shape can break cosmic_text.font.fallback, while a change to cosmic_text.font.fallback can't break cosmic_text.shape.
Position
Below the diagonal: cosmic_text.font.fallback uses a module listed above it, which is the healthy direction.
25→26 cosmic_text.font.fallback uses cosmic_text.font.systempart of a loop✕
Connections
2 pairs of types, where a type in cosmic_text.font.fallback uses a type in cosmic_text.font.system.
cosmic_text.font.fallback uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.font.fallback, while a change to cosmic_text.font.fallback can't break cosmic_text.font.system.
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.
cosmic_text.font.system uses obscura_js.indexed_db, so a change to obscura_js.indexed_db can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break obscura_js.indexed_db.
Position
Below the diagonal: cosmic_text.font.system uses a module listed above it, which is the healthy direction.
cosmic_text.font.system uses cosmic_text.edit, so a change to cosmic_text.edit can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break cosmic_text.edit.
Position
Below the diagonal: cosmic_text.font.system uses a module listed above it, which is the healthy direction.
cosmic_text.font.system uses cosmic_text.swash, so a change to cosmic_text.swash can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break cosmic_text.swash.
Position
Below the diagonal: cosmic_text.font.system uses a module listed above it, which is the healthy direction.
cosmic_text.font.system uses cosmic_text.layout, so a change to cosmic_text.layout can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break cosmic_text.layout.
Position
Below the diagonal: cosmic_text.font.system uses a module listed above it, which is the healthy direction.
cosmic_text.font.system uses cosmic_text.shape, so a change to cosmic_text.shape can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break cosmic_text.shape.
Position
Below the diagonal: cosmic_text.font.system uses a module listed above it, which is the healthy direction.
cosmic_text.font.system uses cosmic_text.font.fallback, so a change to cosmic_text.font.fallback can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break cosmic_text.font.fallback.
Position
Below the diagonal: cosmic_text.font.system uses a module listed above it, which is the healthy direction.
26→28 cosmic_text.font.system uses cosmic_text.bufferpart of a loop✕
Connections
1 pair of types, where a type in cosmic_text.font.system uses a type in cosmic_text.buffer.
cosmic_text.font.system uses cosmic_text.buffer, so a change to cosmic_text.buffer can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break cosmic_text.buffer.
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.
26→29 cosmic_text.font.system uses cosmic_text.attrspart of a loop✕
Connections
3 pairs of types, where a type in cosmic_text.font.system uses a type in cosmic_text.attrs.
cosmic_text.font.system uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.font.system, while a change to cosmic_text.font.system can't break cosmic_text.attrs.
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.
cosmic_text.buffer_line uses cosmic_text.layout, so a change to cosmic_text.layout can break cosmic_text.buffer_line, while a change to cosmic_text.buffer_line can't break cosmic_text.layout.
Position
Below the diagonal: cosmic_text.buffer_line uses a module listed above it, which is the healthy direction.
cosmic_text.buffer_line uses cosmic_text.shape, so a change to cosmic_text.shape can break cosmic_text.buffer_line, while a change to cosmic_text.buffer_line can't break cosmic_text.shape.
Position
Below the diagonal: cosmic_text.buffer_line uses a module listed above it, which is the healthy direction.
cosmic_text.buffer_line uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.buffer_line, while a change to cosmic_text.buffer_line can't break cosmic_text.font.system.
Position
Below the diagonal: cosmic_text.buffer_line uses a module listed above it, which is the healthy direction.
27→29 cosmic_text.buffer_line uses cosmic_text.attrspart of a loop✕
Connections
1 pair of types, where a type in cosmic_text.buffer_line uses a type in cosmic_text.attrs.
cosmic_text.buffer_line uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.buffer_line, while a change to cosmic_text.buffer_line can't break cosmic_text.attrs.
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.
cosmic_text.buffer uses cosmic_text.swash, so a change to cosmic_text.swash can break cosmic_text.buffer, while a change to cosmic_text.buffer can't break cosmic_text.swash.
Position
Below the diagonal: cosmic_text.buffer uses a module listed above it, which is the healthy direction.
cosmic_text.buffer uses obscura_render, so a change to obscura_render can break cosmic_text.buffer, while a change to cosmic_text.buffer can't break obscura_render.
Position
Below the diagonal: cosmic_text.buffer uses a module listed above it, which is the healthy direction.
cosmic_text.buffer uses cosmic_text.layout, so a change to cosmic_text.layout can break cosmic_text.buffer, while a change to cosmic_text.buffer can't break cosmic_text.layout.
Position
Below the diagonal: cosmic_text.buffer uses a module listed above it, which is the healthy direction.
cosmic_text.buffer uses cosmic_text.shape, so a change to cosmic_text.shape can break cosmic_text.buffer, while a change to cosmic_text.buffer can't break cosmic_text.shape.
Position
Below the diagonal: cosmic_text.buffer uses a module listed above it, which is the healthy direction.
cosmic_text.buffer uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.buffer, while a change to cosmic_text.buffer can't break cosmic_text.font.system.
Position
Below the diagonal: cosmic_text.buffer uses a module listed above it, which is the healthy direction.
cosmic_text.buffer uses cosmic_text.buffer_line, so a change to cosmic_text.buffer_line can break cosmic_text.buffer, while a change to cosmic_text.buffer can't break cosmic_text.buffer_line.
Position
Below the diagonal: cosmic_text.buffer uses a module listed above it, which is the healthy direction.
28→29 cosmic_text.buffer uses cosmic_text.attrspart of a loop✕
Connections
3 pairs of types, where a type in cosmic_text.buffer uses a type in cosmic_text.attrs.
cosmic_text.buffer uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.buffer, while a change to cosmic_text.buffer can't break cosmic_text.attrs.
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.
cosmic_text.attrs uses taffy.style, so a change to taffy.style can break cosmic_text.attrs, while a change to cosmic_text.attrs can't break taffy.style.
Position
Below the diagonal: cosmic_text.attrs uses a module listed above it, which is the healthy direction.
cosmic_text.attrs uses cosmic_text.buffer, so a change to cosmic_text.buffer can break cosmic_text.attrs, while a change to cosmic_text.attrs can't break cosmic_text.buffer.
Position
Below the diagonal: cosmic_text.attrs uses a module listed above it, which is the healthy direction.
cosmic_text.edit.editor uses cosmic_text.edit, so a change to cosmic_text.edit can break cosmic_text.edit.editor, while a change to cosmic_text.edit.editor can't break cosmic_text.edit.
Position
Below the diagonal: cosmic_text.edit.editor uses a module listed above it, which is the healthy direction.
cosmic_text.edit.editor uses cosmic_text.swash, so a change to cosmic_text.swash can break cosmic_text.edit.editor, while a change to cosmic_text.edit.editor can't break cosmic_text.swash.
Position
Below the diagonal: cosmic_text.edit.editor uses a module listed above it, which is the healthy direction.
cosmic_text.edit.editor uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.edit.editor, while a change to cosmic_text.edit.editor can't break cosmic_text.font.system.
Position
Below the diagonal: cosmic_text.edit.editor uses a module listed above it, which is the healthy direction.
cosmic_text.edit.editor uses cosmic_text.buffer, so a change to cosmic_text.buffer can break cosmic_text.edit.editor, while a change to cosmic_text.edit.editor can't break cosmic_text.buffer.
Position
Below the diagonal: cosmic_text.edit.editor uses a module listed above it, which is the healthy direction.
cosmic_text.edit.editor uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.edit.editor, while a change to cosmic_text.edit.editor can't break cosmic_text.attrs.
Position
Below the diagonal: cosmic_text.edit.editor uses a module listed above it, which is the healthy direction.
obscura_render.inline uses obscura_js.indexed_db, so a change to obscura_js.indexed_db can break obscura_render.inline, while a change to obscura_render.inline can't break obscura_js.indexed_db.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses cosmic_text.swash, so a change to cosmic_text.swash can break obscura_render.inline, while a change to obscura_render.inline can't break cosmic_text.swash.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_render.inline, while a change to obscura_render.inline can't break obscura_dom.tree.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses taffy.geometry, so a change to taffy.geometry can break obscura_render.inline, while a change to obscura_render.inline can't break taffy.geometry.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses obscura_render, so a change to obscura_render can break obscura_render.inline, while a change to obscura_render.inline can't break obscura_render.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses cosmic_text.layout, so a change to cosmic_text.layout can break obscura_render.inline, while a change to obscura_render.inline can't break cosmic_text.layout.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses cosmic_text.font.system, so a change to cosmic_text.font.system can break obscura_render.inline, while a change to obscura_render.inline can't break cosmic_text.font.system.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses cosmic_text.buffer, so a change to cosmic_text.buffer can break obscura_render.inline, while a change to obscura_render.inline can't break cosmic_text.buffer.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
obscura_render.inline uses cosmic_text.attrs, so a change to cosmic_text.attrs can break obscura_render.inline, while a change to obscura_render.inline can't break cosmic_text.attrs.
Position
Below the diagonal: obscura_render.inline uses a module listed above it, which is the healthy direction.
cosmic_text.edit.syntect uses cosmic_text.edit, so a change to cosmic_text.edit can break cosmic_text.edit.syntect, while a change to cosmic_text.edit.syntect can't break cosmic_text.edit.
Position
Below the diagonal: cosmic_text.edit.syntect uses a module listed above it, which is the healthy direction.
cosmic_text.edit.syntect uses cosmic_text.swash, so a change to cosmic_text.swash can break cosmic_text.edit.syntect, while a change to cosmic_text.edit.syntect can't break cosmic_text.swash.
Position
Below the diagonal: cosmic_text.edit.syntect uses a module listed above it, which is the healthy direction.
cosmic_text.edit.syntect uses cosmic_text.font.system, so a change to cosmic_text.font.system can break cosmic_text.edit.syntect, while a change to cosmic_text.edit.syntect can't break cosmic_text.font.system.
Position
Below the diagonal: cosmic_text.edit.syntect uses a module listed above it, which is the healthy direction.
cosmic_text.edit.syntect uses cosmic_text.attrs, so a change to cosmic_text.attrs can break cosmic_text.edit.syntect, while a change to cosmic_text.edit.syntect can't break cosmic_text.attrs.
Position
Below the diagonal: cosmic_text.edit.syntect uses a module listed above it, which is the healthy direction.
cosmic_text.edit.syntect uses cosmic_text.edit.editor, so a change to cosmic_text.edit.editor can break cosmic_text.edit.syntect, while a change to cosmic_text.edit.syntect can't break cosmic_text.edit.editor.
Position
Below the diagonal: cosmic_text.edit.syntect uses a module listed above it, which is the healthy direction.
obscura_render.dom uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_render.dom, while a change to obscura_render.dom can't break obscura_dom.tree.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.dom uses taffy.style.alignment, so a change to taffy.style.alignment can break obscura_render.dom, while a change to obscura_render.dom can't break taffy.style.alignment.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.dom uses taffy.style.grid, so a change to taffy.style.grid can break obscura_render.dom, while a change to obscura_render.dom can't break taffy.style.grid.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in obscura_render.dom uses a type in taffy.style.
The types involved
obscura_render.dom.dom$module → taffy.style.Style
Direction
obscura_render.dom uses taffy.style, so a change to taffy.style can break obscura_render.dom, while a change to obscura_render.dom can't break taffy.style.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.dom uses taffy.geometry, so a change to taffy.geometry can break obscura_render.dom, while a change to obscura_render.dom can't break taffy.geometry.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.dom uses taffy.tree.taffy_tree, so a change to taffy.tree.taffy_tree can break obscura_render.dom, while a change to obscura_render.dom can't break taffy.tree.taffy_tree.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.dom uses obscura_render, so a change to obscura_render can break obscura_render.dom, while a change to obscura_render.dom can't break obscura_render.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.dom uses obscura_render.css, so a change to obscura_render.css can break obscura_render.dom, while a change to obscura_render.dom can't break obscura_render.css.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.dom uses obscura_render.inline, so a change to obscura_render.inline can break obscura_render.dom, while a change to obscura_render.dom can't break obscura_render.inline.
Position
Below the diagonal: obscura_render.dom uses a module listed above it, which is the healthy direction.
obscura_render.paint uses obscura_js.indexed_db, so a change to obscura_js.indexed_db can break obscura_render.paint, while a change to obscura_render.paint can't break obscura_js.indexed_db.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
obscura_render.paint uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_render.paint, while a change to obscura_render.paint can't break obscura_dom.tree.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
obscura_render.paint uses taffy.style.alignment, so a change to taffy.style.alignment can break obscura_render.paint, while a change to obscura_render.paint can't break taffy.style.alignment.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
obscura_render.paint uses taffy.geometry, so a change to taffy.geometry can break obscura_render.paint, while a change to obscura_render.paint can't break taffy.geometry.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
26 pairs of types, where a type in obscura_render.paint uses a type in obscura_render. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
obscura_render.paint uses obscura_render, so a change to obscura_render can break obscura_render.paint, while a change to obscura_render.paint can't break obscura_render.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
obscura_render.paint uses obscura_render.css, so a change to obscura_render.css can break obscura_render.paint, while a change to obscura_render.paint can't break obscura_render.css.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
obscura_render.paint uses obscura_render.inline, so a change to obscura_render.inline can break obscura_render.paint, while a change to obscura_render.paint can't break obscura_render.inline.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
obscura_render.paint uses obscura_render.dom, so a change to obscura_render.dom can break obscura_render.paint, while a change to obscura_render.paint can't break obscura_render.dom.
Position
Below the diagonal: obscura_render.paint uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_js.indexed_db, so a change to obscura_js.indexed_db can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_js.indexed_db.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_net.cookies, so a change to obscura_net.cookies can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_net.cookies.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_dom.tree.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_net.client, so a change to obscura_net.client can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_net.client.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_render, so a change to obscura_render can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_render.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_render.css, so a change to obscura_render.css can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_render.css.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_render.dom, so a change to obscura_render.dom can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_render.dom.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_js.ops uses obscura_render.paint, so a change to obscura_render.paint can break obscura_js.ops, while a change to obscura_js.ops can't break obscura_render.paint.
Position
Below the diagonal: obscura_js.ops uses a module listed above it, which is the healthy direction.
obscura_browser.context uses obscura_js.indexed_db, so a change to obscura_js.indexed_db can break obscura_browser.context, while a change to obscura_browser.context can't break obscura_js.indexed_db.
Position
Below the diagonal: obscura_browser.context uses a module listed above it, which is the healthy direction.
obscura_browser.context uses obscura_net.cookies, so a change to obscura_net.cookies can break obscura_browser.context, while a change to obscura_browser.context can't break obscura_net.cookies.
Position
Below the diagonal: obscura_browser.context uses a module listed above it, which is the healthy direction.
obscura_browser.context uses obscura_net.client, so a change to obscura_net.client can break obscura_browser.context, while a change to obscura_browser.context can't break obscura_net.client.
Position
Below the diagonal: obscura_browser.context uses a module listed above it, which is the healthy direction.
obscura_browser.context uses obscura_js.ops, so a change to obscura_js.ops can break obscura_browser.context, while a change to obscura_browser.context can't break obscura_js.ops.
Position
Below the diagonal: obscura_browser.context uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_js.indexed_db, so a change to obscura_js.indexed_db can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_js.indexed_db.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_net.cookies, so a change to obscura_net.cookies can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_net.cookies.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_dom.tree.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_net.client, so a change to obscura_net.client can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_net.client.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_render, so a change to obscura_render can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_render.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_render.css, so a change to obscura_render.css can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_render.css.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_render.paint, so a change to obscura_render.paint can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_render.paint.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_js.runtime uses obscura_js.ops, so a change to obscura_js.ops can break obscura_js.runtime, while a change to obscura_js.runtime can't break obscura_js.ops.
Position
Below the diagonal: obscura_js.runtime uses a module listed above it, which is the healthy direction.
obscura_browser.page uses obscura_dom.tree, so a change to obscura_dom.tree can break obscura_browser.page, while a change to obscura_browser.page can't break obscura_dom.tree.
Position
Below the diagonal: obscura_browser.page uses a module listed above it, which is the healthy direction.
obscura_browser.page uses obscura_net.client, so a change to obscura_net.client can break obscura_browser.page, while a change to obscura_browser.page can't break obscura_net.client.
Position
Below the diagonal: obscura_browser.page uses a module listed above it, which is the healthy direction.
obscura_browser.page uses obscura_render, so a change to obscura_render can break obscura_browser.page, while a change to obscura_browser.page can't break obscura_render.
Position
Below the diagonal: obscura_browser.page uses a module listed above it, which is the healthy direction.
obscura_browser.page uses obscura_render.paint, so a change to obscura_render.paint can break obscura_browser.page, while a change to obscura_browser.page can't break obscura_render.paint.
Position
Below the diagonal: obscura_browser.page uses a module listed above it, which is the healthy direction.
obscura_browser.page uses obscura_js.ops, so a change to obscura_js.ops can break obscura_browser.page, while a change to obscura_browser.page can't break obscura_js.ops.
Position
Below the diagonal: obscura_browser.page uses a module listed above it, which is the healthy direction.
obscura_browser.page uses obscura_browser.context, so a change to obscura_browser.context can break obscura_browser.page, while a change to obscura_browser.page can't break obscura_browser.context.
Position
Below the diagonal: obscura_browser.page uses a module listed above it, which is the healthy direction.
obscura_browser.page uses obscura_js.runtime, so a change to obscura_js.runtime can break obscura_browser.page, while a change to obscura_browser.page can't break obscura_js.runtime.
Position
Below the diagonal: obscura_browser.page uses a module listed above it, which is the healthy direction.
obscura_cdp.dispatch uses obscura_browser.context, so a change to obscura_browser.context can break obscura_cdp.dispatch, while a change to obscura_cdp.dispatch can't break obscura_browser.context.
Position
Below the diagonal: obscura_cdp.dispatch uses a module listed above it, which is the healthy direction.
obscura_cdp.domains.page uses obscura_render, so a change to obscura_render can break obscura_cdp.domains.page, while a change to obscura_cdp.domains.page can't break obscura_render.
Position
Below the diagonal: obscura_cdp.domains.page uses a module listed above it, which is the healthy direction.
obscura_cdp.domains.page uses obscura_render.paint, so a change to obscura_render.paint can break obscura_cdp.domains.page, while a change to obscura_cdp.domains.page can't break obscura_render.paint.
Position
Below the diagonal: obscura_cdp.domains.page uses a module listed above it, which is the healthy direction.
obscura_cdp.domains.page uses obscura_browser.page, so a change to obscura_browser.page can break obscura_cdp.domains.page, while a change to obscura_cdp.domains.page can't break obscura_browser.page.
Position
Below the diagonal: obscura_cdp.domains.page uses a module listed above it, which is the healthy direction.
obscura_cdp.domains.page uses obscura_cdp.dispatch, so a change to obscura_cdp.dispatch can break obscura_cdp.domains.page, while a change to obscura_cdp.domains.page can't break obscura_cdp.dispatch.
Position
Below the diagonal: obscura_cdp.domains.page uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 46% · Weak · gated by D1, D2, 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
A03:2025 — Software Supply Chain Failures
12
Medium
A05:2025 — Injection
8
Medium
A02:2025 — Security Misconfiguration
4
High / Critical
Roadmap
First, fix keyboard navigation by ensuring custom controls are operable and anchors have valid links, while simultaneously establishing proper page structure with language attributes, titles, and main landmarks. Next, provide text alternatives for all images, media, and interactive elements, and ensure every form control and button has a clear programmatic label. Finally, enforce these accessibility standards by integrating automated checks into your test suite and CI pipeline to prevent regressions.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
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.
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
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 — 38
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 — 1091
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 — 115
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 13
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. 74 of 74 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 — 74 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, 1211 of 1244 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, 133 test files), but it was not re-run: its build outgrew the 6 GB scratch ceiling (6.054 GB measured) and was stopped; its suite was not run. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
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.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `REDACTED` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D44 Platform End-of-Life — 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 dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a REDACTED) is simply not read here yet.
AC3 Page structure — 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. 85 further occurrence(s) are not listed individually; the score already reflects all 125.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (REDACTED). docker build failed (exit 1) — -------------------- 1 | >>> FROM rust:1-slim-bookworm AS builder 2 | 3 | RUN apt-get update && apt-get install -y --no-install-recommends \ -------------------- ERROR: failed to solve: rust:1-slim-bookworm: failed to resolve source metadata for docker.io/library/rust:1-slim-bookworm: failed to do request: Head "https://registry-1.docker.io/v2/library/rust/manifests/1-slim-bookworm": Forbidden; runtime evidence skipped.
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 Python, Rust 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 Python, Rust 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.
X3 Exception handling — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 83 further occurrence(s) are not listed individually; the score already reflects all 123.
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. 107 further occurrence(s) are not listed individually; the score already reflects all 147.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python, Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 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.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
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.
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.
DM4 Rich vs anemic domain model: Behaviour is detected as state mutation inside a method body — a method that enforces an invariant by validating-and-throwing without mutating reads as a query, and mutation delegated through an interface the scan can't resolve isn't credited; entities with zero public properties still drop out of the population. It detects that state changes, not whether the rule is correct.
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.
261 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was obscura_render::dom::layout_dom_once at 391. A further 10 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 obscura_render::style::named_color at 105 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: crates/obscura-mcp/src/lib.rs (obscura_mcp::handle_tool_call at 43). 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.
+ 118 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 120 down to 120 or less in Cyclomatic Complexity — start with obscura_render::dom::layout_dom_once (cyclomatic 391), obscura_render::style::apply_value (cyclomatic 372), obscura_js::ops::op_dom_inner (cyclomatic 209). — 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 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 120; 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.
+ 159 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 140 bodies over 30 down to 30 or less in Cognitive Complexity — start with obscura_render::dom::layout_dom_once (cognitive 1186), obscura_render::paint::paint_laid_dom_scrolled (cognitive 427), obscura_js::ops::op_dom_inner (cognitive 223). — 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 140 together lifts Cognitive Complexity from 2.0 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; 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 Classes9.1 / 10Stronggated by 90 serious findings✓ 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 41 FunctionTooLong finding(s) in God Classes — start with dom.rs (14), style.rs (7), ops.rs (5). — One of this dimension's main actionable groups (41 warning-level).
Resolve the 21 FileTooLong finding(s) in God Classes — start with page.rs (2), lib.rs (2), REDACTED. — One of this dimension's main actionable groups (21 warning-level).
Resolve the 10 TooManyMethods finding(s) in God Classes — start with REDACTED (3), paint.rs (2), runtime.rs. — One of this dimension's main actionable groups (10 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.
210 duplicated block group(s) detected. A further 5 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 88 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 15 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with dom.rs (3), paint.rs (3), css.rs (2). — One of this dimension's main actionable groups (15 warning-level).
Resolve the 15 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with ops.rs (3), css.rs (3), inline.rs (2). — One of this dimension's main actionable groups (15 warning-level).
Resolve the 15 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with dom.rs (3), runtime.rs (2), ops.rs (2). — One of this dimension's main actionable groups (15 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.4 / 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.
10 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 2 module(s) off the main sequence, with abstractness counted on 9 of the 10 (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: obscura-dom · ×2
What to do
Resolve the 2 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (2 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 geometry.rs, inline.rs, grid_item.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.
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.
2517 test methods: 2106 unit, 411 integration, 0 BDD, 0 e2e. The Rust suite contributes 2454 `#[test]` function(s) across 133 file(s) declaring at least one; its unit/integration split is Cargo's own — 81 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. The Python suite contributes 63 test function(s) across 6 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
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.
15 outdated, 0 yanked direct Cargo dependencies. 52 of 54 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.
Outdated: anyhow · ×15
What to do
Maintain Dependency Hygiene — already on the Gold path. — No findings, and enforcement is at this dimension's ceiling.
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 468 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: crates/obscura-render/src/dom.rs (116×391=45356); crates/obscura-js/src/ops.rs (122×209=25498); crates/obscura-render/src/style.rs (56×372=20832) Repeated repair below the complexity floor: crates/obscura-js/src/frame.rs (14 of 18 changes were fixes); crates/obscura-browser/src/context.rs (6 of 6 changes were fixes); crates/obscura/src/page.rs (4 of 4 changes were fixes)
Resolve the 30 Hotspot finding(s) in Churn × Complexity Hotspots — start with dom.rs (2), page.rs (2), runtime.rs (2). — One of this dimension's main actionable groups (30 warning-level).
Resolve the 4 Repeated repair finding(s) in Churn × Complexity Hotspots — start with frame.rs, context.rs, page.rs. — One of this dimension's main actionable groups (4 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 Factor7.8 / 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.
15 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is crates/obscura-render/src/dom.rs. Counted over 66 of the 85 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
Further sole-owners (lower concentration)
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 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.
1 deducted task-comment markers across 159282 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 1 TodoComment finding(s) in Explicit Debt — start with inline.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.
1 of 1 documentation facets pass in full. 26 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: 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.
1 of 11 build units (Cargo) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: 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).
8 finding(s): 0 critical, 0 high, 8 medium, 0 low. semgrep hit a parse error in 3 file(s) — `crates/obscura-browser/src/idle_deadline.rs` (line 56, line 150, line 297), `REDACTED`, `render-repros/representative-suite/run.sh` (line 42) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
What to do
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (6). — One of this dimension's main actionable groups (6 warning-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 5 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (5). — One of this dimension's main actionable groups (5 warning-level).
Resolve the 1 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 1 High IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 2 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
1 of 66 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is crates/obscura-browser/src/profiles.rs. Counted over 66 of the 85 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.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
No dependency in any ecosystem this repository declares is published as malicious.
✓ On the Gold path — maintain.
Detailed fixes: d43_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives3.5 / 10Weak✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. (×13) — render-repros/abs-fill.html:13, render-repros/img-density-and-alt.html:4, render-repros/img-density-and-alt.html:5, …
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 & labels4.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.
This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×9) — render-repros/form-control-geometry.html:39, render-repros/form-control-geometry.html:42, render-repros/form-control-geometry.html:44, …
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Do you agree with this assessment?
AC3 · Page structure2.7 / 10Weak✓ Tool-verified
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×15) — render-repros/abs-fill.html:1, render-repros/absolute-containing-block.html:1, render-repros/absolute-static-position.html:2, …
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×17) — render-repros/abs-fill.html:1, render-repros/absolute-containing-block.html:1, render-repros/absolute-static-position.html:2, …
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="content">, so there is no content here to wrap — render the <main> from the component mounted into it. — render-repros/animation-fill-forwards.html:2
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div>, so there is no content here to wrap — render the <main> from the component mounted into it. — render-repros/block-whitespace-margin-collapse.html:2
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). (×3) — render-repros/fixed-table-layout.html:13, render-repros/fixed-table-layout.html:17, render-repros/fixed-table-layout.html:21
An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative. (×3) — render-repros/float-bfc-continuation.html:41, render-repros/float-flow-bands.html:47, render-repros/float-flow-bands.html:50
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".
An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action. (×2) — render-repros/opposing-header-floats.html:31, render-repros/ratio-only-inline-images.html:26
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 78 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Other · Domain Modelling — Whether an aggregate references another aggregate by identity rather than embedding it by object reference.
Method: Roslyn (DDD-gated): aggregate roots identified by convention; each aggregate field checked for direct references to other aggregates versus id-only. Deterministic, DDD-native.
Coverage: Population: aggregate roots identified by AggregateRoot/IAggregateRoot base/interface NAME convention; reference-by-identity then checked exhaustively within that set — a root not using those names is invisible.
Other · Domain Modelling — Whether domain identifiers are strongly typed (a newtype wrapper) rather than raw primitives — consistency once an idiom exists.
Method: Roslyn (DDD-gated): strongly-typed id adoption on domain entities/events; raw Guid/int/string ids counted versus wrapped types. An id wrapper is recognised by VALUE SEMANTICS, not by being a struct — a record struct, a record class (`record ApartmentId(Guid Value)`) or a class declared by a typed-id base (`class MemberId : TypedIdValueBase`) all count, while a plain mutable class (reference equality) and a verb-phrase query record (`GetCustomerById`) do not. Deterministic, adoption percentage.
Coverage: Population: id-like members by *Id/*Key NAME suffix; strongly-typed-ID shape then checked semantically — non-suffixed identifiers are not seen.
Do you agree with this assessment?
DM4 · Rich vs anemic domain model10.0 / 10Exemplary✓ Tool-verified
Other · Domain Modelling — Whether domain entities own their behaviour (invariant-enforcing commands) rather than being data-only structs driven by a foreign service.
Method: Roslyn (DDD-gated): entity method BODIES classified mutator-vs-query — only methods that mutate the entity's own declared state count as invariant-protecting behaviour, so a getter/passthrough doesn't rescue an anemic class. Deterministic, exhaustive over domain-layer entities.
Coverage: Population: entities by name/base convention; rich-vs-anemic judged by classifying each method body mutator-vs-query — logic-bearing domain types outside the convention are invisible.
Other · Domain Modelling — Whether a domain type's identity-bearing field stays immutable — a `pub` mutable field under a hand-rolled Hash/PartialEq breaks the value-identity invariant.
Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.
Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 9 of 10 project(s) that lack one — worth up to 1.8 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability6.2 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 6/8 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/obscura-render`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Consider OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) and a health-check endpoint (a /health route on your axum/actix router) for operability.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
`fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×3) — tools/live-view.mjs:34, tools/live-view.mjs:56, tools/live-view.mjs:85
What to do
Bound every outbound call: pass `signal: AbortSignal.timeout(ms)` to `fetch`, set `timeout` on the axios instance (`axios.create({ timeout })`), and add retries with back-off (`axios-retry`, `p-retry`) and a breaker (`opossum`, `cockatiel`) around dependencies that fail.
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.
`start_with_serve_options_limit_and_ready_file` is async and calls thread::sleep, block_on — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs. — crates/obscura-cdp/src/server.rs:328
What to do
Rust: `.await` the future instead of `block_on` (on a Tokio runtime thread it panics outright) and use `tokio::time::sleep(..).await` instead of `std::thread::sleep`; where synchronous code must run, move it to `tokio::task::spawn_blocking` or `block_in_place`.
Other · Security — Read from this repository's Rust source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. 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.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. — crates/obscura-js/src/ops.rs:6921
What to do
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied 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/2 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.
`ensureServe` 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 })`. — tools/live-view.mjs:32
`listAllPages` 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 })`. — tools/live-view.mjs:84
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 unescaped1.6 / 10Critical✓ Tool-verified
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.
`html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. (×3) — REDACTED:3611, REDACTED:12408, REDACTED:15162
`v` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:4133
`html` is text this program did not author, and it is written into the text of an element through `insertAdjacentHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:4429
`String(value==null?'':value)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:10945
`bodyContent` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:15081
`String(html==null?"":html)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — REDACTED:16233
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
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. (×39) — tools/live-view.mjs:36, tools/live-view.mjs:44, tools/live-view.mjs:52, …
`.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — REDACTED:3848
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 1414 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`. — crates/obscura-net/src/client.rs:1414
`debug!` at line 1536 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`. — crates/obscura-net/src/client.rs:1536
`debug!` at line 1558 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`. — crates/obscura-net/src/client.rs:1558
`debug!` at line 332 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`. — crates/obscura-net/src/wreq_client.rs:332
`debug!` at line 531 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`. — crates/obscura-net/src/wreq_client.rs:531
`info!` at line 285 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`. — crates/obscura-mcp/src/http.rs:285
`debug!` at line 305 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`. — crates/obscura-mcp/src/http.rs:305
`debug!` at line 318 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`. — crates/obscura-mcp/src/http.rs:318
`warn!` at line 337 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`. — crates/obscura-mcp/src/http.rs:337
`debug!` at line 263 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`. — crates/obscura-js/src/module_loader.rs:263
`warn!` at line 3360 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`. — crates/obscura-js/src/ops.rs:3360
`error!` at line 3361 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`. — crates/obscura-js/src/ops.rs:3361
`info!` at line 3362 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`. — crates/obscura-js/src/ops.rs:3362
`debug!` at line 3929 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`. — crates/obscura-js/src/ops.rs:3929
`debug!` at line 3964 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`. — crates/obscura-js/src/ops.rs:3964
`debug!` at line 4112 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`. — crates/obscura-js/src/ops.rs:4112
`debug!` at line 4589 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`. — crates/obscura-js/src/ops.rs:4589
`warn!` at line 6550 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`. — crates/obscura-js/src/ops.rs:6550
`warn!` at line 6620 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`. — crates/obscura-js/src/ops.rs:6620
`warn!` at line 6851 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`. — crates/obscura-js/src/ops.rs:6851
`warn!` at line 630 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`. — crates/obscura-js/src/runtime.rs:630
`warn!` at line 3435 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`. — crates/obscura-js/src/runtime.rs:3435
`warn!` at line 3662 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`. — crates/obscura-js/src/runtime.rs:3662
`warn!` at line 3801 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`. — crates/obscura-js/src/runtime.rs:3801
`warn!` at line 3952 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`. — crates/obscura-js/src/runtime.rs:3952
`warn!` at line 39 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`. — crates/obscura-js/src/v8_flags.rs:39
`debug!` at line 436 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`. — crates/obscura-cli/src/main.rs:436
`info!` at line 504 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`. — crates/obscura-cli/src/main.rs:504
`info!` at line 507 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`. — crates/obscura-cli/src/main.rs:507
`info!` at line 510 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`. — crates/obscura-cli/src/main.rs:510
`info!` at line 513 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`. — crates/obscura-cli/src/main.rs:513
`info!` at line 525 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`. — crates/obscura-cli/src/main.rs:525
`info!` at line 678 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`. — crates/obscura-cli/src/main.rs:678
`warn!` at line 734 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`. — crates/obscura-cli/src/main.rs:734
`warn!` at line 746 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`. — crates/obscura-cli/src/main.rs:746
`warn!` at line 749 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`. — crates/obscura-cli/src/main.rs:749
`info!` at line 780 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`. — crates/obscura-cli/src/main.rs:780
`warn!` at line 809 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`. — crates/obscura-cli/src/main.rs:809
`warn!` at line 837 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`. — crates/obscura-cli/src/main.rs:837
`warn!` at line 844 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`. — crates/obscura-cli/src/main.rs:844
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 — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 17 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 1 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 — 48 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.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
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; this repository's Python 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.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. 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 — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — -------------------- 1 | >>> FROM rust:1-slim-bookworm AS builder 2 | 3 | RUN apt-get update && apt-get install -y --no-install-recommends \ -------------------- ERROR: failed to solve: rust:1-slim-bookworm: failed to resolve source metadata for docker.io/library/rust:1-slim-bookworm: failed to do request: Head "https://registry-1.docker.io/v2/library/rust/manifests/1-slim-bookworm": Forbidden; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — 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 — ~19985 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, Python, Rust, html not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Aggregate roots were found in only one source directory (obscura-cdp), which is a layered codebase, not two contexts. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 1 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM3 Integration-event coupling — no integration events detected — coupling check not applicable
DM6 Domain ↔ infrastructure boundary — this Rust crate maps no type to a persistence framework (diesel/sea-orm/sqlx), so DM6's domain↔infrastructure fusion read has no population to be taken over
DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and 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
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
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'.
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
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
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. TypeScript/JavaScript runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
<html> without a lang render-repros/abs-fill.html:1— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/absolute-containing-block.html:1— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/absolute-static-position.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/background-shorthand-reset.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/block-auto-margins.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/box-sizing.html:1— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/carousel-clip.html:1— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/cascade-priority.html:1— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/clear-float.html:1— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/contextual-css-math.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/flex-whitespace-items.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/float-bfc-continuation.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/float-flow-bands.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/font-metric-line-height.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang render-repros/font-shorthand.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC1 · Text alternatives· <img> without a text alternative · ×13
<img> without a text alternative render-repros/abs-fill.html:13— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/img-density-and-alt.html:4— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/img-density-and-alt.html:5— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/img-density-and-alt.html:6— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/img-density-and-alt.html:10— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/img-density-and-alt.html:14— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/img-density-and-alt.html:15— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/retained-cssom-raster.html:12— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/retained-cssom-raster.html:13— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/retained-cssom-raster.html:14— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/retained-cssom-raster.html:15— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/retained-cssom-raster.html:16— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative render-repros/retained-cssom-raster.html:17— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
AC2 · Forms & labels· <input> without a programmatic label · ×7
<input> without a programmatic label render-repros/form-control-geometry.html:39— 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 render-repros/form-control-geometry.html:42— 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 render-repros/form-control-geometry.html:44— 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 render-repros/form-control-geometry.html:47— 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 render-repros/form-control-geometry.html:48— 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 render-repros/form-control-quirks.html:22— 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 render-repros/form-control-quirks.html:25— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels· <textarea> without a programmatic label · ×2
<textarea> without a programmatic label render-repros/form-control-geometry.html:50— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<textarea> without a programmatic label render-repros/form-control-geometry.html:51— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
obscura_render::dom::layout_dom_once (cognitive 1186) crates/obscura-render/src/dom.rs:5203— obscura_render::dom::layout_dom_once has cognitive complexity 1186 (threshold 15). Drivers by points: if/else 221 (759 pts), match/switch 67 (259 pts), loops 34 (125 pts), boolean chains 43 (nesting depth added 821). 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.
obscura_render::paint::paint_laid_dom_scrolled (cognitive 427) crates/obscura-render/src/paint.rs:3939— obscura_render::paint::paint_laid_dom_scrolled has cognitive complexity 427 (threshold 15). Drivers by points: if/else 107 (314 pts), loops 17 (43 pts), boolean chains 36, match/switch 13 (34 pts) (nesting depth added 254). 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.
obscura_render::style::apply_value (cognitive 189) crates/obscura-render/src/style.rs:834— obscura_render::style::apply_value has cognitive complexity 189 (threshold 15). Drivers by points: if/else 71 (124 pts), match/switch 27 (54 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 81). 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.
obscura_render::dom::build (cognitive 176) crates/obscura-render/src/dom.rs:12960— obscura_render::dom::build has cognitive complexity 176 (threshold 15). Drivers by points: if/else 64 (112 pts), boolean chains 44, match/switch 3 (12 pts), loops 4 (8 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::dom::build_children_with_float_zone (cognitive 174) crates/obscura-render/src/dom.rs:14860— obscura_render::dom::build_children_with_float_zone has cognitive complexity 174 (threshold 15). Drivers by points: if/else 52 (122 pts), boolean chains 31, match/switch 8 (16 pts), loops 4 (5 pts) (nesting depth added 79). 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.
obscura_render::dom::build_table (cognitive 164) crates/obscura-render/src/dom.rs:11683— obscura_render::dom::build_table has cognitive complexity 164 (threshold 15). Drivers by points: if/else 56 (112 pts), loops 15 (30 pts), boolean chains 14, match/switch 5 (8 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.
obscura_render::css::denest (cognitive 102) crates/obscura-render/src/css.rs:7080— obscura_render::css::denest has cognitive complexity 102 (threshold 15). Drivers by points: if/else 32 (87 pts), boolean chains 7, loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
obscura_render::dom::build_mixed_block (cognitive 101) crates/obscura-render/src/dom.rs:13794— obscura_render::dom::build_mixed_block has cognitive complexity 101 (threshold 15). Drivers by points: if/else 32 (75 pts), boolean chains 13, loops 5 (11 pts), match/switch 1 (2 pts) (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.
obscura_render::dom::retained_style_plan (cognitive 99) crates/obscura-render/src/dom.rs:3944— obscura_render::dom::retained_style_plan has cognitive complexity 99 (threshold 15). Drivers by points: if/else 27 (80 pts), loops 5 (9 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::paint::serialize_svg_node (cognitive 97) crates/obscura-render/src/paint.rs:11178— obscura_render::paint::serialize_svg_node has cognitive complexity 97 (threshold 15). Drivers by points: if/else 34 (86 pts), loops 3 (5 pts), boolean chains 4, match/switch 2 (nesting depth added 54). 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.
obscura_render::dom::apply_table_row_geometry (cognitive 96) crates/obscura-render/src/dom.rs:9393— obscura_render::dom::apply_table_row_geometry has cognitive complexity 96 (threshold 15). Drivers by points: if/else 23 (73 pts), loops 7 (17 pts), match/switch 2 (6 pts) (nesting depth added 64). 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.
obscura_render::dom::resolve_deferred_flex_inline_sizes (cognitive 89) crates/obscura-render/src/dom.rs:12686— obscura_render::dom::resolve_deferred_flex_inline_sizes has cognitive complexity 89 (threshold 15). Drivers by points: if/else 23 (58 pts), match/switch 6 (15 pts), loops 8 (12 pts), boolean chains 4 (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.
obscura_render::dom::cascade_node_style (cognitive 86) crates/obscura-render/src/dom.rs:2631— obscura_render::dom::cascade_node_style has cognitive complexity 86 (threshold 15). Drivers by points: if/else 25 (66 pts), loops 3 (7 pts), match/switch 2 (7 pts), boolean chains 6 (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.
obscura_render::css::single_media_query_applies_for_viewport (cognitive 81) crates/obscura-render/src/css.rs:6878— obscura_render::css::single_media_query_applies_for_viewport has cognitive complexity 81 (threshold 15). Drivers by points: if/else 49 (74 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::dom::apply_full_span_column_subgrids (cognitive 78) crates/obscura-render/src/dom.rs:8682— obscura_render::dom::apply_full_span_column_subgrids has cognitive complexity 78 (threshold 15). Drivers by points: if/else 20 (50 pts), boolean chains 14, loops 6 (12 pts), match/switch 1 (2 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::paint::draw_text (cognitive 77) crates/obscura-render/src/paint.rs:7453— obscura_render::paint::draw_text has cognitive complexity 77 (threshold 15). Drivers by points: if/else 21 (62 pts), loops 3 (12 pts), boolean chains 3 (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.
obscura_render::css::note_compound_dependencies (cognitive 75) crates/obscura-render/src/css.rs:1119— obscura_render::css::note_compound_dependencies has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 6 (21 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::style::parse_color_for_scheme (cognitive 69) crates/obscura-render/src/style.rs:5038— obscura_render::style::parse_color_for_scheme has cognitive complexity 69 (threshold 15). Drivers by points: if/else 29 (57 pts), match/switch 4 (9 pts), boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::dom::resolve_grid_areas (cognitive 65) crates/obscura-render/src/dom.rs:8380— obscura_render::dom::resolve_grid_areas has cognitive complexity 65 (threshold 15). Drivers by points: if/else 12 (45 pts), loops 6 (16 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::dom::cascade_walk (cognitive 63) crates/obscura-render/src/dom.rs:2899— obscura_render::dom::cascade_walk has cognitive complexity 63 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 5 (18 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::dom::synthesize_row_rects (cognitive 63) crates/obscura-render/src/dom.rs:10770— obscura_render::dom::synthesize_row_rects has cognitive complexity 63 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 7 (13 pts), match/switch 4 (13 pts), boolean chains 1 (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.
obscura_render::inline::shape_with_text_indent (cognitive 62) crates/obscura-render/src/inline.rs:3103— obscura_render::inline::shape_with_text_indent has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 4 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_render::paint::paint_background_gradient_layers (cognitive 62) crates/obscura-render/src/paint.rs:8664— obscura_render::paint::paint_background_gradient_layers has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (50 pts), loops 2 (9 pts), boolean chains 3 (nesting depth added 41). 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.
obscura_render::css::invalidation_compounds (cognitive 53) crates/obscura-render/src/css.rs:551— obscura_render::css::invalidation_compounds has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 3 (7 pts), boolean chains 5, match/switch 1 (2 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.
obscura_render::paint::prepare_dom_with_retained_styles_with_animation_state (cognitive 52) crates/obscura-render/src/paint.rs:2896— obscura_render::paint::prepare_dom_with_retained_styles_with_animation_state has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 17, loops 1 (5 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
obscura_render::dom::layout_dom_once (cyclomatic 391) crates/obscura-render/src/dom.rs:5203— obscura_render::dom::layout_dom_once has cyclomatic complexity 391 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::style::apply_value (cyclomatic 372) crates/obscura-render/src/style.rs:834— obscura_render::style::apply_value has cyclomatic complexity 372 (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.
obscura_render::paint::paint_laid_dom_scrolled (cyclomatic 167) crates/obscura-render/src/paint.rs:3939— obscura_render::paint::paint_laid_dom_scrolled has cyclomatic complexity 167 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::dom::build (cyclomatic 114) crates/obscura-render/src/dom.rs:12960— obscura_render::dom::build has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::dom::build_children_with_float_zone (cyclomatic 92) crates/obscura-render/src/dom.rs:14860— obscura_render::dom::build_children_with_float_zone has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::style::supports_conservative_known_value (cyclomatic 87) crates/obscura-render/src/style.rs:3000— obscura_render::style::supports_conservative_known_value has cyclomatic complexity 87 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: obscura_render::style::named_color (cyclomatic 105) 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.
obscura_render::dom::build_table (cyclomatic 86) crates/obscura-render/src/dom.rs:11683— obscura_render::dom::build_table has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::style::supports_declaration (cyclomatic 71) crates/obscura-render/src/style.rs:2036— obscura_render::style::supports_declaration has cyclomatic complexity 71 (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: obscura_render::style::named_color (cyclomatic 105) 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.
obscura_render::css::single_media_query_applies_for_viewport (cyclomatic 59) crates/obscura-render/src/css.rs:6878— obscura_render::css::single_media_query_applies_for_viewport has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::style::parse_color_for_scheme (cyclomatic 58) crates/obscura-render/src/style.rs:5038— obscura_render::style::parse_color_for_scheme has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: obscura_render::style::named_color (cyclomatic 105) 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.
obscura_render::paint::svg_image_intrinsic_metadata (cyclomatic 51) crates/obscura-render/src/paint.rs:10544— obscura_render::paint::svg_image_intrinsic_metadata has cyclomatic complexity 51 (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.
obscura_render::dom::resolve_deferred_flex_inline_sizes (cyclomatic 50) crates/obscura-render/src/dom.rs:12686— obscura_render::dom::resolve_deferred_flex_inline_sizes 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.
obscura_render::dom::retained_style_plan (cyclomatic 48) crates/obscura-render/src/dom.rs:3944— obscura_render::dom::retained_style_plan has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::css::denest (cyclomatic 47) crates/obscura-render/src/css.rs:7080— obscura_render::css::denest has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: obscura_render::css::animated_properties_for_declaration (cyclomatic 48) 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.
obscura_render::to_taffy_style (cyclomatic 46) crates/obscura-render/src/lib.rs:2535— obscura_render::to_taffy_style has cyclomatic complexity 46 (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.
obscura_render::dom::build_mixed_block (cyclomatic 46) crates/obscura-render/src/dom.rs:13794— obscura_render::dom::build_mixed_block has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::dom::apply_full_span_column_subgrids (cyclomatic 40) crates/obscura-render/src/dom.rs:8682— obscura_render::dom::apply_full_span_column_subgrids 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.
obscura_render::paint::serialize_svg_node (cyclomatic 40) crates/obscura-render/src/paint.rs:11178— obscura_render::paint::serialize_svg_node 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.
obscura_render::style::ua_style (cyclomatic 39) crates/obscura-render/src/style.rs:26— obscura_render::style::ua_style has cyclomatic complexity 39 (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: obscura_render::style::named_color (cyclomatic 105) 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.
obscura_render::dom::cascade_node_style (cyclomatic 38) crates/obscura-render/src/dom.rs:2631— obscura_render::dom::cascade_node_style has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_render::css::animation_value_from_style (cyclomatic 37) crates/obscura-render/src/css.rs:4683— obscura_render::css::animation_value_from_style has cyclomatic complexity 37 (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: obscura_render::css::animated_properties_for_declaration (cyclomatic 48) 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.
obscura_render::style::parse_transform_ops (cyclomatic 35) crates/obscura-render/src/style.rs:3663— obscura_render::style::parse_transform_ops has cyclomatic complexity 35 (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: obscura_render::style::named_color (cyclomatic 105) 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.
obscura_render::style::parse_linear_gradient (cyclomatic 34) crates/obscura-render/src/style.rs:7856— obscura_render::style::parse_linear_gradient has cyclomatic complexity 34 (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: obscura_render::style::named_color (cyclomatic 105) 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.
obscura_render::css::note_compound_dependencies (cyclomatic 32) crates/obscura-render/src/css.rs:1119— obscura_render::css::note_compound_dependencies 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. This is NOT this file's highest cyclomatic complexity: obscura_render::css::animated_properties_for_declaration (cyclomatic 48) 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.
obscura_render::dom::layout_dom_with_web_fonts_pass_limit_and_query_seed (cyclomatic 32) crates/obscura-render/src/dom.rs:4817— obscura_render::dom::layout_dom_with_web_fonts_pass_limit_and_query_seed 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.
FunctionTooLong: obscura_render::dom::layout_dom_once crates/obscura-render/src/dom.rs:5203— FunctionTooLong — obscura_render::dom::layout_dom_once runs 1934 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 1834 over it, 19.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.
FunctionTooLong: obscura_render::style::apply_value crates/obscura-render/src/style.rs:834— FunctionTooLong — obscura_render::style::apply_value runs 824 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 724 over it, 8.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: obscura_js::ops::op_dom_inner crates/obscura-js/src/ops.rs:2138— FunctionTooLong — obscura_js::ops::op_dom_inner runs 796 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 696 over it, 7.96× 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: obscura_render::dom::build_children_with_float_zone crates/obscura-render/src/dom.rs:14860— FunctionTooLong — obscura_render::dom::build_children_with_float_zone runs 498 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 398 over it, 4.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: obscura_js::ops::fetch_url_inner crates/obscura-js/src/ops.rs:3914— FunctionTooLong — obscura_js::ops::fetch_url_inner runs 480 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 380 over it, 4.80× 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: obscura_cdp::domains::page::handle crates/obscura-cdp/src/domains/page.rs:1424— FunctionTooLong — obscura_cdp::domains::page::handle runs 442 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 342 over it, 4.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: obscura_render::dom::build crates/obscura-render/src/dom.rs:12960— FunctionTooLong — obscura_render::dom::build runs 408 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 308 over it, 4.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.
FunctionTooLong: obscura_render::dom::build_table crates/obscura-render/src/dom.rs:11683— FunctionTooLong — obscura_render::dom::build_table runs 293 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 193 over it, 2.93× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: obscura_render::dom::layout_dom_with_web_fonts_pass_limit_and_query_seed crates/obscura-render/src/dom.rs:4817— FunctionTooLong — obscura_render::dom::layout_dom_with_web_fonts_pass_limit_and_query_seed runs 280 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 180 over it, 2.80× 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: obscura_cdp::domains::target::handle crates/obscura-cdp/src/domains/target.rs:7— FunctionTooLong — obscura_cdp::domains::target::handle runs 230 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 130 over it, 2.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: obscura_render::style::ua_style crates/obscura-render/src/style.rs:26— FunctionTooLong — obscura_render::style::ua_style runs 222 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 122 over it, 2.22× 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: obscura_render::style::supports_declaration crates/obscura-render/src/style.rs:2036— FunctionTooLong — obscura_render::style::supports_declaration runs 213 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 113 over it, 2.13× 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: obscura_render::style::parse_color_for_scheme crates/obscura-render/src/style.rs:5038— FunctionTooLong — obscura_render::style::parse_color_for_scheme runs 213 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 113 over it, 2.13× 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: obscura_render::dom::build_mixed_block crates/obscura-render/src/dom.rs:13794— FunctionTooLong — obscura_render::dom::build_mixed_block runs 200 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 100 over it, 2.00× 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: obscura_cdp::server::start_with_serve_options_limit_and_ready_file crates/obscura-cdp/src/server.rs:328— FunctionTooLong — obscura_cdp::server::start_with_serve_options_limit_and_ready_file runs 198 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 98 over it, 1.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: obscura_render::dom::cascade_node_style crates/obscura-render/src/dom.rs:2631— FunctionTooLong — obscura_render::dom::cascade_node_style runs 198 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 98 over it, 1.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: obscura_cdp::server::process_with_interception crates/obscura-cdp/src/server.rs:1857— FunctionTooLong — obscura_cdp::server::process_with_interception runs 187 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 87 over it, 1.87× 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: obscura_render::css::note_compound_dependencies crates/obscura-render/src/css.rs:1119— FunctionTooLong — obscura_render::css::note_compound_dependencies runs 187 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 87 over it, 1.87× 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: obscura_js::ops::stealth_fetch_all crates/obscura-js/src/ops.rs:4620— FunctionTooLong — obscura_js::ops::stealth_fetch_all runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: obscura_render::css::denest crates/obscura-render/src/css.rs:7080— FunctionTooLong — obscura_render::css::denest runs 174 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 74 over it, 1.74× 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: obscura_cdp::domains::page::emit_navigation_events crates/obscura-cdp/src/domains/page.rs:881— FunctionTooLong — obscura_cdp::domains::page::emit_navigation_events runs 165 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 65 over it, 1.65× 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: obscura_cdp::server::cdp_processor crates/obscura-cdp/src/server.rs:1218— FunctionTooLong — obscura_cdp::server::cdp_processor runs 165 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 65 over it, 1.65× 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: obscura_render::dom::resolve_deferred_flex_inline_sizes crates/obscura-render/src/dom.rs:12686— FunctionTooLong — obscura_render::dom::resolve_deferred_flex_inline_sizes 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: obscura_js::ops::op_load_image_metadata crates/obscura-js/src/ops.rs:8560— FunctionTooLong — obscura_js::ops::op_load_image_metadata runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: obscura_render::style::supports_conservative_known_value crates/obscura-render/src/style.rs:3000— FunctionTooLong — obscura_render::style::supports_conservative_known_value runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Swallowed exception (empty catch) tools/live-view.mjs:36— 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) tools/live-view.mjs:44— 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) tools/live-view.mjs: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) tools/live-view.mjs:58— 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) tools/live-view.mjs:300— 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) render-repros/paired-corpus.py:1124— 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) REDACTED:108— 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) REDACTED:267— 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) REDACTED:287— 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) REDACTED:456— 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) REDACTED:459— 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) REDACTED:608— 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) REDACTED:624— 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) REDACTED:652— 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) REDACTED:664— 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) REDACTED:696— 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) REDACTED:704— 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) REDACTED:706— 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) REDACTED:949— 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) REDACTED:1278— 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) REDACTED:1318— 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) REDACTED:2200— 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) REDACTED:2242— 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) REDACTED:2287— 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) REDACTED:3848— `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
Hotspot: crates/obscura-render/src/dom.rs crates/obscura-render/src/dom.rs:5203— crates/obscura-render/src/dom.rs changed 116 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 391 in obscura_render::dom::layout_dom_once at line 5203. 31 of those changes were fix/bug commits, and the other 85 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-render/src/dom.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: crates/obscura-js/src/ops.rs crates/obscura-js/src/ops.rs:2138— crates/obscura-js/src/ops.rs changed 122 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 209 in obscura_js::ops::op_dom_inner at line 2138. 71 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-js/src/ops.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: crates/obscura-render/src/style.rs crates/obscura-render/src/style.rs:834— crates/obscura-render/src/style.rs changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 372 in obscura_render::style::apply_value at line 834. 12 of those changes were fix/bug commits, and the other 44 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-render/src/style.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: REDACTED REDACTED:9802— REDACTED changed 183 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in bootstrap.getComputedStyle at line 9802. 114 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/obscura-render/src/paint.rs crates/obscura-render/src/paint.rs:3939— crates/obscura-render/src/paint.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 167 in obscura_render::paint::paint_laid_dom_scrolled at line 3939. 26 of those changes were fix/bug commits, and the other 62 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-render/src/paint.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: crates/obscura-browser/src/page.rs crates/obscura-browser/src/page.rs:2243— crates/obscura-browser/src/page.rs changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in Page::execute_scripts_with_module_budget at line 2243. 55 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-browser/src/page.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: crates/obscura-js/src/runtime.rs crates/obscura-js/src/runtime.rs:3843— crates/obscura-js/src/runtime.rs changed 219 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ObscuraJsRuntime::run_event_loop_until_quiescent at line 3843. 131 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-js/src/runtime.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: crates/obscura-render/src/lib.rs crates/obscura-render/src/lib.rs:2535— crates/obscura-render/src/lib.rs changed 69 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in obscura_render::to_taffy_style at line 2535. 15 of those changes were fix/bug commits, and the other 54 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-render/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: crates/obscura-render/src/css.rs crates/obscura-render/src/css.rs:3626— crates/obscura-render/src/css.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in Stylesheet::apply_internal at line 3626. 2 of those changes were fix/bug commits, and the other 30 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-render/src/css.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: crates/obscura-cdp/src/domains/page.rs crates/obscura-cdp/src/domains/page.rs:1424— crates/obscura-cdp/src/domains/page.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in obscura_cdp::domains::page::handle at line 1424. 15 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/domains/page.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: crates/obscura-render/src/inline.rs crates/obscura-render/src/inline.rs:3681— crates/obscura-render/src/inline.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in TextEngine::paint_item_with_clip_mask_scaled_for_print at line 3681. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-render/src/inline.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: render-repros/paired-corpus.py render-repros/paired-corpus.py:2245— render-repros/paired-corpus.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in paired-corpus.main at line 2245. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- render-repros/paired-corpus.py`: 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: crates/obscura-cdp/src/server.rs crates/obscura-cdp/src/server.rs:1857— crates/obscura-cdp/src/server.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in obscura_cdp::server::process_with_interception at line 1857. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/server.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: crates/obscura-cli/src/main.rs crates/obscura-cli/src/main.rs:1164— crates/obscura-cli/src/main.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in obscura_cli::run_fetch at line 1164. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cli/src/main.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: crates/obscura-mcp/src/lib.rs crates/obscura-mcp/src/lib.rs:773— crates/obscura-mcp/src/lib.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in obscura_mcp::handle_tool_call at line 773. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-mcp/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: crates/obscura-net/src/client.rs crates/obscura-net/src/client.rs:1394— crates/obscura-net/src/client.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ObscuraHttpClient::fetch_with_profile_uncached at line 1394. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-net/src/client.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: crates/obscura-cdp/src/dispatch.rs crates/obscura-cdp/src/dispatch.rs:743— crates/obscura-cdp/src/dispatch.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in obscura_cdp::dispatch::dispatch_with_deferred at line 743. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-27 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/dispatch.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: crates/obscura-cdp/src/domains/dom.rs crates/obscura-cdp/src/domains/dom.rs:165— crates/obscura-cdp/src/domains/dom.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in obscura_cdp::domains::dom::handle at line 165. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/domains/dom.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: crates/obscura-cdp/src/domains/runtime.rs crates/obscura-cdp/src/domains/runtime.rs:225— crates/obscura-cdp/src/domains/runtime.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in obscura_cdp::domains::runtime::handle at line 225. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/domains/runtime.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: crates/obscura-cdp/src/domains/input.rs crates/obscura-cdp/src/domains/input.rs:140— crates/obscura-cdp/src/domains/input.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in obscura_cdp::domains::input::handle at line 140. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/domains/input.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: crates/obscura-cdp/src/domains/target.rs crates/obscura-cdp/src/domains/target.rs:7— crates/obscura-cdp/src/domains/target.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in obscura_cdp::domains::target::handle at line 7. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/domains/target.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: crates/obscura-net/src/wreq_client.rs crates/obscura-net/src/wreq_client.rs:317— crates/obscura-net/src/wreq_client.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in StealthHttpClient::fetch_with_profile at line 317. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-net/src/wreq_client.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: crates/obscura-dom/src/tree.rs crates/obscura-dom/src/tree.rs:1063— crates/obscura-dom/src/tree.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in DomTree::detach_for_reparent at line 1063. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-dom/src/tree.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: crates/obscura-net/src/cookies.rs crates/obscura-net/src/cookies.rs:404— crates/obscura-net/src/cookies.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CookieJar::set_cookie_from_js at line 404. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-net/src/cookies.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: crates/obscura-cdp/src/domains/emulation.rs crates/obscura-cdp/src/domains/emulation.rs:61— crates/obscura-cdp/src/domains/emulation.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in obscura_cdp::domains::emulation::handle at line 61. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/domains/emulation.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.
obscura_cdp::domains::page::handle (cognitive 117) crates/obscura-cdp/src/domains/page.rs:1424— obscura_cdp::domains::page::handle has cognitive complexity 117 (threshold 15). Drivers by points: if/else 45 (97 pts), loops 2 (8 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 61). 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.
obscura_cdp::server::process_with_interception (cognitive 108) crates/obscura-cdp/src/server.rs:1857— obscura_cdp::server::process_with_interception has cognitive complexity 108 (threshold 15). Drivers by points: if/else 36 (84 pts), boolean chains 11, match/switch 7 (11 pts), loops 2 (nesting depth added 52). 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.
obscura_cdp::domains::dom::handle (cognitive 78) crates/obscura-cdp/src/domains/dom.rs:165— obscura_cdp::domains::dom::handle has cognitive complexity 78 (threshold 15). Drivers by points: if/else 28 (57 pts), match/switch 6 (12 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 38). 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.
obscura_cdp::domains::runtime::handle (cognitive 75) crates/obscura-cdp/src/domains/runtime.rs:225— obscura_cdp::domains::runtime::handle has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (65 pts), match/switch 4 (10 pts) (nesting depth added 46). 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.
obscura_cdp::server::start_with_serve_options_limit_and_ready_file (cognitive 66) crates/obscura-cdp/src/server.rs:328— obscura_cdp::server::start_with_serve_options_limit_and_ready_file has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 8 (20 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cdp::domains::input::handle (cognitive 60) crates/obscura-cdp/src/domains/input.rs:140— obscura_cdp::domains::input::handle has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (54 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 36). 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.
obscura_cdp::server::cdp_processor (cognitive 58) crates/obscura-cdp/src/server.rs:1218— obscura_cdp::server::cdp_processor has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (34 pts), match/switch 6 (19 pts), loops 2 (3 pts), boolean chains 2 (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.
obscura_cdp::domains::target::handle (cognitive 44) crates/obscura-cdp/src/domains/target.rs:7— obscura_cdp::domains::target::handle has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 5 (12 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
obscura_cdp::domains::page::emit_navigation_events (cognitive 40) crates/obscura-cdp/src/domains/page.rs:881— obscura_cdp::domains::page::emit_navigation_events has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 5 (7 pts), boolean chains 6 (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.
obscura_cdp::server::handle_fetch_resolution (cognitive 39) crates/obscura-cdp/src/server.rs:1761— obscura_cdp::server::handle_fetch_resolution has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 4 (14 pts), loops 1 (5 pts), boolean chains 2 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
obscura_cdp::dispatch::drain_frame_events (cognitive 30) crates/obscura-cdp/src/dispatch.rs:1079— obscura_cdp::dispatch::drain_frame_events has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (19 pts), if/else 4 (11 pts) (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.
obscura_cdp::domains::emulation::handle (cognitive 29) crates/obscura-cdp/src/domains/emulation.rs:61— obscura_cdp::domains::emulation::handle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (2 pts) (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.
obscura_cdp::domains::network::handle (cognitive 29) crates/obscura-cdp/src/domains/network.rs:27— obscura_cdp::domains::network::handle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (6 pts), match/switch 2 (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.
obscura_cdp::dispatch::drain_runtime_events (cognitive 28) crates/obscura-cdp/src/dispatch.rs:903— obscura_cdp::dispatch::drain_runtime_events has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (9 pts), match/switch 1 (4 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.
obscura_cdp::server::handle_connection_ws (cognitive 27) crates/obscura-cdp/src/server.rs:2299— obscura_cdp::server::handle_connection_ws has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cdp::domains::pdf::parse_page_ranges (cognitive 26) crates/obscura-cdp/src/domains/pdf.rs:57— obscura_cdp::domains::pdf::parse_page_ranges has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (6 pts), loops 2, 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.
obscura_cdp::dispatch::dispatch_with_deferred (cognitive 22) crates/obscura-cdp/src/dispatch.rs:743— obscura_cdp::dispatch::dispatch_with_deferred has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (7 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cdp::domains::dom::serialize_node (cognitive 19) crates/obscura-cdp/src/domains/dom.rs:614— obscura_cdp::domains::dom::serialize_node has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 8). 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.
obscura_cdp::dispatch::drain_binding_calls (cognitive 18) crates/obscura-cdp/src/dispatch.rs:1002— obscura_cdp::dispatch::drain_binding_calls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 6 (9 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.
obscura_cdp::domains::page::encode_long_full_page_png (cognitive 18) crates/obscura-cdp/src/domains/page.rs:408— obscura_cdp::domains::page::encode_long_full_page_png has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cdp::domains::domsnapshot::build_capture_snapshot (cognitive 17) crates/obscura-cdp/src/domains/domsnapshot.rs:116— obscura_cdp::domains::domsnapshot::build_capture_snapshot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cdp::domains::fetch::handle (cognitive 16) crates/obscura-cdp/src/domains/fetch.rs:56— obscura_cdp::domains::fetch::handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (2 pts), 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.
obscura_cdp::domains::page::pump_screencast_frames (cognitive 16) crates/obscura-cdp/src/domains/page.rs:796— obscura_cdp::domains::page::pump_screencast_frames has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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.
FileTooLong: REDACTED REDACTED— FileTooLong — 13762 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13262 over it, 27.52× 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/dom.rs crates/obscura-render/src/dom.rs— FileTooLong — 10519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 175 free functions. The bar is 500 significant lines; this is 10019 over it, 21.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/paint.rs crates/obscura-render/src/paint.rs— FileTooLong — 8700 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 197 free functions. The bar is 500 significant lines; this is 8200 over it, 17.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: src/style.rs crates/obscura-render/src/style.rs— FileTooLong — 5989 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 212 free functions. The bar is 500 significant lines; this is 5489 over it, 11.98× 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/ops.rs crates/obscura-js/src/ops.rs— FileTooLong — 5513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 188 free functions. The bar is 500 significant lines; this is 5013 over it, 11.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/css.rs crates/obscura-render/src/css.rs— FileTooLong — 5321 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 121 free functions. The bar is 500 significant lines; this is 4821 over it, 10.64× 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/page.rs crates/obscura-browser/src/page.rs— FileTooLong — 3280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 41 free functions. The bar is 500 significant lines; this is 2780 over it, 6.56× 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/runtime.rs crates/obscura-js/src/runtime.rs— FileTooLong — 2881 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 2381 over it, 5.76× 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/inline.rs crates/obscura-render/src/inline.rs— FileTooLong — 2880 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 52 free functions. The bar is 500 significant lines; this is 2380 over it, 5.76× 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: render-repros/paired-corpus.py render-repros/paired-corpus.py— FileTooLong — 2195 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1695 over it, 4.39× 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 crates/obscura-mcp/src/lib.rs— FileTooLong — 1591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 59 free functions. The bar is 500 significant lines; this is 1091 over it, 3.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/main.rs crates/obscura-cli/src/main.rs— FileTooLong — 1561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 42 free functions. The bar is 500 significant lines; this is 1061 over it, 3.12× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/lib.rs crates/obscura-render/src/lib.rs— FileTooLong — 1545 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 1045 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: domains/page.rs crates/obscura-cdp/src/domains/page.rs— FileTooLong — 1461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 37 free functions. The bar is 500 significant lines; this is 961 over it, 2.92× 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/server.rs crates/obscura-cdp/src/server.rs— FileTooLong — 1461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 52 free functions. The bar is 500 significant lines; this is 961 over it, 2.92× 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/tree.rs crates/obscura-dom/src/tree.rs— FileTooLong — 1164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 83% of them inside a single declaration: DomTree (3 blocks, 248-1945). The bar is 500 significant lines; this is 664 over it, 2.33× 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/client.rs crates/obscura-net/src/client.rs— FileTooLong — 1139 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 639 over it, 2.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/selector.rs crates/obscura-dom/src/selector.rs— FileTooLong — 764 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 264 over it, 1.53× 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/dispatch.rs crates/obscura-cdp/src/dispatch.rs— FileTooLong — 674 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 174 over it, 1.35× 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: js/indexed_db.js crates/obscura-js/js/indexed_db.js— FileTooLong — 662 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 162 over it, 1.32× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/cookies.rs crates/obscura-net/src/cookies.rs— FileTooLong — 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 69% of them inside a single declaration: CookieJar (3 blocks, 27-628). The bar is 500 significant lines; this is 44 over it, 1.09× 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.
AC3 · Page structure· Page without a main landmark · ×19
Page without a main landmark render-repros/abs-fill.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/absolute-containing-block.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/absolute-static-position.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/animation-fill-forwards.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div id="content">, so there is no content here to wrap — render the <main> from the component mounted into it.
Page without a main landmark render-repros/background-shorthand-reset.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/block-auto-margins.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/block-whitespace-margin-collapse.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div>, so there is no content here to wrap — render the <main> from the component mounted into it.
Page without a main landmark render-repros/box-shadow-outset.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/box-sizing.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/carousel-clip.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/cascade-priority.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/clear-float.html:1— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/contextual-css-math.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/contextual-grid-gap.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/display-contents-cascade.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/eventtarget-lifecycle.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/flex-whitespace-items.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/float-flow-bands.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark render-repros/font-metric-line-height.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
obscura_cdp::domains::page::handle (cyclomatic 74) crates/obscura-cdp/src/domains/page.rs:1424— obscura_cdp::domains::page::handle has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_cdp::domains::dom::handle (cyclomatic 53) crates/obscura-cdp/src/domains/dom.rs:165— obscura_cdp::domains::dom::handle has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_cdp::server::process_with_interception (cyclomatic 48) crates/obscura-cdp/src/server.rs:1857— obscura_cdp::server::process_with_interception has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_cdp::domains::runtime::handle (cyclomatic 45) crates/obscura-cdp/src/domains/runtime.rs:225— obscura_cdp::domains::runtime::handle 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.
obscura_cdp::server::start_with_serve_options_limit_and_ready_file (cyclomatic 36) crates/obscura-cdp/src/server.rs:328— obscura_cdp::server::start_with_serve_options_limit_and_ready_file 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.
obscura_cdp::dispatch::dispatch_with_deferred (cyclomatic 34) crates/obscura-cdp/src/dispatch.rs:743— obscura_cdp::dispatch::dispatch_with_deferred has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
obscura_cdp::domains::target::handle (cyclomatic 33) crates/obscura-cdp/src/domains/target.rs:7— obscura_cdp::domains::target::handle has cyclomatic complexity 33 (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.
obscura_cdp::domains::input::handle (cyclomatic 29) crates/obscura-cdp/src/domains/input.rs:140— obscura_cdp::domains::input::handle 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.
obscura_cdp::domains::page::emit_navigation_events (cyclomatic 27) crates/obscura-cdp/src/domains/page.rs:881— obscura_cdp::domains::page::emit_navigation_events 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.
obscura_cdp::domains::network::handle (cyclomatic 25) crates/obscura-cdp/src/domains/network.rs:27— obscura_cdp::domains::network::handle 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.
obscura_cdp::server::cdp_processor (cyclomatic 25) crates/obscura-cdp/src/server.rs:1218— obscura_cdp::server::cdp_processor 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.
obscura_cdp::domains::emulation::handle (cyclomatic 21) crates/obscura-cdp/src/domains/emulation.rs:61— obscura_cdp::domains::emulation::handle 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.
obscura_cdp::server::host_matches_bind (cyclomatic 18) crates/obscura-cdp/src/server.rs:104— obscura_cdp::server::host_matches_bind has cyclomatic complexity 18 (threshold 15). 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 (host_matches_ip). 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.
obscura_cdp::domains::page::parse_screenshot_options (cyclomatic 16) crates/obscura-cdp/src/domains/page.rs:201— obscura_cdp::domains::page::parse_screenshot_options 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.
obscura_cdp::domains::pdf::parse_page_ranges (cyclomatic 16) crates/obscura-cdp/src/domains/pdf.rs:57— obscura_cdp::domains::pdf::parse_page_ranges 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.
obscura_cdp::server::handle_fetch_resolution (cyclomatic 16) crates/obscura-cdp/src/server.rs:1761— obscura_cdp::server::handle_fetch_resolution 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.
Duplicated block (10 lines × 2) crates/obscura-js/src/ops.rs:2764— crates/obscura-js/src/ops.rs:2764-2773 | crates/obscura-js/src/ops.rs:2794-2803 — both copies are in the same file, so extract the block into 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) crates/obscura-mcp/src/lib.rs:1298— crates/obscura-mcp/src/lib.rs:1298-1307 | crates/obscura-mcp/src/lib.rs:1623-1632 — both copies are in the same file, so extract the block into 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) crates/obscura-net/src/client.rs:1631— crates/obscura-net/src/client.rs:1631-1640 | crates/obscura-net/src/wreq_client.rs:442-451 — 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) crates/obscura-render/src/css.rs:1743— crates/obscura-render/src/css.rs:1743-1752 | crates/obscura-render/src/css.rs:2604-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 (10 lines × 2) crates/obscura-render/src/css.rs:5192— crates/obscura-render/src/css.rs:5192-5201 | crates/obscura-render/src/inline.rs:3550-3559 — 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) crates/obscura-render/src/dom.rs:5901— crates/obscura-render/src/dom.rs:5901-5910 | crates/obscura-render/src/dom.rs:6310-6319 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:9491— crates/obscura-render/src/dom.rs:9491-9500 | crates/obscura-render/src/dom.rs:9522-9531 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:12789— crates/obscura-render/src/dom.rs:12789-12798 | crates/obscura-render/src/dom.rs:12910-12919 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/inline.rs:3188— crates/obscura-render/src/inline.rs:3188-3197 | crates/obscura-render/src/inline.rs:3216-3225 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:549— crates/obscura-render/src/paint.rs:549-558 | crates/obscura-render/src/paint.rs:580-589 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:3676— crates/obscura-render/src/paint.rs:3676-3685 | crates/obscura-render/src/paint.rs:3714-3723 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:9363— crates/obscura-render/src/paint.rs:9363-9372 | crates/obscura-render/src/paint.rs:9605-9614 — both copies are in the same file, so extract the block into 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) crates/obscura-browser/src/page.rs:79— crates/obscura-browser/src/page.rs:79-88 | crates/obscura-cdp/src/util.rs:54-63 — 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) crates/obscura-dom/src/serialize.rs:179— crates/obscura-dom/src/serialize.rs:179-188 | crates/obscura-render/src/paint.rs:11533-11542 — 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) render-repros/capture_chromium.py:18— render-repros/capture_chromium.py:18-27 | render-repros/probe_long_full_page_chromium.py:26-35 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `render-repros/capture_chromium.py:18` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) crates/obscura-cdp/src/dispatch.rs:907— crates/obscura-cdp/src/dispatch.rs:907-915 | crates/obscura-cdp/src/dispatch.rs:1006-1018 — both copies are in the same file, so extract the block into 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) crates/obscura-dom/src/selector.rs:748— crates/obscura-dom/src/selector.rs:748-756 | crates/obscura-dom/src/selector.rs:794-802 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:1853— crates/obscura-js/src/ops.rs:1853-1861 | crates/obscura-js/src/ops.rs:1870-1878 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:3125— crates/obscura-js/src/ops.rs:3125-3133 | crates/obscura-js/src/ops.rs:3136-3144 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/css.rs:3174— crates/obscura-render/src/css.rs:3174-3182 | crates/obscura-render/src/css.rs:3187-3195 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:12513— crates/obscura-render/src/dom.rs:12513-12521 | crates/obscura-render/src/dom.rs:14113-14121 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/inline.rs:3376— crates/obscura-render/src/inline.rs:3376-3384 | crates/obscura-render/src/lib.rs:325-333 — before extracting anything, compare `crates/obscura-render/src/inline.rs` and `crates/obscura-render/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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) crates/obscura-render/src/inline.rs:3739— crates/obscura-render/src/inline.rs:3739-3747 | crates/obscura-render/src/inline.rs:3851-3859 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:7701— crates/obscura-render/src/paint.rs:7701-7709 | crates/obscura-render/src/paint.rs:7725-7733 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/style.rs:1663— crates/obscura-render/src/style.rs:1663-1671 | crates/obscura-render/src/style.rs:1678-1686 — both copies are in the same file, so extract the block into 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) crates/obscura-cdp/src/server.rs:76— crates/obscura-cdp/src/server.rs:76-84 | crates/obscura-mcp/src/http.rs:70-78 — 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) crates/obscura-js/src/ops.rs:2911— crates/obscura-js/src/ops.rs:2911-2919 | crates/obscura-js/src/ops.rs:2931-2942 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:4493— crates/obscura-js/src/runtime.rs:4493-4501 | crates/obscura-js/src/runtime.rs:4503-4511 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/css.rs:6938— crates/obscura-render/src/css.rs:6938-6946 | crates/obscura-render/src/css.rs:6948-6956 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/css.rs:6989— crates/obscura-render/src/css.rs:6989-6997 | crates/obscura-render/src/css.rs:6999-7007 — both copies are in the same file, so extract the block into 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) crates/obscura-cdp/src/domains/runtime.rs:301— crates/obscura-cdp/src/domains/runtime.rs:301-307 | crates/obscura-cdp/src/domains/runtime.rs:360-366 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:2194— crates/obscura-js/src/ops.rs:2194-2200 | crates/obscura-js/src/ops.rs:2202-2208 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:9249— crates/obscura-js/src/ops.rs:9249-9255 | crates/obscura-js/src/ops.rs:9286-9292 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:1450— crates/obscura-js/src/runtime.rs:1450-1456 | crates/obscura-js/src/runtime.rs:2974-2980 — both copies are in the same file, so extract the block into 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) crates/obscura-mcp/src/lib.rs:1099— crates/obscura-mcp/src/lib.rs:1099-1105 | crates/obscura-mcp/src/lib.rs:1125-1131 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/css.rs:831— crates/obscura-render/src/css.rs:831-837 | crates/obscura-render/src/css.rs:929-935 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:3113— crates/obscura-render/src/dom.rs:3113-3119 | crates/obscura-render/src/dom.rs:3123-3129 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:5966— crates/obscura-render/src/dom.rs:5966-5972 | crates/obscura-render/src/dom.rs:5976-5982 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:14656— crates/obscura-render/src/dom.rs:14656-14662 | crates/obscura-render/src/dom.rs:14710-14716 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:476— crates/obscura-render/src/paint.rs:476-482 | crates/obscura-render/src/paint.rs:510-516 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/obscura-render/src/paint.rs:8253— crates/obscura-render/src/paint.rs:8253-8259 | crates/obscura-render/src/paint.rs:8308-8314 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/style.rs:7612— crates/obscura-render/src/style.rs:7612-7618 | crates/obscura-render/src/style.rs:7667-7673 — both copies are in the same file, so extract the block into 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) crates/obscura-ssrf/src/lib.rs:96— crates/obscura-ssrf/src/lib.rs:96-102 | crates/obscura-ssrf/src/lib.rs:105-111 — both copies are in the same file, so extract the block into 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) crates/obscura-cdp/src/domains/page.rs:179— crates/obscura-cdp/src/domains/page.rs:179-185 | crates/obscura-cdp/src/domains/pdf.rs:48-54 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) crates/obscura-browser/src/page.rs:2564— crates/obscura-browser/src/page.rs:2564-2570 | crates/obscura-browser/src/page.rs:3463-3469 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
obscura_js::ops::op_dom_inner (cognitive 223) crates/obscura-js/src/ops.rs:2138— obscura_js::ops::op_dom_inner has cognitive complexity 223 (threshold 15). Drivers by points: if/else 64 (127 pts), match/switch 30 (57 pts), loops 12 (27 pts), boolean chains 12 (nesting depth added 105). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_js::ops::fetch_url_inner (cognitive 139) crates/obscura-js/src/ops.rs:3914— obscura_js::ops::fetch_url_inner has cognitive complexity 139 (threshold 15). Drivers by points: if/else 54 (109 pts), match/switch 7 (12 pts), boolean chains 9, loops 4 (9 pts) (nesting depth added 65). 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.
obscura_js::ops::render_mutation_impact (cognitive 47) crates/obscura-js/src/ops.rs:1332— obscura_js::ops::render_mutation_impact has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 5 (12 pts), boolean chains 7 (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.
obscura_js::ops::stealth_fetch_all (cognitive 41) crates/obscura-js/src/ops.rs:4620— obscura_js::ops::stealth_fetch_all has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 4, match/switch 2 (4 pts), 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.
obscura_js::ops::set_host_port (cognitive 27) crates/obscura-js/src/ops.rs:7468— obscura_js::ops::set_host_port has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
obscura_js::ops::op_load_image_metadata (cognitive 27) crates/obscura-js/src/ops.rs:8560— obscura_js::ops::op_load_image_metadata has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, match/switch 3 (4 pts), 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.
obscura_js::ops::url_matches_cdp_pattern (cognitive 20) crates/obscura-js/src/ops.rs:3796— obscura_js::ops::url_matches_cdp_pattern has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_js::ops::op_computed_style (cognitive 20) crates/obscura-js/src/ops.rs:9089— obscura_js::ops::op_computed_style has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_js::ops::url_set_inner (cognitive 18) crates/obscura-js/src/ops.rs:7395— obscura_js::ops::url_set_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
obscura_js::ops::validate_fetch_url (cognitive 17) crates/obscura-js/src/ops.rs:6226— obscura_js::ops::validate_fetch_url has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (2 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.
obscura_js::ops::op_initial_frame (cognitive 16) crates/obscura-js/src/ops.rs:6706— obscura_js::ops::op_initial_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
obscura_js::ops::ensure_prepared_render_with_base_url (cognitive 16) crates/obscura-js/src/ops.rs:8124— obscura_js::ops::ensure_prepared_render_with_base_url has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (5 pts), boolean chains 4 (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) crates/obscura-browser/src/page.rs:2412— crates/obscura-browser/src/page.rs:2412-2419 | crates/obscura-browser/src/page.rs:2761-2768 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:3666— crates/obscura-js/src/runtime.rs:3666-3673 | crates/obscura-js/src/runtime.rs:3956-3963 — both copies are in the same file, so extract the block into 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) crates/obscura-net/src/cookies.rs:83— crates/obscura-net/src/cookies.rs:83-90 | crates/obscura-net/src/cookies.rs:408-415 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:1789— crates/obscura-render/src/dom.rs:1789-1796 | crates/obscura-render/src/dom.rs:7984-7991 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:3739— crates/obscura-render/src/dom.rs:3739-3746 | crates/obscura-render/src/dom.rs:3791-3798 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:4010— crates/obscura-render/src/dom.rs:4010-4017 | crates/obscura-render/src/dom.rs:4046-4053 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:6650— crates/obscura-render/src/dom.rs:6650-6658 | crates/obscura-render/src/dom.rs:6698-6705 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/lib.rs:2795— crates/obscura-render/src/lib.rs:2795-2802 | crates/obscura-render/src/lib.rs:2811-2818 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:8271— crates/obscura-render/src/paint.rs:8271-8278 | crates/obscura-render/src/paint.rs:8407-8414 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:9534— crates/obscura-render/src/paint.rs:9534-9541 | crates/obscura-render/src/paint.rs:10861-10868 — both copies are in the same file, so extract the block into 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) crates/obscura-browser/src/page.rs:865— crates/obscura-browser/src/page.rs:865-872 | crates/obscura-render/src/paint.rs:7808-7815 — before extracting anything, compare `crates/obscura-browser/src/page.rs` and `crates/obscura-render/src/paint.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) crates/obscura-mcp/src/lib.rs:1059— crates/obscura-mcp/src/lib.rs:1059-1071 | crates/obscura-mcp/src/lib.rs:1807-1814 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
obscura_browser::page::rebase_css_urls (cognitive 59) crates/obscura-browser/src/page.rs:489— obscura_browser::page::rebase_css_urls has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 4 (9 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_browser::accessibility::compute_properties (cognitive 44) crates/obscura-browser/src/accessibility.rs:628— obscura_browser::accessibility::compute_properties has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_browser::page::css_resource_urls (cognitive 41) crates/obscura-browser/src/page.rs:600— obscura_browser::page::css_resource_urls has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (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.
obscura_browser::accessibility::content_name (cognitive 24) crates/obscura-browser/src/accessibility.rs:428— obscura_browser::accessibility::content_name has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, 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.
obscura_browser::accessibility::map_role (cognitive 20) crates/obscura-browser/src/accessibility.rs:128— obscura_browser::accessibility::map_role has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (9 pts), boolean chains 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.
obscura_browser::accessibility::compute_name (cognitive 20) crates/obscura-browser/src/accessibility.rs:487— obscura_browser::accessibility::compute_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (20 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.
obscura_browser::page::css_import_rule_len (cognitive 19) crates/obscura-browser/src/page.rs:878— obscura_browser::page::css_import_rule_len has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_browser::pdf::selected_page_indices (cognitive 18) crates/obscura-browser/src/pdf.rs:232— obscura_browser::pdf::selected_page_indices has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), 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.
obscura_browser::context::load_web_storage (cognitive 17) crates/obscura-browser/src/context.rs:78— obscura_browser::context::load_web_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_browser::page::css_last_declaration (cognitive 17) crates/obscura-browser/src/page.rs:791— obscura_browser::page::css_last_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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.
obscura_browser::accessibility::build_ax_nodes_with_styles (cognitive 16) crates/obscura-browser/src/accessibility.rs:36— obscura_browser::accessibility::build_ax_nodes_with_styles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4, 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 (5 lines × 2) crates/obscura-cdp/src/domains/dom.rs:303— crates/obscura-cdp/src/domains/dom.rs:303-307 | crates/obscura-cdp/src/domains/dom.rs:331-335 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:8233— crates/obscura-js/src/ops.rs:8233-8237 | crates/obscura-js/src/ops.rs:8275-8280 — both copies are in the same file, so extract the block into 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) crates/obscura-mcp/src/lib.rs:1516— crates/obscura-mcp/src/lib.rs:1516-1520 | crates/obscura-mcp/src/lib.rs:1534-1538 — both copies are in the same file, so extract the block into 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) crates/obscura-net/src/client.rs:1598— crates/obscura-net/src/client.rs:1598-1602 | crates/obscura-net/src/wreq_client.rs:561-565 — 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) crates/obscura-render/src/css.rs:851— crates/obscura-render/src/css.rs:851-858 | crates/obscura-render/src/css.rs:1156-1160 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/css.rs:4387— crates/obscura-render/src/css.rs:4387-4391 | crates/obscura-render/src/css.rs:4671-4675 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/style.rs:3537— crates/obscura-render/src/style.rs:3537-3541 | crates/obscura-render/src/style.rs:3580-3584 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:3055— crates/obscura-js/src/runtime.rs:3055-3059 | crates/obscura-js/src/runtime.rs:3201-3206 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:3777— crates/obscura-render/src/dom.rs:3777-3781 | crates/obscura-render/src/dom.rs:3802-3806 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/style.rs:3775— crates/obscura-render/src/style.rs:3775-3779 | crates/obscura-render/src/style.rs:3792-3796 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:1372— crates/obscura-render/src/paint.rs:1372-1376 | crates/obscura-render/src/paint.rs:5855-5859 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
TooManyMethods: ObscuraJsRuntime crates/obscura-js/src/runtime.rs:258— TooManyMethods — 186 methods. The bar is 30 methods; this is 156 over it, 6.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Page crates/obscura-browser/src/page.rs:239— TooManyMethods — 130 methods, declared across 3 files: src/page.rs (126), src/pdf.rs (3), src/fork_virtual_url.rs (1). The bar is 30 methods; this is 100 over it, 4.33× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DomTree crates/obscura-dom/src/tree.rs:248— TooManyMethods — 92 methods, declared across 3 files: src/tree.rs (78), src/selector.rs (9), src/serialize.rs (5). The bar is 30 methods; this is 62 over it, 3.07× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Element REDACTED:4053— TooManyMethods — 77 methods. The bar is 30 methods; this is 47 over it, 2.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: _Canvas2D REDACTED:15721— TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PreparedRender crates/obscura-render/src/paint.rs:1038— 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: RenderResourceCache crates/obscura-render/src/paint.rs:163— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TextEngine crates/obscura-render/src/inline.rs:873— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CdpContext crates/obscura-cdp/src/dispatch.rs:51— 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: Document REDACTED:6251— 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.
MethodTooLong: Stylesheet.apply_internal crates/obscura-render/src/css.rs:3626— MethodTooLong — apply_internal runs 390 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 290 over it, 3.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Stylesheet.parse_for_viewport_and_media_at_animation_time crates/obscura-render/src/css.rs:2757— MethodTooLong — parse_for_viewport_and_media_at_animation_time runs 230 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 130 over it, 2.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DomLayout.scroll_tree crates/obscura-render/src/dom.rs:1184— MethodTooLong — scroll_tree runs 211 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 111 over it, 2.11× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ObscuraHttpClient.fetch_with_profile_uncached crates/obscura-net/src/client.rs:1394— MethodTooLong — fetch_with_profile_uncached runs 193 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 93 over it, 1.93× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DomLayout.sticky_layout_with_geometry crates/obscura-render/src/dom.rs:1520— MethodTooLong — sticky_layout_with_geometry 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: Stylesheet.pseudo_styles_internal crates/obscura-render/src/css.rs:3068— MethodTooLong — pseudo_styles_internal runs 161 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 61 over it, 1.61× 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: Inner.command crates/obscura-js/src/indexed_db.rs:110— MethodTooLong — command runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ObscuraModuleLoader.load crates/obscura-js/src/module_loader.rs:191— MethodTooLong — load 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: ObscuraState.new crates/obscura-js/src/ops.rs:630— MethodTooLong — new runs 114 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 14 over it, 1.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: StealthHttpClient.fetch_with_profile crates/obscura-net/src/wreq_client.rs:317— MethodTooLong — fetch_with_profile runs 114 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 14 over it, 1.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.
Duplicated block (11 lines × 2) crates/obscura-dom/src/selector.rs:370— crates/obscura-dom/src/selector.rs:370-380 | crates/obscura-dom/src/selector.rs:384-394 — both copies are in the same file, so extract the block into 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) crates/obscura-dom/src/tree.rs:555— crates/obscura-dom/src/tree.rs:555-565 | crates/obscura-dom/src/tree.rs:590-600 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:8431— crates/obscura-js/src/ops.rs:8431-8441 | crates/obscura-render/src/paint.rs:112-122 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) crates/obscura-render/src/dom.rs:713— crates/obscura-render/src/dom.rs:713-723 | crates/obscura-render/src/dom.rs:824-834 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:10955— crates/obscura-render/src/dom.rs:10955-10965 | crates/obscura-render/src/dom.rs:11042-11052 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/inline.rs:1886— crates/obscura-render/src/inline.rs:1886-1896 | crates/obscura-render/src/inline.rs:2987-2997 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:407— crates/obscura-render/src/paint.rs:407-417 | crates/obscura-render/src/paint.rs:431-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 (11 lines × 2) crates/obscura-render/src/style.rs:3781— crates/obscura-render/src/style.rs:3781-3791 | crates/obscura-render/src/style.rs:3809-3819 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:3994— crates/obscura-render/src/dom.rs:3994-4004 | crates/obscura-render/src/dom.rs:4032-4042 — both copies are in the same file, so extract the block into 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) crates/obscura-browser/src/page.rs:4413— crates/obscura-browser/src/page.rs:4413-4423 | crates/obscura-browser/src/page.rs:4498-4508 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:877— crates/obscura-js/src/runtime.rs:877-882 | crates/obscura-js/src/runtime.rs:1093-1098 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/style.rs:5078— crates/obscura-render/src/style.rs:5078-5083 | crates/obscura-render/src/style.rs:5113-5118 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/style.rs:6573— crates/obscura-render/src/style.rs:6573-6578 | crates/obscura-render/src/style.rs:6797-6802 — both copies are in the same file, so extract the block into 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) crates/obscura-browser/src/page.rs:11007— crates/obscura-browser/src/page.rs:11007-11012 | crates/obscura-js/src/ops.rs:872-877 — 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) crates/obscura-browser/src/page.rs:11014— crates/obscura-browser/src/page.rs:11014-11019 | crates/obscura-js/src/ops.rs:879-884 — 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) crates/obscura-browser/src/page.rs:3616— crates/obscura-browser/src/page.rs:3616-3621 | crates/obscura-browser/src/page.rs:3636-3647 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:2693— crates/obscura-js/src/runtime.rs:2693-2699 | crates/obscura-js/src/runtime.rs:2788-2793 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:2526— crates/obscura-js/src/ops.rs:2526-2531 | crates/obscura-js/src/ops.rs:2543-2548 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:5911— crates/obscura-render/src/dom.rs:5911-5916 | crates/obscura-render/src/dom.rs:6322-6327 — both copies are in the same file, so extract the block into 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) scripts/ci/compare_obstacle.py:49— scripts/ci/compare_obstacle.py:49-54 | scripts/ci/perf_smoke.py:138-143 — 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.
Page::execute_scripts_with_module_budget (cognitive 203) crates/obscura-browser/src/page.rs:2243— Page::execute_scripts_with_module_budget has cognitive complexity 203 (threshold 15). Drivers by points: if/else 68 (162 pts), match/switch 12 (23 pts), loops 7 (10 pts), boolean chains 8 (nesting depth added 108). 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.
Page::fetch_stylesheets (cognitive 64) crates/obscura-browser/src/page.rs:1932— Page::fetch_stylesheets has cognitive complexity 64 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 5 (8 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Page::navigate_single (cognitive 63) crates/obscura-browser/src/page.rs:3402— Page::navigate_single has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (42 pts), match/switch 4 (11 pts), loops 3 (9 pts), boolean chains 1 (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.
Page::run_next_pending_frame (cognitive 45) crates/obscura-browser/src/page.rs:1218— Page::run_next_pending_frame has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 3 (7 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Page::render_resource_candidates (cognitive 30) crates/obscura-browser/src/page.rs:3832— Page::render_resource_candidates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 6 (7 pts), boolean chains 1, 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.
Page::release_detached_frames (cognitive 21) crates/obscura-browser/src/page.rs:1495— Page::release_detached_frames has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Page::wait_for_network_idle (cognitive 18) crates/obscura-browser/src/page.rs:3690— Page::wait_for_network_idle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Page::deliver_frame_messages (cognitive 17) crates/obscura-browser/src/page.rs:1379— Page::deliver_frame_messages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cli::run_fetch (cognitive 76) crates/obscura-cli/src/main.rs:1164— obscura_cli::run_fetch has cognitive complexity 76 (threshold 15). Drivers by points: if/else 30 (55 pts), match/switch 6 (11 pts), boolean chains 5, loops 1 (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.
obscura_cli::run_multi_worker_serve (cognitive 51) crates/obscura-cli/src/main.rs:864— obscura_cli::run_multi_worker_serve has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 7 (23 pts), if/else 10 (21 pts), loops 7 (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
obscura_cli::run_cli (cognitive 43) crates/obscura-cli/src/main.rs:401— obscura_cli::run_cli has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (34 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cli::run_parallel_scrape (cognitive 39) crates/obscura-cli/src/main.rs:2033— obscura_cli::run_parallel_scrape has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (26 pts), match/switch 8 (10 pts), loops 2 (3 pts) (nesting depth added 8). 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.
obscura_cli::worker::main (cognitive 29) crates/obscura-cli/src/worker.rs:73— obscura_cli::worker::main has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 5 (10 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
obscura_cli::supervise_worker (cognitive 22) crates/obscura-cli/src/main.rs:783— obscura_cli::supervise_worker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), match/switch 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_cli::extract_readable_text (cognitive 21) crates/obscura-cli/src/main.rs:1915— obscura_cli::extract_readable_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), match/switch 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.
obscura_cli::dump_links (cognitive 17) crates/obscura-cli/src/main.rs:2275— obscura_cli::dump_links has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×8
Untrusted text written into markup unescaped REDACTED:3611— `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:4133— `v` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:4429— `html` is text this program did not author, and it is written into the text of an element through `insertAdjacentHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:10945— `String(value==null?'':value)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:12408— `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:15081— `bodyContent` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:15162— `html` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped REDACTED:16233— `String(html==null?"":html)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
obscura_js::ops::op_dom_inner (cyclomatic 209) crates/obscura-js/src/ops.rs:2138— obscura_js::ops::op_dom_inner has cyclomatic complexity 209 (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.
obscura_js::ops::fetch_url_inner (cyclomatic 72) crates/obscura-js/src/ops.rs:3914— obscura_js::ops::fetch_url_inner 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.
obscura_js::ops::render_mutation_impact (cyclomatic 40) crates/obscura-js/src/ops.rs:1332— obscura_js::ops::render_mutation_impact 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.
obscura_js::ops::stealth_fetch_all (cyclomatic 24) crates/obscura-js/src/ops.rs:4620— obscura_js::ops::stealth_fetch_all 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.
obscura_js::ops::op_load_image_metadata (cyclomatic 21) crates/obscura-js/src/ops.rs:8560— obscura_js::ops::op_load_image_metadata has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
obscura_js::ops::url_set_inner (cyclomatic 17) crates/obscura-js/src/ops.rs:7395— obscura_js::ops::url_set_inner 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.
obscura_js::ops::op_computed_style (cyclomatic 17) crates/obscura-js/src/ops.rs:9089— obscura_js::ops::op_computed_style 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.
obscura_mcp::http::read_request (cognitive 32) crates/obscura-mcp/src/http.rs:120— obscura_mcp::http::read_request has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_mcp::http::handle_connection (cognitive 28) crates/obscura-mcp/src/http.rs:345— obscura_mcp::http::handle_connection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 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.
obscura_mcp::search_body (cognitive 27) crates/obscura-mcp/src/lib.rs:2121— obscura_mcp::search_body has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 7 (10 pts), boolean chains 2, match/switch 1 (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.
obscura_mcp::extract_text (cognitive 24) crates/obscura-mcp/src/lib.rs:2015— obscura_mcp::extract_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 3 (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.
obscura_mcp::run (cognitive 22) crates/obscura-mcp/src/lib.rs:254— obscura_mcp::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (10 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.
obscura_mcp::tool_set_storage_state (cognitive 20) crates/obscura-mcp/src/lib.rs:2244— obscura_mcp::tool_set_storage_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 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.
obscura_mcp::http::run (cognitive 16) crates/obscura-mcp/src/http.rs:276— obscura_mcp::http::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 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.
Page::execute_scripts_with_module_budget (cyclomatic 91) crates/obscura-browser/src/page.rs:2243— Page::execute_scripts_with_module_budget has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Page::navigate_single (cyclomatic 32) crates/obscura-browser/src/page.rs:3402— Page::navigate_single 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.
Page::fetch_stylesheets (cyclomatic 30) crates/obscura-browser/src/page.rs:1932— Page::fetch_stylesheets 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.
Page::run_next_pending_frame (cyclomatic 24) crates/obscura-browser/src/page.rs:1218— Page::run_next_pending_frame 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.
Page::render_resource_candidates (cyclomatic 19) crates/obscura-browser/src/page.rs:3832— Page::render_resource_candidates 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.
Page::release_detached_frames (cyclomatic 16) crates/obscura-browser/src/page.rs:1495— Page::release_detached_frames 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.
Duplicated block (14 lines × 2) crates/obscura-cdp/src/domains/page.rs:954— crates/obscura-cdp/src/domains/page.rs:954-967 | crates/obscura-cdp/src/domains/page.rs:1011-1024 — both copies are in the same file, so extract the block into 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) crates/obscura-net/src/client.rs:758— crates/obscura-net/src/client.rs:758-771 | crates/obscura-net/src/wreq_client.rs:94-107 — 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) crates/obscura-render/src/dom.rs:7140— crates/obscura-render/src/dom.rs:7140-7153 | crates/obscura-render/src/dom.rs:7393-7406 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:1378— crates/obscura-render/src/paint.rs:1378-1391 | crates/obscura-render/src/paint.rs:5861-5874 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:5680— crates/obscura-render/src/paint.rs:5680-5693 | crates/obscura-render/src/paint.rs:9376-9389 — both copies are in the same file, so extract the block into 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) crates/obscura-cdp/src/domains/dom.rs:462— crates/obscura-cdp/src/domains/dom.rs:462-476 | crates/obscura-cdp/src/domains/dom.rs:500-513 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
obscura_browser::accessibility::map_role (cyclomatic 71) crates/obscura-browser/src/accessibility.rs:128— obscura_browser::accessibility::map_role has cyclomatic complexity 71 (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.
obscura_browser::page::rebase_css_urls (cyclomatic 32) crates/obscura-browser/src/page.rs:489— obscura_browser::page::rebase_css_urls 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.
obscura_browser::accessibility::compute_properties (cyclomatic 27) crates/obscura-browser/src/accessibility.rs:628— obscura_browser::accessibility::compute_properties 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.
obscura_browser::page::css_resource_urls (cyclomatic 23) crates/obscura-browser/src/page.rs:600— obscura_browser::page::css_resource_urls 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.
obscura_browser::page::css_import_rule_len (cyclomatic 17) crates/obscura-browser/src/page.rs:878— obscura_browser::page::css_import_rule_len 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.
obscura_cli::run_fetch (cyclomatic 46) crates/obscura-cli/src/main.rs:1164— obscura_cli::run_fetch has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
obscura_cli::run_cli (cyclomatic 28) crates/obscura-cli/src/main.rs:401— obscura_cli::run_cli 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.
obscura_cli::run_parallel_scrape (cyclomatic 28) crates/obscura-cli/src/main.rs:2033— obscura_cli::run_parallel_scrape has cyclomatic complexity 28 (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.
obscura_cli::run_multi_worker_serve (cyclomatic 26) crates/obscura-cli/src/main.rs:864— obscura_cli::run_multi_worker_serve 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.
obscura_cli::worker::main (cyclomatic 18) crates/obscura-cli/src/worker.rs:73— obscura_cli::worker::main has cyclomatic complexity 18 (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.
TextEngine::paint_item_with_clip_mask_scaled_for_print (cognitive 145) crates/obscura-render/src/inline.rs:3681— TextEngine::paint_item_with_clip_mask_scaled_for_print has cognitive complexity 145 (threshold 15). Drivers by points: if/else 38 (105 pts), loops 9 (17 pts), boolean chains 13, match/switch 2 (10 pts) (nesting depth added 83). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TextEngine::push_shaped_item (cognitive 50) crates/obscura-render/src/inline.rs:1558— TextEngine::push_shaped_item has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 10, loops 7 (9 pts), match/switch 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.
TextEngine::inline_owner_line_fragments (cognitive 48) crates/obscura-render/src/inline.rs:2118— TextEngine::inline_owner_line_fragments has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (33 pts), boolean chains 9, loops 3 (6 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.
TextEngine::finalize (cognitive 28) crates/obscura-render/src/inline.rs:1991— TextEngine::finalize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 1 (2 pts), boolean chains 1, match/switch 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.
TextEngine::caret_from_point (cognitive 21) crates/obscura-render/src/inline.rs:2244— TextEngine::caret_from_point has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CookieJar::set_cookie_from_js (cognitive 52) crates/obscura-net/src/cookies.rs:404— CookieJar::set_cookie_from_js has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 4 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
CookieJar::set_cookie (cognitive 47) crates/obscura-net/src/cookies.rs:79— CookieJar::set_cookie has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (31 pts), match/switch 4 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 25). 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.
CookieJar::get_cookie_header_in_context (cognitive 35) crates/obscura-net/src/cookies.rs:203— CookieJar::get_cookie_header_in_context has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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.
CookieJar::get_js_visible_cookies (cognitive 26) crates/obscura-net/src/cookies.rs:362— CookieJar::get_js_visible_cookies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (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.
CookieJar::set_cookies_from_import (cognitive 22) crates/obscura-net/src/cookies.rs:308— CookieJar::set_cookies_from_import has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, 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.
DomTree::serialize_worklist (cognitive 43) crates/obscura-dom/src/serialize.rs:50— DomTree::serialize_worklist has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (12 pts), match/switch 3 (6 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DomTree::import_node_from (cognitive 24) crates/obscura-dom/src/tree.rs:1793— DomTree::import_node_from has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (7 pts), loops 3 (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.
DomTree::set_subtree_connected (cognitive 20) crates/obscura-dom/src/tree.rs:698— DomTree::set_subtree_connected has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DomTree::remove (cognitive 19) crates/obscura-dom/src/tree.rs:1147— DomTree::remove has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DomTree::detach_for_reparent (cognitive 18) crates/obscura-dom/src/tree.rs:1063— DomTree::detach_for_reparent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, 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.
obscura_net::robots::parse_robots_txt (cognitive 34) crates/obscura-net/src/robots.rs:100— obscura_net::robots::parse_robots_txt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 9, match/switch 2 (7 pts), 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.
obscura_net::encoding::meta_attribute (cognitive 24) crates/obscura-net/src/encoding.rs:233— obscura_net::encoding::meta_attribute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_net::client::validate_url (cognitive 18) crates/obscura-net/src/client.rs:643— obscura_net::client::validate_url has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, match/switch 1 (2 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.
obscura_net::encoding::charset_from_content_type (cognitive 17) crates/obscura-net/src/encoding.rs:203— obscura_net::encoding::charset_from_content_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, 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.
obscura_net::cookies::parse_http_date (cognitive 16) crates/obscura-net/src/cookies.rs:656— obscura_net::cookies::parse_http_date has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ObscuraJsRuntime::run_event_loop_until_quiescent (cognitive 29) crates/obscura-js/src/runtime.rs:3843— ObscuraJsRuntime::run_event_loop_until_quiescent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 6, match/switch 2 (3 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.
ObscuraJsRuntime::v8_to_json (cognitive 26) crates/obscura-js/src/runtime.rs:4352— ObscuraJsRuntime::v8_to_json has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ObscuraJsRuntime::execute_classic_script (cognitive 23) crates/obscura-js/src/runtime.rs:3280— ObscuraJsRuntime::execute_classic_script has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (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.
ObscuraJsRuntime::share_ops_with_realm (cognitive 16) crates/obscura-js/src/runtime.rs:899— ObscuraJsRuntime::share_ops_with_realm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), 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.
ObscuraJsRuntime::pending_render_image_urls (cognitive 16) crates/obscura-js/src/runtime.rs:2059— ObscuraJsRuntime::pending_render_image_urls 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.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×5
Duplicated block (13 lines × 2) crates/obscura-js/src/ops.rs:2920— crates/obscura-js/src/ops.rs:2920-2932 | crates/obscura-js/src/ops.rs:2943-2955 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:4424— crates/obscura-js/src/ops.rs:4424-4436 | crates/obscura-js/src/ops.rs:4711-4723 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:1922— crates/obscura-js/src/runtime.rs:1922-1934 | crates/obscura-js/src/runtime.rs:1960-1972 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/inline.rs:1404— crates/obscura-render/src/inline.rs:1404-1416 | crates/obscura-render/src/inline.rs:1458-1470 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:10144— crates/obscura-render/src/paint.rs:10144-10156 | crates/obscura-render/src/style.rs:7883-7895 — 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.
Repeated repair: crates/obscura-js/src/frame.rs crates/obscura-js/src/frame.rs:56— crates/obscura-js/src/frame.rs changed 18 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is FrameRealm::new at line 56), 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(js): iframe shadow root document routing”; “fix(js): load iframe srcdoc in native child realms”; “fix(browser): preserve plain-text document metadata and newlines”; “fix(js): define the FileList global so boot references stop crashing”. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-js/src/frame.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.
Repeated repair: crates/obscura-browser/src/context.rs crates/obscura-browser/src/context.rs:78— crates/obscura-browser/src/context.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is obscura_browser::context::load_web_storage at line 78), 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(net): gate file:// reads inside the loader”; “fix(js): implement context-owned IndexedDB transactions”; “fix(storage): retry profile writes and preserve browser strings”; “fix(js): keep Web Storage across navigation and persist it, and back IndexedDB”. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-browser/src/context.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.
Repeated repair: crates/obscura/src/page.rs crates/obscura/src/page.rs:82— crates/obscura/src/page.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is Page::wait_for_selector at line 82), 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(obscura): the frame wrappers borrow the page”; “fix(js): give child iframes a realm so their scripts run”; “fix(obscura): make Element borrow the Page safely instead of a raw pointer”; “fix(obscura): escape attribute name in Element::attribute()”. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura/src/page.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.
Repeated repair: crates/obscura-cdp/src/domains/accessibility.rs crates/obscura-cdp/src/domains/accessibility.rs:9— crates/obscura-cdp/src/domains/accessibility.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is obscura_cdp::domains::accessibility::handle at line 9), 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(mcp): return bounded actionable snapshots”; “fix(cdp): correct accessible names and visibility”; “fix(cdp): expose contenteditable accessibility values”. 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 21:14:07 +01:00' --until='2026-10-25 21:14:07 +01:00' --full-history --no-merges -- crates/obscura-cdp/src/domains/accessibility.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.
PreparedRender::hit_test (cognitive 32) crates/obscura-render/src/paint.rs:1564— PreparedRender::hit_test has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 4, loops 2 (nesting depth added 9). Of this number, 22 points are the body's own statements and 10 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.
PreparedRender::computed_style (cognitive 29) crates/obscura-render/src/paint.rs:1763— PreparedRender::computed_style has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (13 pts), if/else 10 (11 pts), loops 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.
PreparedRender::resolve_scroll_state_for_viewport (cognitive 21) crates/obscura-render/src/paint.rs:1286— PreparedRender::resolve_scroll_state_for_viewport has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 4). Of this number, 12 points are the body's own statements and 9 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.
PreparedRender::check_visibility (cognitive 18) crates/obscura-render/src/paint.rs:1514— PreparedRender::check_visibility has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, 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.
TooManyFields: LayoutStyle crates/obscura-render/src/lib.rs:1006— TooManyFields — 198 stored fields beside 4 methods. The bar is 30 stored fields; this is 168 over it, 6.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: ObscuraState crates/obscura-js/src/ops.rs:329— TooManyFields — 81 stored fields beside 3 methods. The bar is 30 stored fields; this is 51 over it, 2.70× 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: Page crates/obscura-browser/src/page.rs:239— TooManyFields — 48 stored fields beside 130 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: CdpContext crates/obscura-cdp/src/dispatch.rs:51— TooManyFields — 31 stored fields beside 32 methods. The bar is 30 stored fields; this is 1 over it, 1.03× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
ClassTooLong: Stylesheet crates/obscura-render/src/css.rs:2412— ClassTooLong — 1234 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, 2 blocks, lines 2412-4182. The bar is 400 significant lines; this is 834 over it, 3.09× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DomTree crates/obscura-dom/src/tree.rs:248— ClassTooLong — 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 92 methods, 3 blocks, lines 248-1945. The bar is 400 significant lines; this is 568 over it, 2.42× 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: DomLayout crates/obscura-render/src/dom.rs:307— ClassTooLong — 559 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, 2 blocks, lines 307-1742. The bar is 400 significant lines; this is 159 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ObscuraHttpClient crates/obscura-net/src/client.rs:845— ClassTooLong — 459 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 24 methods, 3 blocks, lines 845-1703. The bar is 400 significant lines; this is 59 over it, 1.15× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×4
Members sharing a duplicated core (4 members, 50+ identical tokens) crates/obscura-render/src/css.rs:3080— crates/obscura-render/src/css.rs:3080-3298 | crates/obscura-render/src/css.rs:3322-3378 | crates/obscura-render/src/css.rs:3387-3443 | crates/obscura-render/src/css.rs:3643-4181 — 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) crates/obscura-render/src/paint.rs:3966— crates/obscura-render/src/paint.rs:3966-5517 | crates/obscura-render/src/paint.rs:5600-5814 | crates/obscura-render/src/paint.rs:9297-9514 | crates/obscura-render/src/paint.rs:9529-9796 — 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) crates/obscura-render/src/paint.rs:10143— crates/obscura-render/src/paint.rs:10143-10175 | crates/obscura-render/src/style.rs:6659-6703 | crates/obscura-render/src/style.rs:6872-6916 | crates/obscura-render/src/style.rs:7856-7984 — 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) crates/obscura-render/src/style.rs:2544— crates/obscura-render/src/style.rs:2544-2586 | crates/obscura-render/src/style.rs:2673-2708 | crates/obscura-render/src/style.rs:2710-2754 | crates/obscura-render/src/style.rs:2756-2796 — 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 (16 lines × 2) crates/obscura-cli/src/main.rs:1898— crates/obscura-cli/src/main.rs:1898-1913 | crates/obscura-mcp/src/lib.rs:1998-2013 — before extracting anything, compare `crates/obscura-cli/src/main.rs` and `crates/obscura-mcp/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) crates/obscura-js/src/ops.rs:8975— crates/obscura-js/src/ops.rs:8975-8990 | crates/obscura-js/src/ops.rs:9040-9055 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/runtime.rs:3719— crates/obscura-js/src/runtime.rs:3719-3734 | crates/obscura-js/src/runtime.rs:3808-3823 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/paint.rs:9462— crates/obscura-render/src/paint.rs:9462-9477 | crates/obscura-render/src/paint.rs:9703-9718 — both copies are in the same file, so extract the block into 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) crates/obscura-dom/src/tree.rs:1310— crates/obscura-dom/src/tree.rs:1310-1324 | crates/obscura-dom/src/tree.rs:1344-1358 — both copies are in the same file, so extract the block into 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) crates/obscura-js/src/ops.rs:1533— crates/obscura-js/src/ops.rs:1533-1547 | crates/obscura-js/src/ops.rs:1554-1568 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) crates/obscura-render/src/dom.rs:6664— crates/obscura-render/src/dom.rs:6664-6678 | crates/obscura-render/src/dom.rs:6707-6721 — both copies are in the same file, so extract the block into 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) crates/obscura-cdp/src/domains/runtime.rs:309— crates/obscura-cdp/src/domains/runtime.rs:309-324 | crates/obscura-cdp/src/domains/runtime.rs:371-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.
AC3 · Page structure· Data table has no header cells · ×3
Data table has no header cells render-repros/fixed-table-layout.html:13— 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).
Data table has no header cells render-repros/fixed-table-layout.html:17— 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).
Data table has no header cells render-repros/fixed-table-layout.html:21— 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).
Empty <h2> heading render-repros/float-bfc-continuation.html:41— An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
Empty <h2> heading render-repros/float-flow-bands.html:47— An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
Empty <h2> heading render-repros/float-flow-bands.html:50— An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
Stylesheet::apply_internal (cyclomatic 81) crates/obscura-render/src/css.rs:3626— Stylesheet::apply_internal 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.
Stylesheet::pseudo_styles_internal (cyclomatic 36) crates/obscura-render/src/css.rs:3068— Stylesheet::pseudo_styles_internal 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. This is NOT this file's highest cyclomatic complexity: obscura_render::css::animated_properties_for_declaration (cyclomatic 48) 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.
Stylesheet::parse_for_viewport_and_media_at_animation_time (cyclomatic 29) crates/obscura-render/src/css.rs:2757— Stylesheet::parse_for_viewport_and_media_at_animation_time has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: obscura_render::css::animated_properties_for_declaration (cyclomatic 48) 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.
TextEngine::paint_item_with_clip_mask_scaled_for_print (cyclomatic 60) crates/obscura-render/src/inline.rs:3681— TextEngine::paint_item_with_clip_mask_scaled_for_print has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TextEngine::push_shaped_item (cyclomatic 36) crates/obscura-render/src/inline.rs:1558— TextEngine::push_shaped_item 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.
TextEngine::inline_owner_line_fragments (cyclomatic 21) crates/obscura-render/src/inline.rs:2118— TextEngine::inline_owner_line_fragments 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.
PreparedRender::computed_style (cyclomatic 40) crates/obscura-render/src/paint.rs:1763— PreparedRender::computed_style has cyclomatic complexity 40 (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.
PreparedRender::hit_test (cyclomatic 22) crates/obscura-render/src/paint.rs:1564— PreparedRender::hit_test has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body's own statements and 6 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.
PreparedRender::resolve_scroll_state_for_viewport (cyclomatic 16) crates/obscura-render/src/paint.rs:1286— PreparedRender::resolve_scroll_state_for_viewport has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body's own statements and 7 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.
CookieJar::set_cookie_from_js (cyclomatic 27) crates/obscura-net/src/cookies.rs:404— CookieJar::set_cookie_from_js 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.
CookieJar::set_cookie (cyclomatic 26) crates/obscura-net/src/cookies.rs:79— CookieJar::set_cookie 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.
CookieJar::get_cookie_header_in_context (cyclomatic 16) crates/obscura-net/src/cookies.rs:203— CookieJar::get_cookie_header_in_context 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.
Stylesheet::apply_internal (cognitive 147) crates/obscura-render/src/css.rs:3626— Stylesheet::apply_internal has cognitive complexity 147 (threshold 15). Drivers by points: if/else 54 (101 pts), loops 17 (28 pts), boolean chains 14, match/switch 2 (4 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Stylesheet::parse_for_viewport_and_media_at_animation_time (cognitive 69) crates/obscura-render/src/css.rs:2757— Stylesheet::parse_for_viewport_and_media_at_animation_time has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (55 pts), match/switch 2 (8 pts), loops 3 (6 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.
Stylesheet::pseudo_styles_internal (cognitive 58) crates/obscura-render/src/css.rs:3068— Stylesheet::pseudo_styles_internal has cognitive complexity 58 (threshold 15). Drivers by points: if/else 25 (42 pts), loops 7 (12 pts), boolean chains 4 (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.
Duplicated block (25–27 lines × 2) crates/obscura-render/src/dom.rs:6141— crates/obscura-render/src/dom.rs:6141-6165 | crates/obscura-render/src/dom.rs:6335-6361 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25–27 lines × 2) crates/obscura-render/src/inline.rs:1187— crates/obscura-render/src/inline.rs:1187-1211 | crates/obscura-render/src/lib.rs:383-409 — before extracting anything, compare `crates/obscura-render/src/inline.rs` and `crates/obscura-render/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 (25–27 lines × 2) crates/obscura-render/src/paint.rs:4202— crates/obscura-render/src/paint.rs:4202-4228 | crates/obscura-render/src/paint.rs:4241-4265 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) crates/obscura-render/src/paint.rs:2146— crates/obscura-render/src/paint.rs:2146-2165 | crates/obscura-render/src/paint.rs:2179-2198 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) crates/obscura-render/src/paint.rs:5379— crates/obscura-render/src/paint.rs:5379-5398 | crates/obscura-render/src/paint.rs:5414-5433 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20 lines × 2) crates/obscura-render/src/paint.rs:7870— crates/obscura-render/src/paint.rs:7870-7889 | crates/obscura-render/src/paint.rs:8023-8042 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) crates/obscura-render/src/css.rs:5782— crates/obscura-render/src/css.rs:5782-5798 | crates/obscura-render/src/css.rs:5814-5830 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) crates/obscura-render/src/dom.rs:5614— crates/obscura-render/src/dom.rs:5614-5630 | crates/obscura-render/src/dom.rs:6465-6481 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) crates/obscura-render/src/style.rs:195— crates/obscura-render/src/style.rs:195-211 | crates/obscura-render/src/style.rs:224-240 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 3) crates/obscura-browser/src/page.rs:757— crates/obscura-browser/src/page.rs:757-772 | crates/obscura-render/src/paint.rs:8021-8036 | crates/obscura-render/src/style.rs:2924-2939 — before extracting anything, compare `crates/obscura-browser/src/page.rs` and `crates/obscura-render/src/paint.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 3) crates/obscura-render/src/css.rs:1013— crates/obscura-render/src/css.rs:1013-1028 | crates/obscura-render/src/css.rs:1053-1068 | crates/obscura-render/src/css.rs:1092-1107 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (16 lines × 3) crates/obscura-render/src/css.rs:2845— crates/obscura-render/src/css.rs:2845-2860 | crates/obscura-render/src/css.rs:2888-2903 | crates/obscura-render/src/css.rs:2927-2942 — 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 (12 lines × 2) crates/obscura-browser/src/page.rs:2733— crates/obscura-browser/src/page.rs:2733-2744 | crates/obscura-browser/src/page.rs:2907-2918 — both copies are in the same file, so extract the block into 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) crates/obscura-cdp/src/domains/dom.rs:310— crates/obscura-cdp/src/domains/dom.rs:310-321 | crates/obscura-cdp/src/domains/dom.rs:338-349 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) crates/obscura-js/src/ops.rs:8960— crates/obscura-js/src/ops.rs:8960-8971 | crates/obscura-js/src/ops.rs:9025-9036 — both copies are in the same file, so extract the block into 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–11 lines × 2) crates/obscura-render/src/dom.rs:5761— crates/obscura-render/src/dom.rs:5761-5771 | crates/obscura-render/src/dom.rs:6271-6280 — both copies are in the same file, so extract the block into 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–11 lines × 2) crates/obscura-render/src/dom.rs:10922— crates/obscura-render/src/dom.rs:10922-10932 | crates/obscura-render/src/dom.rs:11123-11132 — both copies are in the same file, so extract the block into 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–11 lines × 2) crates/obscura-render/src/style.rs:505— crates/obscura-render/src/style.rs:505-514 | crates/obscura-render/src/style.rs:5512-5522 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Low cohesion: Size (LCOM4 5) vendor/taffy/src/geometry.rs:341— Size's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: TextEngine (LCOM4 4) crates/obscura-render/src/inline.rs:873— TextEngine'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: GridItem (LCOM4 4) vendor/taffy/src/compute/grid/types/grid_item.rs:14— GridItem'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.
Outbound HTTP without resilience tools/live-view.mjs:34— `fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience tools/live-view.mjs:56— `fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience tools/live-view.mjs:85— `fetch(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
AC4 · Keyboard semantics· Anchor without href · ×2
Anchor without href render-repros/opposing-header-floats.html:31— An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
Anchor without href render-repros/ratio-only-inline-images.html:26— An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
DomLayout::scroll_tree (cyclomatic 35) crates/obscura-render/src/dom.rs:1184— DomLayout::scroll_tree has cyclomatic complexity 35 (threshold 15). Of this number, 27 points are the body's own statements and 8 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.
DomLayout::sticky_layout_with_geometry (cyclomatic 19) crates/obscura-render/src/dom.rs:1520— DomLayout::sticky_layout_with_geometry 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.
ObscuraJsRuntime::run_event_loop_until_quiescent (cyclomatic 22) crates/obscura-js/src/runtime.rs:3843— ObscuraJsRuntime::run_event_loop_until_quiescent 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.
ObscuraJsRuntime::execute_classic_script (cyclomatic 16) crates/obscura-js/src/runtime.rs:3280— ObscuraJsRuntime::execute_classic_script 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.
obscura_mcp::http::read_request (cyclomatic 21) crates/obscura-mcp/src/http.rs:120— obscura_mcp::http::read_request 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.
obscura_mcp::http::handle_connection (cyclomatic 17) crates/obscura-mcp/src/http.rs:345— obscura_mcp::http::handle_connection 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.
ObscuraHttpClient::fetch_with_profile_uncached (cognitive 88) crates/obscura-net/src/client.rs:1394— ObscuraHttpClient::fetch_with_profile_uncached has cognitive complexity 88 (threshold 15). Drivers by points: if/else 30 (73 pts), loops 4 (8 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ObscuraHttpClient::fetch_with_profile (cognitive 22) crates/obscura-net/src/client.rs:1250— ObscuraHttpClient::fetch_with_profile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (10 pts), 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.
DomLayout::scroll_tree (cognitive 75) crates/obscura-render/src/dom.rs:1184— DomLayout::scroll_tree has cognitive complexity 75 (threshold 15). Drivers by points: if/else 30 (62 pts), boolean chains 7, loops 5 (6 pts) (nesting depth added 33). Of this number, 64 points are the body's own statements and 11 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.
DomLayout::sticky_layout_with_geometry (cognitive 35) crates/obscura-render/src/dom.rs:1520— DomLayout::sticky_layout_with_geometry has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_dom::selector::subject_keys (cognitive 31) crates/obscura-dom/src/selector.rs:1190— obscura_dom::selector::subject_keys has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
obscura_dom::tree::collect_text_inner (cognitive 17) crates/obscura-dom/src/tree.rs:1889— obscura_dom::tree::collect_text_inner has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (6 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.
ReplacedItem::constrain_auto_size (cognitive 19) crates/obscura-render/src/inline.rs:1173— ReplacedItem::constrain_auto_size has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 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.
ReplacedItem::size (cognitive 16) crates/obscura-render/src/inline.rs:1217— ReplacedItem::size has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 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.
Duplicated block (38 lines × 2) crates/obscura-net/src/cookies.rs:91— crates/obscura-net/src/cookies.rs:91-128 | crates/obscura-net/src/cookies.rs:415-452 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (38 lines × 2) crates/obscura-render/src/paint.rs:9411— crates/obscura-render/src/paint.rs:9411-9448 | crates/obscura-render/src/paint.rs:9652-9689 — both copies are in the same file, so extract the block into 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) crates/obscura-browser/src/page.rs:758— crates/obscura-browser/src/page.rs:758-778 | crates/obscura-render/src/style.rs:2925-2945 — before extracting anything, compare `crates/obscura-browser/src/page.rs` and `crates/obscura-render/src/style.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 2) crates/obscura-render/src/dom.rs:7712— crates/obscura-render/src/dom.rs:7712-7732 | crates/obscura-render/src/dom.rs:7846-7866 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) crates/obscura-browser/src/page.rs:503— crates/obscura-browser/src/page.rs:503-521 | crates/obscura-browser/src/page.rs:629-647 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) crates/obscura-render/src/inline.rs:3336— crates/obscura-render/src/inline.rs:3336-3354 | crates/obscura-render/src/lib.rs:284-302 — before extracting anything, compare `crates/obscura-render/src/inline.rs` and `crates/obscura-render/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 (18 lines × 2) crates/obscura-render/src/paint.rs:3262— crates/obscura-render/src/paint.rs:3262-3279 | crates/obscura-render/src/paint.rs:3351-3368 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) crates/obscura-render/src/style.rs:4507— crates/obscura-render/src/style.rs:4507-4524 | crates/obscura-render/src/style.rs:4542-4559 — both copies are in the same file, so extract the block into 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–15 lines × 2) crates/obscura-render/src/paint.rs:5641— crates/obscura-render/src/paint.rs:5641-5655 | crates/obscura-render/src/paint.rs:9355-9366 — both copies are in the same file, so extract the block into 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–15 lines × 2) crates/obscura-render/src/style.rs:6558— crates/obscura-render/src/style.rs:6558-6569 | crates/obscura-render/src/style.rs:6779-6793 — both copies are in the same file, so extract the block into 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 × 3) crates/obscura-render/src/paint.rs:5766— crates/obscura-render/src/paint.rs:5766-5779 | crates/obscura-render/src/paint.rs:9459-9472 | crates/obscura-render/src/paint.rs:9700-9713 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14 lines × 3) crates/obscura-render/src/style.rs:200— crates/obscura-render/src/style.rs:200-213 | crates/obscura-render/src/style.rs:229-242 | crates/obscura-render/src/style.rs:261-274 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (13 lines × 4) crates/obscura-render/src/css.rs:681— crates/obscura-render/src/css.rs:681-693 | crates/obscura-render/src/css.rs:1016-1028 | crates/obscura-render/src/css.rs:1056-1068 | crates/obscura-render/src/css.rs:1095-1107 — 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 lines × 4) crates/obscura-render/src/paint.rs:4804— crates/obscura-render/src/paint.rs:4804-4816 | crates/obscura-render/src/paint.rs:5752-5764 | crates/obscura-render/src/paint.rs:9445-9457 | crates/obscura-render/src/paint.rs:9686-9698 — 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 (12 lines × 3) crates/obscura-render/src/style.rs:2547— crates/obscura-render/src/style.rs:2547-2558 | crates/obscura-render/src/style.rs:2713-2724 | crates/obscura-render/src/style.rs:2759-2770 — 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 (12 lines × 3) crates/obscura-render/src/style.rs:6662— crates/obscura-render/src/style.rs:6662-6673 | crates/obscura-render/src/style.rs:6875-6886 | crates/obscura-render/src/style.rs:7884-7895 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) crates/obscura-dom/src/tree.rs:1229— crates/obscura-dom/src/tree.rs:1229-1237 | crates/obscura-dom/src/tree.rs:1251-1261 | crates/obscura-dom/src/tree.rs:1593-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 (9 lines × 3) crates/obscura-dom/src/tree.rs:1318— crates/obscura-dom/src/tree.rs:1318-1326 | crates/obscura-dom/src/tree.rs:1352-1360 | crates/obscura-dom/src/tree.rs:1927-1935 — 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) crates/obscura-browser/src/page.rs:563— crates/obscura-browser/src/page.rs:563-570 | crates/obscura-browser/src/page.rs:694-701 | crates/obscura-browser/src/page.rs:847-854 — 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) crates/obscura-render/src/style.rs:1532— crates/obscura-render/src/style.rs:1532-1539 | crates/obscura-render/src/style.rs:7694-7701 | crates/obscura-render/src/style.rs:7724-7731 — 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) crates/obscura-js/src/runtime.rs:806— crates/obscura-js/src/runtime.rs:806-810 | crates/obscura-js/src/runtime.rs:908-912 | crates/obscura-js/src/runtime.rs:973-977 — 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) crates/obscura-js/src/ops.rs:2597— crates/obscura-js/src/ops.rs:2597-2601 | crates/obscura-js/src/ops.rs:2604-2610 | crates/obscura-js/src/ops.rs:2613-2619 — 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.
Off the main sequence: obscura-dom — obscura-dom: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 6 project(s), so it's rigid to change.
Off the main sequence: obscura-net — obscura-net: abstractness 0.05, instability 0.14, distance 0.81 — zone of pain — concrete and depended on by 6 project(s), so it's rigid to change.
X2 · Cancellation propagation· Async function without AbortSignal · ×2
Async function without AbortSignal: ensureServe tools/live-view.mjs:32— `ensureServe` 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: listAllPages tools/live-view.mjs:84— `listAllPages` 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 })`.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 78 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.
paired-corpus.main (cyclomatic 91) render-repros/paired-corpus.py:2245— paired-corpus.main has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Inner::command (cyclomatic 76) crates/obscura-js/src/indexed_db.rs:110— Inner::command has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
bootstrap._cssSupportsDeclaration (cyclomatic 76) REDACTED:13572— bootstrap._cssSupportsDeclaration has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
bootstrap._fetch (cyclomatic 66) REDACTED:8465— bootstrap._fetch has cyclomatic complexity 66 (threshold 15). Of this number, 61 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Element.click (cyclomatic 54) REDACTED:4525— Element.click has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
bootstrap.__prepareInsertedScript (cyclomatic 51) REDACTED:2176— bootstrap.__prepareInsertedScript has cyclomatic complexity 51 (threshold 15). Of this number, 47 points are the body's own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
paired-corpus.compare_geometry_probes (cyclomatic 46) render-repros/paired-corpus.py:1938— paired-corpus.compare_geometry_probes has cyclomatic complexity 46 (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.
Document.createTreeWalker (cyclomatic 41) REDACTED:6601— Document.createTreeWalker 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.
ObscuraHttpClient::fetch_with_profile_uncached (cyclomatic 38) crates/obscura-net/src/client.rs:1394— ObscuraHttpClient::fetch_with_profile_uncached has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DOMParser.parseFromString (cyclomatic 38) REDACTED:12368— DOMParser.parseFromString has cyclomatic complexity 38 (threshold 15). Of this number, 24 points are the body's own statements and 14 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
bootstrap._inputParseNumber (cyclomatic 38) REDACTED:3401— bootstrap._inputParseNumber has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
bootstrap._splitTopLevelCssRules (cyclomatic 37) REDACTED:10052— bootstrap._splitTopLevelCssRules has cyclomatic complexity 37 (threshold 15). Of this number, 32 points are the body's own statements and 5 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.
bootstrap._cssSupportsSelector (cyclomatic 36) REDACTED:13907— bootstrap._cssSupportsSelector has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 6 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 13913). 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.
bootstrap._installCaretGeometry (cyclomatic 36) REDACTED:18202— bootstrap._installCaretGeometry has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 12 of the 36 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 18261, nativeCaret, a function literal at line 18241, …). 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.
paired-corpus.compare_feature_probes (cyclomatic 35) render-repros/paired-corpus.py:2085— paired-corpus.compare_feature_probes has cyclomatic complexity 35 (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.
bootstrap._elementClassFor (cyclomatic 35) REDACTED:7623— bootstrap._elementClassFor has cyclomatic complexity 35 (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.
Element.setAttribute (cyclomatic 34) REDACTED:4274— Element.setAttribute has cyclomatic complexity 34 (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.
paired-corpus.classify_state_comparability (cyclomatic 32) render-repros/paired-corpus.py:1442— paired-corpus.classify_state_comparability has cyclomatic complexity 32 (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.
Element._navigateSubmit (cyclomatic 32) REDACTED:5361— Element._navigateSubmit 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.
bootstrap.getComputedStyle (cyclomatic 32) REDACTED:9802— bootstrap.getComputedStyle 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. This shape REPEATS in the file: one other method here (bootstrap.getComputedStyle::dimensionFor) 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.
Element.removeAttribute (cyclomatic 31) REDACTED:4334— Element.removeAttribute has cyclomatic complexity 31 (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.
bootstrap._structuredClone (cyclomatic 31) REDACTED:12955— bootstrap._structuredClone 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.
bootstrap._rebaseCssUrls (cyclomatic 30) REDACTED:552— bootstrap._rebaseCssUrls 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.
bootstrap._normalizeWaapiTiming (cyclomatic 30) REDACTED:3755— bootstrap._normalizeWaapiTiming has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Element.scrollTo (cyclomatic 29) REDACTED:5929— Element.scrollTo 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.
Element._scrollIntoView (cyclomatic 28) REDACTED:5877— Element._scrollIntoView has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body's own statements and 14 belong to one function item inside it that branches. 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.
HTMLImageElement._applyImageMetadata (cyclomatic 28) REDACTED:7426— HTMLImageElement._applyImageMetadata has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
IntersectionObserver._entry (cyclomatic 28) REDACTED:11338— IntersectionObserver._entry 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.
bootstrap._consoleRemoteObject (cyclomatic 28) REDACTED:880— bootstrap._consoleRemoteObject 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.
bootstrap._normalizeWaapiKeyframes (cyclomatic 28) REDACTED:3700— bootstrap._normalizeWaapiKeyframes has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body's own statements and 10 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
bootstrap.perf.measure (cyclomatic 28) REDACTED:12742— bootstrap.perf.measure 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.
bootstrap._xmlWellFormed (cyclomatic 27) REDACTED:12319— bootstrap._xmlWellFormed 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.
bootstrap._cssSupportsColor (cyclomatic 27) REDACTED:13502— bootstrap._cssSupportsColor has cyclomatic complexity 27 (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.
obscura_dom::selector::subject_keys (cyclomatic 26) crates/obscura-dom/src/selector.rs:1190— obscura_dom::selector::subject_keys has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
Element.href (cyclomatic 26) REDACTED:5035— Element.href 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.
XMLHttpRequest.send (cyclomatic 26) REDACTED:8689— XMLHttpRequest.send has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 8705, 8761). 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.
FormData.constructor (cyclomatic 26) REDACTED:12142— FormData.constructor 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.
bootstrap._ensureInsertionValidity (cyclomatic 26) REDACTED:2490— bootstrap._ensureInsertionValidity has cyclomatic complexity 26 (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.
bootstrap._elementClassForKnownName (cyclomatic 26) REDACTED:7665— bootstrap._elementClassForKnownName 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.
bootstrap._roMeasurement (cyclomatic 26) REDACTED:9292— bootstrap._roMeasurement has cyclomatic complexity 26 (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.
indexed_db._idbPrepare (cyclomatic 26) crates/obscura-js/js/indexed_db.js:157— indexed_db._idbPrepare has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
compare_obstacle.main (cyclomatic 25) scripts/ci/compare_obstacle.py:57— compare_obstacle.main 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.
Node.compareDocumentPosition (cyclomatic 25) REDACTED:2980— Node.compareDocumentPosition 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.
Element.checkVisibility (cyclomatic 25) REDACTED:5818— Element.checkVisibility has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Response.constructor (cyclomatic 25) REDACTED:9007— Response.constructor 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.
MutationObserver.observe (cyclomatic 25) REDACTED:10766— MutationObserver.observe 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.
bootstrap._splitCssDeclarations (cyclomatic 25) REDACTED:1761— bootstrap._splitCssDeclarations has cyclomatic complexity 25 (threshold 15). Of this number, 24 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.
bootstrap._ensureDocumentChildValidity (cyclomatic 25) REDACTED:2535— bootstrap._ensureDocumentChildValidity has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body's own statements and 9 belong to 3 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.
obscura_net::robots::parse_robots_txt (cyclomatic 24) crates/obscura-net/src/robots.rs:100— obscura_net::robots::parse_robots_txt has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
bootstrap.getComputedStyle::dimensionFor (cyclomatic 24) REDACTED:9849— bootstrap.getComputedStyle::dimensionFor 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. This shape REPEATS in the file: one other method here (bootstrap.getComputedStyle) 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.
bootstrap._cssSupportsContent (cyclomatic 24) REDACTED:13736— bootstrap._cssSupportsContent 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.
bootstrap._cssSplitTopLevel (cyclomatic 24) REDACTED:13842— bootstrap._cssSplitTopLevel 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.
bootstrap._rngCopyContents (cyclomatic 24) REDACTED:14679— bootstrap._rngCopyContents has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body's own statements and 5 belong to one function item 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.
Range.toString (cyclomatic 23) REDACTED:14817— Range.toString has cyclomatic complexity 23 (threshold 15). Of this number, 14 points are the body's own statements and 9 belong to one function item inside it that branches. 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.
_Canvas2D.stroke (cyclomatic 23) REDACTED:15987— _Canvas2D.stroke has cyclomatic complexity 23 (threshold 15). Of this number, 14 points are the body's own statements and 9 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.
_idbOpen::attempt (cyclomatic 23) crates/obscura-js/js/indexed_db.js:675— _idbOpen::attempt 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.
NonGeometricStyleCache::resolve_style (cyclomatic 22) crates/obscura-render/src/dom.rs:4600— NonGeometricStyleCache::resolve_style 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.
ScrollPaintState::overflow_clip_for (cyclomatic 22) crates/obscura-render/src/paint.rs:6014— ScrollPaintState::overflow_clip_for 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.
obscura_ssrf::is_forbidden_ip (cyclomatic 22) crates/obscura-ssrf/src/lib.rs:35— obscura_ssrf::is_forbidden_ip has cyclomatic complexity 22 (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.
Node.isEqualNode (cyclomatic 22) REDACTED:3056— Node.isEqualNode 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.
Element._loadIframeSrc (cyclomatic 22) REDACTED:5120— Element._loadIframeSrc has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5138, 5173). 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.
Request.constructor (cyclomatic 22) REDACTED:8938— Request.constructor has cyclomatic complexity 22 (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.
bootstrap._xpathFindNodes (cyclomatic 22) REDACTED:6177— bootstrap._xpathFindNodes has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body's own statements and 11 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.
DocumentWriteStream::mirror (cyclomatic 21) crates/obscura-js/src/write_stream.rs:92— DocumentWriteStream::mirror 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.
Element.value (cyclomatic 21) REDACTED:4799— Element.value 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.
bootstrap._eventTargetDispatch (cyclomatic 21) REDACTED:2017— bootstrap._eventTargetDispatch 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.
bootstrap._insertWrittenNodes (cyclomatic 21) REDACTED:6969— bootstrap._insertWrittenNodes 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.
bootstrap.__obscura_init (cyclomatic 21) REDACTED:18319— bootstrap.__obscura_init has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
indexed_db._idbWrite (cyclomatic 21) crates/obscura-js/js/indexed_db.js:428— indexed_db._idbWrite has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 439). 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.
StealthHttpClient::fetch_with_profile (cyclomatic 20) crates/obscura-net/src/wreq_client.rs:317— StealthHttpClient::fetch_with_profile 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.
check.main (cyclomatic 20) render-repros/check.py:205— check.main 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.
pr_policy.check_workflows (cyclomatic 20) scripts/ci/pr_policy.py:113— pr_policy.check_workflows 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.
Node.cloneNode (cyclomatic 20) REDACTED:2931— Node.cloneNode 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.
PerformanceObserver.observe (cyclomatic 20) REDACTED:12815— PerformanceObserver.observe 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.
bootstrap._queueMutationRecord (cyclomatic 20) REDACTED:10827— bootstrap._queueMutationRecord 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.
bootstrap._windowScroll (cyclomatic 20) REDACTED:16599— bootstrap._windowScroll has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
bootstrap.Node.lookupPrefix (cyclomatic 20) REDACTED:18468— bootstrap.Node.lookupPrefix 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.
connect (cyclomatic 20) tools/live-view.mjs:177— connect has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 13 function items inside it that branch (capture, a function literal at line 221, a function literal at line 186, …). 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.
DomTree::serialize_worklist (cyclomatic 19) crates/obscura-dom/src/serialize.rs:50— DomTree::serialize_worklist 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.
bootstrap._domEventDispatch (cyclomatic 19) REDACTED:2112— bootstrap._domEventDispatch 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.
bootstrap._serializeBody (cyclomatic 19) REDACTED:8437— bootstrap._serializeBody 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.
bootstrap._runIntersectionRenderCheckpoint (cyclomatic 19) REDACTED:11147— bootstrap._runIntersectionRenderCheckpoint has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body's own statements and 3 belong to 2 function items inside it that branch. 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.
bootstrap._cssHasInvalidSupportsValueSyntax (cyclomatic 19) REDACTED:13680— bootstrap._cssHasInvalidSupportsValueSyntax 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.
indexed_db._idbRun (cyclomatic 19) crates/obscura-js/js/indexed_db.js:302— indexed_db._idbRun 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.
SpanAttrs::to_attrs (cyclomatic 18) crates/obscura-render/src/inline.rs:2382— SpanAttrs::to_attrs 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.
Element._stepBy (cyclomatic 18) REDACTED:4920— Element._stepBy 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.
bootstrap._decodeDataScriptUrl (cyclomatic 18) REDACTED:343— bootstrap._decodeDataScriptUrl 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.
bootstrap._eventTargetAdd (cyclomatic 18) REDACTED:1963— bootstrap._eventTargetAdd has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Element.scrollTop (cyclomatic 17) REDACTED:5691— Element.scrollTop 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. This shape REPEATS in the file: one other method here (Element.scrollLeft) 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.
Element.scrollLeft (cyclomatic 17) REDACTED:5727— Element.scrollLeft 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. This shape REPEATS in the file: one other method here (Element.scrollTop) 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.
Range.deleteContents (cyclomatic 17) REDACTED:14842— Range.deleteContents 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.
Range.insertNode (cyclomatic 17) REDACTED:14888— Range.insertNode 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.
_Canvas2D.fill (cyclomatic 17) REDACTED:15937— _Canvas2D.fill has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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.
bootstrap._loadLinkedStylesheet (cyclomatic 17) REDACTED:676— bootstrap._loadLinkedStylesheet 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.
bootstrap._shallowCloneNode (cyclomatic 17) REDACTED:1933— bootstrap._shallowCloneNode 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.
bootstrap._collectInnerText (cyclomatic 17) REDACTED:3986— bootstrap._collectInnerText 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.
bootstrap._encodePNG (cyclomatic 17) REDACTED:15651— bootstrap._encodePNG has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
bootstrap.Node.lookupNamespaceURI (cyclomatic 17) REDACTED:18446— bootstrap.Node.lookupNamespaceURI 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.
RealmStates::frames_removed_by (cyclomatic 16) crates/obscura-js/src/ops.rs:1206— RealmStates::frames_removed_by 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.
paired-corpus.split_generated_id_variance (cyclomatic 16) render-repros/paired-corpus.py:1717— paired-corpus.split_generated_id_variance 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.
Node.textContent (cyclomatic 16) REDACTED:2823— Node.textContent 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.
Element.contentDocument (cyclomatic 16) REDACTED:5204— Element.contentDocument has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
bootstrap._fetchLinkedCss (cyclomatic 16) REDACTED:629— bootstrap._fetchLinkedCss has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, 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.
bootstrap._domEventInvoke (cyclomatic 16) REDACTED:2071— bootstrap._domEventInvoke 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.
bootstrap._preInsertConverted (cyclomatic 16) REDACTED:2593— bootstrap._preInsertConverted 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.
bootstrap._evaluateMediaDimension (cyclomatic 16) REDACTED:9645— bootstrap._evaluateMediaDimension 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.
bootstrap._evaluateOneMediaQuery (cyclomatic 16) REDACTED:9724— bootstrap._evaluateOneMediaQuery 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.
bootstrap._cssSplitWhitespace (cyclomatic 16) REDACTED:13700— bootstrap._cssSplitWhitespace 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.
bootstrap._cssSupportsConditionResult (cyclomatic 16) REDACTED:13974— bootstrap._cssSupportsConditionResult 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.
indexed_db._idbDispatch (cyclomatic 16) crates/obscura-js/js/indexed_db.js:24— indexed_db._idbDispatch has cyclomatic complexity 16 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TodoComment crates/obscura-render/src/inline.rs:3889— // TODO). Reapply the span alpha here so transparent and — 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.
Inner::command (cognitive 157) crates/obscura-js/src/indexed_db.rs:110— Inner::command has cognitive complexity 157 (threshold 15). Drivers by points: if/else 54 (119 pts), loops 8 (24 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paired-corpus.main (cognitive 150) render-repros/paired-corpus.py:2245— paired-corpus.main has cognitive complexity 150 (threshold 15). Drivers by points: if/else 37 (69 pts), ternaries 25 (48 pts), boolean chains 24, loops 2 (5 pts), error handling 2 (4 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Element.click (cognitive 91) REDACTED:4525— Element.click has cognitive complexity 91 (threshold 15). Drivers by points: if/else 24 (50 pts), boolean chains 18, ternaries 5 (11 pts), loops 3 (9 pts), error handling 1 (3 pts) (nesting depth added 40). 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.
bootstrap._cssSupportsDeclaration (cognitive 89) REDACTED:13572— bootstrap._cssSupportsDeclaration has cognitive complexity 89 (threshold 15). Drivers by points: if/else 46 (59 pts), boolean chains 19, ternaries 2 (5 pts), loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._splitTopLevelCssRules (cognitive 76) REDACTED:10052— bootstrap._splitTopLevelCssRules has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (61 pts), boolean chains 9, loops 4 (6 pts) (nesting depth added 43). Of this number, 67 points are the body's own statements and 9 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.
bootstrap._fetch (cognitive 71) REDACTED:8465— bootstrap._fetch has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 23 (34 pts), boolean chains 25, if/else 10, error handling 2 (nesting depth added 11). Of this number, 65 points are the body's own statements and 6 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.
Document.createTreeWalker (cognitive 67) REDACTED:6601— Document.createTreeWalker has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (43 pts), loops 9 (14 pts), boolean chains 8, ternaries 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.
bootstrap.__prepareInsertedScript (cognitive 66) REDACTED:2176— bootstrap.__prepareInsertedScript has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (30 pts), error handling 9 (20 pts), boolean chains 15, ternaries 1 (nesting depth added 21). Of this number, 57 points are the body's own statements and 9 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paired-corpus.compare_geometry_probes (cognitive 62) render-repros/paired-corpus.py:1938— paired-corpus.compare_geometry_probes has cognitive complexity 62 (threshold 15). Drivers by points: boolean chains 30, if/else 6 (14 pts), ternaries 5 (12 pts), loops 3 (6 pts) (nesting depth added 18). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
bootstrap._xmlWellFormed (cognitive 57) REDACTED:12319— bootstrap._xmlWellFormed has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (51 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DocumentWriteStream::mirror (cognitive 54) crates/obscura-js/src/write_stream.rs:92— DocumentWriteStream::mirror has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 4 (9 pts), match/switch 3 (7 pts) (nesting depth added 34). 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.
bootstrap._rebaseCssUrls (cognitive 53) REDACTED:552— bootstrap._rebaseCssUrls has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 10, error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (2 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.
bootstrap._cssSupportsSelector (cognitive 50) REDACTED:13907— bootstrap._cssSupportsSelector has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 10, loops 2 (4 pts) (nesting depth added 18). Most of this is not in the body itself: 5 of the 50 points are its own statements and the rest belongs to one function literal inside it that branches (line 13913). 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.
bootstrap._inputParseNumber (cognitive 47) REDACTED:3401— bootstrap._inputParseNumber has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (27 pts), ternaries 5 (14 pts), boolean chains 5, match/switch 1 (nesting depth added 25). 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.
check.main (cognitive 46) render-repros/check.py:205— check.main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 6 (16 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ScrollPaintState::overflow_clip_for (cognitive 43) crates/obscura-render/src/paint.rs:6014— ScrollPaintState::overflow_clip_for has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (4 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.
paired-corpus.compare_feature_probes (cognitive 43) render-repros/paired-corpus.py:2085— paired-corpus.compare_feature_probes has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 27, if/else 3 (7 pts), ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 9). 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.
StealthHttpClient::fetch_with_profile (cognitive 42) crates/obscura-net/src/wreq_client.rs:317— StealthHttpClient::fetch_with_profile has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 4 (8 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.
_Canvas2D.fill (cognitive 42) REDACTED:15937— _Canvas2D.fill has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (22 pts), if/else 7 (19 pts), boolean chains 1 (nesting depth added 26). Of this number, 41 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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.
bootstrap._structuredClone (cognitive 42) REDACTED:12955— bootstrap._structuredClone has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (30 pts), loops 4 (6 pts), boolean chains 5, ternaries 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.
pr_policy.check_workflows (cognitive 41) scripts/ci/pr_policy.py:113— pr_policy.check_workflows has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DOMParser.parseFromString (cognitive 41) REDACTED:12368— DOMParser.parseFromString has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 14, error handling 5 (7 pts), ternaries 4, loops 1 (nesting depth added 4). Of this number, 26 points are the body's own statements and 15 belong to 7 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
bootstrap._queueMutationRecord (cognitive 41) REDACTED:10827— bootstrap._queueMutationRecord has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Element._navigateSubmit (cognitive 40) REDACTED:5361— Element._navigateSubmit has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 12, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._elementClassForKnownName (cognitive 40) REDACTED:7665— bootstrap._elementClassForKnownName has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FormData.constructor (cognitive 39) REDACTED:12142— FormData.constructor has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 3 (11 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
bootstrap._splitCssDeclarations (cognitive 39) REDACTED:1761— bootstrap._splitCssDeclarations has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 5, loops 1 (nesting depth added 17). Of this number, 38 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._cssSupportsContent (cognitive 39) REDACTED:13736— bootstrap._cssSupportsContent has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Element.setAttribute (cognitive 37) REDACTED:4274— Element.setAttribute has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 12, ternaries 4 (5 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.
_Canvas2D.stroke (cognitive 37) REDACTED:15987— _Canvas2D.stroke has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (6 pts), boolean chains 4, ternaries 2 (nesting depth added 14). Of this number, 23 points are the body's own statements and 14 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.
Element.value (cognitive 36) REDACTED:4799— Element.value has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 5 (15 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Node.cloneNode (cognitive 35) REDACTED:2931— Node.cloneNode has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (10 pts), boolean chains 5, ternaries 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.
bootstrap._eventTargetDispatch (cognitive 33) REDACTED:2017— bootstrap._eventTargetDispatch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 4, error handling 2 (4 pts), loops 1, ternaries 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.
bootstrap._xpathFindNodes (cognitive 33) REDACTED:6177— bootstrap._xpathFindNodes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, loops 3 (4 pts), ternaries 2 (nesting depth added 12). Most of this is not in the body itself: 13 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 6194). 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.
paired-corpus.classify_state_comparability (cognitive 32) render-repros/paired-corpus.py:1442— paired-corpus.classify_state_comparability has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 17, if/else 10 (11 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Element.scrollTo (cognitive 32) REDACTED:5929— Element.scrollTo has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 11, ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._insertWrittenNodes (cognitive 32) REDACTED:6969— bootstrap._insertWrittenNodes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, ternaries 2 (4 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.
_idbOpen::attempt (cognitive 32) crates/obscura-js/js/indexed_db.js:675— _idbOpen::attempt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), error handling 2 (4 pts), boolean chains 3, other 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IntersectionObserver._entry (cognitive 31) REDACTED:11338— IntersectionObserver._entry has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 10, ternaries 5 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._consoleRemoteObject (cognitive 31) REDACTED:880— bootstrap._consoleRemoteObject has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 8, ternaries 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.
bootstrap._elementClassFor (cognitive 31) REDACTED:7623— bootstrap._elementClassFor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 10 (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.
compare_obstacle.main (cognitive 30) scripts/ci/compare_obstacle.py:57— compare_obstacle.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
Node.compareDocumentPosition (cognitive 30) REDACTED:2980— Node.compareDocumentPosition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 5 (12 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Element.removeAttribute (cognitive 30) REDACTED:4334— Element.removeAttribute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 12, ternaries 4 (5 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
bootstrap._normalizeWaapiKeyframes (cognitive 29) REDACTED:3700— bootstrap._normalizeWaapiKeyframes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, loops 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 7). Of this number, 21 points are the body's own statements and 8 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap.getComputedStyle (cognitive 29) REDACTED:9802— bootstrap.getComputedStyle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 29 (36 pts), boolean chains 19, ternaries 11 (19 pts), error handling 2 (3 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. This shape REPEATS in the file: one other method here (bootstrap.getComputedStyle::dimensionFor) 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.
bootstrap.perf.measure (cognitive 29) REDACTED:12742— bootstrap.perf.measure has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, ternaries 5 (7 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.
bootstrap._rngCopyContents (cognitive 29) REDACTED:14679— bootstrap._rngCopyContents has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 7 (10 pts), boolean chains 4, loops 2 (nesting depth added 5). Of this number, 20 points are the body's own statements and 9 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
indexed_db._idbWrite (cognitive 29) crates/obscura-js/js/indexed_db.js:428— indexed_db._idbWrite has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 10). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 439). 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.
bootstrap._decodeDataScriptUrl (cognitive 28) REDACTED:343— bootstrap._decodeDataScriptUrl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 2 (4 pts), ternaries 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.
bootstrap._cssSplitTopLevel (cognitive 28) REDACTED:13842— bootstrap._cssSplitTopLevel has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 7, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap.Node.lookupPrefix (cognitive 28) REDACTED:18468— bootstrap.Node.lookupPrefix has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 7, loops 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.
NonGeometricStyleCache::resolve_style (cognitive 27) crates/obscura-render/src/dom.rs:4600— NonGeometricStyleCache::resolve_style has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HTMLImageElement._applyImageMetadata (cognitive 27) REDACTED:7426— HTMLImageElement._applyImageMetadata has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), error handling 2 (6 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._domEventInvoke (cognitive 27) REDACTED:2071— bootstrap._domEventInvoke has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 2 (5 pts), boolean chains 4, 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.
bootstrap._ensureDocumentChildValidity (cognitive 27) REDACTED:2535— bootstrap._ensureDocumentChildValidity has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 7). Of this number, 20 points are the body's own statements and 7 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.
bootstrap._normalizeWaapiTiming (cognitive 27) REDACTED:3755— bootstrap._normalizeWaapiTiming has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, ternaries 7 (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.
obscura_ssrf::is_forbidden_ip (cognitive 26) crates/obscura-ssrf/src/lib.rs:35— obscura_ssrf::is_forbidden_ip has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 15, if/else 5 (10 pts), 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.
Range.toString (cognitive 26) REDACTED:14817— Range.toString has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 11, loops 1 (2 pts) (nesting depth added 6). Of this number, 13 points are the body's own statements and 13 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.
bootstrap._base64ToUint8Array (cognitive 26) REDACTED:8332— bootstrap._base64ToUint8Array has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._checkXmlWellFormed (cognitive 26) REDACTED:12255— bootstrap._checkXmlWellFormed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._cssSupportsColor (cognitive 26) REDACTED:13502— bootstrap._cssSupportsColor has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 10 (12 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
bootstrap.Node.lookupNamespaceURI (cognitive 26) REDACTED:18446— bootstrap.Node.lookupNamespaceURI has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 7, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_idbDispatch (cognitive 26) crates/obscura-js/js/indexed_db.js:24— _idbDispatch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 11). Of this number, 21 points are the body's own statements and 5 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.
Node.isEqualNode (cognitive 25) REDACTED:3056— Node.isEqualNode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, loops 2 (3 pts), ternaries 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.
Element._loadIframeSrc (cognitive 25) REDACTED:5120— Element._loadIframeSrc has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, error handling 2 (3 pts) (nesting depth added 4). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5138, 5173). 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.
Element.checkVisibility (cognitive 25) REDACTED:5818— Element.checkVisibility has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Element._scrollIntoView (cognitive 25) REDACTED:5877— Element._scrollIntoView has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (12 pts), loops 1 (nesting depth added 2). Of this number, 14 points are the body's own statements and 11 belong to one function item inside it that branches. 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.
PerformanceObserver.observe (cognitive 25) REDACTED:12815— PerformanceObserver.observe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, loops 1 (2 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Range.deleteContents (cognitive 25) REDACTED:14842— Range.deleteContents has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 6 (12 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.
_Canvas2D.fillText (cognitive 25) REDACTED:15843— _Canvas2D.fillText has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (17 pts), boolean chains 4, if/else 1 (4 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.
_Canvas2D._resolvePaint (cognitive 25) REDACTED:16053— _Canvas2D._resolvePaint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 13). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 3 function items inside it that branch (lerp, a function literal at line 16073, a function literal at line 16080). 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.
bootstrap._runResizeRenderCheckpoint (cognitive 25) REDACTED:9226— bootstrap._runResizeRenderCheckpoint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (10 pts), boolean chains 2, error handling 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.
MutationObserver.observe (cognitive 24) REDACTED:10766— MutationObserver.observe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, boolean chains 7, ternaries 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.
bootstrap.__runDynScriptTask (cognitive 24) REDACTED:423— bootstrap.__runDynScriptTask has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 4 (7 pts), boolean chains 1 (nesting depth added 11). Of this number, 17 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._preInsertConverted (cognitive 24) REDACTED:2593— bootstrap._preInsertConverted has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), ternaries 2 (7 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
bootstrap._cssHasInvalidSupportsValueSyntax (cognitive 24) REDACTED:13680— bootstrap._cssHasInvalidSupportsValueSyntax has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, 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.
_idbPrepare (cognitive 24) crates/obscura-js/js/indexed_db.js:157— _idbPrepare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_idbRun (cognitive 24) crates/obscura-js/js/indexed_db.js:302— _idbRun has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, ternaries 2 (4 pts), error handling 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.
Element.href (cognitive 23) REDACTED:5035— Element.href has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (7 pts), boolean chains 5 (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.
bootstrap._browserPostedTaskRunOne (cognitive 23) REDACTED:1300— bootstrap._browserPostedTaskRunOne has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), error handling 2 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._domEventDispatch (cognitive 23) REDACTED:2112— bootstrap._domEventDispatch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, 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.
bootstrap._cssEnclosingGroup (cognitive 23) REDACTED:13821— bootstrap._cssEnclosingGroup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (4 pts), boolean chains 1, 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.
XMLHttpRequest.send (cognitive 22) REDACTED:8689— XMLHttpRequest.send has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, error handling 1 (2 pts), ternaries 2, match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 8705, 8761). 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.
bootstrap._roMeasurement (cognitive 22) REDACTED:9292— bootstrap._roMeasurement has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, ternaries 8, if/else 3, error handling 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
bootstrap.__obscura_init (cognitive 22) REDACTED:18319— bootstrap.__obscura_init has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7, boolean chains 6, loops 4, if/else 2 (3 pts), error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ContainerQueryEvaluator::evaluate_query (cognitive 21) crates/obscura-render/src/css.rs:2242— ContainerQueryEvaluator::evaluate_query has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
perf_smoke.main (cognitive 21) scripts/ci/perf_smoke.py:146— perf_smoke.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (7 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._runIntersectionRenderCheckpoint (cognitive 21) REDACTED:11147— bootstrap._runIntersectionRenderCheckpoint has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (10 pts), boolean chains 6, if/else 3 (5 pts) (nesting depth added 6). Of this number, 18 points are the body's own statements and 3 belong to 2 function items inside it that branch. 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.
RealmStates::frames_removed_by (cognitive 20) crates/obscura-js/src/ops.rs:1206— RealmStates::frames_removed_by has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (3 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.
paired-corpus.split_generated_id_variance (cognitive 20) render-repros/paired-corpus.py:1717— paired-corpus.split_generated_id_variance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Node.normalize (cognitive 20) REDACTED:3028— Node.normalize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 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.
Element.scrollTop (cognitive 20) REDACTED:5691— Element.scrollTop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Element.scrollLeft) 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.
Element.scrollLeft (cognitive 20) REDACTED:5727— Element.scrollLeft has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Element.scrollTop) 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.
Response.constructor (cognitive 20) REDACTED:9007— Response.constructor has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (10 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
XMLSerializer.serializeToString (cognitive 20) REDACTED:12539— XMLSerializer.serializeToString has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._loadLinkedStylesheet (cognitive 20) REDACTED:676— bootstrap._loadLinkedStylesheet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 4 (5 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
bootstrap._isActuallyDisabled (cognitive 20) REDACTED:3516— bootstrap._isActuallyDisabled has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._collectInnerText (cognitive 20) REDACTED:3986— bootstrap._collectInnerText has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
bootstrap._evaluateOneMediaQuery (cognitive 20) REDACTED:9724— bootstrap._evaluateOneMediaQuery has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap.getComputedStyle::dimensionFor (cognitive 20) REDACTED:9849— bootstrap.getComputedStyle::dimensionFor has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 1, error handling 1, if/else 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (bootstrap.getComputedStyle) 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.
bootstrap._cssSplitWhitespace (cognitive 20) REDACTED:13700— bootstrap._cssSplitWhitespace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._cssHasTopLevelComma (cognitive 20) REDACTED:13879— bootstrap._cssHasTopLevelComma has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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.
connect (cognitive 20) tools/live-view.mjs:177— connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), error handling 5, boolean chains 4, ternaries 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 13 function items inside it that branch (capture, a function literal at line 221, a function literal at line 186, …). 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.
ObscuraModuleLoader::load (cognitive 19) crates/obscura-js/src/module_loader.rs:191— ObscuraModuleLoader::load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (8 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.
Document.createNodeIterator (cognitive 19) REDACTED:6747— Document.createNodeIterator has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._shallowCloneNode (cognitive 19) REDACTED:1933— bootstrap._shallowCloneNode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (6 pts), boolean chains 5, 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.
bootstrap._serializeBody (cognitive 19) REDACTED:8437— bootstrap._serializeBody has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, ternaries 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.
bootstrap._splitMediaAnd (cognitive 19) REDACTED:9599— bootstrap._splitMediaAnd has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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.
bootstrap._cssSupportsConditionResult (cognitive 19) REDACTED:13974— bootstrap._cssSupportsConditionResult has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, ternaries 4 (8 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_idbCompare (cognitive 19) crates/obscura-js/js/indexed_db.js:100— _idbCompare has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4 (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.
AccessibilityContext::new (cognitive 18) crates/obscura-browser/src/accessibility.rs:278— AccessibilityContext::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paired-corpus.parse_obscura_capture_report (cognitive 18) render-repros/paired-corpus.py:492— paired-corpus.parse_obscura_capture_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Element.contentDocument (cognitive 18) REDACTED:5204— Element.contentDocument has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 4). Of this number, 14 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
bootstrap._consoleFn (cognitive 18) REDACTED:922— bootstrap._consoleFn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 3 (5 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 5). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 924, 943). 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.
bootstrap._splitMediaQueryList (cognitive 18) REDACTED:9574— bootstrap._splitMediaQueryList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._evaluateMediaDimension (cognitive 18) REDACTED:9645— bootstrap._evaluateMediaDimension has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._cssSupportsSingleUrl (cognitive 18) REDACTED:13780— bootstrap._cssSupportsSingleUrl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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.
bootstrap._cssBalancedSupportsSyntax (cognitive 18) REDACTED:13953— bootstrap._cssBalancedSupportsSyntax has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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.
bootstrap._encodePNG (cognitive 18) REDACTED:15651— bootstrap._encodePNG has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (12 pts), ternaries 2 (4 pts), boolean chains 1, if/else 1 (nesting depth added 6). Of this number, 17 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
bootstrap._windowScroll (cognitive 18) REDACTED:16599— bootstrap._windowScroll has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 7, error handling 1. Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, 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.
indexed_db._idbKey (cognitive 18) crates/obscura-js/js/indexed_db.js:79— indexed_db._idbKey has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, ternaries 2 (4 pts), loops 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.
FrameRealm::run_document_scripts (cognitive 17) crates/obscura-js/src/frame.rs:310— FrameRealm::run_document_scripts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Node.textContent (cognitive 17) REDACTED:2823— Node.textContent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
Element.insertAdjacentHTML (cognitive 17) REDACTED:4429— Element.insertAdjacentHTML has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (4 pts), boolean chains 1, match/switch 1, ternaries 1 (nesting depth added 8). 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.
Element._stepBy (cognitive 17) REDACTED:4920— Element._stepBy has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Request.constructor (cognitive 17) REDACTED:8938— Request.constructor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 6, ternaries 1. 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.
Worker.constructor (cognitive 17) REDACTED:16406— Worker.constructor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 pts), boolean chains 2 (nesting depth added 8). Of this number, 10 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._dom (cognitive 17) REDACTED:168— bootstrap._dom has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap.__prepareInsertedSubtree (cognitive 17) REDACTED:2347— bootstrap.__prepareInsertedSubtree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._ensureInsertionValidity (cognitive 17) REDACTED:2490— bootstrap._ensureInsertionValidity has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6, ternaries 1 (2 pts) (nesting depth added 1). 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.
bootstrap._plainInsertionNodes (cognitive 17) REDACTED:2612— bootstrap._plainInsertionNodes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, 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.
bootstrap._labeledControl (cognitive 17) REDACTED:3462— bootstrap._labeledControl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 4 (6 pts), boolean chains 5 (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.
bootstrap._xpathPredicateParts (cognitive 17) REDACTED:6152— bootstrap._xpathPredicateParts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._syncAdoptedStyles (cognitive 17) REDACTED:10613— bootstrap._syncAdoptedStyles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (nesting depth added 4). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bootstrap._installCaretGeometry (cognitive 17) REDACTED:18202— bootstrap._installCaretGeometry has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5, ternaries 3, loops 1. Of this number, 11 points are the body's own statements and 6 belong to 5 function items inside it that branch. 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.
_idbCursorNext (cognitive 17) crates/obscura-js/js/indexed_db.js:575— _idbCursorNext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (7 pts), boolean chains 3 (nesting depth added 4). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 581, 580, 578). 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.
CssCounterState::render (cognitive 16) crates/obscura-render/src/dom.rs:3147— CssCounterState::render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SpanAttrs::to_attrs (cognitive 16) crates/obscura-render/src/inline.rs:2382— SpanAttrs::to_attrs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, 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.
paired-corpus.attach_chromium_box_quads (cognitive 16) render-repros/paired-corpus.py:1045— paired-corpus.attach_chromium_box_quads has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (5 pts), error handling 2 (3 pts), loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Document.contentType (cognitive 16) REDACTED:6373— Document.contentType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
URLSearchParams._decode (cognitive 16) REDACTED:12206— URLSearchParams._decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Canvas2D.drawImage (cognitive 16) REDACTED:15912— _Canvas2D.drawImage has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 2 (5 pts), loops 2 (5 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.
bootstrap._cssTopLevelComma (cognitive 16) REDACTED:13554— bootstrap._cssTopLevelComma has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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.
bootstrap.URL.createObjectURL (cognitive 16) REDACTED:16530— bootstrap.URL.createObjectURL has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 5, error handling 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 2). Of this number, 14 points are the body's own statements and 2 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.
indexed_db._idbRevive (cognitive 16) crates/obscura-js/js/indexed_db.js:193— indexed_db._idbRevive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×1
REDACTED
D30 · Dependency Vulnerabilities· Medium vulnerability · ×1
REDACTED
D4 · Code Duplication· Near-duplicate member family (3 members, 8 shared lines) · ×1
Near-duplicate member family (3 members, 8 shared lines) crates/obscura-render/src/style.rs:834— crates/obscura-render/src/style.rs:834-1981 | crates/obscura-render/src/style.rs:7693-7706 | crates/obscura-render/src/style.rs:7723-7736 — These 3 members are variants of one another: a block of 8 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
Duplicated block (45–56 lines × 2) crates/obscura-render/src/dom.rs:7499— crates/obscura-render/src/dom.rs:7499-7554 | crates/obscura-render/src/dom.rs:7629-7673 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (48–54 lines × 2) crates/obscura-render/src/dom.rs:7416— crates/obscura-render/src/dom.rs:7416-7469 | crates/obscura-render/src/dom.rs:7557-7604 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (51 lines × 2) crates/obscura-render/src/css.rs:3328— crates/obscura-render/src/css.rs:3328-3378 | crates/obscura-render/src/css.rs:3393-3443 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (44 lines × 2) crates/obscura-render/src/paint.rs:10248— crates/obscura-render/src/paint.rs:10248-10291 | crates/obscura-render/src/paint.rs:10403-10446 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (41–42 lines × 2) crates/obscura-js/src/ops.rs:4510— crates/obscura-js/src/ops.rs:4510-4551 | crates/obscura-js/src/ops.rs:4765-4805 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (40 lines × 2) crates/obscura-render/src/style.rs:6660— crates/obscura-render/src/style.rs:6660-6699 | crates/obscura-render/src/style.rs:6873-6912 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (33–36 lines × 2) crates/obscura-net/src/cookies.rs:133— crates/obscura-net/src/cookies.rs:133-168 | crates/obscura-net/src/cookies.rs:456-488 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (33 lines × 2) crates/obscura-render/src/paint.rs:9377— crates/obscura-render/src/paint.rs:9377-9409 | crates/obscura-render/src/paint.rs:9618-9650 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (31–32 lines × 2) crates/obscura-render/src/paint.rs:9482— crates/obscura-render/src/paint.rs:9482-9513 | crates/obscura-render/src/paint.rs:9723-9753 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (32 lines × 2) crates/obscura-render/src/style.rs:2711— crates/obscura-render/src/style.rs:2711-2742 | crates/obscura-render/src/style.rs:2757-2788 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24–31 lines × 2) crates/obscura-js/src/ops.rs:4451— crates/obscura-js/src/ops.rs:4451-4481 | crates/obscura-js/src/ops.rs:4726-4749 — both copies are in the same file, so extract the block into 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) crates/obscura-browser/src/page.rs:2853— crates/obscura-browser/src/page.rs:2853-2880 | crates/obscura-browser/src/page.rs:2933-2961 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (29 lines × 2) crates/obscura-render/src/style.rs:6706— crates/obscura-render/src/style.rs:6706-6734 | crates/obscura-render/src/style.rs:6921-6949 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (26–28 lines × 2) crates/obscura-browser/src/page.rs:531— crates/obscura-browser/src/page.rs:531-558 | crates/obscura-browser/src/page.rs:655-680 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (25 lines × 2) crates/obscura-render/src/paint.rs:5781— crates/obscura-render/src/paint.rs:5781-5805 | crates/obscura-render/src/paint.rs:9474-9498 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (23–24 lines × 3) crates/obscura-render/src/paint.rs:5786— crates/obscura-render/src/paint.rs:5786-5808 | crates/obscura-render/src/paint.rs:9479-9502 | crates/obscura-render/src/paint.rs:9720-9742 — 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 (24 lines × 2) crates/obscura-cli/src/main.rs:1936— crates/obscura-cli/src/main.rs:1936-1959 | crates/obscura-mcp/src/lib.rs:2028-2051 — before extracting anything, compare `crates/obscura-cli/src/main.rs` and `crates/obscura-mcp/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (21–24 lines × 2) crates/obscura-render/src/dom.rs:5834— crates/obscura-render/src/dom.rs:5834-5857 | crates/obscura-render/src/dom.rs:6380-6400 — both copies are in the same file, so extract the block into 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–23 lines × 2) crates/obscura-cli/src/main.rs:2009— crates/obscura-cli/src/main.rs:2009-2031 | crates/obscura-mcp/src/lib.rs:2068-2088 — before extracting anything, compare `crates/obscura-cli/src/main.rs` and `crates/obscura-mcp/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (20–23 lines × 2) crates/obscura-render/src/inline.rs:3751— crates/obscura-render/src/inline.rs:3751-3773 | crates/obscura-render/src/inline.rs:3860-3879 — both copies are in the same file, so extract the block into 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–22 lines × 2) crates/obscura-cdp/src/server.rs:1324— crates/obscura-cdp/src/server.rs:1324-1345 | crates/obscura-cdp/src/server.rs:1437-1450 — both copies are in the same file, so extract the block into 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 × 3) crates/obscura-render/src/css.rs:2862— crates/obscura-render/src/css.rs:2862-2886 | crates/obscura-render/src/css.rs:2905-2925 | crates/obscura-render/src/css.rs:2944-2964 — 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 (19–20 lines × 2) crates/obscura-render/src/dom.rs:5635— crates/obscura-render/src/dom.rs:5635-5654 | crates/obscura-render/src/dom.rs:6446-6464 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 4) crates/obscura-browser/src/page.rs:761— crates/obscura-browser/src/page.rs:761-778 | crates/obscura-render/src/style.rs:2877-2894 | crates/obscura-render/src/style.rs:2928-2945 | crates/obscura-render/src/style.rs:8329-8346 — before extracting anything, compare `crates/obscura-browser/src/page.rs` and `crates/obscura-render/src/style.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 3) crates/obscura-render/src/paint.rs:4805— crates/obscura-render/src/paint.rs:4805-4822 | crates/obscura-render/src/paint.rs:5753-5770 | crates/obscura-render/src/paint.rs:9446-9463 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (17 lines × 5) crates/obscura-browser/src/page.rs:759— crates/obscura-browser/src/page.rs:759-775 | crates/obscura-browser/src/page.rs:799-815 | crates/obscura-render/src/style.rs:2875-2891 | crates/obscura-render/src/style.rs:2926-2942 | crates/obscura-render/src/style.rs:8327-8343 — before extracting anything, compare `crates/obscura-browser/src/page.rs` and `crates/obscura-render/src/style.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 3) crates/obscura-render/src/style.rs:2678— crates/obscura-render/src/style.rs:2678-2694 | crates/obscura-render/src/style.rs:2715-2731 | crates/obscura-render/src/style.rs:2761-2777 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (13–17 lines × 2) crates/obscura-dom/src/selector.rs:730— crates/obscura-dom/src/selector.rs:730-746 | crates/obscura-dom/src/selector.rs:779-791 — both copies are in the same file, so extract the block into 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 × 6) crates/obscura-browser/src/page.rs:759— crates/obscura-browser/src/page.rs:759-774 | crates/obscura-browser/src/page.rs:799-814 | crates/obscura-render/src/css.rs:6732-6747 | crates/obscura-render/src/style.rs:2875-2890 | crates/obscura-render/src/style.rs:2926-2941 | crates/obscura-render/src/style.rs:8327-8342 — before extracting anything, compare `crates/obscura-browser/src/page.rs` and `crates/obscura-render/src/style.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15–16 lines × 2) crates/obscura-render/src/paint.rs:11841— crates/obscura-render/src/paint.rs:11841-11856 | crates/obscura-render/src/paint.rs:11953-11967 — both copies are in the same file, so extract the block into 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 × 3) crates/obscura-render/src/css.rs:3328— crates/obscura-render/src/css.rs:3328-3342 | crates/obscura-render/src/css.rs:3393-3407 | crates/obscura-render/src/css.rs:3707-3721 — 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–15 lines × 3) crates/obscura-render/src/dom.rs:15137— crates/obscura-render/src/dom.rs:15137-15147 | crates/obscura-render/src/dom.rs:15330-15340 | crates/obscura-render/src/dom.rs:15358-15372 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14 lines × 4) crates/obscura-render/src/css.rs:521— crates/obscura-render/src/css.rs:521-534 | crates/obscura-render/src/css.rs:576-589 | crates/obscura-render/src/css.rs:771-784 | crates/obscura-render/src/css.rs:1449-1462 — 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 (12–14 lines × 2) crates/obscura-render/src/dom.rs:7799— crates/obscura-render/src/dom.rs:7799-7810 | crates/obscura-render/src/dom.rs:7816-7829 — both copies are in the same file, so extract the block into 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 × 7) crates/obscura-render/src/css.rs:520— crates/obscura-render/src/css.rs:520-532 | crates/obscura-render/src/css.rs:575-587 | crates/obscura-render/src/css.rs:770-782 | crates/obscura-render/src/css.rs:1012-1024 | crates/obscura-render/src/css.rs:1052-1064 | crates/obscura-render/src/css.rs:1091-1103 | crates/obscura-render/src/css.rs:1448-1460 — 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 (13 lines × 3) crates/obscura-render/src/paint.rs:5681— crates/obscura-render/src/paint.rs:5681-5693 | crates/obscura-render/src/paint.rs:9377-9389 | crates/obscura-render/src/paint.rs:9618-9630 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–13 lines × 2) crates/obscura-dom/src/tree.rs:1230— crates/obscura-dom/src/tree.rs:1230-1239 | crates/obscura-dom/src/tree.rs:1252-1264 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/css.rs:3108— crates/obscura-render/src/css.rs:3108-3119 | crates/obscura-render/src/css.rs:3332-3343 | crates/obscura-render/src/css.rs:3397-3408 | crates/obscura-render/src/css.rs:3711-3722 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8–12 lines × 4) crates/obscura-render/src/dom.rs:15141— crates/obscura-render/src/dom.rs:15141-15148 | crates/obscura-render/src/dom.rs:15250-15257 | crates/obscura-render/src/dom.rs:15334-15341 | crates/obscura-render/src/dom.rs:15362-15373 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–12 lines × 3) crates/obscura-js/src/runtime.rs:1335— crates/obscura-js/src/runtime.rs:1335-1346 | crates/obscura-js/src/runtime.rs:2257-2268 | crates/obscura-js/src/runtime.rs:4082-4090 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–12 lines × 2) crates/obscura-cdp/src/domains/page.rs:1032— crates/obscura-cdp/src/domains/page.rs:1032-1040 | crates/obscura-cdp/src/domains/page.rs:1222-1233 — both copies are in the same file, so extract the block into 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–12 lines × 2) crates/obscura-js/src/ops.rs:4235— crates/obscura-js/src/ops.rs:4235-4246 | crates/obscura-js/src/ops.rs:4415-4425 — both copies are in the same file, so extract the block into 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–12 lines × 2) crates/obscura-net/src/robots.rs:116— crates/obscura-net/src/robots.rs:116-127 | crates/obscura-net/src/robots.rs:149-158 — both copies are in the same file, so extract the block into 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–11 lines × 2) crates/obscura-browser/src/page.rs:837— crates/obscura-browser/src/page.rs:837-845 | crates/obscura-render/src/paint.rs:7995-8005 — before extracting anything, compare `crates/obscura-browser/src/page.rs` and `crates/obscura-render/src/paint.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8–11 lines × 2) crates/obscura-render/src/css.rs:3770— crates/obscura-render/src/css.rs:3770-3780 | crates/obscura-render/src/css.rs:3788-3795 — both copies are in the same file, so extract the block into 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 × 3) crates/obscura-render/src/paint.rs:10636— crates/obscura-render/src/paint.rs:10636-10645 | crates/obscura-render/src/paint.rs:11076-11085 | crates/obscura-render/src/paint.rs:11773-11782 — 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) crates/obscura-render/src/paint.rs:10568— crates/obscura-render/src/paint.rs:10568-10577 | crates/obscura-render/src/paint.rs:10605-10612 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/style.rs:7556— crates/obscura-render/src/style.rs:7556-7564 | crates/obscura-render/src/style.rs:8155-8164 — both copies are in the same file, so extract the block into 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) crates/obscura-render/src/dom.rs:7429— crates/obscura-render/src/dom.rs:7429-7439 | crates/obscura-render/src/dom.rs:7524-7533 | crates/obscura-render/src/dom.rs:7570-7579 | crates/obscura-render/src/dom.rs:7651-7659 — 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–9 lines × 3) crates/obscura-cdp/src/domains/dom.rs:97— crates/obscura-cdp/src/domains/dom.rs:97-103 | crates/obscura-cdp/src/domains/dom.rs:309-317 | crates/obscura-cdp/src/domains/dom.rs:337-345 — 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 × 4) crates/obscura-render/src/inline.rs:1891— crates/obscura-render/src/inline.rs:1891-1898 | crates/obscura-render/src/inline.rs:2992-2999 | crates/obscura-render/src/inline.rs:3738-3745 | crates/obscura-render/src/inline.rs:3850-3857 — 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 (2–8 lines × 4) crates/obscura-render/src/paint.rs:4730— crates/obscura-render/src/paint.rs:4730-4737 | crates/obscura-render/src/paint.rs:5678-5685 | crates/obscura-render/src/paint.rs:9374-9381 | crates/obscura-render/src/paint.rs:9615-9616 — 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) crates/obscura-js/src/runtime.rs:2672— crates/obscura-js/src/runtime.rs:2672-2679 | crates/obscura-js/src/runtime.rs:2757-2763 — both copies are in the same file, so extract the block into 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 × 3) crates/obscura-render/src/dom.rs:6119— crates/obscura-render/src/dom.rs:6119-6124 | crates/obscura-render/src/dom.rs:6141-6146 | crates/obscura-render/src/dom.rs:6335-6340 — 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–6 lines × 2) crates/obscura-render/src/style.rs:8224— crates/obscura-render/src/style.rs:8224-8228 | crates/obscura-render/src/style.rs:8232-8237 — both copies are in the same file, so extract the block into 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–5 lines × 3) crates/obscura-render/src/style.rs:1912— crates/obscura-render/src/style.rs:1912-1916 | crates/obscura-render/src/style.rs:4607-4611 | crates/obscura-render/src/style.rs:4627-4630 — 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 (25 lines × 3) crates/obscura-cdp/src/domains/input.rs:163— crates/obscura-cdp/src/domains/input.rs:163-187 | crates/obscura-cdp/src/domains/input.rs:243-337 | crates/obscura-cdp/src/domains/input.rs:355-398 — 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 (3–11 lines × 3) crates/obscura-render/src/style.rs:216— crates/obscura-render/src/style.rs:216-226 | crates/obscura-render/src/style.rs:245-256 | crates/obscura-render/src/style.rs:275-277 — 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 × 5) crates/obscura-js/src/ops.rs:2661— crates/obscura-js/src/ops.rs:2661-2668 | crates/obscura-js/src/ops.rs:2671-2681 | crates/obscura-js/src/ops.rs:2684-2691 | crates/obscura-js/src/ops.rs:3118-3125 | crates/obscura-js/src/ops.rs:3129-3136 — 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 (10 lines × 5) crates/obscura-render/src/style.rs:1617— crates/obscura-render/src/style.rs:1617-1626 | crates/obscura-render/src/style.rs:1632-1641 | crates/obscura-render/src/style.rs:1647-1656 | crates/obscura-render/src/style.rs:1662-1671 | crates/obscura-render/src/style.rs:1677-1686 — 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 (10 lines × 6) crates/obscura-render/src/style.rs:1600— crates/obscura-render/src/style.rs:1600-1609 | crates/obscura-render/src/style.rs:1617-1626 | crates/obscura-render/src/style.rs:1632-1641 | crates/obscura-render/src/style.rs:1647-1656 | crates/obscura-render/src/style.rs:1662-1671 | crates/obscura-render/src/style.rs:1677-1686 — 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 (5 lines × 6) crates/obscura-render/src/style.rs:101— crates/obscura-render/src/style.rs:101-105 | crates/obscura-render/src/style.rs:107-111 | crates/obscura-render/src/style.rs:113-117 | crates/obscura-render/src/style.rs:119-123 | crates/obscura-render/src/style.rs:125-129 | crates/obscura-render/src/style.rs:131-135 — 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 (22–26 lines × 2) render-repros/paired-corpus.py:2756— render-repros/paired-corpus.py:2756-2777 | render-repros/paired-corpus.py:2798-2823 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `render-repros/paired-corpus.py:2756` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Sync-over-async blocking crates/obscura-cdp/src/server.rs:328— `start_with_serve_options_limit_and_ready_file` is async and calls thread::sleep, block_on — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs.
Weak hash algorithm crates/obscura-js/src/ops.rs:6921— MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`sha2::Sha256::digest(…)`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
Interpolated log message defeats structured logging crates/obscura-net/src/client.rs:1414— `debug!` at line 1414 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 crates/obscura-net/src/client.rs:1536— `debug!` at line 1536 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 crates/obscura-net/src/client.rs:1558— `debug!` at line 1558 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 crates/obscura-net/src/wreq_client.rs:332— `debug!` at line 332 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 crates/obscura-net/src/wreq_client.rs:531— `debug!` at line 531 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 crates/obscura-mcp/src/http.rs:285— `info!` at line 285 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 crates/obscura-mcp/src/http.rs:305— `debug!` at line 305 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 crates/obscura-mcp/src/http.rs:318— `debug!` at line 318 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 crates/obscura-mcp/src/http.rs:337— `warn!` at line 337 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 crates/obscura-js/src/module_loader.rs:263— `debug!` at line 263 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 crates/obscura-js/src/ops.rs:3360— `warn!` at line 3360 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 crates/obscura-js/src/ops.rs:3361— `error!` at line 3361 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 crates/obscura-js/src/ops.rs:3362— `info!` at line 3362 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 crates/obscura-js/src/ops.rs:3929— `debug!` at line 3929 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 crates/obscura-js/src/ops.rs:3964— `debug!` at line 3964 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 crates/obscura-js/src/ops.rs:4112— `debug!` at line 4112 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 crates/obscura-js/src/ops.rs:4589— `debug!` at line 4589 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 crates/obscura-js/src/ops.rs:6550— `warn!` at line 6550 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 crates/obscura-js/src/ops.rs:6620— `warn!` at line 6620 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 crates/obscura-js/src/ops.rs:6851— `warn!` at line 6851 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 crates/obscura-js/src/runtime.rs:630— `warn!` at line 630 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 crates/obscura-js/src/runtime.rs:3435— `warn!` at line 3435 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 crates/obscura-js/src/runtime.rs:3662— `warn!` at line 3662 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 crates/obscura-js/src/runtime.rs:3801— `warn!` at line 3801 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 crates/obscura-js/src/runtime.rs:3952— `warn!` at line 3952 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`.
Silent fallback default on Err crates/obscura-cdp/src/domains/input.rs:10— `js_str` turns every `Err` into `"\"\"".to_string()` — 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 crates/obscura-cdp/src/util.rs:44— `object_id_literal` turns every `Err` into `"\"\"".to_string()` — 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 crates/obscura-cli/src/main.rs:1860— `dump_cookies` turns every `Err` into `"[]".to_string()` — 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 crates/obscura-cli/src/main.rs:1881— `dump_text` 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 crates/obscura-js/src/ops.rs:1217— `frames_removed_by` turns every `Err` into `Vec::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 crates/obscura-js/src/frame.rs:422— `encode_json_argument` turns every `Err` into `"\"\"".to_string()` — 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 crates/obscura-js/src/frame.rs:437— `origin_of` turns every `Err` into `"null".to_string()` — 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 crates/obscura-js/src/ops.rs:1906— `op_shadow_attach` turns every `Err` into `-1` — 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 crates/obscura-js/src/ops.rs:6291— `op_get_cookies` 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 crates/obscura-js/src/ops.rs:6313— `storage_origin` turns every `Err` into `"null".to_string()` — 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 crates/obscura-js/src/ops.rs:6367— `origin_storage_command` turns every `Err` into `"null".to_string()` — 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 crates/obscura-js/src/ops.rs:6768— `op_initial_frame` turns every `Err` into `"null".to_string()` — 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 crates/obscura-js/src/ops.rs:7390— `op_url_parse` turns every `Err` into `"{\"ok\":false}".to_string()` — 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 crates/obscura-js/src/ops.rs:7461— `op_url_set` turns every `Err` into `"{\"ok\":false}".to_string()` — 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 crates/obscura-js/src/ops.rs:7534— `op_document_domain_candidate` 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 crates/obscura-js/src/ops.rs:8970— `op_resize_observer_measurements` turns every `Err` into `"[]".to_string()` — 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 crates/obscura-js/src/ops.rs:9035— `op_intersection_observer_measurements` turns every `Err` into `"[]".to_string()` — 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 crates/obscura-js/src/ops.rs:9148— `op_computed_style` turns every `Err` into `"none".to_string()` — 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 crates/obscura-js/src/runtime.rs:364— `js_string_literal` turns every `Err` into `"\"\"".to_string()` — 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 crates/obscura-mcp/src/lib.rs:1034— `tool_snapshot` 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 crates/obscura-render/src/dom.rs:10527— `build_shaped_word_leaves` turns every `Err` into `Vec::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.
Duplicated predicate crates/obscura-browser/src/page.rs:1748— `!device_scale_factor.is_finite() || device_scale_factor < 0.0` appears character-identically in 2 files — crates/obscura-browser/src/page.rs, crates/obscura-cdp/src/domains/emulation.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 crates/obscura-cdp/src/domains/input.rs:340— `!page.has_pending_navigation() && page.sync_virtual_url()` appears character-identically in 2 files — crates/obscura-cdp/src/domains/input.rs, crates/obscura-cdp/src/server.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 crates/obscura-browser/src/page.rs:871— `!path.ends_with(".eot") && !path.ends_with(".svg")` appears character-identically in 2 files — crates/obscura-browser/src/page.rs, crates/obscura-render/src/paint.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 crates/obscura-browser/src/page.rs:1651— `!viewport.0.is_finite() || !viewport.1.is_finite() || viewport.0 <= 0.0 || viewport.1 <= 0.0` appears character-identically in 2 files — crates/obscura-browser/src/page.rs, crates/obscura-render/src/paint.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 crates/obscura-cli/src/main.rs:1908— `(*pending_space || begins_with_space) && !result.is_empty() && !result_ends_with_space` appears character-identically in 2 files — crates/obscura-cli/src/main.rs, crates/obscura-mcp/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 crates/obscura-render/src/inline.rs:3918— `(px as f32) < cx0 || (px as f32) >= cx1 || (py as f32) < cy0 || (py as f32) >= cy1` appears character-identically in 2 files — crates/obscura-render/src/inline.rs, crates/obscura-render/src/paint.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 crates/obscura-render/src/paint.rs:10636— `cursor < bytes.len() && bytes[cursor].is_ascii_whitespace()` appears character-identically in 2 files — crates/obscura-render/src/paint.rs, crates/obscura-render/src/style.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 crates/obscura-js/src/ops.rs:6263— `lower_domain == "localhost" || lower_domain.ends_with(".localhost") || lower_domain == "127.0.0.1" || lower_domain == "::1"` appears character-identically in 2 files — crates/obscura-js/src/ops.rs, crates/obscura-net/src/client.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 crates/obscura-cdp/src/domains/page.rs:1379— `nav_method == "POST" && !nav_body.is_empty()` appears character-identically in 2 files — crates/obscura-cdp/src/domains/page.rs, crates/obscura-cdp/src/server.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 crates/obscura-net/src/client.rs:620— `self.allow_private || env_allows_private_network()` appears character-identically in 2 files — crates/obscura-net/src/client.rs, crates/obscura-net/src/wreq_client.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 crates/obscura-browser/src/page.rs:158— `source.scheme() == "https" && target.scheme() == "http"` appears character-identically in 2 files — crates/obscura-browser/src/page.rs, crates/obscura-net/src/client.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 crates/obscura-render/src/lib.rs:2589— `style.overflow_hidden && !style.overflow_propagated_to_viewport` appears character-identically in 2 files — crates/obscura-render/src/lib.rs, crates/obscura-render/src/paint.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 crates/obscura-render/src/inline.rs:131— `token == "monospace" || token.contains("mono") || token.contains("courier") || token.contains("consol") || token == "menlo" || token == "mon…` appears character-identically in 2 files — crates/obscura-render/src/inline.rs, crates/obscura-render/src/paint.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 crates/obscura-render/src/inline.rs:151— `token == "sans-serif" || token.contains("sans") || token == "arial" || token == "helvetica" || token == "helvetica neue" || token == "-apple…` appears character-identically in 2 files — crates/obscura-render/src/inline.rs, crates/obscura-render/src/paint.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 crates/obscura-render/src/inline.rs:141— `token == "serif" || token == "georgia" || token.contains("times") || token == "cambria" || token.contains("garamond") || token.contains("lib…` appears character-identically in 2 files — crates/obscura-render/src/inline.rs, crates/obscura-render/src/paint.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 crates/obscura-render/src/inline.rs:128— `token == "system-ui" || token == "ui-sans-serif"` appears character-identically in 2 files — crates/obscura-render/src/inline.rs, crates/obscura-render/src/paint.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 crates/obscura-render/src/dom.rs:3293— `width.is_finite() && height.is_finite() && width > 0.0 && height > 0.0` appears character-identically in 3 files — crates/obscura-render/src/dom.rs, crates/obscura-render/src/inline.rs, crates/obscura-render/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.
Silent fallback default in catch REDACTED:2820— `baseURI` swallows every exception into `return ""` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:5212— `contentDocument` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:6238— `_documentUrlHost` swallows every exception into `return ""` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch REDACTED:13577— `_cssSupportsDeclaration` swallows every exception into `return false` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 14 significant file(s) lose their only recent owner: crates/obscura-render/src/dom.rs, crates/obscura-render/src/style.rs, crates/obscura-render/src/css.rs, crates/obscura-render/src/inline.rs, render-repros/paired-corpus.py, crates/obscura-render/src/lib.rs, crates/obscura-cdp/src/domains/pdf.rs, crates/obscura-cdp/src/domains/domsnapshot.rs (+6 more). Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (15 single-owned of 66 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 66 of the 85 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: render-repros/capture-media-emulation.py.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 11 project(s) overshoot their size bounds, lowering Project Cohesion to 8.2/10. The most over is `crates/obscura-js` (56397 LoC, 271 module-visible types across 2 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 — 1 of 66 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; 66 of the 85 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: crates/obscura-browser/src/profiles.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
Orphaned file crates/obscura-browser/src/profiles.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Logging is not universal — Only 6/8 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `crates/obscura-render`.
No release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
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/2 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.
Subsumed condition operand crates/obscura-render/src/style.rs:7747— `n.ends_with("rem")` can never decide this `||` — every value satisfying `n.ends_with("rem")` also satisfies `n.ends_with("em")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Outdated: anyhow — `anyhow` is locked at 1.0.103 but 1.0.104 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/obscura-browser/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p anyhow` and commit the updated REDACTED.
Outdated: async-trait — `async-trait` is locked at 0.1.89 but 0.1.92 is the current stable release on crates.io, and it already satisfies the `"0.1"` requirement declared in crates/obscura-net/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p async-trait` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.6.1 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4"` requirement declared in crates/obscura-cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: deno_error — `deno_error` is locked at 0.7.1 but 0.7.3 is the current stable release on crates.io, and it already satisfies the `"0.7"` requirement declared in crates/obscura-js/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p deno_error` and commit the updated REDACTED.
Outdated: encoding_rs — `encoding_rs` is locked at 0.8.35 but 0.8.42 is the current stable release on crates.io, and it already satisfies the `"0.8"` requirement declared in crates/obscura-net/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p encoding_rs` and commit the updated REDACTED.
Outdated: futures — `futures` is locked at 0.3.32 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in crates/obscura-browser/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p futures` and commit the updated REDACTED.
Outdated: futures-util — `futures-util` is locked at 0.3.32 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in crates/obscura-cdp/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p futures-util` and commit the updated REDACTED.
Outdated: libc — `libc` is locked at 0.2.186 but 0.2.191 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in crates/obscura-cdp/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libc` and commit the updated REDACTED.
Outdated: psl — `psl` is locked at 2.1.223 but 2.1.245 is the current stable release on crates.io, and it already satisfies the `"2"` requirement declared in crates/obscura-js/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p psl` and commit the updated REDACTED.
Outdated: serde — `serde` is locked at 1.0.228 but 1.0.229 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/obscura-browser/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde` and commit the updated REDACTED.
Outdated: serde_json — `serde_json` is locked at 1.0.150 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/obscura-browser/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde_json` and commit the updated REDACTED.
Outdated: thiserror — `thiserror` is locked at 2.0.18 but 2.0.21 is the current stable release on crates.io, and it already satisfies the `"2"` requirement declared in crates/obscura-browser/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p thiserror` and commit the updated REDACTED.
Outdated: tokio — `tokio` is locked at 1.53.3 but 1.54.1 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/obscura-browser/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tokio` and commit the updated REDACTED.
Outdated: uuid — `uuid` is locked at 1.23.3 but 1.29.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/obscura-cdp/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p uuid` and commit the updated REDACTED.
Outdated: wuff — `wuff` is locked at 0.2.8 but 0.2.9 is the current stable release on crates.io, and it already satisfies the `"0.2.7"` requirement declared in crates/obscura-render/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p wuff` and commit the updated REDACTED.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 1 file(s) — `REDACTED` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a1763b-ad60-7079-8548-00b6020ea35a · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 38 · Warnings: 1091 · Recommendations: 100 · Info: 15 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 26-10-2026 @ 03:23 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.