Public report of Flaminis/Dalaran, published 17 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 17 November 2026, 19:01 UTC · Survey ID cd_9fa546b5baaa4ce18b6c0a190b5b24d5
Flaminis/Dalaran
Measured 17 November 2026, 18:58 UTC, at code version da14440
First survey, so nothing to compare with yet
CAI scoreAt risk
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: 462,219 lines of product code in 114 projects, tests not counted · Estimated rebuild effort: about 3.7 person-years · Weakest lens: Production Readiness, 43.8
Findings by how serious they are
60 critical3302 serious258 minor
16 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 18:58 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
83of 83 dimensions measured by tools.
3509of 3620 findings point to an exact file and line, so you can open each one in the code. The other 111 concern the repository as a whole, such as missing documentation.
83dimensions across 9 lenses, read from 462,219 lines of product code in 114 projects.
Flaminis/Dalaran is rated At risk because critical security findings are open, most of them in the packages it uses. Its score is held back in part because we found no working pipeline that builds or tests changes to the code. It scores 53.7 out of 100, which the At risk rating leaves unchanged. We judged it as a preview release, against a lower bar.
Production Readiness, at 43.8, is the weakest lens and counts most in the score. The best first step is adding an automated build and test pipeline, worth about 5.4 points. Adding a test runner and linting to the front end's build comes next, worth about 3.2 points. Raising Production Readiness to 62 would lift the score to about 59.7.
Nineteen known security holes in the packages the code depends on can be used by attackers. Four weaknesses in the code could be used by an attacker, and three settings leave the servers or containers unsafe. Updating the vulnerable packages, fixing the weaknesses the scanner points to and correcting the unsafe settings would close these risks. The place where the code runs text as code or as a command needs a direct call instead. The two parts of the code nobody has worked on for a long time need someone to learn and document them before anyone changes them.
The product code is 462,219 lines, about €540,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 Production Readiness rose from 43.8 to 62, the lowest score rated Strong, the score would rise from 53.7 to about 59.7.
Code composition: what the lines of code are
Product code 84%Tests 16%
Rebuild cost: about €540,000 · Estimate
Cost to rebuild
€180,000 to €900,000, for 2,970 to 9,422 hours of work, about 3.7 person-years for 2 to 7 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 54. 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: 462,219 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Add a CI workflow that builds and runs the test suite on every push/PR.
Raises the score by about 5.4 points · Medium effort · CI/CD gates
2
Add a test runner (vitest / jest / playwright) and eslint as package.json scripts and run them in CI.
Raises the score by about 3.2 points · Medium effort · Tooling
3
Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g.
`composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
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 €540,000 to build again, about 3.7 person-years of work. Its weakest lens is Production Readiness, at 43.8 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Add a CI workflow that builds and runs the test suite on every push/PR. Of all the actions in this report, it raises the score most for the work it takes: about 5.4 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 7.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 430,700 lines over the last 90 days, which is about 1,746,728 lines a year. At that pace, the extra work comes to an estimated 87.3 to 582.2 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 our 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.
1934 modules, with 5385 dependencies between them. 39 loops run through 246 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 1894 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.
1 pair of types, where a type in dl_analytics.event uses a type in dl_byte_size.
The types involved
dl_analytics.event.Id → dl_byte_size.SizeBytes
Direction
dl_analytics.event uses dl_byte_size, so a change to dl_byte_size can break dl_analytics.event, while a change to dl_analytics.event can't break dl_byte_size.
Position
Below the diagonal: dl_analytics.event uses a module listed above it, which is the healthy direction.
dl_chunk.latest_at uses dl_log_types.index.time_int, so a change to dl_log_types.index.time_int can break dl_chunk.latest_at, while a change to dl_chunk.latest_at can't break dl_log_types.index.time_int.
Position
Below the diagonal: dl_chunk.latest_at uses a module listed above it, which is the healthy direction.
dl_chunk.latest_at uses dl_types_core.timeline_name, so a change to dl_types_core.timeline_name can break dl_chunk.latest_at, while a change to dl_chunk.latest_at can't break dl_types_core.timeline_name.
Position
Below the diagonal: dl_chunk.latest_at uses a module listed above it, which is the healthy direction.
dl_log_types.index.absolute_time_range uses dl_log_types.index.time_int, so a change to dl_log_types.index.time_int can break dl_log_types.index.absolute_time_range, while a change to dl_log_types.index.absolute_time_range can't break dl_log_types.index.time_int.
Position
Below the diagonal: dl_log_types.index.absolute_time_range uses a module listed above it, which is the healthy direction.
dl_renderer.wgpu_buffer_types uses dl_byte_size, so a change to dl_byte_size can break dl_renderer.wgpu_buffer_types, while a change to dl_renderer.wgpu_buffer_types can't break dl_byte_size.
Position
Below the diagonal: dl_renderer.wgpu_buffer_types uses a module listed above it, which is the healthy direction.
dl_types_core.component_descriptor uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_types_core.component_descriptor, while a change to dl_types_core.component_descriptor can't break dl_types_core.archetype.
Position
Below the diagonal: dl_types_core.component_descriptor uses a module listed above it, which is the healthy direction.
dl_log_types.index.time_type uses dl_log_types.index.time_int, so a change to dl_log_types.index.time_int can break dl_log_types.index.time_type, while a change to dl_log_types.index.time_type can't break dl_log_types.index.time_int.
Position
Below the diagonal: dl_log_types.index.time_type uses a module listed above it, which is the healthy direction.
dl_log_types.index.time_type uses dl_log_types.index.absolute_time_range, so a change to dl_log_types.index.absolute_time_range can break dl_log_types.index.time_type, while a change to dl_log_types.index.time_type can't break dl_log_types.index.absolute_time_range.
Position
Below the diagonal: dl_log_types.index.time_type uses a module listed above it, which is the healthy direction.
dl_types_core.chunk_id uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_types_core.chunk_id, while a change to dl_types_core.chunk_id can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_types_core.chunk_id uses a module listed above it, which is the healthy direction.
dl_types_core.row_id uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_types_core.row_id, while a change to dl_types_core.row_id can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_types_core.row_id uses a module listed above it, which is the healthy direction.
dl_viewer_context.item uses dl_log_types.entry_id, so a change to dl_log_types.entry_id can break dl_viewer_context.item, while a change to dl_viewer_context.item can't break dl_log_types.entry_id.
Position
Below the diagonal: dl_viewer_context.item uses a module listed above it, which is the healthy direction.
dl_viewer_context.item uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer_context.item, while a change to dl_viewer_context.item can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer_context.item uses a module listed above it, which is the healthy direction.
dl_viewer_context.item uses dl_uri.origin, so a change to dl_uri.origin can break dl_viewer_context.item, while a change to dl_viewer_context.item can't break dl_uri.origin.
Position
Below the diagonal: dl_viewer_context.item uses a module listed above it, which is the healthy direction.
24→35 dl_viewer_context.item uses dl_entity_db.entity_dbpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.item uses a type in dl_entity_db.entity_db.
dl_viewer_context.item uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer_context.item, while a change to dl_viewer_context.item can't break dl_entity_db.entity_db.
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→38 dl_viewer_context.item uses dl_log_types.path.entity_pathpart of a loop✕
Connections
2 pairs of types, where a type in dl_viewer_context.item uses a type in dl_log_types.path.entity_path.
dl_viewer_context.item uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_viewer_context.item, while a change to dl_viewer_context.item can't break dl_log_types.path.entity_path.
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.
dl_viewer_context.viewer_context uses dl_log_types.entry_id, so a change to dl_log_types.entry_id can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_log_types.entry_id.
Position
Below the diagonal: dl_viewer_context.viewer_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.viewer_context uses dl_renderer.context, so a change to dl_renderer.context can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_renderer.context.
Position
Below the diagonal: dl_viewer_context.viewer_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.viewer_context uses dl_types_core.view, so a change to dl_types_core.view can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_types_core.view.
Position
Below the diagonal: dl_viewer_context.viewer_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.viewer_context uses dl_viewer_context.app_options, so a change to dl_viewer_context.app_options can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_viewer_context.app_options.
Position
Below the diagonal: dl_viewer_context.viewer_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.viewer_context uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer_context.viewer_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.viewer_context uses dl_viewer_context.item, so a change to dl_viewer_context.item can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_viewer_context.item.
Position
Below the diagonal: dl_viewer_context.viewer_context uses a module listed above it, which is the healthy direction.
25→27 dl_viewer_context.viewer_context uses dl_viewer_context.query_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.viewer_context uses a type in dl_viewer_context.query_context.
dl_viewer_context.viewer_context uses dl_viewer_context.query_context, so a change to dl_viewer_context.query_context can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_viewer_context.query_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
25→31 dl_viewer_context.viewer_context uses dl_viewer_context.view.view_class_registrypart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.viewer_context uses a type in dl_viewer_context.view.view_class_registry.
dl_viewer_context.viewer_context uses dl_viewer_context.view.view_class_registry, so a change to dl_viewer_context.view.view_class_registry can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_viewer_context.view.view_class_registry.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
25→32 dl_viewer_context.viewer_context uses dl_viewer_context.app_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.viewer_context uses a type in dl_viewer_context.app_context.
dl_viewer_context.viewer_context uses dl_viewer_context.app_context, so a change to dl_viewer_context.app_context can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_viewer_context.app_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
25→33 dl_viewer_context.viewer_context uses dl_log_typespart of a loop✕
Connections
2 pairs of types, where a type in dl_viewer_context.viewer_context uses a type in dl_log_types.
dl_viewer_context.viewer_context uses dl_log_types, so a change to dl_log_types can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_log_types.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
25→35 dl_viewer_context.viewer_context uses dl_entity_db.entity_dbpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.viewer_context uses a type in dl_entity_db.entity_db.
dl_viewer_context.viewer_context uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_entity_db.entity_db.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
25→37 dl_viewer_context.viewer_context uses dl_viewer_context.store_view_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.viewer_context uses a type in dl_viewer_context.store_view_context.
dl_viewer_context.viewer_context uses dl_viewer_context.store_view_context, so a change to dl_viewer_context.store_view_context can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_viewer_context.store_view_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
25→38 dl_viewer_context.viewer_context uses dl_log_types.path.entity_pathpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.viewer_context uses a type in dl_log_types.path.entity_path.
dl_viewer_context.viewer_context uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_viewer_context.viewer_context, while a change to dl_viewer_context.viewer_context can't break dl_log_types.path.entity_path.
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.
dl_viewer_context.view.view_query uses dl_log_types.index.time_int, so a change to dl_log_types.index.time_int can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_log_types.index.time_int.
Position
Below the diagonal: dl_viewer_context.view.view_query uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_query uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_types_core.archetype.
Position
Below the diagonal: dl_viewer_context.view.view_query uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_query uses dl_types_core.timeline_name, so a change to dl_types_core.timeline_name can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_types_core.timeline_name.
Position
Below the diagonal: dl_viewer_context.view.view_query uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_query uses dl_viewer_context.view.named_system, so a change to dl_viewer_context.view.named_system can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_viewer_context.view.named_system.
Position
Below the diagonal: dl_viewer_context.view.view_query uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_query uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer_context.view.view_query uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_query uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_viewer_context.view.view_query uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_query uses dl_viewer_context.viewer_context, so a change to dl_viewer_context.viewer_context can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_viewer_context.viewer_context.
Position
Below the diagonal: dl_viewer_context.view.view_query uses a module listed above it, which is the healthy direction.
26→27 dl_viewer_context.view.view_query uses dl_viewer_context.query_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.view_query uses a type in dl_viewer_context.query_context.
dl_viewer_context.view.view_query uses dl_viewer_context.query_context, so a change to dl_viewer_context.query_context can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_viewer_context.query_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
26→29 dl_viewer_context.view.view_query uses dl_viewer_context.view.view_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.view_query uses a type in dl_viewer_context.view.view_context.
dl_viewer_context.view.view_query uses dl_viewer_context.view.view_context, so a change to dl_viewer_context.view.view_context can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_viewer_context.view.view_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
26→38 dl_viewer_context.view.view_query uses dl_log_types.path.entity_pathpart of a loop✕
Connections
4 pairs of types, where a type in dl_viewer_context.view.view_query uses a type in dl_log_types.path.entity_path.
dl_viewer_context.view.view_query uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_viewer_context.view.view_query, while a change to dl_viewer_context.view.view_query can't break dl_log_types.path.entity_path.
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.
dl_viewer_context.query_context uses dl_renderer.context, so a change to dl_renderer.context can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_renderer.context.
Position
Below the diagonal: dl_viewer_context.query_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.query_context uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_types_core.archetype.
Position
Below the diagonal: dl_viewer_context.query_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.query_context uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer_context.query_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.query_context uses dl_viewer_context.viewer_context, so a change to dl_viewer_context.viewer_context can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_viewer_context.viewer_context.
Position
Below the diagonal: dl_viewer_context.query_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.query_context uses dl_viewer_context.view.view_query, so a change to dl_viewer_context.view.view_query can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_viewer_context.view.view_query.
Position
Below the diagonal: dl_viewer_context.query_context uses a module listed above it, which is the healthy direction.
27→29 dl_viewer_context.query_context uses dl_viewer_context.view.view_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.query_context uses a type in dl_viewer_context.view.view_context.
dl_viewer_context.query_context uses dl_viewer_context.view.view_context, so a change to dl_viewer_context.view.view_context can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_viewer_context.view.view_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
27→32 dl_viewer_context.query_context uses dl_viewer_context.app_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.query_context uses a type in dl_viewer_context.app_context.
dl_viewer_context.query_context uses dl_viewer_context.app_context, so a change to dl_viewer_context.app_context can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_viewer_context.app_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
27→35 dl_viewer_context.query_context uses dl_entity_db.entity_dbpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.query_context uses a type in dl_entity_db.entity_db.
dl_viewer_context.query_context uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_entity_db.entity_db.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
27→38 dl_viewer_context.query_context uses dl_log_types.path.entity_pathpart of a loop✕
Connections
3 pairs of types, where a type in dl_viewer_context.query_context uses a type in dl_log_types.path.entity_path.
dl_viewer_context.query_context uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_viewer_context.query_context, while a change to dl_viewer_context.query_context can't break dl_log_types.path.entity_path.
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.
dl_viewer_context.view.visualizer_system uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_types_core.archetype.
Position
Below the diagonal: dl_viewer_context.view.visualizer_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.visualizer_system uses dl_types_core.view, so a change to dl_types_core.view can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_types_core.view.
Position
Below the diagonal: dl_viewer_context.view.visualizer_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.visualizer_system uses dl_viewer_context.app_options, so a change to dl_viewer_context.app_options can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_viewer_context.app_options.
Position
Below the diagonal: dl_viewer_context.view.visualizer_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.visualizer_system uses dl_viewer_context.view.named_system, so a change to dl_viewer_context.view.named_system can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_viewer_context.view.named_system.
Position
Below the diagonal: dl_viewer_context.view.visualizer_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.visualizer_system uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_viewer_context.view.visualizer_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.visualizer_system uses dl_viewer_context.view.view_query, so a change to dl_viewer_context.view.view_query can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_viewer_context.view.view_query.
Position
Below the diagonal: dl_viewer_context.view.visualizer_system uses a module listed above it, which is the healthy direction.
28→29 dl_viewer_context.view.visualizer_system uses dl_viewer_context.view.view_contextpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.visualizer_system uses a type in dl_viewer_context.view.view_context.
dl_viewer_context.view.visualizer_system uses dl_viewer_context.view.view_context, so a change to dl_viewer_context.view.view_context can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_viewer_context.view.view_context.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
28→30 dl_viewer_context.view.visualizer_system uses dl_viewer_context.view.view_context_systempart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.visualizer_system uses a type in dl_viewer_context.view.view_context_system.
dl_viewer_context.view.visualizer_system uses dl_viewer_context.view.view_context_system, so a change to dl_viewer_context.view.view_context_system can break dl_viewer_context.view.visualizer_system, while a change to dl_viewer_context.view.visualizer_system can't break dl_viewer_context.view.view_context_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.
dl_viewer_context.view.view_context uses dl_renderer.context, so a change to dl_renderer.context can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_renderer.context.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context uses dl_types_core.view, so a change to dl_types_core.view can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_types_core.view.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context uses dl_viewer_context.viewer_context, so a change to dl_viewer_context.viewer_context can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_viewer_context.viewer_context.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context uses dl_viewer_context.view.view_query, so a change to dl_viewer_context.view.view_query can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_viewer_context.view.view_query.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context uses dl_viewer_context.query_context, so a change to dl_viewer_context.query_context can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_viewer_context.query_context.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context uses dl_viewer_context.view.visualizer_system, so a change to dl_viewer_context.view.visualizer_system can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_viewer_context.view.visualizer_system.
Position
Below the diagonal: dl_viewer_context.view.view_context uses a module listed above it, which is the healthy direction.
29→31 dl_viewer_context.view.view_context uses dl_viewer_context.view.view_class_registrypart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.view_context uses a type in dl_viewer_context.view.view_class_registry.
dl_viewer_context.view.view_context uses dl_viewer_context.view.view_class_registry, so a change to dl_viewer_context.view.view_class_registry can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_viewer_context.view.view_class_registry.
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.
29→33 dl_viewer_context.view.view_context uses dl_log_typespart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.view_context uses a type in dl_log_types.
dl_viewer_context.view.view_context uses dl_log_types, so a change to dl_log_types can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_log_types.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
29→35 dl_viewer_context.view.view_context uses dl_entity_db.entity_dbpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.view_context uses a type in dl_entity_db.entity_db.
dl_viewer_context.view.view_context uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_entity_db.entity_db.
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.
29→38 dl_viewer_context.view.view_context uses dl_log_types.path.entity_pathpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.view.view_context uses a type in dl_log_types.path.entity_path.
dl_viewer_context.view.view_context uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_viewer_context.view.view_context, while a change to dl_viewer_context.view.view_context can't break dl_log_types.path.entity_path.
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.
dl_viewer_context.view.view_context_system uses dl_types_core.view, so a change to dl_types_core.view can break dl_viewer_context.view.view_context_system, while a change to dl_viewer_context.view.view_context_system can't break dl_types_core.view.
Position
Below the diagonal: dl_viewer_context.view.view_context_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context_system uses dl_viewer_context.viewer_context, so a change to dl_viewer_context.viewer_context can break dl_viewer_context.view.view_context_system, while a change to dl_viewer_context.view.view_context_system can't break dl_viewer_context.viewer_context.
Position
Below the diagonal: dl_viewer_context.view.view_context_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context_system uses dl_viewer_context.view.view_query, so a change to dl_viewer_context.view.view_query can break dl_viewer_context.view.view_context_system, while a change to dl_viewer_context.view.view_context_system can't break dl_viewer_context.view.view_query.
Position
Below the diagonal: dl_viewer_context.view.view_context_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context_system uses dl_viewer_context.view.visualizer_system, so a change to dl_viewer_context.view.visualizer_system can break dl_viewer_context.view.view_context_system, while a change to dl_viewer_context.view.view_context_system can't break dl_viewer_context.view.visualizer_system.
Position
Below the diagonal: dl_viewer_context.view.view_context_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_context_system uses dl_viewer_context.view.view_context, so a change to dl_viewer_context.view.view_context can break dl_viewer_context.view.view_context_system, while a change to dl_viewer_context.view.view_context_system can't break dl_viewer_context.view.view_context.
Position
Below the diagonal: dl_viewer_context.view.view_context_system uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_class_registry uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_viewer_context.view.view_class_registry, while a change to dl_viewer_context.view.view_class_registry can't break dl_types_core.archetype.
Position
Below the diagonal: dl_viewer_context.view.view_class_registry uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_class_registry uses dl_types_core.view, so a change to dl_types_core.view can break dl_viewer_context.view.view_class_registry, while a change to dl_viewer_context.view.view_class_registry can't break dl_types_core.view.
Position
Below the diagonal: dl_viewer_context.view.view_class_registry uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_class_registry uses dl_viewer_context.app_options, so a change to dl_viewer_context.app_options can break dl_viewer_context.view.view_class_registry, while a change to dl_viewer_context.view.view_class_registry can't break dl_viewer_context.app_options.
Position
Below the diagonal: dl_viewer_context.view.view_class_registry uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_class_registry uses dl_viewer_context.viewer_context, so a change to dl_viewer_context.viewer_context can break dl_viewer_context.view.view_class_registry, while a change to dl_viewer_context.view.view_class_registry can't break dl_viewer_context.viewer_context.
Position
Below the diagonal: dl_viewer_context.view.view_class_registry uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_class_registry uses dl_viewer_context.view.visualizer_system, so a change to dl_viewer_context.view.visualizer_system can break dl_viewer_context.view.view_class_registry, while a change to dl_viewer_context.view.view_class_registry can't break dl_viewer_context.view.visualizer_system.
Position
Below the diagonal: dl_viewer_context.view.view_class_registry uses a module listed above it, which is the healthy direction.
dl_viewer_context.view.view_class_registry uses dl_viewer_context.view.view_context_system, so a change to dl_viewer_context.view.view_context_system can break dl_viewer_context.view.view_class_registry, while a change to dl_viewer_context.view.view_class_registry can't break dl_viewer_context.view.view_context_system.
Position
Below the diagonal: dl_viewer_context.view.view_class_registry uses a module listed above it, which is the healthy direction.
dl_viewer_context.app_context uses dl_log_types.entry_id, so a change to dl_log_types.entry_id can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_log_types.entry_id.
Position
Below the diagonal: dl_viewer_context.app_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.app_context uses dl_renderer.context, so a change to dl_renderer.context can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_renderer.context.
Position
Below the diagonal: dl_viewer_context.app_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.app_context uses dl_viewer_context.app_options, so a change to dl_viewer_context.app_options can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_viewer_context.app_options.
Position
Below the diagonal: dl_viewer_context.app_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.app_context uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_viewer_context.app_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.app_context uses dl_viewer_context.item, so a change to dl_viewer_context.item can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_viewer_context.item.
Position
Below the diagonal: dl_viewer_context.app_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.app_context uses dl_viewer_context.view.view_class_registry, so a change to dl_viewer_context.view.view_class_registry can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_viewer_context.view.view_class_registry.
Position
Below the diagonal: dl_viewer_context.app_context uses a module listed above it, which is the healthy direction.
32→33 dl_viewer_context.app_context uses dl_log_typespart of a loop✕
Connections
2 pairs of types, where a type in dl_viewer_context.app_context uses a type in dl_log_types.
dl_viewer_context.app_context uses dl_log_types, so a change to dl_log_types can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_log_types.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
32→35 dl_viewer_context.app_context uses dl_entity_db.entity_dbpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.app_context uses a type in dl_entity_db.entity_db.
dl_viewer_context.app_context uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_entity_db.entity_db.
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.
32→38 dl_viewer_context.app_context uses dl_log_types.path.entity_pathpart of a loop✕
Connections
1 pair of types, where a type in dl_viewer_context.app_context uses a type in dl_log_types.path.entity_path.
dl_viewer_context.app_context uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_viewer_context.app_context, while a change to dl_viewer_context.app_context can't break dl_log_types.path.entity_path.
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.
dl_log_types uses dl_log_types.index.time_type, so a change to dl_log_types.index.time_type can break dl_log_types, while a change to dl_log_types can't break dl_log_types.index.time_type.
Position
Below the diagonal: dl_log_types uses a module listed above it, which is the healthy direction.
dl_log_types uses dl_viewer_context.app_context, so a change to dl_viewer_context.app_context can break dl_log_types, while a change to dl_log_types can't break dl_viewer_context.app_context.
Position
Below the diagonal: dl_log_types uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_byte_size, so a change to dl_byte_size can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_byte_size.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_byte_size.mem_usage_tree, so a change to dl_byte_size.mem_usage_tree can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_byte_size.mem_usage_tree.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_log_types.index.time_int, so a change to dl_log_types.index.time_int can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_log_types.index.time_int.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_types_core.archetype.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_types_core.timeline_name, so a change to dl_types_core.timeline_name can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_types_core.timeline_name.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_log_types.index.absolute_time_range, so a change to dl_log_types.index.absolute_time_range can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_log_types.index.absolute_time_range.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_types_core.chunk_id, so a change to dl_types_core.chunk_id can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_types_core.chunk_id.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
dl_chunk_store.store uses dl_log_types, so a change to dl_log_types can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_log_types.
Position
Below the diagonal: dl_chunk_store.store uses a module listed above it, which is the healthy direction.
34→38 dl_chunk_store.store uses dl_log_types.path.entity_pathpart of a loop✕
Connections
1 pair of types, where a type in dl_chunk_store.store uses a type in dl_log_types.path.entity_path.
dl_chunk_store.store uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_log_types.path.entity_path.
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.
34→40 dl_chunk_store.store uses dl_chunk.chunkpart of a loop✕
Connections
1 pair of types, where a type in dl_chunk_store.store uses a type in dl_chunk.chunk.
dl_chunk_store.store uses dl_chunk.chunk, so a change to dl_chunk.chunk can break dl_chunk_store.store, while a change to dl_chunk_store.store can't break dl_chunk.chunk.
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.
dl_entity_db.entity_db uses dl_byte_size, so a change to dl_byte_size can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_byte_size.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_byte_size.mem_usage_tree, so a change to dl_byte_size.mem_usage_tree can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_byte_size.mem_usage_tree.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_log_types.index.time_int, so a change to dl_log_types.index.time_int can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_log_types.index.time_int.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_types_core.archetype.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_types_core.timeline_name, so a change to dl_types_core.timeline_name can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_types_core.timeline_name.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_log_types.index.absolute_time_range, so a change to dl_log_types.index.absolute_time_range can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_log_types.index.absolute_time_range.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_log_types.index.time_type, so a change to dl_log_types.index.time_type can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_log_types.index.time_type.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_types_core.row_id, so a change to dl_types_core.row_id can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_types_core.row_id.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_viewer_context.app_context, so a change to dl_viewer_context.app_context can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_viewer_context.app_context.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_log_types, so a change to dl_log_types can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_log_types.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
dl_entity_db.entity_db uses dl_chunk_store.store, so a change to dl_chunk_store.store can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_chunk_store.store.
Position
Below the diagonal: dl_entity_db.entity_db uses a module listed above it, which is the healthy direction.
35→38 dl_entity_db.entity_db uses dl_log_types.path.entity_pathpart of a loop✕
Connections
2 pairs of types, where a type in dl_entity_db.entity_db uses a type in dl_log_types.path.entity_path.
dl_entity_db.entity_db uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_log_types.path.entity_path.
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.
35→40 dl_entity_db.entity_db uses dl_chunk.chunkpart of a loop✕
Connections
1 pair of types, where a type in dl_entity_db.entity_db uses a type in dl_chunk.chunk.
dl_entity_db.entity_db uses dl_chunk.chunk, so a change to dl_chunk.chunk can break dl_entity_db.entity_db, while a change to dl_entity_db.entity_db can't break dl_chunk.chunk.
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.
dl_viewer.app_state uses dl_byte_size.mem_usage_tree, so a change to dl_byte_size.mem_usage_tree can break dl_viewer.app_state, while a change to dl_viewer.app_state can't break dl_byte_size.mem_usage_tree.
Position
Below the diagonal: dl_viewer.app_state uses a module listed above it, which is the healthy direction.
dl_viewer.app_state uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer.app_state, while a change to dl_viewer.app_state can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer.app_state uses a module listed above it, which is the healthy direction.
dl_viewer.app_state uses dl_viewer_context.view.view_class_registry, so a change to dl_viewer_context.view.view_class_registry can break dl_viewer.app_state, while a change to dl_viewer.app_state can't break dl_viewer_context.view.view_class_registry.
Position
Below the diagonal: dl_viewer.app_state uses a module listed above it, which is the healthy direction.
dl_viewer.app_state uses dl_viewer_context.app_context, so a change to dl_viewer_context.app_context can break dl_viewer.app_state, while a change to dl_viewer.app_state can't break dl_viewer_context.app_context.
Position
Below the diagonal: dl_viewer.app_state uses a module listed above it, which is the healthy direction.
dl_viewer.app_state uses dl_log_types, so a change to dl_log_types can break dl_viewer.app_state, while a change to dl_viewer.app_state can't break dl_log_types.
Position
Below the diagonal: dl_viewer.app_state uses a module listed above it, which is the healthy direction.
dl_viewer.app_state uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer.app_state, while a change to dl_viewer.app_state can't break dl_entity_db.entity_db.
Position
Below the diagonal: dl_viewer.app_state uses a module listed above it, which is the healthy direction.
dl_viewer_context.store_view_context uses dl_renderer.context, so a change to dl_renderer.context can break dl_viewer_context.store_view_context, while a change to dl_viewer_context.store_view_context can't break dl_renderer.context.
Position
Below the diagonal: dl_viewer_context.store_view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.store_view_context uses dl_types_core.timeline_name, so a change to dl_types_core.timeline_name can break dl_viewer_context.store_view_context, while a change to dl_viewer_context.store_view_context can't break dl_types_core.timeline_name.
Position
Below the diagonal: dl_viewer_context.store_view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.store_view_context uses dl_viewer_context.app_options, so a change to dl_viewer_context.app_options can break dl_viewer_context.store_view_context, while a change to dl_viewer_context.store_view_context can't break dl_viewer_context.app_options.
Position
Below the diagonal: dl_viewer_context.store_view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.store_view_context uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer_context.store_view_context, while a change to dl_viewer_context.store_view_context can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer_context.store_view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.store_view_context uses dl_viewer_context.app_context, so a change to dl_viewer_context.app_context can break dl_viewer_context.store_view_context, while a change to dl_viewer_context.store_view_context can't break dl_viewer_context.app_context.
Position
Below the diagonal: dl_viewer_context.store_view_context uses a module listed above it, which is the healthy direction.
dl_viewer_context.store_view_context uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer_context.store_view_context, while a change to dl_viewer_context.store_view_context can't break dl_entity_db.entity_db.
Position
Below the diagonal: dl_viewer_context.store_view_context uses a module listed above it, which is the healthy direction.
dl_log_types.path.entity_path uses dl_viewer_context.store_view_context, so a change to dl_viewer_context.store_view_context can break dl_log_types.path.entity_path, while a change to dl_log_types.path.entity_path can't break dl_viewer_context.store_view_context.
Position
Below the diagonal: dl_log_types.path.entity_path uses a module listed above it, which is the healthy direction.
dl_viewer.app uses dl_byte_size.mem_usage_tree, so a change to dl_byte_size.mem_usage_tree can break dl_viewer.app, while a change to dl_viewer.app can't break dl_byte_size.mem_usage_tree.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
dl_viewer.app uses dl_quota_channel.async_broadcast_channel, so a change to dl_quota_channel.async_broadcast_channel can break dl_viewer.app, while a change to dl_viewer.app can't break dl_quota_channel.async_broadcast_channel.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
dl_viewer.app uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_viewer.app, while a change to dl_viewer.app can't break dl_types_core.archetype.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
dl_viewer.app uses dl_types_core.view, so a change to dl_types_core.view can break dl_viewer.app, while a change to dl_viewer.app can't break dl_types_core.view.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in dl_viewer.app uses a type in dl_analytics.event.
The types involved
dl_viewer.app.app$module → dl_analytics.event.Id
Direction
dl_viewer.app uses dl_analytics.event, so a change to dl_analytics.event can break dl_viewer.app, while a change to dl_viewer.app can't break dl_analytics.event.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
dl_viewer.app uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_viewer.app, while a change to dl_viewer.app can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in dl_viewer.app uses a type in dl_viewer_context.item.
The types involved
dl_viewer.app.App → dl_viewer_context.item.Item
Direction
dl_viewer.app uses dl_viewer_context.item, so a change to dl_viewer_context.item can break dl_viewer.app, while a change to dl_viewer.app can't break dl_viewer_context.item.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
dl_viewer.app uses dl_viewer_context.view.view_class_registry, so a change to dl_viewer_context.view.view_class_registry can break dl_viewer.app, while a change to dl_viewer.app can't break dl_viewer_context.view.view_class_registry.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
dl_viewer.app uses dl_entity_db.entity_db, so a change to dl_entity_db.entity_db can break dl_viewer.app, while a change to dl_viewer.app can't break dl_entity_db.entity_db.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in dl_viewer.app uses a type in dl_viewer.app_state.
The types involved
dl_viewer.app.App → dl_viewer.app_state.AppState
Direction
dl_viewer.app uses dl_viewer.app_state, so a change to dl_viewer.app_state can break dl_viewer.app, while a change to dl_viewer.app can't break dl_viewer.app_state.
Position
Below the diagonal: dl_viewer.app uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_log_types.index.time_int, so a change to dl_log_types.index.time_int can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_log_types.index.time_int.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_types_core.archetype, so a change to dl_types_core.archetype can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_types_core.archetype.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_types_core.timeline_name, so a change to dl_types_core.timeline_name can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_types_core.timeline_name.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_chunk.latest_at, so a change to dl_chunk.latest_at can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_chunk.latest_at.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_log_types.index.absolute_time_range, so a change to dl_log_types.index.absolute_time_range can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_log_types.index.absolute_time_range.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_types_core.component_descriptor, so a change to dl_types_core.component_descriptor can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_types_core.component_descriptor.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_types_core.chunk_id, so a change to dl_types_core.chunk_id can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_types_core.chunk_id.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in dl_chunk.chunk uses a type in dl_types_core.row_id.
The types involved
dl_chunk.chunk.Chunk → dl_types_core.row_id.RowId
Direction
dl_chunk.chunk uses dl_types_core.row_id, so a change to dl_types_core.row_id can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_types_core.row_id.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
dl_chunk.chunk uses dl_log_types.path.entity_path, so a change to dl_log_types.path.entity_path can break dl_chunk.chunk, while a change to dl_chunk.chunk can't break dl_log_types.path.entity_path.
Position
Below the diagonal: dl_chunk.chunk uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 51.2 · Adequate · gated by R1 ·
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
64
High / Critical
A05:2025 — Injection
11
High / Critical
A02:2025 — Security Misconfiguration
5
High / Critical
Roadmap
Top priorities: Add a CI workflow that builds and runs the test suite on every push/PR; Add a test runner (vitest / jest / playwright) and eslint as package.json scripts and run them in CI; Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Add a CI workflow that builds and runs the test suite on every push/PR.
Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
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.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 60
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 — 3302
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 — 258
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 16
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 83 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 83 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, 3509 of 3620 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the Rust half could not be measured — the Cargo suite in repository root did not build, so it was never run. Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo.
D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.py, .rs) and this repository declares a Cargo test suite (repository root, 529 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Python REDACTED/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its crate dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): 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 — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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.
D31 IaC & Container Security — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Checkov ran but its report could not be read (checkov produced no output — not a clean result). Every misconfiguration only checkov reports — most of its Terraform, CloudFormation, Bicep and Ansible policies — is absent from this card, so its absence here is not evidence those resources are configured correctly.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `dalaran_py/dalaran_sdk/dalaran/catalog/_entry.py` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AX1 Captive dependencies — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository defines its own container in dalaran_py/dalaran_sdk/dalaran/any_batch_value.py, whose lifetimes are not modelled 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.
AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The dev server exited, and its output does not match a cause we recognise. (rule: unrecognised-exit). The renderer reported: the dev server (`npm run dev` in dalaran_notebook/) exited before it served a page. Likely cause (not identified): the dev server exited, and its output does not match a cause we recognise. Last output: "36 │ return (await import("./dl_viewer")).default; / ╵ ~~~~~~~~~~~~~ / file://<repo>/dalaran_notebook/build.mjs:26 / throw new Error(`Failed to build widget:\n${e.toString()}`); / ^ / Error: Failed to build widget: / Error: Build failed with 1 error: / ../dalaran_js/web-viewer/index.ts:36:23: ERROR: Could not resolve "./dl_viewer" / at main (file://<repo>/dalaran_notebook/build.mjs:26:11) / at process.processTicksAndRejections (node:internal/process/task_queues:105:5) / at async file://<repo>/dalaran_notebook/build.mjs:44:1 / Node.js v22.13.0" No runtime evidence was gathered.
AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (dev). the dev server (`npm run dev` in dalaran_notebook/) exited before it served a page. Likely cause (not identified): the dev server exited, and its output does not match a cause we recognise. Last output: "36 │ return (await import("./dl_viewer")).default; / ╵ ~~~~~~~~~~~~~ / file://<repo>/dalaran_notebook/build.mjs:26 / throw new Error(`Failed to build widget:\n${e.toString()}`); / ^ / Error: Failed to build widget: / Error: Build failed with 1 error: / ../dalaran_js/web-viewer/index.ts:36:23: ERROR: Could not resolve "./dl_viewer" / at main (file://<repo>/dalaran_notebook/build.mjs:26:11) / at process.processTicksAndRejections (node:internal/process/task_queues:105:5) / at async file://<repo>/dalaran_notebook/build.mjs:44:1 / Node.js v22.13.0" No runtime evidence was gathered.
C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. 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.
X17 Uncapped recursion over a caller-supplied document — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 13 further occurrence(s) are not listed individually; the score already reflects all 53.
X19 Unrestored process-global state — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X24 Document value interpolated into markup unescaped — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X5 Nullable reference types — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 493 further occurrence(s) are not listed individually; the score already reflects all 533.
Repo exclusion declarations: 2184 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
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.
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 checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
D22 Internal API Consistency: API consistency compares the call shapes of members that play the same role on the exposed C# surface: whether the API suits its callers is not measured, and surfaces in other languages are not measured.
D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
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 REDACTED, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
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.
150 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was App::run_system_command at 94. A further 32 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 Scale::from_str at 42 — they are counted neither in the figure above nor in this dimension's score. 15 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: crates/viewer/dl_ui/src/color_table.rs (Scale::from_str at 42), crates/viewer/dl_ui/src/command/ui_command.rs (UICommand::kb_shortcuts at 40), crates/viewer/dl_ui/src/command/recording_command.rs (RecordingCommandKind::text_and_tooltip at 25), crates/build/dl_types_builder/src/codegen/rust/arrow.rs (ArrowDataTypeTokenizer::to_tokens at 22), crates/build/dl_types_builder/src/codegen/rust/api.rs (TypeTokenizer::to_tokens at 21), and 10 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 92 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with App::run_system_command (cyclomatic 94). — Refactoring it lifts Cyclomatic Complexity from 6.1 to about 6.5/10.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 210 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 120 down to 120 or less in Cognitive Complexity — start with App::run_system_command (cognitive 134). — Refactoring it lifts Cognitive Complexity from 5.3 to about 5.4/10.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.4 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 88 MethodTooLong finding(s) in God Classes — start with mod.rs (5), query.rs (4), command_handling.rs (3). — One of this dimension's main actionable groups (88 warning-level).
Resolve the 75 FileTooLong finding(s) in God Classes — start with mod.rs (6), query.rs (2), view_class.rs (2). — One of this dimension's main actionable groups (75 warning-level).
Resolve the 45 FunctionTooLong finding(s) in God Classes — start with mod.rs (2), video_stream_cache.rs (2), entrypoint.rs (2). — One of this dimension's main actionable groups (45 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
475 duplicated block group(s) detected. 5.1 % of the production lines (23,411 of 462,219) are in a reported copy. A further 374 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 102 of the 849 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 223 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 35 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), draw.rs (2), query.rs. — One of this dimension's main actionable groups (35 warning-level).
Resolve the 32 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with compare.py (2), chunk.rs, data_source.rs. — One of this dimension's main actionable groups (32 warning-level).
Resolve the 28 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with outlines.rs (2), lines.rs (2), writes.rs. — One of this dimension's main actionable groups (28 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling6.6 / 10Adequate✓ 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.
114 production modules (Cargo+npm+Python), 0 dependency cycle(s), 25 unstable depended-on module(s). Read from the build's own module declarations; 17 module(s) off the main sequence, with abstractness counted on 102 of the 114 (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: dl_build_tools · ×17
Unstable project dalaran
Unstable project dl_blueprint_tree
Unstable project dl_chunk_store_ui
Unstable project dl_dataframe_ui
+ 21 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 17 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (17 warning-level).
Resolve the 1 Unstable project dalaran finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project dl_blueprint_tree finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
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 5 Low cohesion finding(s) in Cohesion (LCOM4) — start with chunk.rs, importer.rs, notifications.rs. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
55 outdated, 0 yanked direct Cargo dependencies. 220 of 223 direct crates were graded against crates.io (0 not published there, 3 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: async-trait · ×55
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 1076 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. A further 12 crate(s) in the closure resolve from git, a path or a private registry and publish no licence this pass can read; they are outside this verdict. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares a Python REDACTED/requirements.txt (pip/uv/Poetry) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 68 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (2), command_handling.rs, lint.py. — One of this dimension's main actionable groups (68 warning-level).
Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with robot.py. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.4 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
69 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs. Counted over 1170 of the 1713 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 · ×6
Further sole-owners (lower concentration)
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
1273 deducted task-comment markers across 462219 LoC (0.3/KLoC) → score 9.5. 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 1267 TodoComment finding(s) in Explicit Debt — start with mod.rs (59), lib.rs (47), query.rs (19). — One of this dimension's main actionable groups (1267 warning-level).
Resolve the 6 HackComment finding(s) in Explicit Debt — start with __main__.py, command_handling.rs, logic.rs. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 2 documentation facets pass in full; short on: F2 example. 273 document(s) read across 109 unit(s).
Documentation: no build, run or usage example · ×84crates/store/dl_chunk/README.md:1
What to do
Resolve the 84 Documentation finding(s) in Documentation Quality — start with README.md (84). — One of this dimension's main actionable groups (84 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.
2 naming inconsistencies among 80 declarations measured against a convention their peers follow.
`do_GET` spells `GET` where 78 names in the project spell it `get`dalaran_notebook/src/dalaran_notebook/asset_server.py:39
`_serve_GET` spells `GET` where 78 names in the project spell it `get`dalaran_notebook/src/dalaran_notebook/asset_server.py:48
What to do
Resolve the 1 `do_GET` spells `GET` where 78 names in the project spell it `get` finding(s) in Naming Consistency — start with asset_server.py. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 `_serve_GET` spells `GET` where 78 names in the project spell it `get` finding(s) in Naming Consistency — start with asset_server.py. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d21_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D22 · Internal API Consistency10.0 / 10Exemplary○ Nothing flagged
What it measures: Whether the internal API surface is consistent and coherent.
Method: Call-shape rules (A1-A9) over the structured code model of the intentionally exposed C# surface: members of one type, overloads of one name and the same slot across sibling types are compared, and a member that makes a caller use a different convention for the same kind of operation is flagged. Deterministic, no model. Advisory.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.
8 of 111 build units (Cargo, Python, npm) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion · ×8dalaran_py/Cargo.toml:1
What to do
Resolve the 8 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Cargo.toml (8). — One of this dimension's main actionable groups (8 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).
11 finding(s): 0 critical, 5 high, 4 medium, 2 low. semgrep hit a parse error in 4 file(s) — `crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs` (line 65, lines 67–70, line 71, …), `crates/viewer/dl_renderer/src/importer/dae.rs` (line 384, line 420), `dalaran_cpp/docs/header.html` (lines 4–89), `dalaran_py/dalaran_sdk/dalaran/catalog/_entry.py` — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
+ 7 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 12 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (7), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (12 issue-level).
Resolve the 5 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (4), REDACTED. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 2 Critical vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 2 High IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Critical 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).
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.
41 of 1170 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is crates/viewer/dl_renderer/src/file_resolver.rs. Counted over 1170 of the 1713 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 2 Orphaned knowledge finding(s) in Knowledge Freshness — start with file_resolver.rs, iterator.rs. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 39 Orphaned file finding(s) in Knowledge Freshness — start with as_components.rs, generate_view_coordinate_defs.py, error_utils.py. — One of this dimension's main actionable groups (39 recommendation-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 19 Change coupling finding(s) in Change Coupling — start with selection_panel.rs (2), __init__.py, gltf.rs. — One of this dimension's main actionable groups (19 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
1 end-of-life runtime(s) and 0 end-of-life framework(s), read from 4 platform declaration(s) and 10 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
End-of-life runtime: Rust 1.95rust-toolchain:1
What to do
Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with rust-toolchain. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d44_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
Do you agree with this assessment?
AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged
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.
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"). — REDACTED:3
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. — REDACTED:3
user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta. — REDACTED:7
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
<div> moves — its inline style sets `transition: width 0.2s` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — dalaran_js/web-viewer/index.ts:517
`.sm-dox ul a:hover, .sm-dox ul a:active, .sm-dox ul a:focus` sets color: #1C1D1F on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:493
`.sm-dox a:hover, .sm-dox a:active, .tablist li a:hover` sets color: #1C1D1F on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:515
`#MSearchSelectWindow a.SelectItem:hover` sets color: #1C1D1F on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:713
`.dalaran-notebook-loading__spinner` moves (`animation: dalaran-notebook-spin 0.8s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_py/dalaran_sdk/dalaran/_loading_widget.css:23
`.sm-dox ul` moves (`animation: ease-out 150ms slideInMenu`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:464
`#MSearchResultsWindow` moves (`animation: ease-out 280ms slideInSearchResults`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:664
`#MSearchResultsWindow` moves (`animation: ease-out 280ms slideInSearchResultsMobile`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:750
`div.contents .toc.interactive > h3::before` moves (`transition: transform 0.25s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1177
`div.contents .toc.interactive.open` moves (`transition: max-height 0.2s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1187
`table.memberdecls img[src="closed.png"]` moves (`transition: transform 0.25s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1869
`table.memberdecls tr[style="display: table-row "]` moves (`animation: fade .5s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1948
`doxygen-awesome-dark-mode-toggle > svg` moves (`transition: transform .1s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:2347
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
`StoreHub.load_blueprint_store` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command. — crates/viewer/dl_viewer_context/src/store_hub.rs:1348
What to do
Keep query handlers read-only — move the writes/event-publishes into a command handler so reads stay safe to retry, cache, and route to a read replica.
Other · Event-Driven — Whether event/message handlers avoid synchronous blocking waits — a blocking wait inside a handler stalls throughput and risks deadlock.
Method: Roslyn semantic scan (event-driven gated): event-handler bodies scanned for HTTP/gRPC invocations by resolved symbol type, not substring. Deterministic, semantic-resolved.
`common.collect_snippets_for_api_docs` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/build/dl_types_builder/src/codegen/common.rs:312
`cpu_worker.chunk_store_cpu_worker_thread` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `recv`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:804
`DataframeSegmentStream.poll_next` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `block_on`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:224
`FileSink.with_options` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/store/dl_log_encoding/src/dlr/file_sink.rs:125
`register_with_dataset.load_store_ids` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/store/dl_server/src/dalaran_cloud/register_with_dataset.rs:442
`ResolvedStore.load_dlr_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. (×2) — crates/store/dl_server/src/store/resolved_store.rs:128, crates/store/dl_server/src/store/resolved_store.rs:144
`resolved_store.write_dlr` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/store/dl_server/src/store/resolved_store.rs:233
`resolved_store.enumerate_and_load_agree_on_store_ids` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/store/dl_server/src/store/resolved_store.rs:276
`source.write_dlr` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/store/dl_server/src/store/source.rs:333
`source.dlr_manifest_lazy_and_eager_produce_equivalent_output` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. (×2) — crates/store/dl_server/src/store/source.rs:387, crates/store/dl_server/src/store/source.rs:393
`compare.load_chunks` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/top/dalaran/src/commands/dlr/compare.rs:197
`Config.load` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/utils/dl_analytics/src/native/config.rs:85
`Pipeline.new` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/utils/dl_analytics/src/native/pipeline.rs:68
`cli.login` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `thread::sleep`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/utils/dl_auth/src/cli.rs:90
`storage.load` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/utils/dl_auth/src/oauth/storage.rs:71
`storage.clear` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::remove_file`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/utils/dl_auth/src/oauth/storage.rs:93
`add_data_source.register_local_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/viewer/dl_viewer/src/app/add_data_source.rs:414
`wsl.is_wsl` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/viewer/dl_viewer/src/viewer_analytics/wsl.rs:4
`WebViewerData.from_archive` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/viewer/dl_web_viewer_server/src/lib.rs:167
`trailing_data.read_zip_from_exe` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — crates/viewer/dl_web_viewer_server/src/trailing_data.rs:27
`PyRrdReaderInternal.store` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — dalaran_py/src/chunk_stream/dlr_reader.rs:162
`python_bridge.init_perf_telemetry` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `block_on`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — dalaran_py/src/python_bridge.rs:159
`python_bridge.check_for_dlr_footer` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — dalaran_py/src/python_bridge.rs:2864
`utils.wait_for_future` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `block_on`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — dalaran_py/src/utils.rs:46
What to do
Use the awaited twin of each blocking call, or move the work off the loop with `tokio::task::spawn_blocking` — a synchronous handler cannot simply `.await` in place.
Other · Event-Driven — Whether state changes and message publishes are atomic (a transactional outbox) rather than a crash-unsafe dual write.
Method: Roslyn semantic scan (event-driven gated): event-handler methods scanned for DB-save plus bus-publish without a transactional outbox reference. Deterministic, semantic-resolved.
`merge_optimize$module.merge_and_compact` performs two independent DURABLE writes — a durable state write (`entity_db.store_kind`, :555) and a second independent durable store write — in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox). — crates/top/dalaran/src/commands/dlr/merge_optimize.rs:437
`recording$module.check_recording` performs two independent DURABLE writes — a durable state write (`store_ids.insert`, :131) and a second independent durable store write — in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox). — crates/top/dalaran/src/commands/doctor/recording.rs:26
What to do
Adopt the transactional outbox pattern so DB writes and message publishes commit atomically — no lost or phantom events on a crash.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
Other · Code Health — Unreviewed-generation residue in this repository's Rust: functions whose whole body is still `todo!()`/`unimplemented!()` or only panics with a "not implemented" message, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
`do_maintenance`'s whole body panics or returns an error whose message says it isn't finished — generated scaffolding that was never completed. Implement it or remove it. — crates/store/dl_server/src/dalaran_cloud/mod.rs:2065
`do_global_maintenance`'s whole body panics or returns an error whose message says it isn't finished — generated scaffolding that was never completed. Implement it or remove it. — crates/store/dl_server/src/dalaran_cloud/mod.rs:2074
`create_table_entry`'s whole body panics or returns an error whose message says it isn't finished — generated scaffolding that was never completed. Implement it or remove it. — crates/store/dl_server/src/store/table.rs:310
What to do
Finish or delete the functions that are still `todo!()`/`unimplemented!()` or panic "not implemented", and replace placeholder text before shipping.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Rust: functions whose body is `todo!()`/`unimplemented!()` or only panics with a "not implemented" message, match arms and branches left as `todo!()`, functions that take inputs and return a constant (`Ok(())`, `None`, `Default::default()`, an empty `Vec`) or do nothing, and impls most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`new` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/cpp/mod.rs:430
`quoted_arrow_primitive_type` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/arrow.rs:186
`quote_arrow_deserializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:459
`quote_arrow_field_deserializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:899
`quote_arrow_deserializer_buffer_slice` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:1112
`quote_arrow_field_deserializer_buffer_slice` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:1195
`quote_buffer_slice_element_type` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:1224
`quote_arrow_serializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/serializer.rs:448
`quote_arrow_field_serializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/codegen/rust/serializer.rs:970
`type_from_raw_type` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/build/dl_types_builder/src/objects/from_fbs.rs:560
`eval` does real work, but one of its branches is `Err` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. (×2) — crates/store/dl_lenses_core/src/selector/eval.rs:450, crates/store/dl_lenses_core/src/selector/eval.rs:555
`query_dataset` does real work, but one of its branches is `Err` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/store/dl_server/src/dalaran_cloud/mod.rs:1446
`do_maintenance`'s whole body panics or returns an error whose message says it isn't finished — a not-implemented stub in ordinary clothes. Implement it or remove it. — crates/store/dl_server/src/dalaran_cloud/mod.rs:2065
`do_global_maintenance`'s whole body panics or returns an error whose message says it isn't finished — a not-implemented stub in ordinary clothes. Implement it or remove it. — crates/store/dl_server/src/dalaran_cloud/mod.rs:2074
`create_table_entry`'s whole body panics or returns an error whose message says it isn't finished — a not-implemented stub in ordinary clothes. Implement it or remove it. — crates/store/dl_server/src/store/table.rs:310
`run` does real work, but one of its branches is `panic!` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — crates/top/dalaran/src/commands/dlr/print.rs:102
`print_property` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — crates/top/dalaran/src/commands/mcap/info.rs:167
`print_details` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — crates/utils/dl_analytics/src/cli.rs:118
`set_event_waker` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — crates/viewer/dl_gamepad/src/web.rs:7
`navigation_from_active_gamepad` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — crates/viewer/dl_gamepad/src/web.rs:11
`collect` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — crates/viewer/dl_renderer/src/file_server.rs:313
`setup_table_header` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — crates/viewer/dl_ui/src/design_tokens.rs:946
`build_table_container_end` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — dalaran_py/src/catalog/dataframe_rendering.rs:62
`log_tracing_session_started` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — dalaran_py/src/tracing_session.rs:141
What to do
Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
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 repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
Do you agree with this assessment?
P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified
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.
No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
What to do
Add a CI workflow that builds and runs the test suite on every push/PR.
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's code 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.
Only 57/65 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/build/dl_dev_tools`, `crates/build/dl_web_tests`, `crates/store/dl_query`, `crates/top/dalaran-cli`, `crates/utils/dl_test_mocks` and 3 more.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Add a health-check endpoint (a /health route on your axum/actix router) so orchestrators and load balancers can probe liveness/readiness.
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.
`dalaran_js/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — dalaran_js/package.json:13
What to do
Your ecosystem's static analyzer is declared as a dependency but is not wired into CI — run it as a required step on push/PR (e.g. `composer phpstan` / `mix sobelow` / `bundle exec brakeman` / the spotbugs Gradle task / `sbt scalafixAll --check` / `golangci-lint run` / `rebar3 lint`) so a regression fails the build instead of relying on someone running it locally.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code 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.
`login` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs. — crates/utils/dl_auth/src/cli.rs:51
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`.
Do you agree with this assessment?
R1 · Type Safety2.5 / 10Weak✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
3 typed · 9 plain JS — the untyped files are crates/viewer/dl_web_viewer_server/web_viewer/sw.js, dalaran_js/scripts/common.mjs, dalaran_js/scripts/docs.mjs, dalaran_js/scripts/publish.mjs, REDACTED, dalaran_js/scripts/version.mjs (+3 more). 0 production file(s) opt out entirely with @ts-nocheck · 3 @ts-ignore suppression(s).
React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.
dalaran_js/web-viewer/index.ts:768 · dalaran_js/web-viewer/index.ts: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. — dalaran_js/web-viewer/index.ts:768
dalaran_js/web-viewer/index.ts:899 · dalaran_js/web-viewer/index.ts:914 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — dalaran_js/web-viewer/index.ts:899
dalaran_js/web-viewer/index.ts:688 · dalaran_js/web-viewer/index.ts:710 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — dalaran_js/web-viewer/index.ts:688
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
start has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — dalaran_js/web-viewer/index.ts:490
on_custom_message has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — dalaran_notebook/src/js/widget.ts:112
(top-level) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — dalaran_js/scripts/version.mjs:4
Do you agree with this assessment?
R3 · Large Files6.7 / 10Adequate✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
dalaran_js/web-viewer/index.ts has 1170 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — dalaran_js/web-viewer/index.ts:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
Do you agree with this assessment?
R6 · Tooling3.3 / 10Weak✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
test ✗ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
What to do
Add a test runner (vitest / jest / playwright) and eslint as package.json scripts and run them in CI.
Do you agree with this assessment?
R7 · Dead Code9.9 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
2 file(s) (~1561 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: dalaran_js/web-viewer/index.ts imports './dl_viewer', which is not in the scanned tree. That is usually a generated or build-output module, so reachability cannot see past it and no dead-code claim is made about this package. Nothing is necessarily wrong here. — dalaran_js/web-viewer
Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect. — dalaran_js/web-viewer/index.ts:468
Nothing in its class calls or references this private method — no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used. — dalaran_js/web-viewer/index.ts:647
This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. — dalaran_notebook/build.mjs:40
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Declared in dalaran_js/web-viewer/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2) — dalaran_js/web-viewer/package.json:56, dalaran_js/web-viewer/package.json:58
Declared in dalaran_js/web-viewer-react/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — dalaran_js/web-viewer-react/package.json:48
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Security — Only what this repository's own non-C# files could be read for was assessed — markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. Nothing else in this dimension was assessed: the transport, cookie, input-validation and crypto controls are read from a source model that was not loaded for this repository’s language, so their absence here is not a finding about this repository.
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.
`https://cdn.jsdelivr.net/npm/chart.js@4.4.0/dist/chart.umd.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. — scripts/ci/templates/benchmark.html:111
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
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.
This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`. — crates/utils/dl_auth/src/cli.rs:90
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.
The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch. (×14) — crates/viewer/dl_web_viewer_server/src/lib.rs:506, crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:596, crates/viewer/dl_view_tensor/src/tensor_dimension_mapper.rs:283, …
`let mut caches = { dl_tracing::profile_wait !("master-cache-write-lock"); sel…` follows `{ return cache; }` (line 157) in the same block, and control never passes that statement — it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns `unreachable_code` on it. Delete it, or move it before the statement that leaves if it was meant to run. — crates/viewer/dl_viewer_context/src/cache/memoizers.rs:161
The `if` on line 109 tests the literal `true`, so control always takes it and this `else` never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch. — crates/viewer/dl_ui/src/list_item/property_content.rs:111
The `if` on line 137 tests the literal `true`, so control always takes it and this `else` never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch. — crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:148
`None` follows `{ * idx = if let Some(idx) = if before { current_idx.checked_sub(1) } else { …` (line 1051) in the same block, and control never passes that statement — it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns `unreachable_code` on it. Delete it, or move it before the statement that leaves if it was meant to run. — crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:1069
The `if` on line 115 tests the literal `true`, so control always takes it and this `else` never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch. — crates/build/dl_types_builder/src/codegen/rust/reflection.rs:117
What to do
Each finding names the span that makes the branch dead and the span it is dead because of. Confirm from the two, then delete the dead arm or fix the predicate that was meant to be reachable.
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.
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 document1.1 / 10Critical✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`compile` is public, takes a document from its caller (line 28) and hands it to `compile_inner`, which recurses at line 249 through `compile_split_branch`, `compile_merged` and back with a piece of the document (and at line 252, line 356, line 404) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `compile_inner` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — dalaran_py/src/chunk_stream/engine.rs:249
`tokens` is public and takes a `AppContext` as its receiver from its caller, and it calls itself at line 168 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `tokens` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/app_context.rs:168
`tokens` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 60 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `tokens` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:60
`render_mode` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 96 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `render_mode` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:96
`store_hub` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 111 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `store_hub` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:111
`store_bundle` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 116 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `store_bundle` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:116
`table_stores` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 121 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `table_stores` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:121
`store_id` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 190 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `store_id` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:190
`selection` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 195 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `selection` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:195
`is_selected_or_loading` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 200 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `is_selected_or_loading` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:200
`hovered` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 205 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `hovered` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:205
`selection_state` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 209 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `selection_state` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:209
`active_redap_entry` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 214 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `active_redap_entry` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:214
`active_table_id` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 219 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `active_table_id` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:219
`focused_item` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 224 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `focused_item` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:224
`drag_and_drop_manager` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 229 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `drag_and_drop_manager` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:229
`current_query` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 234 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `current_query` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:234
`handle_select_hover_drag_interactions` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 261 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `handle_select_hover_drag_interactions` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:261
`handle_select_focus_sync` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 274 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `handle_select_focus_sync` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:274
`revert_to_default_route` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 286 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `revert_to_default_route` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/viewer_context.rs:286
`display_name` is public and takes a `ViewClassRegistry` as its receiver from its caller, and it calls itself at line 408 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `display_name` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:408
`hash` is public and takes a `WgpuCoreWrappedContextError` as its receiver from its caller, and it calls itself at line 184 with a piece of the document (and at line 185) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `hash` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_renderer/src/error_handling/wgpu_core_error.rs:184
`eq` is public and takes a `WgpuCoreWrappedContextError` as its receiver from its caller, and it calls itself at line 200 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `eq` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_renderer/src/error_handling/wgpu_core_error.rs:200
`visit` is public and takes a `ContentsData` as its receiver from its caller, and it calls itself at line 86 with a piece of the document (and at line 87, line 166) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/viewer/dl_blueprint_tree/src/data.rs:86
`subscribe` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 268 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `subscribe` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/async_broadcast_channel.rs:268
`recv` is public and takes a `Receiver` as its receiver from its caller, and it calls itself at line 349 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `recv` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/async_broadcast_channel.rs:349
`clone` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 18 with a piece of the document (and at line 19) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `clone` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/async_mpsc_channel.rs:18
`send` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 33 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `send` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/async_mpsc_channel.rs:33
`try_send` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 68 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `try_send` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/async_mpsc_channel.rs:68
`recv` is public and takes a `Receiver` as its receiver from its caller, and it calls itself at line 82 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `recv` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/async_mpsc_channel.rs:82
`clone` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 71 with a piece of the document (and at line 313) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `clone` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/mod.rs:71
`is_empty` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 275 with a piece of the document (and at line 367) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `is_empty` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/mod.rs:275
`len` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 281 with a piece of the document (and at line 373) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `len` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/mod.rs:281
`recv` is public and takes a `Receiver` as its receiver from its caller, and it calls itself at line 338 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `recv` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/mod.rs:338
`recv_timeout` is public and takes a `Receiver` as its receiver from its caller, and it calls itself at line 346 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `recv_timeout` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/mod.rs:346
`try_recv` is public and takes a `Receiver` as its receiver from its caller, and it calls itself at line 353 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `try_recv` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/mod.rs:353
`recv` is public and takes a `Select` as its receiver from its caller, and it calls itself at line 137 with a piece of the document (and at line 202) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `recv` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/select.rs:137
`select` is public and takes a `Select` as its receiver from its caller, and it calls itself at line 148 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `select` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/select.rs:148
`try_select` is public and takes a `Select` as its receiver from its caller, and it calls itself at line 157 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `try_select` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/select.rs:157
`select_timeout` is public and takes a `Select` as its receiver from its caller, and it calls itself at line 172 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `select_timeout` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crates/utils/dl_quota_channel/src/sync/select.rs:172
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
`writer` (line 1701) is a `BufWriter` this function owns and never releases: no `flush()` (or `into_inner()`) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends. — crates/viewer/dl_viewer/src/app/mod.rs:1701
`frame` (line 68) is a transaction this function owns and never releases: no `commit()` (or a deliberate `rollback()`) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends. — crates/viewer/dl_view_time_series/src/visualizer_ui.rs:68
`table_state` (line 401) is a `DataFusionAdapter` released by `update_query()` only on the path that reaches line 504; the `return` on line 438 leaves before that with a success value, and on that path `DataFusionAdapter` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it before that `return` too (or return an error there, if the early exit is a failure). — crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:401
`selection` (line 1160) is a `TableSelectionState` this function owns and never releases: no `store()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `TableSelectionState` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends. — crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:1160
`viewport` (line 72) is a `ViewportBlueprint` this function owns and never releases: no `save_to_blueprint_store()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `ViewportBlueprint` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends. — crates/viewer/dl_dataframe_ui/src/preview_renderer.rs:72
`data_type_ui` (line 76) is a `DataTypeUi` this function owns and never releases: no `list_item_ui()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `DataTypeUi` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends. — crates/viewer/dl_arrow_ui/src/arrow_node.rs:76
`data_type_ui` (line 130) is a `DataTypeUi` this function owns and never releases: no `list_item_ui()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `DataTypeUi` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends. — crates/viewer/dl_arrow_ui/src/datatype_ui.rs:130
`std::mem::forget(stream)` (line 62) takes `stream` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done. — crates/top/dl_sdk/src/global.rs:62
`std::mem::forget(global.write().take())` (line 265) takes `global.write().take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done. — crates/top/dl_sdk/src/global.rs:265
`std::mem::forget(cell.take())` (line 269) takes `cell.take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done. — crates/top/dl_sdk/src/global.rs:269
`std::mem::forget(global.write().take())` (line 275) takes `global.write().take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done. — crates/top/dl_sdk/src/global.rs:275
`std::mem::forget(cell.take())` (line 279) takes `cell.take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done. — crates/top/dl_sdk/src/global.rs:279
`part.into_raw()` (line 1407) gives up ownership in exchange for a raw handle — the value's `Drop` will no longer run — and nothing in the crate's code ever reclaims a `dl_sdk` from a raw pointer (`dl_sdk::from_raw`). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a `free` function that rebuilds the owner with `from_raw` and drops it), or keep the owning value. — crates/top/dalaran_c/src/lib.rs:1407
`buffered_writer` (line 152) is a `BufWriter` this function owns and never releases: no `flush()` (or `into_inner()`) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends. — crates/top/dalaran/src/commands/dlr/migrate.rs:152
`hub.into_raw()` (line 287) gives up ownership in exchange for a raw handle — the value's `Drop` will no longer run — and nothing in the crate's code ever reclaims a `dl_log_encoding` from a raw pointer (`dl_log_encoding::from_raw`). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a `free` function that rebuilds the owner with `from_raw` and drops it), or keep the owning value. — crates/store/dl_redap_client/src/connection_client.rs:287
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
Other · Code Health — Whether async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) 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.
`url_exists` 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 })`. — dalaran_notebook/src/dalaran_notebook/error_widget.js:18
`fetch_viewer_wasm` 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 })`. — dalaran_js/web-viewer/index.ts:39
`isPublished` 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 })`. — dalaran_js/scripts/common.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. Also whether a `finally` that gives the primitive back unconditionally can run in a state where the method does not hold it: after a timed wait whose result was discarded, after an acquire inside the `try` that can fail, after the body already released it, or never, because a `return` left between the acquire and the `try`. In Rust, where a guard or permit releases when it is dropped, whether a release written BY HAND — `add_permits` after a forgotten permit, `force_unlock` after a leaked guard, a raw lock's `unlock` — matches the state the function's own acquisitions put the primitive in: not after a try or timed acquire whose failure does not leave, not from a cleanup set up before an acquire that can fail, not skipped by a `?`, `return`, `break` or `continue`, and not on top of a guard that still releases itself.
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.
`tracing::debug!` at line 522 is called with an argument built by `chunk_sizes.iter().sum::<u64>()` (line 525), whose cost grows with the collection it walks. Rust evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because tracing::debug! is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `log_enabled!`/`tracing::enabled!` test, no debug flag, no `cfg(debug_assertions)`, and the work is in the argument itself, not deferred into a field the subscriber formats or a closure the formatter calls. — crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:522
What to do
In Rust, hand the logger the value and let it format only what it writes: `debug!("rows: {:?}", rows)` or a field, `debug!(rows = ?rows, "loaded")` — `format_args!` and `?`/`%` fields defer the formatting. When the line needs a computed view (a `collect`, a `join`, a `serde_json::to_string`), put it behind `if log_enabled!(Level::Debug)` (`if tracing::enabled!(Level::DEBUG)` for tracing), which asks the target's own filter. The macros put their arguments behind the global maximum level only, so a collect or serialisation in the argument runs whenever any target is at debug, and the logger then drops this line.
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.
`SphinxObjectInv.project` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/build/dl_dev_tools/src/build_search_index/ingest/python.rs:220
`DalaranArgs.spawn` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/top/dalaran/src/clap.rs:46
`CompactCommand._ignored` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/top/dalaran/src/commands/dlr/merge_optimize.rs:422
`User.email_verified` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/utils/dl_auth/src/oauth/api.rs:329
`User.profile_picture_url` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/utils/dl_auth/src/oauth/api.rs:330
`User.first_name` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/utils/dl_auth/src/oauth/api.rs:331
`User.last_name` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/utils/dl_auth/src/oauth/api.rs:332
`User.last_sign_in_at` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/utils/dl_auth/src/oauth/api.rs:333
`User.external_id` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/utils/dl_auth/src/oauth/api.rs:336
`GetDeviceAuthUrlResponse.expires_in` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — crates/utils/dl_auth/src/oauth/api.rs:357
What to do
Each finding names the spans that disagree — the knob the caller supplies and the site that ignores it, whether by re-spelling its default, by falling back under the wrong key, by parsing with no format provider at all, or by printing under whatever culture the host supplies. Confirm from those spans, then decide which of the two the type meant: read the knob at the named site, or drop the knob so the signature stops advertising something the type cannot feel. Leaving both is the one option that cannot be right.
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.
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.
`warning` at line 248 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — dalaran_notebook/src/dalaran_notebook/__init__.py:248
`debug!` at line 153 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`. — dalaran_py/src/trace_context.rs:153
`debug!` at line 164 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`. — dalaran_py/src/trace_context.rs:164
`info!` at line 142 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`. — dalaran_py/src/tracing_session.rs:142
`warn!` at line 272 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`. — dalaran_py/src/catalog/connection_handle.rs:272
`error!` at line 48 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/utils/dl_perf_telemetry/src/metrics_server.rs:48
`info!` at line 52 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/utils/dl_perf_telemetry/src/metrics_server.rs:52
`error!` at line 87 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/utils/dl_perf_telemetry/src/metrics_server.rs:87
`error!` at line 97 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/utils/dl_perf_telemetry/src/metrics_server.rs:97
`warn!` at line 183 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/utils/dl_perf_telemetry/src/telemetry.rs:183
`warn!` at line 281 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/utils/dl_perf_telemetry/src/telemetry.rs:281
`debug!` at line 139 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/utils/dl_perf_telemetry/src/tracestate.rs:139
`info!` at line 331 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/utils/dl_perf_telemetry/src/tracing_session.rs:331
`info!` at line 112 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `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/store/dl_server/src/server.rs:112
`error!` at line 120 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/store/dl_server/src/server.rs:120
`error!` at line 179 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/store/dl_server/src/server.rs:179
`trace!` at line 295 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/store/dl_redap_client/src/lib.rs:295
`trace!` at line 306 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/store/dl_redap_client/src/lib.rs:306
`trace!` at line 314 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/store/dl_redap_client/src/lib.rs:314
`debug!` at line 325 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/store/dl_redap_client/src/lib.rs:325
`debug!` at line 457 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/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:457
`debug!` at line 522 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `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/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:522
Other · Code Health — Whether Rust's absent values are handled rather than forced — `Option` and `Result` make absence a value the caller must handle in every crate, and each `.unwrap()` or `.expect()` that no guard on its path proves present is a panic the first time the value is `None` or `Err`.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
`std::thread::Builder::new().name("cargo_run_wasm".into()).spawn(||{cargo_run_wasm::run_wasm_cli_with_css(CSS);})` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — run_wasm/src/main.rs:85
`thread.join()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — run_wasm/src/main.rs:88
`dl_build_tools::get_and_track_env_var("CARGO_MANIFEST_DIR")` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:19
`fs::read_dir(&all_path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:34
`fs::read_dir(subdir.path())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:39
`path.file_stem()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:44
`path.file_stem().unwrap().to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:44
`fs::read_to_string(&path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:46
`path.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:62
`dl_build_tools::write_file_if_necessary(target_path,contents.as_bytes(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:72
`path.file_name()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:79
`fs::copy(&path,&target_path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:80
`dl_build_tools::rustfmt_str(&source)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:151
`dl_build_tools::write_file_if_necessary(snippets_path.join("mod.rs"),source.as_bytes(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/build.rs:157
`(sink as&dyn std::any::Any).downcast_ref::<dalaran::sink::GrpcSink>()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/all/howto/check_connection_status.rs:20
`stops.last()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `colormap` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — docs/snippets/all/howto/dual_color_point_cloud.rs:26
`rec.flush_blocking()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×4) — docs/snippets/all/descriptors/descr_builtin_archetype.rs:37, docs/snippets/all/descriptors/descr_builtin_component.rs:47, docs/snippets/all/descriptors/descr_custom_archetype.rs:82, …
`std::fs::File::open(&path_to_dlr)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×4) — docs/snippets/all/descriptors/descr_builtin_archetype.rs:39, docs/snippets/all/descriptors/descr_builtin_component.rs:49, docs/snippets/all/descriptors/descr_custom_archetype.rs:84, …
`ChunkStore::from_dlr_reader(&ChunkStoreConfig::ALL_DISABLED,&mut dlr_file,)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×4) — docs/snippets/all/descriptors/descr_builtin_archetype.rs:44, docs/snippets/all/descriptors/descr_builtin_component.rs:54, docs/snippets/all/descriptors/descr_custom_archetype.rs:89, …
`stores.into_values().next()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×4) — docs/snippets/all/descriptors/descr_builtin_archetype.rs:47, docs/snippets/all/descriptors/descr_builtin_component.rs:57, docs/snippets/all/descriptors/descr_custom_archetype.rs:92, …
`chunks.into_iter().next()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×3) — docs/snippets/all/descriptors/descr_builtin_component.rs:62, docs/snippets/all/descriptors/descr_custom_archetype.rs:97, docs/snippets/all/descriptors/descr_custom_component.rs:57
`std::env::current_dir()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — dalaran_py/build.rs:43
`std::env::current_dir()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — dalaran_py/build.rs:48, dalaran_py/build.rs:59
`dl_perf_telemetry::Telemetry::init_with_session_id_reader(args,dl_perf_telemetry::TelemetryDropBehavior::Shutdown,||{pyo3::Python::attach(crate::tracing_session::current_dalaran_session_id_from_contextvar,)},)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `init_perf_telemetry` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — dalaran_py/src/python_bridge.rs:174
`tokio::runtime::Runtime::new()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `get_tokio_runtime` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — dalaran_py/src/utils.rs:20
What to do
Each row is a forced `Option`/`Result` no guard on its path proves present. Handle the absent case where it arises rather than forcing it: `?` to hand it to the caller, `if let` / `match` / `let … else` to branch on it, `unwrap_or` / `unwrap_or_default` / `unwrap_or_else` where a default is right. Where the value genuinely cannot be absent, say so in a way a reader can check from the line: test it first (`if x.is_none() { return … }`), look the key up with `contains_key` or the index against `len()`, or construct the value so it cannot be absent.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 13 of 55 WCAG 2.2 Level A/AA success criteria (24%; ≈26% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 42 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 14 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 7 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 — 4 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 42 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — not 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
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 — AX6 reached only 13% of this repository's production lines — rust (400,701 lines), cpp (12,325 lines), c (159 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the dev server (`npm run dev` in dalaran_notebook/) exited before it served a page. Likely cause (not identified): the dev server exited, and its output does not match a cause we recognise. Last output: "36 │ return (await import("./dl_viewer")).default; / ╵ ~~~~~~~~~~~~~ / file://<repo>/dalaran_notebook/build.mjs:26 / throw new Error(`Failed to build widget:\n${e.toString()}`); / ^ / Error: Failed to build widget: / Error: Build failed with 1 error: / ../dalaran_js/web-viewer/index.ts:36:23: ERROR: Could not resolve "./dl_viewer" / at main (file://<repo>/dalaran_notebook/build.mjs:26:11) / at process.processTicksAndRejections (node:internal/process/task_queues:105:5) / at async file://<repo>/dalaran_notebook/build.mjs:44:1 / Node.js v22.13.0" No runtime evidence was gathered. This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~85394 lines of test source are present (.py, .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.
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+ sibling projects each declaring an entity of their own or taking another project's integration events. 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"]`.
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
D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not measured — Rust suite
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 455 value object(s); 1 domain event(s); its domain events are published by services or handlers — no domain entity raises one
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
P12 CI test-gate honesty — no CI workflow found
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R4 Test Coverage — the JS/TS workspace (10 production file(s)) has no JavaScript/TypeScript test, but it is 0.55% of this repository's production source and the other 99.45% carries 85,394 line(s) of test code this pass cannot read — an incidental frontend's reachability is not the repository's test posture, so it is not scored as one
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — X19 reached only 13% of this repository's production lines — rust (400,701 lines), cpp (12,325 lines), c (159 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
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.
X24 Document value interpolated into markup unescaped — X24 reached only 13% of this repository's production lines — rust (400,701 lines), cpp (12,325 lines), c (159 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X3 Exception handling — X3 reached only 13% of this repository's production lines — rust (400,701 lines), cpp (12,325 lines), c (159 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
Critical — 60 finding(s)
ED1 · Handler temporal coupling· Blocking call on the event loop · ×26
Blocking call on the event loop: common.collect_snippets_for_api_docs calls `std::fs::read_to_string` crates/build/dl_types_builder/src/codegen/common.rs:312— `common.collect_snippets_for_api_docs` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: cpu_worker.chunk_store_cpu_worker_thread calls `recv` crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:804— `cpu_worker.chunk_store_cpu_worker_thread` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `recv`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: DataframeSegmentStream.poll_next calls `block_on` crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:224— `DataframeSegmentStream.poll_next` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `block_on`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: FileSink.with_options calls `File::create` crates/store/dl_log_encoding/src/dlr/file_sink.rs:125— `FileSink.with_options` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: register_with_dataset.load_store_ids calls `File::open` crates/store/dl_server/src/dalaran_cloud/register_with_dataset.rs:442— `register_with_dataset.load_store_ids` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: ResolvedStore.load_dlr_file calls `File::open` crates/store/dl_server/src/store/resolved_store.rs:128— `ResolvedStore.load_dlr_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: ResolvedStore.load_dlr_file calls `File::open` crates/store/dl_server/src/store/resolved_store.rs:144— `ResolvedStore.load_dlr_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: resolved_store.write_dlr calls `File::create` crates/store/dl_server/src/store/resolved_store.rs:233— `resolved_store.write_dlr` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: resolved_store.enumerate_and_load_agree_on_store_ids calls `File::open` crates/store/dl_server/src/store/resolved_store.rs:276— `resolved_store.enumerate_and_load_agree_on_store_ids` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: source.write_dlr calls `File::create` crates/store/dl_server/src/store/source.rs:333— `source.write_dlr` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::create`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: source.dlr_manifest_lazy_and_eager_produce_equivalent_output calls `File::open` crates/store/dl_server/src/store/source.rs:387— `source.dlr_manifest_lazy_and_eager_produce_equivalent_output` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: source.dlr_manifest_lazy_and_eager_produce_equivalent_output calls `File::open` crates/store/dl_server/src/store/source.rs:393— `source.dlr_manifest_lazy_and_eager_produce_equivalent_output` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: compare.load_chunks calls `File::open` crates/top/dalaran/src/commands/dlr/compare.rs:197— `compare.load_chunks` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: Config.load calls `File::open` crates/utils/dl_analytics/src/native/config.rs:85— `Config.load` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: Pipeline.new calls `std::fs::create_dir_all` crates/utils/dl_analytics/src/native/pipeline.rs:68— `Pipeline.new` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::create_dir_all`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: cli.login calls `thread::sleep` crates/utils/dl_auth/src/cli.rs:90— `cli.login` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `thread::sleep`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: storage.load calls `std::fs::read_to_string` crates/utils/dl_auth/src/oauth/storage.rs:71— `storage.load` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read_to_string`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: storage.clear calls `std::fs::remove_file` crates/utils/dl_auth/src/oauth/storage.rs:93— `storage.clear` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::remove_file`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: add_data_source.register_local_file calls `File::open` crates/viewer/dl_viewer/src/app/add_data_source.rs:414— `add_data_source.register_local_file` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: wsl.is_wsl calls `std::fs::read` crates/viewer/dl_viewer/src/viewer_analytics/wsl.rs:4— `wsl.is_wsl` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: WebViewerData.from_archive calls `File::open` crates/viewer/dl_web_viewer_server/src/lib.rs:167— `WebViewerData.from_archive` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: trailing_data.read_zip_from_exe calls `File::open` crates/viewer/dl_web_viewer_server/src/trailing_data.rs:27— `trailing_data.read_zip_from_exe` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: PyRrdReaderInternal.store calls `File::open` dalaran_py/src/chunk_stream/dlr_reader.rs:162— `PyRrdReaderInternal.store` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `File::open`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: python_bridge.init_perf_telemetry calls `block_on` dalaran_py/src/python_bridge.rs:159— `python_bridge.init_perf_telemetry` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `block_on`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Blocking call on the event loop: python_bridge.check_for_dlr_footer calls `std::fs::read` dalaran_py/src/python_bridge.rs:2864— `python_bridge.check_for_dlr_footer` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `std::fs::read`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`.
Orphaned knowledge crates/viewer/dl_renderer/src/file_resolver.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Dual write (no outbox): merge_optimize$module.merge_and_compact crates/top/dalaran/src/commands/dlr/merge_optimize.rs:437— `merge_optimize$module.merge_and_compact` performs two independent DURABLE writes — a durable state write (`entity_db.store_kind`, :555) and a second independent durable store write — in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox).
Dual write (no outbox): recording$module.check_recording crates/top/dalaran/src/commands/doctor/recording.rs:26— `recording$module.check_recording` performs two independent DURABLE writes — a durable state write (`store_ids.insert`, :131) and a second independent durable store write — in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox).
Viewport restricts zoom REDACTED:7— user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta.
AX9 · CQS / query purity· Query writes persistent state on the read path · ×1
Query writes persistent state on the read path: StoreHub.load_blueprint_store crates/viewer/dl_viewer_context/src/store_hub.rs:1348— `StoreHub.load_blueprint_store` is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command.
TodoComment tests/rust/plot_dashboard_stress/src/main.rs:33— // TODO(cmc): could have flags to add attributes (color, radius...) to put some more stress — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/rust/log_benchmark/src/image.rs:65— // TODO(andreas): We have to copy the image every time since the tensor buffer wants to — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/rust/dl_integration_test/tests/integration/internal_catalog.rs:19— // TODO(RR-4929): We should properly show the application id,
TodoComment tests/rust/dl_integration_test/tests/integration/internal_catalog.rs:173— // TODO(RR-5355): We currently still show too many toasts. Once we have improved
TodoComment tests/rust/dl_integration_test/tests/integration/internal_catalog.rs:180— // TODO(RR-4929): Remove this mask once the catalog app id matches recording app id.
TodoComment tests/rust/dl_integration_test/tests/integration/multi_container_test.rs:248— // TODO(aedm): count the labels in the selection panel only — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/python/plot_dashboard_stress/main.py:91— # TODO(cmc): could have flags to add attributes (color, radius...) to put some more stress — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/python/chunk_zoo/chunk_zoo.py:140— # TODO(ab): add variants (unordered, overlapping timestamps, etc.) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment scripts/fast_lint.py:164— # TODO(jleibs): implement lint-cpp-files — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment scripts/generate_changelog.py:580— # NOTE: we intentionally add TODO:s with names below, which the CI will not be happy about. Hence the # NOLINT suffixes — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment scripts/generate_view_coordinate_defs.py:7— # TODO(#2388): This script can potentially go away or be significantly reduced.
TodoComment scripts/lint.py:100— # TODO(RR-3355): Use a shared utility for this
TodoComment scripts/roundtrip_utils.py:14— # TODO(RR-3355): Use a shared utility for this
TodoComment scripts/lint.py:182— # TODO(#6077): figure out how we best link to our own code from our docs
TodoComment scripts/lint.py:1986— # TODO(#6730): parse all .gitignore files, not just top-level
TodoComment scripts/nbstripout.py:34— # TODO(#6730): parse all .gitignore files, not just top-level
TodoComment scripts/run_all.py:44— # TODO(ab): remove when mediapipe is 3.12 compatible — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment scripts/run_all.py:45— # TODO(ab): remove when mediapipe is 3.12 compatible — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment scripts/run_all.py:46— # TODO(ab): remove when torch is umap-learn/numba is 3.12 compatible — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment scripts/zombie_todos.py:374— # Check for internal issue references (TODO(#1234))
TodoComment scripts/zombie_todos.py:384— # Check for external issue references (TODO(owner/repo#1234))
TodoComment scripts/zombie_todos.py:396— # Check for Linear issue references (TODO(ABC-123))
TodoComment scripts/zombie_todos.py:451— # TODO(emilk): parse all .gitignore files, not just top-level — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment scripts/screenshot_compare/build_screenshot_compare.py:169— # TODO(andreas): nightly channel would be better, but the dependencies that requires make things hard to get to run. — 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.
MethodTooLong: App.run_system_command crates/viewer/dl_viewer/src/app/command_handling.rs:73— MethodTooLong — run_system_command runs 444 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 344 over it, 4.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: AppState.show crates/viewer/dl_viewer/src/app_state.rs:208— MethodTooLong — show runs 443 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 343 over it, 4.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TimeSeriesView.ui crates/viewer/dl_view_time_series/src/view_class.rs:440— MethodTooLong — ui runs 378 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 278 over it, 3.78× 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: ChunkStore.insert_chunk_impl crates/store/dl_chunk_store/src/writes.rs:280— MethodTooLong — insert_chunk_impl 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.
MethodTooLong: Telemetry.init crates/utils/dl_perf_telemetry/src/telemetry.rs:483— MethodTooLong — init runs 285 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 185 over it, 2.85× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: App.ui crates/viewer/dl_viewer/src/app/mod.rs:1233— MethodTooLong — ui runs 279 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 179 over it, 2.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: StatsCommand.run crates/top/dalaran/src/commands/dlr/stats.rs:33— MethodTooLong — run runs 249 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 149 over it, 2.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SpatialView3D.view_3d crates/viewer/dl_view_spatial/src/ui_3d.rs:124— MethodTooLong — view_3d runs 225 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 125 over it, 2.25× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: QueryHandle._next_n_rows crates/store/dl_dataframe/src/query.rs:1788— MethodTooLong — _next_n_rows runs 223 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 123 over it, 2.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: StateTimelineView.ui crates/viewer/dl_view_state_timeline/src/view_class.rs:288— MethodTooLong — ui runs 220 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 120 over it, 2.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: App.run_ui_command crates/viewer/dl_viewer/src/app/command_handling.rs:790— MethodTooLong — run_ui_command runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TimeControl.handle_time_command crates/viewer/dl_viewer_context/src/time_control/command.rs:202— MethodTooLong — handle_time_command runs 210 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 110 over it, 2.10× 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: DalaranCloudHandler.query_dataset crates/store/dl_server/src/dalaran_cloud/mod.rs:1441— MethodTooLong — query_dataset runs 205 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 105 over it, 2.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SplitCommand.run crates/top/dalaran/src/commands/dlr/split.rs:85— MethodTooLong — run runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: App.with_commands crates/viewer/dl_viewer/src/app/mod.rs:206— MethodTooLong — with_commands runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: GaussianSplatDrawData.new crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:334— MethodTooLong — new runs 196 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 96 over it, 1.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.
MethodTooLong: DataframeQueryTableProvider.scan crates/store/dl_datafusion/src/dataframe_query_common.rs:446— MethodTooLong — scan runs 195 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 95 over it, 1.95× 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: PointCloudDrawData.new crates/viewer/dl_renderer/src/renderer/point_cloud.rs:333— MethodTooLong — new runs 195 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 95 over it, 1.95× 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: BarChartView.ui crates/viewer/dl_view_bar_chart/src/view_class.rs:156— MethodTooLong — ui runs 194 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 94 over it, 1.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: RecordingPreviewRenderer.show_preview crates/viewer/dl_dataframe_ui/src/preview_renderer.rs:108— MethodTooLong — show_preview runs 184 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 84 over it, 1.84× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ViewBuilder.new crates/viewer/dl_renderer/src/view_builder.rs:441— MethodTooLong — new runs 184 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 84 over it, 1.84× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: QueryHandle.try_bulk_emit_run crates/store/dl_dataframe/src/query.rs:2132— MethodTooLong — try_bulk_emit_run runs 181 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 81 over it, 1.81× 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: DataFusionTableWidget.table_ui crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:515— MethodTooLong — table_ui runs 179 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 79 over it, 1.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SplitCommand.split_store crates/top/dalaran/src/commands/dlr/split.rs:532— MethodTooLong — split_store runs 176 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 76 over it, 1.76× 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: SeriesPointsSystem.load_series crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:188— MethodTooLong — load_series runs 176 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 76 over it, 1.76× 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.
FileTooLong: src/python_bridge.rs dalaran_py/src/python_bridge.rs— FileTooLong — 1701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 78 free functions. The bar is 500 significant lines; this is 1201 over it, 3.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: v1alpha1/dalaran.cloud.v1alpha1.ext.rs crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs— FileTooLong — 1552 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 1052 over it, 3.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: dalaran_cloud/mod.rs crates/store/dl_server/src/dalaran_cloud/mod.rs— FileTooLong — 1534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 79% of them inside a single declaration: DalaranCloudHandler (5 blocks, 209-2159). The bar is 500 significant lines; this is 1034 over it, 3.07× 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/query.rs crates/store/dl_dataframe/src/query.rs— FileTooLong — 1338 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 84% of them inside a single declaration: QueryHandle (4 blocks, 242-2522). The bar is 500 significant lines; this is 838 over it, 2.68× 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: cache/video_stream_cache.rs crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs— FileTooLong — 1313 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 813 over it, 2.63× 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/time_panel.rs crates/viewer/dl_time_panel/src/time_panel.rs— FileTooLong — 1299 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: TimePanel (4 blocks, 97-2053). The bar is 500 significant lines; this is 799 over it, 2.60× 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/recording_stream.rs crates/top/dl_sdk/src/recording_stream.rs— FileTooLong — 1240 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 740 over it, 2.48× 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: commands/entrypoint.rs crates/top/dalaran/src/commands/entrypoint.rs— FileTooLong — 1218 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 718 over it, 2.44× 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: app/command_handling.rs crates/viewer/dl_viewer/src/app/command_handling.rs— FileTooLong — 1186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 85% of them inside a single declaration: App (40-1689). The bar is 500 significant lines; this is 686 over it, 2.37× 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/view_class.rs crates/viewer/dl_view_time_series/src/view_class.rs— FileTooLong — 1183 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 683 over it, 2.37× 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/chunk.rs crates/store/dl_chunk/src/chunk.rs— FileTooLong — 1141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 62% of them inside a single declaration: Chunk (13 blocks, 225-1927). The bar is 500 significant lines; this is 641 over it, 2.28× 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/connection_client.rs crates/store/dl_redap_client/src/connection_client.rs— FileTooLong — 1141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 80% of them inside a single declaration: RedapClient (4 blocks, 308-1708). The bar is 500 significant lines; this is 641 over it, 2.28× 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: app/mod.rs crates/viewer/dl_viewer/src/app/mod.rs— FileTooLong — 1089 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 90% of them inside a single declaration: App (4 blocks, 75-1730). The bar is 500 significant lines; this is 589 over it, 2.18× 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/visualizer_ui.rs crates/viewer/dl_selection_panel/src/visualizer_ui.rs— FileTooLong — 991 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 491 over it, 1.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: footer/raw_dlr_manifest.rs crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs— FileTooLong — 987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 93% of them inside a single declaration: RawRrdManifest (8 blocks, 137-1728). The bar is 500 significant lines; this is 487 over it, 1.97× 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/selection_panel.rs crates/viewer/dl_selection_panel/src/selection_panel.rs— FileTooLong — 933 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 433 over it, 1.87× 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/top/dalaran_c/src/lib.rs— FileTooLong — 915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 43 free functions. The bar is 500 significant lines; this is 415 over it, 1.83× 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/datafusion_table_widget.rs crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs— FileTooLong — 856 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 356 over it, 1.71× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/ui_ext.rs crates/viewer/dl_ui/src/ui_ext.rs— FileTooLong — 855 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 94% of them inside a single declaration: UiExt (19-1373). The bar is 500 significant lines; this is 355 over it, 1.71× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/analytics.rs crates/store/dl_datafusion/src/analytics.rs— FileTooLong — 841 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 341 over it, 1.68× 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/blueprint_tree.rs crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs— FileTooLong — 840 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 91% of them inside a single declaration: BlueprintTree (2 blocks, 25-1235). The bar is 500 significant lines; this is 340 over it, 1.68× 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: lerobot/datasetv3.rs crates/store/dl_importer/src/lerobot/datasetv3.rs— FileTooLong — 832 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 60% of them inside a single declaration: LeRobotDatasetV3 (3 blocks, 84-937). The bar is 500 significant lines; this is 332 over it, 1.66× 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/grpc.rs crates/store/dl_redap_client/src/grpc.rs— FileTooLong — 820 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 320 over it, 1.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/viewport_ui.rs crates/viewer/dl_viewport/src/viewport_ui.rs— FileTooLong — 800 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 300 over it, 1.60× 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/dataframe_query_common.rs crates/store/dl_datafusion/src/dataframe_query_common.rs— FileTooLong — 799 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 299 over it, 1.60× 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.
Hotspot: crates/viewer/dl_viewer/src/app/command_handling.rs crates/viewer/dl_viewer/src/app/command_handling.rs:73— crates/viewer/dl_viewer/src/app/command_handling.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in App::run_system_command at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewer/src/app/command_handling.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: scripts/lint.py scripts/lint.py:191— scripts/lint.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in lint.lint_line at line 191. 2 of those changes were fix/bug commits, and the other 18 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- scripts/lint.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/viewer/dl_viewer/src/app_state.rs crates/viewer/dl_viewer/src/app_state.rs:208— crates/viewer/dl_viewer/src/app_state.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in AppState::show at line 208. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewer/src/app_state.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/viewer/dl_viewer_context/src/time_control/command.rs crates/viewer/dl_viewer_context/src/time_control/command.rs:202— crates/viewer/dl_viewer_context/src/time_control/command.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in TimeControl::handle_time_command at line 202. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewer_context/src/time_control/command.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/store/dl_datafusion/src/dataframe_query_common.rs crates/store/dl_datafusion/src/dataframe_query_common.rs:446— crates/store/dl_datafusion/src/dataframe_query_common.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DataframeQueryTableProvider::scan at line 446. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/store/dl_datafusion/src/dataframe_query_common.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/viewer/dl_viewer/src/app/add_data_source.rs crates/viewer/dl_viewer/src/app/add_data_source.rs:63— crates/viewer/dl_viewer/src/app/add_data_source.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in App::load_data_source at line 63. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewer/src/app/add_data_source.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/top/dalaran/src/commands/entrypoint.rs crates/top/dalaran/src/commands/entrypoint.rs:383— crates/top/dalaran/src/commands/entrypoint.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Args::generate_markdown_manual at line 383. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/top/dalaran/src/commands/entrypoint.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/build/dl_types_builder/src/codegen/python/mod.rs crates/build/dl_types_builder/src/codegen/python/mod.rs:773— crates/build/dl_types_builder/src/codegen/python/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in dl_types_builder::codegen::python::code_for_struct 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/build/dl_types_builder/src/codegen/python/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/store/dl_data_source/src/data_source.rs crates/store/dl_data_source/src/data_source.rs:83— crates/store/dl_data_source/src/data_source.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in LogDataSource::from_uri at line 83. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/store/dl_data_source/src/data_source.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/viewer/dl_view_spatial/src/ui_3d.rs crates/viewer/dl_view_spatial/src/ui_3d.rs:124— crates/viewer/dl_view_spatial/src/ui_3d.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in SpatialView3D::view_3d at line 124. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_view_spatial/src/ui_3d.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/store/dl_chunk_store/src/writes.rs crates/store/dl_chunk_store/src/writes.rs:280— crates/store/dl_chunk_store/src/writes.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ChunkStore::insert_chunk_impl at line 280. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/store/dl_chunk_store/src/writes.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/viewer/dl_selection_panel/src/selection_panel.rs crates/viewer/dl_selection_panel/src/selection_panel.rs:161— crates/viewer/dl_selection_panel/src/selection_panel.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SelectionPanel::item_ui at line 161. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_selection_panel/src/selection_panel.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/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:728— crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread at line 728. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.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/viewer/dl_redap_browser/src/servers.rs crates/viewer/dl_redap_browser/src/servers.rs:428— crates/viewer/dl_redap_browser/src/servers.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dl_redap_browser::servers::error_ui at line 428. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_redap_browser/src/servers.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/viewer/dl_viewer_context/src/open_url.rs crates/viewer/dl_viewer_context/src/open_url.rs:570— crates/viewer/dl_viewer_context/src/open_url.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ViewerOpenUrl::open at line 570. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewer_context/src/open_url.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/viewer/dl_viewer/src/app/logic.rs crates/viewer/dl_viewer/src/app/logic.rs:149— crates/viewer/dl_viewer/src/app/logic.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in App::receive_messages at line 149. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewer/src/app/logic.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/viewer/dl_viewport/src/viewport_ui.rs crates/viewer/dl_viewport/src/viewport_ui.rs:54— crates/viewer/dl_viewport/src/viewport_ui.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ViewportUi::viewport_ui at line 54. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewport/src/viewport_ui.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/viewer/dl_viewer_context/src/cache/video_stream_cache.rs crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1974— crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk at line 1974. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_viewer_context/src/cache/video_stream_cache.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: scripts/generate_changelog.py scripts/generate_changelog.py:413— scripts/generate_changelog.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in generate_changelog.main at line 413. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- scripts/generate_changelog.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: dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py:314— dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in VideoFrameDecoder._decode_to_target at line 314. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.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/store/dl_datafusion/src/pushdown_expressions.rs crates/store/dl_datafusion/src/pushdown_expressions.rs:256— crates/store/dl_datafusion/src/pushdown_expressions.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries at line 256. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/store/dl_datafusion/src/pushdown_expressions.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/viewer/dl_data_ui/src/video_ui.rs crates/viewer/dl_data_ui/src/video_ui.rs:93— crates/viewer/dl_data_ui/src/video_ui.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dl_data_ui::video_ui::video_data_ui at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/viewer/dl_data_ui/src/video_ui.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/store/dl_datafusion/src/pipeline_budget.rs crates/store/dl_datafusion/src/pipeline_budget.rs:1472— crates/store/dl_datafusion/src/pipeline_budget.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PipelineBudget::reserve_with_priority at line 1472. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/store/dl_datafusion/src/pipeline_budget.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/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:881— crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ChunkFetcher::next_chunk at line 881. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.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/utils/dl_perf_telemetry/src/telemetry.rs crates/utils/dl_perf_telemetry/src/telemetry.rs:483— crates/utils/dl_perf_telemetry/src/telemetry.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Telemetry::init at line 483. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- crates/utils/dl_perf_telemetry/src/telemetry.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.
FunctionTooLong: dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks crates/viewer/dl_component_fallbacks/src/component_fallbacks.rs:30— FunctionTooLong — dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks runs 341 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 241 over it, 3.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_view_spatial::visualizers::video::execute_video_stream_like crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs:164— FunctionTooLong — dl_view_spatial::visualizers::video::execute_video_stream_like runs 228 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 128 over it, 2.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:931— FunctionTooLong — dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop runs 208 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 108 over it, 2.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: dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:728— FunctionTooLong — dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread 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: dl_redap_client::grpc::stream_segment_from_server crates/store/dl_redap_client/src/grpc.rs:803— FunctionTooLong — dl_redap_client::grpc::stream_segment_from_server 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: dl_datafusion::analytics::build_query_span crates/store/dl_datafusion/src/analytics.rs:856— FunctionTooLong — dl_datafusion::analytics::build_query_span runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_data_ui::entity_db_ui::grid_content_ui crates/viewer/dl_data_ui/src/entity_db_ui.rs:103— FunctionTooLong — dl_data_ui::entity_db_ui::grid_content_ui runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls crates/store/dl_datafusion/src/chunk_fetcher.rs:626— FunctionTooLong — dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls 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: dl_view_spatial::visualizers::video::show_video_frame crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs:539— FunctionTooLong — dl_view_spatial::visualizers::video::show_video_frame runs 163 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 63 over it, 1.63× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dalaran::commands::dlr::route::process_messages crates/top/dalaran/src/commands/dlr/route.rs:103— FunctionTooLong — dalaran::commands::dlr::route::process_messages runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_selection_panel::visualizer_ui::visualizer_components crates/viewer/dl_selection_panel/src/visualizer_ui.rs:226— FunctionTooLong — dl_selection_panel::visualizer_ui::visualizer_components runs 159 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 59 over it, 1.59× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_view_spatial::picking_ui::picking crates/viewer/dl_view_spatial/src/picking_ui.rs:30— FunctionTooLong — dl_view_spatial::picking_ui::picking 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.
FunctionTooLong: dl_sdk::spawn::spawn crates/top/dl_sdk/src/spawn.rs:206— FunctionTooLong — dl_sdk::spawn::spawn runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_time_panel::time_selection_ui::loop_selection_ui crates/viewer/dl_time_panel/src/time_selection_ui.rs:57— FunctionTooLong — dl_time_panel::time_selection_ui::loop_selection_ui runs 144 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 44 over it, 1.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_view_spatial::shared_fallbacks::register_fallbacks crates/viewer/dl_view_spatial/src/shared_fallbacks.rs:27— FunctionTooLong — dl_view_spatial::shared_fallbacks::register_fallbacks runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_viewport_blueprint::viewport_blueprint::apply_viewport_command crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:983— FunctionTooLong — dl_viewport_blueprint::viewport_blueprint::apply_viewport_command runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dalaran_py" # name of the rust crate::python_bridge::dalaran_bindings dalaran_py/src/python_bridge.rs:187— FunctionTooLong — dalaran_py" # name of the rust crate::python_bridge::dalaran_bindings runs 138 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 38 over it, 1.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dalaran::commands::doctor::recording::check_recording crates/top/dalaran/src/commands/doctor/recording.rs:26— FunctionTooLong — dalaran::commands::doctor::recording::check_recording runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_redap_client::connection_client::fetch_dlr_manifest_via_key crates/store/dl_redap_client/src/connection_client.rs:98— FunctionTooLong — dl_redap_client::connection_client::fetch_dlr_manifest_via_key runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_types_core::reflection::generic_placeholder_for_datatype crates/store/dl_types_core/src/reflection.rs:79— FunctionTooLong — dl_types_core::reflection::generic_placeholder_for_datatype runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_view_time_series::fallbacks::register_fallbacks crates/viewer/dl_view_time_series/src/fallbacks.rs:13— FunctionTooLong — dl_view_time_series::fallbacks::register_fallbacks runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:214— FunctionTooLong — dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1974— FunctionTooLong — dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk runs 129 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 29 over it, 1.29× 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: dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs:648— FunctionTooLong — dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output runs 126 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 26 over it, 1.26× 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: dalaran::commands::dlr::merge_optimize::merge_and_compact crates/top/dalaran/src/commands/dlr/merge_optimize.rs:437— FunctionTooLong — dalaran::commands::dlr::merge_optimize::merge_and_compact runs 122 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 22 over it, 1.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.
+ 20 more in this group — see findings.md.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×40
Recursive walk over a caller-supplied document has no depth cap dalaran_py/src/chunk_stream/engine.rs:249— `compile` is public, takes a document from its caller (line 28) and hands it to `compile_inner`, which recurses at line 249 through `compile_split_branch`, `compile_merged` and back with a piece of the document (and at line 252, line 356, line 404) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `compile_inner` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/app_context.rs:168— `tokens` is public and takes a `AppContext` as its receiver from its caller, and it calls itself at line 168 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `tokens` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:60— `tokens` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 60 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `tokens` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:96— `render_mode` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 96 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `render_mode` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:111— `store_hub` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 111 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `store_hub` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:116— `store_bundle` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 116 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `store_bundle` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:121— `table_stores` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 121 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `table_stores` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:190— `store_id` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 190 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `store_id` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:195— `selection` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 195 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `selection` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:200— `is_selected_or_loading` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 200 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `is_selected_or_loading` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:205— `hovered` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 205 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `hovered` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:209— `selection_state` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 209 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `selection_state` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:214— `active_redap_entry` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 214 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `active_redap_entry` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:219— `active_table_id` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 219 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `active_table_id` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:224— `focused_item` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 224 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `focused_item` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:229— `drag_and_drop_manager` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 229 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `drag_and_drop_manager` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:234— `current_query` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 234 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `current_query` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:261— `handle_select_hover_drag_interactions` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 261 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `handle_select_hover_drag_interactions` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:274— `handle_select_focus_sync` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 274 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `handle_select_focus_sync` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/viewer_context.rs:286— `revert_to_default_route` is public and takes a `ViewerContext` as its receiver from its caller, and it calls itself at line 286 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `revert_to_default_route` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:408— `display_name` is public and takes a `ViewClassRegistry` as its receiver from its caller, and it calls itself at line 408 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `display_name` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_renderer/src/error_handling/wgpu_core_error.rs:184— `hash` is public and takes a `WgpuCoreWrappedContextError` as its receiver from its caller, and it calls itself at line 184 with a piece of the document (and at line 185) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `hash` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_renderer/src/error_handling/wgpu_core_error.rs:200— `eq` is public and takes a `WgpuCoreWrappedContextError` as its receiver from its caller, and it calls itself at line 200 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `eq` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/viewer/dl_blueprint_tree/src/data.rs:86— `visit` is public and takes a `ContentsData` as its receiver from its caller, and it calls itself at line 86 with a piece of the document (and at line 87, line 166) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap crates/utils/dl_quota_channel/src/async_broadcast_channel.rs:268— `subscribe` is public and takes a `Sender` as its receiver from its caller, and it calls itself at line 268 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `subscribe` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
+ 15 more in this group — see findings.md.
X5 · Nullable reference types· Symbol treated as nullable, then dereferenced unguarded · ×40
Symbol treated as nullable, then dereferenced unguarded run_wasm/src/main.rs:85— `std::thread::Builder::new().name("cargo_run_wasm".into()).spawn(||{cargo_run_wasm::run_wasm_cli_with_css(CSS);})` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded run_wasm/src/main.rs:88— `thread.join()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:19— `dl_build_tools::get_and_track_env_var("CARGO_MANIFEST_DIR")` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:34— `fs::read_dir(&all_path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:39— `fs::read_dir(subdir.path())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:44— `path.file_stem()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:44— `path.file_stem().unwrap().to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:46— `fs::read_to_string(&path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:62— `path.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:72— `dl_build_tools::write_file_if_necessary(target_path,contents.as_bytes(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:79— `path.file_name()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:80— `fs::copy(&path,&target_path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:151— `dl_build_tools::rustfmt_str(&source)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/build.rs:157— `dl_build_tools::write_file_if_necessary(snippets_path.join("mod.rs"),source.as_bytes(),)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/howto/check_connection_status.rs:20— `(sink as&dyn std::any::Any).downcast_ref::<dalaran::sink::GrpcSink>()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `main` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/howto/dual_color_point_cloud.rs:26— `stops.last()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `colormap` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_archetype.rs:37— `rec.flush_blocking()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_archetype.rs:39— `std::fs::File::open(&path_to_dlr)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_archetype.rs:44— `ChunkStore::from_dlr_reader(&ChunkStoreConfig::ALL_DISABLED,&mut dlr_file,)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_archetype.rs:47— `stores.into_values().next()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_component.rs:47— `rec.flush_blocking()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_component.rs:49— `std::fs::File::open(&path_to_dlr)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_component.rs:54— `ChunkStore::from_dlr_reader(&ChunkStoreConfig::ALL_DISABLED,&mut dlr_file,)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_component.rs:57— `stores.into_values().next()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Symbol treated as nullable, then dereferenced unguarded docs/snippets/all/descriptors/descr_builtin_component.rs:62— `chunks.into_iter().next()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `check_tags` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
Duplicated block (9 lines × 2) crates/store/dl_dataframe/src/query.rs:1242— crates/store/dl_dataframe/src/query.rs:1242-1250 | crates/store/dl_dataframe/src/query.rs:1722-1730 — both copies are in the same file, so extract the block into 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/store/dl_entity_db/src/entity_db.rs:1148— crates/store/dl_entity_db/src/entity_db.rs:1148-1156 | crates/store/dl_entity_db/src/entity_db.rs:1171-1179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_entity_db/src/entity_db.rs:1148` 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/store/dl_importer/src/lerobot/datasetv3.rs:1355— crates/store/dl_importer/src/lerobot/datasetv3.rs:1355-1363 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1397-1405 — both copies are in the same file, so extract the 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 `crates/store/dl_importer/src/lerobot/datasetv3.rs:1355` 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/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:150— crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:150-158 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:174-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:150` 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/store/dl_lenses_core/src/selector/eval.rs:498— crates/store/dl_lenses_core/src/selector/eval.rs:498-506 | crates/store/dl_lenses_core/src/selector/eval.rs:578-586 — both copies are in the same file, so extract the 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 `crates/store/dl_lenses_core/src/selector/eval.rs:498` 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/store/dl_lenses_core/src/selector/lexer.rs:122— crates/store/dl_lenses_core/src/selector/lexer.rs:122-130 | crates/store/dl_lenses_core/src/selector/lexer.rs:209-217 — both copies are in the same file, so extract the 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 `crates/store/dl_lenses_core/src/selector/lexer.rs:122` 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/utils/dl_arrow_util/src/format.rs:294— crates/utils/dl_arrow_util/src/format.rs:294-302 | crates/utils/dl_arrow_util/src/format.rs:349-357 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/utils/dl_arrow_util/src/format.rs:291` calls `format_dataframe_without_metadata`, `is_empty` and `crates/utils/dl_arrow_util/src/format.rs:347` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) crates/utils/dl_auth/src/callback_server.rs:27— crates/utils/dl_auth/src/callback_server.rs:27-35 | crates/utils/dl_auth/src/callback_server.rs:70-78 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/utils/dl_auth/src/callback_server.rs:80` calls `new_v4`, `to_string` and `crates/utils/dl_auth/src/callback_server.rs:37` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) crates/utils/dl_auth/src/oauth/api.rs:76— crates/utils/dl_auth/src/oauth/api.rs:76-84 | crates/utils/dl_auth/src/oauth/api.rs:101-109 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_auth/src/oauth/api.rs:76` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) crates/utils/dl_video/src/demux/mod.rs:365— crates/utils/dl_video/src/demux/mod.rs:365-373 | crates/utils/dl_video/src/demux/mod.rs:388-396 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:467— crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:467-475 | crates/viewer/dl_chunk_store_ui/src/chunk_ui.rs:195-203 — 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 `crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:467` 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/viewer/dl_dataframe_ui/src/filters/filter.rs:144— crates/viewer/dl_dataframe_ui/src/filters/filter.rs:144-152 | crates/viewer/dl_dataframe_ui/src/filters/filter.rs:155-163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (9 lines × 2) crates/viewer/dl_view_graph/src/ui/draw.rs:144— crates/viewer/dl_view_graph/src/ui/draw.rs:144-152 | crates/viewer/dl_view_graph/src/ui/draw.rs:172-180 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/viewer/dl_view_graph/src/ui/draw.rs:184` calls `unwrap_or_else`, `text_color`, `gamma_multiply` and `crates/viewer/dl_view_graph/src/ui/draw.rs:154` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) crates/viewer/dl_view_graph/src/ui/draw.rs:365— crates/viewer/dl_view_graph/src/ui/draw.rs:365-373 | crates/viewer/dl_view_map/src/map_view.rs:508-516 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_graph/src/ui/draw.rs:365` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (9 lines × 2) crates/viewer/dl_viewer_context/src/item.rs:163— crates/viewer/dl_viewer_context/src/item.rs:163-171 | crates/viewer/dl_viewer_context/src/item.rs:204-212 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer_context/src/item.rs:163` 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) docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:6— docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:6-14 | docs/snippets/all/archetypes/line_strips3d_simple.rs:5-13 — 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 `docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:6` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) docs/snippets/all/tutorials/dna.rs:68— docs/snippets/all/tutorials/dna.rs:68-76 | docs/snippets/all/tutorials/dna.rs:92-100 — both copies are in the same file, so extract the 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 `docs/snippets/all/tutorials/dna.rs:68` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) crates/utils/dl_video/src/demux/mod.rs:257— crates/utils/dl_video/src/demux/mod.rs:257-265 | crates/utils/dl_video/src/demux/mp4.rs:74-82 — 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 `crates/utils/dl_video/src/demux/mod.rs:257` 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/viewer/dl_dataframe_ui/src/lib.rs:52— crates/viewer/dl_dataframe_ui/src/lib.rs:52-60 | crates/viewer/dl_redap_browser/src/servers.rs:699-707 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_dataframe_ui/src/lib.rs:52` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) crates/store/dl_datafusion/src/dataset_manifest.rs:62— crates/store/dl_datafusion/src/dataset_manifest.rs:62-70 | crates/store/dl_datafusion/src/segment_table.rs:62-70 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) dalaran_py/src/catalog/segment_url_udf.rs:215— dalaran_py/src/catalog/segment_url_udf.rs:215-223 | dalaran_py/src/catalog/segment_url_udf.rs:232-243 — both copies are in the same file, so extract the 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 `dalaran_py/src/catalog/segment_url_udf.rs:215` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (9 lines × 2) crates/viewer/dl_renderer/src/view_builder.rs:458— crates/viewer/dl_renderer/src/view_builder.rs:458-467 | crates/viewer/dl_renderer/src/view_builder.rs:497-505 — both copies are in the same file, so extract the 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 `crates/viewer/dl_renderer/src/view_builder.rs:458` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) crates/viewer/dl_renderer/src/renderer/rectangles.rs:768— crates/viewer/dl_renderer/src/renderer/rectangles.rs:768-776 | crates/viewer/dl_renderer/src/renderer/rectangles.rs:779-788 — both copies are in the same file, so extract the 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 `crates/viewer/dl_renderer/src/renderer/rectangles.rs:768` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) crates/viewer/dl_dataframe_ui/src/filters/boolean.rs:237— crates/viewer/dl_dataframe_ui/src/filters/boolean.rs:237-245 | crates/viewer/dl_dataframe_ui/src/filters/timestamp.rs:227-235 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) crates/store/dl_importer/src/importer_parquet.rs:37— crates/store/dl_importer/src/importer_parquet.rs:37-45 | crates/store/dl_importer/src/importer_parquet.rs:71-79 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_importer/src/importer_parquet.rs:37` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/store/dl_importer/src/importer_parquet.rs:69` calls `into_owned` and `crates/store/dl_importer/src/importer_parquet.rs:34` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cognitive 98) crates/build/dl_types_builder/src/codegen/rust/serializer.rs:472— dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer has cognitive complexity 98 (threshold 15). Drivers by points: if/else 49 (86 pts), match/switch 5 (10 pts), boolean chains 2 (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.
dl_types_builder::codegen::python::code_for_struct (cognitive 75) crates/build/dl_types_builder/src/codegen/python/mod.rs:773— dl_types_builder::codegen::python::code_for_struct has cognitive complexity 75 (threshold 15). Drivers by points: if/else 40 (61 pts), loops 3 (9 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::python::check_ext_consistency (cognitive 61) crates/build/dl_types_builder/src/codegen/python/mod.rs:324— dl_types_builder::codegen::python::check_ext_consistency has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 5 (15 pts), boolean chains 3 (nesting depth added 35). 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.
dl_types_builder::codegen::python::quote_arrow_serialization (cognitive 60) crates/build/dl_types_builder/src/codegen/python/mod.rs:2446— dl_types_builder::codegen::python::quote_arrow_serialization has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 3 (8 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 29). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_types_builder::docs::doclink_translation::try_translate_doclink (cognitive 43) crates/build/dl_types_builder/src/docs.rs:287— dl_types_builder::docs::doclink_translation::try_translate_doclink has cognitive complexity 43 (threshold 15). Drivers by points: if/else 28 (38 pts), boolean chains 3, loops 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.
dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder (cognitive 42) crates/build/dl_types_builder/src/codegen/cpp/mod.rs:1870— dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 2 (8 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.
dl_types_builder::codegen::common::remove_orphaned_files (cognitive 36) crates/build/dl_types_builder/src/codegen/common.rs:397— dl_types_builder::codegen::common::remove_orphaned_files has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::cpp::quote_append_field_to_builder (cognitive 34) crates/build/dl_types_builder/src/codegen/cpp/mod.rs:2091— dl_types_builder::codegen::cpp::quote_append_field_to_builder has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::rust::util::string_from_quoted (cognitive 34) crates/build/dl_types_builder/src/codegen/rust/util.rs:61— dl_types_builder::codegen::rust::util::string_from_quoted has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
dl_types_builder::codegen::rust::api::quote_from_impl_from_obj (cognitive 33) crates/build/dl_types_builder/src/codegen/rust/api.rs:1259— dl_types_builder::codegen::rust::api::quote_from_impl_from_obj has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (33 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.
dl_types_builder::codegen::docs::website::write_fields (cognitive 31) crates/build/dl_types_builder/src/codegen/docs/website.rs:404— dl_types_builder::codegen::docs::website::write_fields has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). Of this number, 30 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.
dl_types_builder::codegen::python::quote_field_converter_from_field (cognitive 31) crates/build/dl_types_builder/src/codegen/python/mod.rs:1979— dl_types_builder::codegen::python::quote_field_converter_from_field has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 2, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_types_builder::codegen::docs::snippets_ref::collect_snippets_recursively (cognitive 25) crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs:387— dl_types_builder::codegen::docs::snippets_ref::collect_snippets_recursively has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (12 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.
dl_types_builder::codegen::python::quote_arrow_support_from_obj (cognitive 25) crates/build/dl_types_builder/src/codegen/python/mod.rs:2259— dl_types_builder::codegen::python::quote_arrow_support_from_obj has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 3 (4 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.
dl_types_builder::codegen::rust::util::doc_as_lines (cognitive 24) crates/build/dl_types_builder/src/codegen/rust/util.rs:305— dl_types_builder::codegen::rust::util::doc_as_lines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 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.
dl_types_builder::codegen::cpp::lines_from_docs (cognitive 23) crates/build/dl_types_builder/src/codegen/cpp/mod.rs:2711— dl_types_builder::codegen::cpp::lines_from_docs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), match/switch 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::rust::deserializer::quote_arrow_deserializer (cognitive 22) crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:55— dl_types_builder::codegen::rust::deserializer::quote_arrow_deserializer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::rust::deserializer::quote_iterator_transparency (cognitive 21) crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:964— dl_types_builder::codegen::rust::deserializer::quote_iterator_transparency has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 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.
dl_types_builder::codegen::python::code_for_union (cognitive 20) crates/build/dl_types_builder/src/codegen/python/mod.rs:1248— dl_types_builder::codegen::python::code_for_union has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, match/switch 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
dl_types_builder::codegen::common::collect_snippets_for_api_docs (cognitive 19) crates/build/dl_types_builder/src/codegen/common.rs:293— dl_types_builder::codegen::common::collect_snippets_for_api_docs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::docs::website::write_used_by (cognitive 19) crates/build/dl_types_builder/src/codegen/docs/website.rs:529— dl_types_builder::codegen::docs::website::write_used_by has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::rust::serializer::quote_arrow_serializer (cognitive 19) crates/build/dl_types_builder/src/codegen/rust/serializer.rs:15— dl_types_builder::codegen::rust::serializer::quote_arrow_serializer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 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.
dl_types_builder::codegen::rust::util::replace_doc_attrb_with_doc_comment (cognitive 19) crates/build/dl_types_builder/src/codegen/rust/util.rs:187— dl_types_builder::codegen::rust::util::replace_doc_attrb_with_doc_comment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 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.
dl_types_builder::codegen::docs::website::index_page (cognitive 18) crates/build/dl_types_builder/src/codegen/docs/website.rs:146— dl_types_builder::codegen::docs::website::index_page has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_builder::codegen::docs::website::write_archetype_fields (cognitive 18) crates/build/dl_types_builder/src/codegen/docs/website.rs:574— dl_types_builder::codegen::docs::website::write_archetype_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (8 lines × 2) crates/store/dl_chunk/src/chunk.rs:1232— crates/store/dl_chunk/src/chunk.rs:1232-1239 | crates/store/dl_chunk/src/chunk.rs:1258-1265 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk/src/chunk.rs:1232` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/store/dl_data_source/src/data_source.rs:165— crates/store/dl_data_source/src/data_source.rs:165-172 | crates/store/dl_data_source/src/data_source.rs:217-224 — both copies are in the same file, so extract the 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 `crates/store/dl_data_source/src/data_source.rs:165` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/store/dl_importer/src/importer_parquet.rs:47— crates/store/dl_importer/src/importer_parquet.rs:47-54 | crates/store/dl_importer/src/importer_parquet.rs:81-88 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_importer/src/importer_parquet.rs:47` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/store/dl_importer/src/lerobot/datasetv3.rs:1366— crates/store/dl_importer/src/lerobot/datasetv3.rs:1366-1373 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1408-1415 — both copies are in the same file, so extract the 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 `crates/store/dl_importer/src/lerobot/datasetv3.rs:1366` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/store/dl_log_types/src/example_components.rs:196— crates/store/dl_log_types/src/example_components.rs:196-203 | crates/store/dl_log_types/src/example_components.rs:301-308 — both copies are in the same file, so extract the block into 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/store/dl_query/src/latest_all.rs:58— crates/store/dl_query/src/latest_all.rs:58-65 | crates/store/dl_query/src/latest_all.rs:90-97 — both copies are in the same file, so extract the block into 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/store/dl_redap_client/src/connection_registry.rs:64— crates/store/dl_redap_client/src/connection_registry.rs:64-71 | crates/store/dl_redap_client/src/connection_registry.rs:82-89 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_client/src/connection_registry.rs:64` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:90— crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:90-97 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:215-222 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:90` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/top/dalaran/src/commands/dlr/split.rs:990— crates/top/dalaran/src/commands/dlr/split.rs:990-997 | crates/top/dalaran/src/commands/dlr/split.rs:998-1005 — both copies are in the same file, so extract the block into 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/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs:54— crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs:54-61 | crates/viewer/dl_ui/src/list_item/item_buttons.rs:81-88 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs:54` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:440— crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:440-447 | crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:494-501 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:440` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/viewer/dl_view_tensor/src/view_class.rs:608— crates/viewer/dl_view_tensor/src/view_class.rs:608-615 | crates/viewer/dl_view_tensor/src/view_class.rs:624-631 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view_tensor/src/view_class.rs:608` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/viewer/dl_view_time_series/src/series_query.rs:275— crates/viewer/dl_view_time_series/src/series_query.rs:275-282 | crates/viewer/dl_view_time_series/src/series_query.rs:409-416 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view_time_series/src/series_query.rs:275` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:46— crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:46-53 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:42-49 — before extracting anything, compare `crates/viewer/dl_viewer_context/src/tensor/image_stats.rs` and `crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:46` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) docs/snippets/all/archetypes/mesh3d_indexed.rs:6— docs/snippets/all/archetypes/mesh3d_indexed.rs:6-15 | docs/snippets/all/archetypes/mesh3d_simple.rs:7-14 — 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 `docs/snippets/all/archetypes/mesh3d_indexed.rs:6` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) docs/snippets/all/archetypes/transform3d_hierarchy.rs:20— docs/snippets/all/archetypes/transform3d_hierarchy.rs:20-27 | docs/snippets/all/archetypes/transform3d_hierarchy.rs:30-37 — both copies are in the same file, so extract the 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 `docs/snippets/all/archetypes/transform3d_hierarchy.rs:20` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (8 lines × 2) crates/viewer/dl_component_ui/src/line_strip.rs:54— crates/viewer/dl_component_ui/src/line_strip.rs:54-61 | crates/viewer/dl_component_ui/src/line_strip.rs:116-123 — both copies are in the same file, so extract the 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 `crates/viewer/dl_component_ui/src/line_strip.rs:54` 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 first that the copies are not typed on the same thing: the declarations holding them bind `value` to `&mut MaybeMutRef<'_, LineStrip3D>` in one and `&mut MaybeMutRef<'_, LineStrip2D>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/viewer/dl_component_ui/src/line_strip.rs:62` calls `col`, `label`, `format_f32` and `crates/viewer/dl_component_ui/src/line_strip.rs:124` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) crates/store/dl_hdf5/src/config.rs:105— crates/store/dl_hdf5/src/config.rs:105-112 | crates/store/dl_parquet/src/config.rs:118-125 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/viewer/dl_context_menu/src/actions/add_container.rs:29— crates/viewer/dl_context_menu/src/actions/add_container.rs:29-36 | crates/viewer/dl_context_menu/src/actions/move_contents_to_new_container.rs:41-48 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) crates/viewer/dl_renderer/src/gaussian_splat_builder.rs:85— crates/viewer/dl_renderer/src/gaussian_splat_builder.rs:85-92 | crates/viewer/dl_renderer/src/line_drawable_builder.rs:81-88 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) crates/viewer/dl_ui/src/command/recording_command.rs:97— crates/viewer/dl_ui/src/command/recording_command.rs:97-104 | crates/viewer/dl_ui/src/command/redap_server_command.rs:45-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) crates/viewer/dl_view_spatial/src/view_2d.rs:273— crates/viewer/dl_view_spatial/src/view_2d.rs:273-280 | crates/viewer/dl_view_spatial/src/view_3d.rs:536-543 — 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 `crates/viewer/dl_view_spatial/src/view_2d.rs:273` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/viewer/dl_renderer/src/draw_phases/outlines.rs:445— crates/viewer/dl_renderer/src/draw_phases/outlines.rs:445-453 | crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs:504-511 — 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 `crates/viewer/dl_renderer/src/draw_phases/outlines.rs:445` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) docs/snippets/all/concepts/transform3d_hierarchy_simple.rs:10— docs/snippets/all/concepts/transform3d_hierarchy_simple.rs:10-17 | docs/snippets/all/concepts/transform3d_hierarchy_simple.rs:24-32 — both copies are in the same file, so extract the 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 `docs/snippets/all/concepts/transform3d_hierarchy_simple.rs:10` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) crates/store/dl_lenses/src/semantic/ros2msg/log.rs:78— crates/store/dl_lenses/src/semantic/ros2msg/log.rs:78-85 | crates/store/dl_lenses/src/semantic/ros2msg/log.rs:108-115 — both copies are in the same file, so extract the block into 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/store/dl_chunk_store/src/writes.rs:141— crates/store/dl_chunk_store/src/writes.rs:141-151 | crates/store/dl_chunk_store/src/writes.rs:163-173 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk_store/src/writes.rs:141` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/store/dl_importer/src/importer_dlr.rs:56— crates/store/dl_importer/src/importer_dlr.rs:56-66 | crates/store/dl_importer/src/importer_dlr.rs:86-96 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_importer/src/importer_dlr.rs:56` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/store/dl_importer/src/importer_dlr.rs:67` calls `clone` and `crates/store/dl_importer/src/importer_dlr.rs:97` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 2) crates/store/dl_importer/src/lerobot/common.rs:145— crates/store/dl_importer/src/lerobot/common.rs:145-155 | crates/store/dl_importer/src/lerobot/common.rs:179-189 — both copies are in the same file, so extract the 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 `crates/store/dl_importer/src/lerobot/common.rs:145` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/store/dl_importer/src/lerobot/datasetv2.rs:296— crates/store/dl_importer/src/lerobot/datasetv2.rs:296-306 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1300-1310 — before extracting anything, compare `crates/store/dl_importer/src/lerobot/datasetv2.rs` and `crates/store/dl_importer/src/lerobot/datasetv3.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) crates/top/dalaran/src/commands/mcap/check.rs:48— crates/top/dalaran/src/commands/mcap/check.rs:48-58 | crates/top/dalaran/src/commands/mcap/info.rs:24-34 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) crates/top/dl_sdk/src/recording_stream.rs:1843— crates/top/dl_sdk/src/recording_stream.rs:1843-1853 | crates/top/dl_sdk/src/recording_stream.rs:1866-1876 — both copies are in the same file, so extract the 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 `crates/top/dl_sdk/src/recording_stream.rs:1843` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/viewer/dl_data_ui/src/item_ui.rs:554— crates/viewer/dl_data_ui/src/item_ui.rs:554-564 | crates/viewer/dl_data_ui/src/item_ui.rs:575-585 — both copies are in the same file, so extract the 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 `crates/viewer/dl_data_ui/src/item_ui.rs:554` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/viewer/dl_data_ui/src/video_ui.rs:854— crates/viewer/dl_data_ui/src/video_ui.rs:854-864 | crates/viewer/dl_data_ui/src/video_ui.rs:886-896 — both copies are in the same file, so extract the 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 `crates/viewer/dl_data_ui/src/video_ui.rs:854` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 2) crates/viewer/dl_renderer/src/device_caps.rs:400— crates/viewer/dl_renderer/src/device_caps.rs:400-410 | crates/viewer/dl_renderer/src/device_caps.rs:467-477 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/device_caps.rs:400` 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 (11 lines × 2) crates/viewer/dl_renderer/src/draw_phases/outlines.rs:307— crates/viewer/dl_renderer/src/draw_phases/outlines.rs:307-317 | crates/viewer/dl_renderer/src/renderer/compositor.rs:190-202 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/draw_phases/outlines.rs:307` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 2) crates/viewer/dl_renderer/src/renderer/lines.rs:744— crates/viewer/dl_renderer/src/renderer/lines.rs:744-754 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:802-812 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/lines.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/lines.rs:744` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/viewer/dl_view_time_series/src/aggregation.rs:41— crates/viewer/dl_view_time_series/src/aggregation.rs:41-51 | crates/viewer/dl_view_time_series/src/aggregation.rs:141-151 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view_time_series/src/aggregation.rs:41` 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 (11 lines × 2) crates/viewer/dl_view_time_series/src/series_query.rs:261— crates/viewer/dl_view_time_series/src/series_query.rs:261-271 | crates/viewer/dl_view_time_series/src/series_query.rs:395-405 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_time_series/src/series_query.rs:261` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/viewer/dl_viewer_context/src/image_info.rs:75— crates/viewer/dl_viewer_context/src/image_info.rs:75-85 | crates/viewer/dl_viewer_context/src/image_info.rs:114-124 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer_context/src/image_info.rs:75` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) docs/snippets/all/archetypes/capsules3d_batch.rs:29— docs/snippets/all/archetypes/capsules3d_batch.rs:29-39 | docs/snippets/all/archetypes/cylinders3d_batch.rs:29-39 — 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 `docs/snippets/all/archetypes/capsules3d_batch.rs:29` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) docs/snippets/all/descriptors/descr_builtin_component.rs:62— docs/snippets/all/descriptors/descr_builtin_component.rs:62-72 | docs/snippets/all/descriptors/descr_custom_component.rs:57-67 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/descriptors/descr_builtin_component.rs:62` 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 (11 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:286— crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:286-296 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:500-510 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/points2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/points3d.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) dalaran_py/src/trace_context.rs:67— dalaran_py/src/trace_context.rs:67-77 | dalaran_py/src/tracing_session.rs:46-56 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) crates/store/dl_server/src/dalaran_cloud/mod.rs:433— crates/store/dl_server/src/dalaran_cloud/mod.rs:433-443 | crates/store/dl_server/src/dalaran_cloud/mod.rs:491-501 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_server/src/dalaran_cloud/mod.rs:433` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 2) crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:114— crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:114-124 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:166-176 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:114` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/store/dl_data_source/src/data_source.rs:413— crates/store/dl_data_source/src/data_source.rs:413-423 | crates/store/dl_data_source/src/data_source.rs:428-438 — both copies are in the same file, so extract the 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 `crates/store/dl_data_source/src/data_source.rs:413` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:26— docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:26-36 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:40-50 — both copies are in the same file, so extract the 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 `docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:26` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/viewer/dl_renderer/src/renderer/lines.rs:676— crates/viewer/dl_renderer/src/renderer/lines.rs:676-686 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:703-713 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/lines.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/lines.rs:676` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:333— crates/store/dl_redap_tests/src/utils/dalaran.rs:333-343 | crates/store/dl_redap_tests/src/utils/dalaran.rs:846-856 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:333` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 2) crates/viewer/dl_renderer_examples/outlines.rs:51— crates/viewer/dl_renderer_examples/outlines.rs:51-61 | crates/viewer/dl_renderer_examples/picking.rs:134-144 — 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 `crates/viewer/dl_renderer_examples/outlines.rs:51` 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.
ClassTooLong: DalaranCloudHandler crates/store/dl_server/src/dalaran_cloud/mod.rs:209— ClassTooLong — 1212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 6 methods, 5 blocks, lines 209-2159. The bar is 400 significant lines; this is 812 over it, 3.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: QueryHandle crates/store/dl_dataframe/src/query.rs:242— ClassTooLong — 1122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 30 methods, 4 blocks, lines 242-2522. The bar is 400 significant lines; this is 722 over it, 2.81× 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: TimePanel crates/viewer/dl_time_panel/src/time_panel.rs:97— ClassTooLong — 1056 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 4 blocks, lines 97-2053. The bar is 400 significant lines; this is 656 over it, 2.64× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: App crates/viewer/dl_viewer/src/app/mod.rs:75— ClassTooLong — 975 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 84 methods, 4 blocks, lines 75-1730. The bar is 400 significant lines; this is 575 over it, 2.44× 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: RawRrdManifest crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:137— ClassTooLong — 920 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 56 methods, 8 blocks, lines 137-1728. The bar is 400 significant lines; this is 520 over it, 2.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: RedapClient crates/store/dl_redap_client/src/connection_client.rs:308— ClassTooLong — 909 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 43 methods, 4 blocks, lines 308-1708. The bar is 400 significant lines; this is 509 over it, 2.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: UiExt crates/viewer/dl_ui/src/ui_ext.rs:19— ClassTooLong — 804 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 65 methods. The bar is 400 significant lines; this is 404 over it, 2.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: BlueprintTree crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:25— ClassTooLong — 767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 21 methods, 2 blocks, lines 25-1235. The bar is 400 significant lines; this is 367 over it, 1.92× 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: StoreHub crates/viewer/dl_viewer_context/src/store_hub.rs:118— ClassTooLong — 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 59 methods, 3 blocks, lines 118-1506. The bar is 400 significant lines; this is 317 over it, 1.79× 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: Chunk crates/store/dl_chunk/src/chunk.rs:225— ClassTooLong — 711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 117 methods, 13 blocks, lines 225-1927. The bar is 400 significant lines; this is 311 over it, 1.78× 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: EntityDb crates/store/dl_entity_db/src/entity_db.rs:113— ClassTooLong — 711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 70 methods, 6 blocks, lines 113-1378. The bar is 400 significant lines; this is 311 over it, 1.78× 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: AppState crates/viewer/dl_viewer/src/app_state.rs:46— ClassTooLong — 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 14 methods, 4 blocks, lines 46-1202. The bar is 400 significant lines; this is 284 over it, 1.71× 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: RecordingStream crates/top/dl_sdk/src/recording_stream.rs:778— ClassTooLong — 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 73 methods, 10 blocks, lines 778-2900. The bar is 400 significant lines; this is 240 over it, 1.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: TimeSeriesView crates/viewer/dl_view_time_series/src/view_class.rs:118— ClassTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 0 methods. The bar is 400 significant lines; this is 190 over it, 1.48× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DesignTokens crates/viewer/dl_ui/src/design_tokens.rs:103— ClassTooLong — 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 41 methods, 2 blocks, lines 103-965. The bar is 400 significant lines; this is 139 over it, 1.35× 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: ViewportBlueprint crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:37— ClassTooLong — 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 40 methods, 2 blocks, lines 37-970. The bar is 400 significant lines; this is 112 over it, 1.28× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ComponentUiRegistry crates/viewer/dl_viewer_context/src/component_ui_registry.rs:125— ClassTooLong — 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 21 methods, 3 blocks, lines 125-960. The bar is 400 significant lines; this is 112 over it, 1.28× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: LeRobotDatasetV3 crates/store/dl_importer/src/lerobot/datasetv3.rs:84— ClassTooLong — 499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 18 methods, 3 blocks, lines 84-937. The bar is 400 significant lines; this is 99 over it, 1.25× 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: DatastoreUi crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:115— ClassTooLong — 483 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 10 methods, 3 blocks, lines 115-861. The bar is 400 significant lines; this is 83 over it, 1.21× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: InMemoryStore crates/store/dl_server/src/store/in_memory_store.rs:39— ClassTooLong — 466 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 36 methods, 4 blocks, lines 39-816. The bar is 400 significant lines; this is 66 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: SplitCommand crates/top/dalaran/src/commands/dlr/split.rs:32— ClassTooLong — 465 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 3 methods, 2 blocks, lines 32-789. The bar is 400 significant lines; this is 65 over it, 1.16× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DataFusionTableWidget crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:151— ClassTooLong — 443 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 17 methods, 2 blocks, lines 151-836. The bar is 400 significant lines; this is 43 over it, 1.11× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ConnectionHandle dalaran_py/src/catalog/connection_handle.rs:34— ClassTooLong — 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 29 methods, 3 blocks, lines 34-636. The bar is 400 significant lines; this is 29 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Dataset crates/store/dl_server/src/store/dataset.rs:40— ClassTooLong — 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 26 methods, 2 blocks, lines 40-705. The bar is 400 significant lines; this is 12 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DataframeQueryTableProvider crates/store/dl_datafusion/src/dataframe_query_common.rs:111— ClassTooLong — 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 6 methods, 4 blocks, lines 111-825. The bar is 400 significant lines; this is 6 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (10 lines × 2) crates/store/dl_chunk/src/unit_chunk.rs:77— crates/store/dl_chunk/src/unit_chunk.rs:77-86 | crates/store/dl_chunk/src/unit_chunk.rs:368-377 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk/src/unit_chunk.rs:77` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) crates/store/dl_chunk/src/unit_chunk.rs:131— crates/store/dl_chunk/src/unit_chunk.rs:131-140 | crates/store/dl_chunk/src/unit_chunk.rs:413-422 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk/src/unit_chunk.rs:131` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) crates/store/dl_chunk_store/src/events.rs:52— crates/store/dl_chunk_store/src/events.rs:52-61 | crates/store/dl_chunk_store/src/events.rs:402-411 — both copies are in the same file, so extract the block into 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/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:448— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:448-457 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:811-820 — both copies are in the same file, so extract the 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 `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:448` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (10 lines × 2) crates/store/dl_tf/src/transform_resolution_cache/cache.rs:314— crates/store/dl_tf/src/transform_resolution_cache/cache.rs:314-323 | crates/store/dl_tf/src/transform_resolution_cache/cache.rs:379-390 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_tf/src/transform_resolution_cache/cache.rs:314` 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 (10 lines × 2) crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:179— crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:179-188 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:214-223 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:179` 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 (10 lines × 2) crates/top/dalaran/src/commands/entrypoint.rs:1566— crates/top/dalaran/src/commands/entrypoint.rs:1566-1575 | crates/top/dalaran/src/commands/entrypoint.rs:1581-1590 — both copies are in the same file, so extract the block into 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/top/dalaran/src/demo_util.rs:119— crates/top/dalaran/src/demo_util.rs:119-128 | crates/viewer/dl_renderer/src/colormap.rs:250-259 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/top/dalaran/src/demo_util.rs:119` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) crates/viewer/dl_blueprint_tree/src/data.rs:422— crates/viewer/dl_blueprint_tree/src/data.rs:422-431 | crates/viewer/dl_blueprint_tree/src/data.rs:446-456 — both copies are in the same file, so extract the 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 `crates/viewer/dl_blueprint_tree/src/data.rs:422` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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.
Duplicated block (10 lines × 2) crates/viewer/dl_context_menu/src/actions/show_hide.rs:18— crates/viewer/dl_context_menu/src/actions/show_hide.rs:18-27 | crates/viewer/dl_context_menu/src/actions/show_hide.rs:77-87 — both copies are in the same file, so extract the 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 `crates/viewer/dl_context_menu/src/actions/show_hide.rs:18` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:223— crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:223-232 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:234-243 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:223` 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 (10 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:116— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:116-125 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:114-123 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) crates/viewer/dl_viewer/src/app/logic.rs:72— crates/viewer/dl_viewer/src/app/logic.rs:72-81 | crates/viewer/dl_viewer/src/app/mod.rs:1461-1470 — 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) dalaran_py/src/catalog/dataset_entry.rs:107— dalaran_py/src/catalog/dataset_entry.rs:107-116 | dalaran_py/src/catalog/dataset_entry.rs:122-131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dalaran_py/src/catalog/dataset_entry.rs:107` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) dalaran_py/src/python_bridge.rs:1581— dalaran_py/src/python_bridge.rs:1581-1590 | dalaran_py/src/python_bridge.rs:1612-1621 — both copies are in the same file, so extract the 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 `dalaran_py/src/python_bridge.rs:1581` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) docs/snippets/all/archetypes/graph_directed.rs:6— docs/snippets/all/archetypes/graph_directed.rs:6-15 | docs/snippets/all/archetypes/graph_undirected.rs:6-15 — 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 `docs/snippets/all/archetypes/graph_directed.rs:6` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) crates/store/dl_log_types/src/example_components.rs:210— crates/store/dl_log_types/src/example_components.rs:210-219 | crates/store/dl_log_types/src/example_components.rs:315-324 — both copies are in the same file, so extract the 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 `crates/store/dl_log_types/src/example_components.rs:210` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) crates/viewer/dl_viewport_blueprint/src/container.rs:365— crates/viewer/dl_viewport_blueprint/src/container.rs:365-374 | crates/viewer/dl_viewport_blueprint/src/view.rs:358-367 — 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/viewer/dl_viewer/src/ui/share_modal.rs:288— crates/viewer/dl_viewer/src/ui/share_modal.rs:288-297 | crates/viewer/dl_viewer/src/ui/share_modal.rs:317-326 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/ui/share_modal.rs:288` 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 (10 lines × 2) crates/utils/dl_video/src/decode/av1.rs:207— crates/utils/dl_video/src/decode/av1.rs:207-216 | crates/utils/dl_video/src/decode/av1.rs:220-229 — both copies are in the same file, so extract the 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 `crates/utils/dl_video/src/decode/av1.rs:207` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:454— crates/store/dl_redap_tests/src/utils/dalaran.rs:454-463 | crates/store/dl_redap_tests/src/utils/dalaran.rs:477-486 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:454` 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 (10 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:508— crates/store/dl_redap_tests/src/utils/dalaran.rs:508-517 | crates/store/dl_redap_tests/src/utils/dalaran.rs:680-689 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:508` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) examples/python/detect_and_track_objects/detect_and_track_objects.py:443— examples/python/detect_and_track_objects/detect_and_track_objects.py:443-452 | examples/python/human_pose_tracking/human_pose_tracking.py:165-174 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:182— examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:182-191 | examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:197-206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) scripts/lint.py:101— scripts/lint.py:101-110 | scripts/roundtrip_utils.py:15-24 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) crates/store/dl_log_types/src/example_components.rs:173— crates/store/dl_log_types/src/example_components.rs:173-178 | crates/store/dl_log_types/src/example_components.rs:278-283 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) crates/store/dl_server/src/dalaran_cloud/mod.rs:1642— crates/store/dl_server/src/dalaran_cloud/mod.rs:1642-1647 | crates/store/dl_server/src/store/dataset.rs:404-409 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) crates/store/dl_server/src/store/dataset.rs:234— crates/store/dl_server/src/store/dataset.rs:234-239 | crates/store/dl_server/src/store/dataset.rs:412-417 — both copies are in the same file, so extract the block into 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/utils/dl_analytics/src/native/pipeline.rs:95— crates/utils/dl_analytics/src/native/pipeline.rs:95-101 | crates/utils/dl_analytics/src/native/pipeline.rs:113-118 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_analytics/src/native/pipeline.rs:95` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:191— crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:191-196 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:348-353 — both copies are in the same file, so extract the 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 `crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:191` 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 (6 lines × 2) crates/viewer/dl_view_spatial/src/ui_2d.rs:366— crates/viewer/dl_view_spatial/src/ui_2d.rs:366-371 | crates/viewer/dl_view_spatial/src/ui_3d.rs:415-420 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/viewer/dl_view_spatial/src/ui_2d.rs:365` calls `view_context` and `crates/viewer/dl_view_spatial/src/ui_3d.rs:413` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:238— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:238-243 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:240-245 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:238` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (6 lines × 2) crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:384— crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:384-391 | crates/viewer/dl_view_time_series/src/series_query.rs:400-405 — 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 `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:384` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (6 lines × 2) docs/snippets/all/archetypes/points2d_random.rs:20— docs/snippets/all/archetypes/points2d_random.rs:20-27 | docs/snippets/all/archetypes/points3d_random.rs:22-27 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/points2d_random.rs:20` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) crates/store/dl_chunk_store/src/query.rs:76— crates/store/dl_chunk_store/src/query.rs:76-81 | crates/store/dl_chunk_store/src/query.rs:103-108 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_chunk_store/src/query.rs:76` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) crates/store/dl_importer/src/lerobot/datasetv2.rs:247— crates/store/dl_importer/src/lerobot/datasetv2.rs:247-252 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1264-1269 — before extracting anything, compare `crates/store/dl_importer/src/lerobot/datasetv2.rs` and `crates/store/dl_importer/src/lerobot/datasetv3.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (6 lines × 2) crates/store/dl_lenses_core/src/combinators/reshape.rs:294— crates/store/dl_lenses_core/src/combinators/reshape.rs:294-299 | crates/store/dl_lenses_core/src/combinators/reshape.rs:307-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) crates/top/dalaran/src/commands/dlr/filter.rs:77— crates/top/dalaran/src/commands/dlr/filter.rs:77-82 | crates/top/dalaran/src/commands/dlr/merge_optimize.rs:545-550 — 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 `crates/top/dalaran/src/commands/dlr/filter.rs:77` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (6 lines × 2) dalaran_py/src/selector.rs:78— dalaran_py/src/selector.rs:78-83 | dalaran_py/src/selector.rs:99-104 — both copies are in the same file, so extract the 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 `dalaran_py/src/selector.rs:78` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) crates/store/dl_hdf5/src/config.rs:85— crates/store/dl_hdf5/src/config.rs:85-90 | crates/store/dl_parquet/src/config.rs:98-103 — 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/store/dl_sorbet/src/column_descriptor.rs:60— crates/store/dl_sorbet/src/column_descriptor.rs:60-65 | crates/store/dl_sorbet/src/column_descriptor_ref.rs:40-45 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) crates/viewer/dl_viewport_blueprint/src/container.rs:334— crates/viewer/dl_viewport_blueprint/src/container.rs:334-339 | crates/viewer/dl_viewport_blueprint/src/view.rs:132-137 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) crates/viewer/dl_component_ui/src/datatype_uis/view_uuid.rs:9— crates/viewer/dl_component_ui/src/datatype_uis/view_uuid.rs:9-14 | crates/viewer/dl_component_ui/src/image_format.rs:9-15 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_component_ui/src/datatype_uis/view_uuid.rs:9` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) crates/store/dl_importer/src/importer_urdf/joint_transform.rs:106— crates/store/dl_importer/src/importer_urdf/joint_transform.rs:106-116 | crates/store/dl_importer/src/importer_urdf/joint_transform.rs:135-140 — both copies are in the same file, so extract the 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 `crates/store/dl_importer/src/importer_urdf/joint_transform.rs:135` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (6 lines × 2) docs/snippets/all/archetypes/asset3d_simple.rs:6— docs/snippets/all/archetypes/asset3d_simple.rs:6-11 | docs/snippets/all/archetypes/gaussian_splats3d_ply.rs:6-11 — 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 `docs/snippets/all/archetypes/gaussian_splats3d_ply.rs:6` 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.
Duplicated block (6 lines × 2) dalaran_py/dalaran_sdk/dalaran/robot/frames.py:197— dalaran_py/dalaran_sdk/dalaran/robot/frames.py:197-202 | dalaran_py/dalaran_sdk/dalaran/robot/robot.py:248-259 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) crates/utils/dl_test_mocks/src/otlp.rs:239— crates/utils/dl_test_mocks/src/otlp.rs:239-244 | crates/utils/dl_test_mocks/src/posthog.rs:272-277 — 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 `crates/utils/dl_test_mocks/src/otlp.rs:239` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (6 lines × 2) scripts/ci/python_check_signatures.py:132— scripts/ci/python_check_signatures.py:132-137 | scripts/ci/python_check_signatures.py:162-167 — both copies are in the same file, so extract the block into 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) examples/python/structure_from_motion/structure_from_motion/read_write_model.py:331— examples/python/structure_from_motion/structure_from_motion/read_write_model.py:331-336 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:356-361 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 2) scripts/ci/upload_docs.py:293— scripts/ci/upload_docs.py:293-298 | scripts/ci/upload_docs.py:395-400 — both copies are in the same file, so extract the block into 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/store/dl_parquet/src/streaming.rs:45— crates/store/dl_parquet/src/streaming.rs:45-49 | crates/store/dl_parquet/src/streaming.rs:72-76 — both copies are in the same file, so extract the block into 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/store/dl_server/src/dalaran_cloud/mod.rs:1213— crates/store/dl_server/src/dalaran_cloud/mod.rs:1213-1217 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1242-1246 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `request` to `tonic::Request<dl_protos::cloud::v1alpha1::GetSegmentTableSchemaRequest>` in one and `tonic::Request<dl_protos::cloud::v1alpha1::ScanSegmentTableRequest>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (5 lines × 2) crates/viewer/dl_view_spatial/src/proc_mesh.rs:323— crates/viewer/dl_view_spatial/src/proc_mesh.rs:323-327 | crates/viewer/dl_view_spatial/src/proc_mesh.rs:335-339 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view_spatial/src/proc_mesh.rs:323` 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 (5 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:455— crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:455-460 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:498-502 — 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. 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.
Duplicated block (5 lines × 2) crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:7— crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:7-11 | docs/snippets/all/quick_start/quick_start_connect.rs:7-12 — before extracting anything, compare `crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs` and `docs/snippets/all/quick_start/quick_start_connect.rs` as WHOLE FILES: 94% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1089— crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1089-1095 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1369-1373 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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.
Duplicated block (5 lines × 2) dalaran_py/src/catalog/dataframe_rendering.rs:140— dalaran_py/src/catalog/dataframe_rendering.rs:140-144 | dalaran_py/src/catalog/dataframe_rendering.rs:179-183 — both copies are in the same file, so extract the 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 `dalaran_py/src/catalog/dataframe_rendering.rs:140` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) docs/snippets/all/tutorials/dna.rs:62— docs/snippets/all/tutorials/dna.rs:62-66 | docs/snippets/all/tutorials/dna.rs:86-90 — both copies are in the same file, so extract the block into 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/viewer/dl_ui/src/list_item/label_content.rs:128— crates/viewer/dl_ui/src/list_item/label_content.rs:128-132 | crates/viewer/dl_ui/src/list_item/property_content.rs:63-67 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:172— crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:172-176 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:146-150 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) crates/top/dalaran/src/commands/dlr/stats.rs:224— crates/top/dalaran/src/commands/dlr/stats.rs:224-228 | crates/top/dalaran/src/commands/dlr/stats.rs:240-247 — both copies are in the same file, so extract the 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 `crates/top/dalaran/src/commands/dlr/stats.rs:224` 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 (5 lines × 2) docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:67— docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:67-73 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:78-82 — both copies are in the same file, so extract the 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 `docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:67` 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.
Duplicated block (5 lines × 2) crates/viewer/dl_selection_panel/src/selection_panel.rs:211— crates/viewer/dl_selection_panel/src/selection_panel.rs:211-215 | crates/viewer/dl_selection_panel/src/selection_panel.rs:232-238 — both copies are in the same file, so extract the 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 `crates/viewer/dl_selection_panel/src/selection_panel.rs:211` 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.
Duplicated block (5 lines × 2) crates/store/dl_importer/src/lerobot/datasetv3.rs:520— crates/store/dl_importer/src/lerobot/datasetv3.rs:520-524 | crates/store/dl_importer/src/lerobot/datasetv3.rs:555-559 — both copies are in the same file, so extract the 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 `crates/store/dl_importer/src/lerobot/datasetv3.rs:520` 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 (5 lines × 2) dalaran_py/src/catalog/dataset_entry.rs:240— dalaran_py/src/catalog/dataset_entry.rs:240-244 | dalaran_py/src/catalog/dataset_entry.rs:264-268 — both copies are in the same file, so extract the 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 `dalaran_py/src/catalog/dataset_entry.rs:240` 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 (5 lines × 2) crates/store/dl_chunk/src/iter.rs:326— crates/store/dl_chunk/src/iter.rs:326-330 | crates/store/dl_chunk/src/iter.rs:417-421 — both copies are in the same file, so extract the block into 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/viewer/dl_view_spatial/src/visualizers/mod.rs:76— crates/viewer/dl_view_spatial/src/visualizers/mod.rs:76-80 | crates/viewer/dl_view_spatial/src/visualizers/mod.rs:103-107 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/mod.rs:81— crates/viewer/dl_view_spatial/src/visualizers/mod.rs:81-85 | crates/viewer/dl_view_spatial/src/visualizers/mod.rs:111-115 — both copies are in the same file, so extract the block into 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) scripts/ci/compare.py:69— scripts/ci/compare.py:69-73 | scripts/ci/count_bytes.py:74-78 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (5 lines × 2) scripts/ci/pixi_install_wheel.py:88— scripts/ci/pixi_install_wheel.py:88-92 | scripts/ci/uv_install_wheel.py:88-92 — before extracting anything, compare `scripts/ci/pixi_install_wheel.py` and `scripts/ci/uv_install_wheel.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) scripts/ci/bundle_and_upload_dalaran_cpp.py:23— scripts/ci/bundle_and_upload_dalaran_cpp.py:23-27 | scripts/screenshot_compare/build_screenshot_compare.py:67-71 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) crates/store/dl_chunk_store/src/query.rs:198— crates/store/dl_chunk_store/src/query.rs:198-209 | crates/store/dl_chunk_store/src/query.rs:247-258 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk_store/src/query.rs:198` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:406— crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:406-417 | crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:428-439 — both copies are in the same file, so extract the 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 `crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:406` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) crates/store/dl_log_types/src/index/time_real.rs:110— crates/store/dl_log_types/src/index/time_real.rs:110-121 | crates/store/dl_log_types/src/index/time_real.rs:128-139 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `f32` in one and `f64` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (12 lines × 2) crates/viewer/dl_renderer/src/colormap.rs:113— crates/viewer/dl_renderer/src/colormap.rs:113-124 | crates/viewer/dl_renderer/src/colormap.rs:157-168 — both copies are in the same file, so extract the 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 `crates/viewer/dl_renderer/src/colormap.rs:113` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:566— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:566-577 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:561-572 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:566` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (12 lines × 2) crates/viewer/dl_view_spatial/src/eye.rs:582— crates/viewer/dl_view_spatial/src/eye.rs:582-593 | crates/viewer/dl_view_spatial/src/eye.rs:633-644 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:94— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:94-106 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:92-103 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:94` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (12 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:71— crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:71-82 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:80-91 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:71` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) crates/viewer/dl_viewer_context/src/selection_state.rs:207— crates/viewer/dl_viewer_context/src/selection_state.rs:207-218 | crates/viewer/dl_viewer_context/src/selection_state.rs:228-239 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer_context/src/selection_state.rs:207` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) docs/snippets/all/tutorials/any_values.rs:22— docs/snippets/all/tutorials/any_values.rs:22-33 | docs/snippets/all/tutorials/dynamic_archetype.rs:23-34 — 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 `docs/snippets/all/tutorials/any_values.rs:22` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:416— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:416-428 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:473-484 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs` and `crates/viewer/dl_renderer/src/renderer/mesh_renderer.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. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:416` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) crates/viewer/dl_selection_panel/src/selection_panel.rs:262— crates/viewer/dl_selection_panel/src/selection_panel.rs:262-274 | crates/viewer/dl_selection_panel/src/selection_panel.rs:301-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_selection_panel/src/selection_panel.rs:262` 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.
Duplicated block (12 lines × 2) dalaran_py/src/catalog/segment_url_udf.rs:101— dalaran_py/src/catalog/segment_url_udf.rs:101-112 | dalaran_py/src/catalog/segment_url_udf.rs:118-129 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dalaran_py/src/catalog/segment_url_udf.rs:101` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs:13— crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs:13-24 | crates/store/dl_lenses/src/semantic/foxglove/voxel_grid.rs:13-24 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs:12— crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs:12-23 | crates/store/dl_lenses/src/semantic/foxglove/poses_in_frame.rs:12-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs:12` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) docs/snippets/all/archetypes/transform3d_hierarchy.rs:66— docs/snippets/all/archetypes/transform3d_hierarchy.rs:66-77 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:86-97 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/transform3d_hierarchy.rs:66` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) dalaran_notebook/src/dalaran_notebook/asset_server.py:49— dalaran_notebook/src/dalaran_notebook/asset_server.py:49-60 | dalaran_notebook/src/dalaran_notebook/asset_server.py:64-75 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) crates/viewer/dl_renderer_examples/picking.rs:132— crates/viewer/dl_renderer_examples/picking.rs:132-143 | crates/viewer/dl_renderer_examples/world_grid.rs:64-75 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer_examples/picking.rs:132` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) examples/python/face_tracking/face_tracking.py:374— examples/python/face_tracking/face_tracking.py:374-385 | examples/python/gesture_detection/gesture_detection.py:226-237 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `examples/python/face_tracking/face_tracking.py:387` calls `resize_image` and `examples/python/gesture_detection/gesture_detection.py:242` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 2) scripts/ci/pixi_install_wheel.py:33— scripts/ci/pixi_install_wheel.py:33-44 | scripts/ci/uv_install_wheel.py:32-43 — before extracting anything, compare `scripts/ci/pixi_install_wheel.py` and `scripts/ci/uv_install_wheel.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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.
TooManyMethods: Chunk crates/store/dl_chunk/src/chunk.rs:225— TooManyMethods — 117 methods, declared across 11 files: src/chunk.rs (51), src/slice.rs (17), src/iter.rs (10), src/shuffle.rs (10), +7 more file(s). The bar is 30 methods; this is 87 over it, 3.90× 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: ChunkStore crates/store/dl_chunk_store/src/store.rs:519— TooManyMethods — 117 methods, declared across 11 files: src/query.rs (32), src/store.rs (31), src/lineage.rs (11), src/subscribers.rs (11), +7 more file(s). The bar is 30 methods; this is 87 over it, 3.90× 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: App crates/viewer/dl_viewer/src/app/mod.rs:75— TooManyMethods — 84 methods, declared across 6 files: app/mod.rs (31), app/command_handling.rs (18), app/logic.rs (16), app/ui.rs (8), +2 more file(s). The bar is 30 methods; this is 54 over it, 2.80× 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. Most of these members implement app.App (84 of 84 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member.
TooManyMethods: RecordingStream crates/top/dl_sdk/src/recording_stream.rs:778— TooManyMethods — 73 methods, declared across 2 files: src/recording_stream.rs (62), src/global.rs (11). The bar is 30 methods; this is 43 over it, 2.43× 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: EntityDb crates/store/dl_entity_db/src/entity_db.rs:113— TooManyMethods — 70 methods. The bar is 30 methods; this is 40 over it, 2.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: StoreHub crates/viewer/dl_viewer_context/src/store_hub.rs:118— TooManyMethods — 59 methods. The bar is 30 methods; this is 29 over it, 1.97× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: RawRrdManifest crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:137— TooManyMethods — 56 methods. The bar is 30 methods; this is 26 over it, 1.87× 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: TimeControl crates/viewer/dl_viewer_context/src/time_control/mod.rs:183— TooManyMethods — 44 methods, declared across 2 files: time_control/mod.rs (34), time_control/command.rs (10). The bar is 30 methods; this is 14 over it, 1.47× 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: RedapClient crates/store/dl_redap_client/src/connection_client.rs:308— TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DesignTokens crates/viewer/dl_ui/src/design_tokens.rs:103— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× 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: ViewportBlueprint crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:37— 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: ViewerContext crates/viewer/dl_viewer_context/src/viewer_context.rs:21— TooManyMethods — 38 methods, declared across 2 files: src/viewer_context.rs (37), src/query_context.rs (1). The bar is 30 methods; this is 8 over it, 1.27× 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: RecordingStream dalaran_py/dalaran_sdk/dalaran/recording_stream.py:155— TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: InMemoryStore crates/store/dl_server/src/store/in_memory_store.rs:39— 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: WebViewer dalaran_js/web-viewer/index.ts:467— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: RrdManifestIndex crates/store/dl_entity_db/src/dlr_manifest_index.rs:113— 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: TimeColumn crates/store/dl_chunk/src/chunk.rs:896— TooManyMethods — 31 methods, declared across 5 files: src/chunk.rs (23), src/slice.rs (4), src/shuffle.rs (2), src/builder.rs (1), +1 more file(s). The bar is 30 methods; this is 1 over it, 1.03× 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: EntityPath crates/store/dl_log_types/src/path/entity_path.rs:94— TooManyMethods — 31 methods, declared across 3 files: path/entity_path.rs (28), path/parse_path.rs (2), datatypes/entity_path_ext.rs (1). The bar is 30 methods; this is 1 over it, 1.03× 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: PyDatasetEntryInternal dalaran_py/src/catalog/dataset_entry.rs:31— 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.
Change coupling: __init__.py ↔ widget.ts dalaran_notebook/src/dalaran_notebook/__init__.py:1— `dalaran_notebook/src/dalaran_notebook/__init__.py` and `dalaran_notebook/src/js/widget.ts` change together 87% of the time (13 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `beaee9c6` Expose theme setting on web-viewer notebook (at that commit the files were still `rerun_notebook/src/rerun_notebook/__init__.py` and `rerun_notebook/src/js/widget.ts`); `99ffdbe8` Auth for Jupyter Notebooks (#11855) (at that commit the files were still `rerun_notebook/src/rerun_notebook/__init__.py` and `rerun_notebook/src/js/widget.ts`); `889d9fe7` Upload notebook assets to `{version}/notebook/{file}` (#10722) (at that commit the files were still `rerun_notebook/src/rerun_notebook/__init__.py` and `rerun_notebook/src/js/widget.ts`) — run `git show` on any of them.
Change coupling: gltf.rs ↔ obj.rs crates/viewer/dl_renderer/src/importer/gltf.rs:1— `crates/viewer/dl_renderer/src/importer/gltf.rs` and `crates/viewer/dl_renderer/src/importer/obj.rs` change together 87% of the time (13 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `3e26be7f` Ignore NaN/Inf values for bounding box calculations used in 3d eye ca… (at that commit the files were still `crates/viewer/re_renderer/src/importer/gltf.rs` and `crates/viewer/re_renderer/src/importer/obj.rs`); `8382f149` Fix bounding box calculation for GLB/GLTF & DAE meshes (at that commit the files were still `crates/viewer/re_renderer/src/importer/gltf.rs` and `crates/viewer/re_renderer/src/importer/obj.rs`); `1c02564c` Don't keep around additional cpu copy of loaded mesh files (#7824) (at that commit the files were still `crates/viewer/re_renderer/src/importer/gltf.rs` and `crates/viewer/re_renderer/src/importer/obj.rs`) — run `git show` on any of them.
Change coupling: line_visualizer_system.rs ↔ point_visualizer_system.rs crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:1— `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` change together 82% of the time (51 of the 62 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 51 shared commits counted here, the most recent 3 are `8c8e96b6` Time series: warn when scalar series count changes (#12802) (at that commit the files were still `crates/viewer/re_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/re_view_time_series/src/point_visualizer_system.rs`); `7d6aeef7` Skip empty visualizers (at that commit the files were still `crates/viewer/re_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/re_view_time_series/src/point_visualizer_system.rs`); `ab4b97bf` Fix time series ui-id issues when showing the same blueprint multiple… (at that commit the files were still `crates/viewer/re_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/re_view_time_series/src/point_visualizer_system.rs`) — run `git show` on any of them.
Change coupling: obj.rs ↔ mesh_renderer.rs crates/viewer/dl_renderer/src/importer/obj.rs:1— `crates/viewer/dl_renderer/src/importer/obj.rs` and `crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs` change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `3e26be7f` Ignore NaN/Inf values for bounding box calculations used in 3d eye ca… (at that commit the files were still `crates/viewer/re_renderer/src/importer/obj.rs` and `crates/viewer/re_renderer/src/renderer/mesh_renderer.rs`); `1c02564c` Don't keep around additional cpu copy of loaded mesh files (#7824) (at that commit the files were still `crates/viewer/re_renderer/src/importer/obj.rs` and `crates/viewer/re_renderer/src/renderer/mesh_renderer.rs`); `514ed624` Remove old `MeshManager` (#7531) (at that commit the files were still `crates/viewer/re_renderer/src/importer/obj.rs` and `crates/viewer/re_renderer/src/renderer/mesh_renderer.rs`) — run `git show` on any of them.
Change coupling: imu.rs ↔ point_cloud_2.rs crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs:1— `crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs` and `crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs` change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `e44b1750` Parse `frame_id` fields of ROS 2 MCAP messages as `CoordinateFrame` (… (at that commit the files were still `crates/store/re_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs` and `crates/store/re_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs`); `f47dab6b` Group non-Unix epoch ROS 2 messages on a shared timeline (#11218) (at that commit the files were still `crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs` and `crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs`); `5b273ad6` Implement fallback mode for raw MCAP layer (#11136) (at that commit the files were still `crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs` and `crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs`) — run `git show` on any of them.
Change coupling: assets3d.rs ↔ meshes.rs crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:1— `crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/meshes.rs` change together 71% of the time (12 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `d995b273` Lazily convert to string (at that commit the files were still `crates/viewer/re_view_spatial/src/visualizers/assets3d.rs` and `crates/viewer/re_view_spatial/src/visualizers/meshes.rs`); `a830fa0a` Always access `caches` through `store_context` (#9030) (at that commit the files were still `crates/viewer/re_view_spatial/src/visualizers/assets3d.rs` and `crates/viewer/re_view_spatial/src/visualizers/meshes.rs`); `1c02564c` Don't keep around additional cpu copy of loaded mesh files (#7824) (at that commit the files were still `crates/viewer/re_space_view_spatial/src/visualizers/assets3d.rs` and `crates/viewer/re_space_view_spatial/src/visualizers/meshes.rs`) — run `git show` on any of them.
Change coupling: widget.ts ↔ notebook.py dalaran_notebook/src/js/widget.ts:1— `dalaran_notebook/src/js/widget.ts` and `dalaran_py/dalaran_sdk/dalaran/notebook.py` change together 67% of the time (10 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `beaee9c6` Expose theme setting on web-viewer notebook (at that commit the files were still `rerun_notebook/src/js/widget.ts` and `rerun_py/rerun_sdk/rerun/notebook.py`); `99ffdbe8` Auth for Jupyter Notebooks (#11855) (at that commit the files were still `rerun_notebook/src/js/widget.ts` and `rerun_py/rerun_sdk/rerun/notebook.py`); `32322c92` Add `open_url`/`close_url` notebook APIs (#10602) (at that commit the files were still `rerun_notebook/src/js/widget.ts` and `rerun_py/rerun_sdk/rerun/notebook.py`) — run `git show` on any of them.
Change coupling: view_2d.rs ↔ view_3d.rs crates/viewer/dl_view_spatial/src/view_2d.rs:1— `crates/viewer/dl_view_spatial/src/view_2d.rs` and `crates/viewer/dl_view_spatial/src/view_3d.rs` change together 60% of the time (30 of the 50 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 30 shared commits counted here, the most recent 3 are `5797b85e` Add `SpatialInformation` blueprint controls to 2D view (at that commit the files were still `crates/viewer/re_view_spatial/src/view_2d.rs` and `crates/viewer/re_view_spatial/src/view_3d.rs`); `093a677e` Skip heuristic exclusions if transform frame ids have been logged (#1… (at that commit the files were still `crates/viewer/re_view_spatial/src/view_2d.rs` and `crates/viewer/re_view_spatial/src/view_3d.rs`); `2e71c003` Add exclusions for 2d visualizables in 3d and vice-versa (#12087) (at that commit the files were still `crates/viewer/re_view_spatial/src/view_2d.rs` and `crates/viewer/re_view_spatial/src/view_3d.rs`) — run `git show` on any of them.
Change coupling: loading.rs ↔ store_hub.rs crates/viewer/dl_viewer/src/loading.rs:1— `crates/viewer/dl_viewer/src/loading.rs` and `crates/viewer/dl_viewer_context/src/store_hub.rs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `f26336ef` Removing all calls to `StoreBundle::entry` apart from `entity_db_entry` (at that commit the files were still `crates/viewer/re_viewer/src/loading.rs` and `crates/viewer/re_viewer_context/src/store_hub.rs`); `f5f80f98` Move `StoreBundle` from `re_viewer_context` to `re_entity_db` (#9971) (at that commit the files were still `crates/viewer/re_viewer/src/loading.rs` and `crates/viewer/re_viewer_context/src/store_hub.rs`); `ef0a3e8b` Move `store_bundle` to `re_viewer_context` (#9407) (at that commit the files were still `crates/viewer/re_viewer/src/loading.rs` and `crates/viewer/re_viewer_context/src/store_hub.rs`) — run `git show` on any of them.
Change coupling: importer.rs ↔ decode.rs crates/store/dl_importer/src/importer_mcap/importer.rs:1— `crates/store/dl_importer/src/importer_mcap/importer.rs` and `crates/store/dl_mcap/src/parsers/decode.rs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `16808be2` Introduce MCAP layers and `rerun mcap` CLI tools (#10856) (at that commit the files were still `crates/store/re_data_loader/src/loader_mcap.rs` and `crates/store/re_data_loader/src/mcap/decode.rs`); `90072252` Add profile scopes to mcap loader (#10859) (at that commit the files were still `crates/store/re_data_loader/src/loader_mcap.rs` and `crates/store/re_data_loader/src/mcap/decode.rs`); `15f12097` Low-level Arrow conversion of `protobuf`-encoded MCAP messages (#10791) (at that commit the files were still `crates/store/re_data_loader/src/loader_mcap.rs` and `crates/store/re_data_loader/src/mcap/decode.rs`) — run `git show` on any of them.
Change coupling: selection_panel.rs ↔ view_highlights.rs crates/viewer/dl_selection_panel/src/selection_panel.rs:1— `crates/viewer/dl_selection_panel/src/selection_panel.rs` and `crates/viewer/dl_viewport/src/view_highlights.rs` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `9f04b354` Add an explicit `DataResult` variant to `re_viewport_context::Item` (… (at that commit the files were still `crates/re_viewer/src/ui/selection_panel.rs` and `crates/re_viewport/src/space_view_highlights.rs`); `4dc09f1f` Remove groups from blueprint (#5326) (at that commit the files were still `crates/re_viewer/src/ui/selection_panel.rs` and `crates/re_viewport/src/space_view_highlights.rs`); `48f64a73` Click a recording to select it (#4761) (at that commit the files were still `crates/re_viewer/src/ui/selection_panel.rs` and `crates/re_viewport/src/space_view_highlights.rs`) — run `git show` on any of them.
Change coupling: segment_table.rs ↔ table_entry_provider.rs crates/store/dl_datafusion/src/segment_table.rs:1— `crates/store/dl_datafusion/src/segment_table.rs` and `crates/store/dl_datafusion/src/table_entry_provider.rs` change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `be131708` dataplatform api: use entry headers everywhere (at that commit the files were still `crates/store/re_datafusion/src/segment_table.rs` and `crates/store/re_datafusion/src/table_entry_provider.rs`); `120219a8` Clean-up of the partition table datafusion table provider (#11434) (at that commit the files were still `crates/store/re_datafusion/src/partition_table.rs` and `crates/store/re_datafusion/src/table_entry_provider.rs`); `124fbc50` Introduce `ConnectionClient`, an ergonomic wrapper over the frontend … (at that commit the files were still `crates/store/re_datafusion/src/partition_table.rs` and `crates/store/re_datafusion/src/table_entry_provider.rs`) — run `git show` on any of them.
Change coupling: dlr_manifest_index.rs ↔ prefetch_chunks.rs crates/store/dl_entity_db/src/dlr_manifest_index.rs:1— `crates/store/dl_entity_db/src/dlr_manifest_index.rs` and `crates/viewer/dl_viewer/src/prefetch_chunks.rs` change together 55% of the time (11 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `7c0680e5` By default, fetch similar chunks 30 seconds of playtime forward (at that commit the files were still `crates/store/re_entity_db/src/rrd_manifest_index.rs` and `crates/viewer/re_viewer/src/prefetch_chunks.rs`); `b509f91d` By default, only prefetched what is visible (at that commit the files were still `crates/store/re_entity_db/src/rrd_manifest_index.rs` and `crates/viewer/re_viewer/src/prefetch_chunks.rs`); `78dbaf3c` Better fetching of multiple recordings (at that commit the files were still `crates/store/re_entity_db/src/rrd_manifest_index.rs` and `crates/viewer/re_viewer/src/prefetch_chunks.rs`) — run `git show` on any of them.
Change coupling: image_decode_cache.rs ↔ video_asset_cache.rs crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs:1— `crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs` and `crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `3149d364` Add `pixi run rerun-fast` for faster compile times using cranelift (at that commit the files were still `crates/viewer/re_viewer_context/src/cache/image_decode_cache.rs` and `crates/viewer/re_viewer_context/src/cache/video_asset_cache.rs`); `95a4b5ea` Help out `+nightly` type checker by specifying trait bounds (#12432) (at that commit the files were still `crates/viewer/re_viewer_context/src/cache/image_decode_cache.rs` and `crates/viewer/re_viewer_context/src/cache/video_asset_cache.rs`); `b461f398` Fix videos re-decoding on some ui interactions (#10420) (at that commit the files were still `crates/viewer/re_viewer_context/src/cache/image_decode_cache.rs` and `crates/viewer/re_viewer_context/src/cache/video_asset_cache.rs`) — run `git show` on any of them.
Change coupling: selection_panel.rs ↔ add_view_or_container_modal.rs crates/viewer/dl_selection_panel/src/selection_panel.rs:1— `crates/viewer/dl_selection_panel/src/selection_panel.rs` and `crates/viewer/dl_viewport_blueprint/src/ui/add_view_or_container_modal.rs` change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `a4f0e721` Move blueprint tree UI to new `re_blueprint_tree` crate (#6427) (at that commit the files were still `crates/re_viewer/src/ui/selection_panel.rs` and `crates/re_viewport_blueprint/src/ui/add_space_view_or_container_modal.rs`); `76fd4cbe` Allow setting custom names to container (#5626) (at that commit the files were still `crates/re_viewer/src/ui/selection_panel.rs` and `crates/re_viewport/src/add_space_view_or_container_modal.rs`); `ce407eb3` Introduce basic support for $origin substitution in EntityPathFilter … (at that commit the files were still `crates/re_viewer/src/ui/selection_panel.rs` and `crates/re_viewport/src/add_space_view_or_container_modal.rs`) — run `git show` on any of them.
Change coupling: viewport_ui.rs ↔ add_view_or_container_modal.rs crates/viewer/dl_viewport/src/viewport_ui.rs:1— `crates/viewer/dl_viewport/src/viewport_ui.rs` and `crates/viewer/dl_viewport_blueprint/src/ui/add_view_or_container_modal.rs` change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `55b389f4` Refactor in preparation for supporting light mode (#9961) (at that commit the files were still `crates/viewer/re_viewport/src/viewport_ui.rs` and `crates/viewer/re_viewport_blueprint/src/ui/add_view_or_container_modal.rs`); `a4f0e721` Move blueprint tree UI to new `re_blueprint_tree` crate (#6427) (at that commit the files were still `crates/re_viewport/src/viewport.rs` and `crates/re_viewport_blueprint/src/ui/add_space_view_or_container_modal.rs`); `76fd4cbe` Allow setting custom names to container (#5626) (at that commit the files were still `crates/re_viewport/src/viewport.rs` and `crates/re_viewport/src/add_space_view_or_container_modal.rs`) — run `git show` on any of them.
Change coupling: component_path_ui.rs ↔ instance_path_ui.rs crates/viewer/dl_data_ui/src/component_path_ui.rs:1— `crates/viewer/dl_data_ui/src/component_path_ui.rs` and `crates/viewer/dl_data_ui/src/instance_path_ui.rs` change together 50% of the time (13 of the 26 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `474dbe8a` Selection panel: show all values at the latest time stamp (at that commit the files were still `crates/viewer/re_data_ui/src/component_path_ui.rs` and `crates/viewer/re_data_ui/src/instance_path_ui.rs`); `e462d01c` Show reason for loading indicators on hover in debug mode (at that commit the files were still `crates/viewer/re_data_ui/src/component_path_ui.rs` and `crates/viewer/re_data_ui/src/instance_path_ui.rs`); `a2b5ab84` Improve error messages for Tensor and Text Document views (#8155) (at that commit the files were still `crates/viewer/re_data_ui/src/component_path.rs` and `crates/viewer/re_data_ui/src/instance_path.rs`) — run `git show` on any of them.
Change coupling: depth_images.rs ↔ images.rs crates/viewer/dl_view_spatial/src/visualizers/depth_images.rs:1— `crates/viewer/dl_view_spatial/src/visualizers/depth_images.rs` and `crates/viewer/dl_view_spatial/src/visualizers/images.rs` change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `19b2c79a` Make more visualizer errors point to specific components that are in … (at that commit the files were still `crates/viewer/re_view_spatial/src/visualizers/depth_images.rs` and `crates/viewer/re_view_spatial/src/visualizers/images.rs`); `c8d169b2` Fix missing error when drawing depth image for point cloud without pi… (at that commit the files were still `crates/viewer/re_view_spatial/src/visualizers/depth_images.rs` and `crates/viewer/re_view_spatial/src/visualizers/images.rs`); `1d1eb78b` Prepare video visualizer for upcoming stream visualizer (#10125) (at that commit the files were still `crates/viewer/re_view_spatial/src/visualizers/depth_images.rs` and `crates/viewer/re_view_spatial/src/visualizers/images.rs`) — run `git show` on any of them.
Change coupling: frame_id_registry.rs ↔ transform_tree_context.rs crates/store/dl_tf/src/frame_id_registry.rs:1— `crates/store/dl_tf/src/frame_id_registry.rs` and `crates/viewer/dl_view_spatial/src/contexts/transform_tree_context.rs` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `5bf9c4a6` Clearer behavior for `CoordinateFrame("")` (at that commit the files were still `crates/store/re_tf/src/frame_id_registry.rs` and `crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs`); `6589388d` Use full recording schema in manifest ingestion (at that commit the files were still `crates/store/re_tf/src/frame_id_registry.rs` and `crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs`); `5072951e` Show `TransformAxes3D` for out-of-hierarchy `Transform`s (#12262) (at that commit the files were still `crates/store/re_tf/src/frame_id_registry.rs` and `crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs`) — run `git show` on any of them.
Duplicated block (13 lines × 2) crates/store/dl_chunk_store/src/writes.rs:1119— crates/store/dl_chunk_store/src/writes.rs:1119-1131 | crates/store/dl_chunk_store/src/writes.rs:1151-1163 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk_store/src/writes.rs:1119` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) crates/store/dl_dataframe/src/query.rs:1869— crates/store/dl_dataframe/src/query.rs:1869-1881 | crates/store/dl_dataframe/src/query.rs:2326-2338 — both copies are in the same file, so extract the 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 `crates/store/dl_dataframe/src/query.rs:1869` 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 (13 lines × 2) crates/store/dl_log_channel/src/receiver_set.rs:137— crates/store/dl_log_channel/src/receiver_set.rs:137-149 | crates/store/dl_log_channel/src/receiver_set.rs:173-185 — both copies are in the same file, so extract the block into 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/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1434— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1434-1446 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1472-1484 — both copies are in the same file, so extract the 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 `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1434` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1432` calls `Some`, `to_owned` and `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1470` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:98— crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:98-110 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/nav_sat_fix.rs:93-105 — 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 `crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:98` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) crates/store/dl_sorbet/src/column_kind.rs:48— crates/store/dl_sorbet/src/column_kind.rs:48-60 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:68-80 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_sorbet/src/column_kind.rs:48` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:477— crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:477-489 | crates/viewer/dl_chunk_store_ui/src/chunk_ui.rs:205-217 — 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 `crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:477` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:496— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:496-508 | crates/viewer/dl_renderer/src/renderer/rectangles.rs:820-832 — 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 `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:496` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (13 lines × 2) crates/viewer/dl_selection_panel/src/selection_panel.rs:714— crates/viewer/dl_selection_panel/src/selection_panel.rs:714-726 | crates/viewer/dl_selection_panel/src/visualizer_ui.rs:1246-1258 — 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 `crates/viewer/dl_selection_panel/src/selection_panel.rs:714` 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 (13 lines × 2) crates/viewer/dl_ui/src/command/recording_command.rs:298— crates/viewer/dl_ui/src/command/recording_command.rs:298-310 | crates/viewer/dl_ui/src/command/ui_command.rs:265-277 — before extracting anything, compare `crates/viewer/dl_ui/src/command/recording_command.rs` and `crates/viewer/dl_ui/src/command/ui_command.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_ui/src/command/recording_command.rs:298` 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 (13 lines × 2) crates/viewer/dl_view/src/clears.rs:39— crates/viewer/dl_view/src/clears.rs:39-51 | crates/viewer/dl_view/src/clears.rs:66-78 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view/src/clears.rs:39` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/viewer/dl_view/src/clears.rs:65` calls `unwrap_or_default` and `crates/viewer/dl_view/src/clears.rs:38` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:86— crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:86-98 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:58-70 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:86` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:450— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:450-463 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:292-304 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:450` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) docs/snippets/all/archetypes/transform3d_column_updates.rs:8— docs/snippets/all/archetypes/transform3d_column_updates.rs:8-20 | docs/snippets/all/archetypes/transform3d_row_updates.rs:8-20 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/transform3d_column_updates.rs:8` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) docs/snippets/all/archetypes/arrows3d_column_updates.rs:16— docs/snippets/all/archetypes/arrows3d_column_updates.rs:16-28 | docs/snippets/all/archetypes/arrows3d_row_updates.rs:15-27 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `docs/snippets/all/archetypes/arrows3d_column_updates.rs:12` calls `new_duration_secs` and `docs/snippets/all/archetypes/arrows3d_row_updates.rs:11` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:117— crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:117-129 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:196-208 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:117` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062-1074 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1269-1281 — both copies are in the same file, so extract the 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 `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) crates/viewer/dl_view_bar_chart/src/view_class.rs:227— crates/viewer/dl_view_bar_chart/src/view_class.rs:227-239 | crates/viewer/dl_view_bar_chart/src/view_class.rs:241-253 — both copies are in the same file, so extract the block into 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) examples/python/structure_from_motion/structure_from_motion/read_write_model.py:226— examples/python/structure_from_motion/structure_from_motion/read_write_model.py:226-238 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:340-352 — both copies are in the same file, so extract the block into 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/store/dl_chunk/src/iter.rs:477— crates/store/dl_chunk/src/iter.rs:477-483 | crates/store/dl_chunk/src/iter.rs:554-560 — both copies are in the same file, so extract the block into 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/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:171— crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:171-177 | crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:217-223 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:171` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) crates/store/dl_lenses/src/op/semantic.rs:244— crates/store/dl_lenses/src/op/semantic.rs:244-250 | crates/store/dl_lenses/src/op/semantic.rs:282-288 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_lenses/src/op/semantic.rs:244` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) crates/store/dl_lenses/src/op/string.rs:13— crates/store/dl_lenses/src/op/string.rs:13-19 | crates/store/dl_lenses/src/op/string.rs:53-59 — both copies are in the same file, so extract the 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 `crates/store/dl_lenses/src/op/string.rs:13` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:511— crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:511-517 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:352-360 — 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 `crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:511` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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.
Duplicated block (7 lines × 2) crates/viewer/dl_selection_panel/src/selection_panel.rs:1162— crates/viewer/dl_selection_panel/src/selection_panel.rs:1162-1168 | crates/viewer/dl_selection_panel/src/selection_panel.rs:1204-1210 — both copies are in the same file, so extract the 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 `crates/viewer/dl_selection_panel/src/selection_panel.rs:1162` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) crates/viewer/dl_view_map/src/map_view.rs:629— crates/viewer/dl_view_map/src/map_view.rs:629-635 | crates/viewer/dl_view_spatial/src/picking.rs:206-212 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:107— crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:107-113 | crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:154-160 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/store/dl_sorbet/src/column_kind.rs:29— crates/store/dl_sorbet/src/column_kind.rs:29-35 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:54-60 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) crates/viewer/dl_viewer_context/src/cache/encoded_depth_image_stats_cache.rs:114— crates/viewer/dl_viewer_context/src/cache/encoded_depth_image_stats_cache.rs:114-120 | crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs:136-142 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/viewer/dl_viewer_context/src/cache/encoded_depth_image_stats_cache.rs:111` calls `clear` and `crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs:126` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) crates/store/dl_uri/src/endpoints/catalog.rs:24— crates/store/dl_uri/src/endpoints/catalog.rs:24-30 | crates/store/dl_uri/src/endpoints/proxy.rs:23-29 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) crates/store/dl_query/src/cache.rs:219— crates/store/dl_query/src/cache.rs:219-225 | crates/store/dl_query/src/cache.rs:245-251 — both copies are in the same file, so extract the 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 `crates/store/dl_query/src/cache.rs:219` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) dalaran_py/src/arrow.rs:27— dalaran_py/src/arrow.rs:27-33 | dalaran_py/src/arrow.rs:34-40 — both copies are in the same file, so extract the block into 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/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:69— crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:69-75 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:76-82 — both copies are in the same file, so extract the 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 `crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:69` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (7 lines × 2) crates/viewer/dl_viewer_context/src/item.rs:327— crates/viewer/dl_viewer_context/src/item.rs:327-333 | crates/viewer/dl_viewer_context/src/route.rs:60-66 — 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/store/dl_query/src/bin/clamped_zip.rs:198— crates/store/dl_query/src/bin/clamped_zip.rs:198-204 | crates/store/dl_query/src/bin/clamped_zip.rs:237-243 — both copies are in the same file, so extract the block into 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/top/dalaran/src/demo_util.rs:109— crates/top/dalaran/src/demo_util.rs:109-115 | crates/viewer/dl_renderer/src/colormap.rs:240-246 — 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.
Off the main sequence: dl_build_tools — dl_build_tools: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 13 project(s), so it's rigid to change.
Off the main sequence: dl_grpc_headers — dl_grpc_headers: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: dl_rvl — dl_rvl: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
Off the main sequence: dl_span — dl_span: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
Off the main sequence: dl_tracing — dl_tracing: abstractness 0.00, instability 0.02, distance 0.98 — zone of pain — concrete and depended on by 59 project(s), so it's rigid to change.
Off the main sequence: dl_format — dl_format: abstractness 0.00, instability 0.05, distance 0.95 — zone of pain — concrete and depended on by 35 project(s), so it's rigid to change.
Off the main sequence: dl_build_info — dl_build_info: abstractness 0.00, instability 0.07, distance 0.93 — zone of pain — concrete and depended on by 13 project(s), so it's rigid to change.
Off the main sequence: dl_web — dl_web: abstractness 0.00, instability 0.10, distance 0.90 — zone of pain — concrete and depended on by 9 project(s), so it's rigid to change.
Off the main sequence: dl_log — dl_log: abstractness 0.14, instability 0.00, distance 0.86 — zone of pain — concrete and depended on by 71 project(s), so it's rigid to change.
Off the main sequence: dl_quota_channel — dl_quota_channel: abstractness 0.00, instability 0.14, distance 0.86 — zone of pain — concrete and depended on by 18 project(s), so it's rigid to change.
Off the main sequence: dl_tuid — dl_tuid: abstractness 0.00, instability 0.17, distance 0.83 — zone of pain — concrete and depended on by 10 project(s), so it's rigid to change.
Off the main sequence: dl_mutex — dl_mutex: abstractness 0.00, instability 0.18, distance 0.82 — zone of pain — concrete and depended on by 9 project(s), so it's rigid to change.
Off the main sequence: dl_log_types — dl_log_types: abstractness 0.06, instability 0.13, distance 0.81 — zone of pain — concrete and depended on by 59 project(s), so it's rigid to change.
Off the main sequence: dl_capabilities — dl_capabilities: abstractness 0.00, instability 0.20, distance 0.80 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: dl_string_interner — dl_string_interner: abstractness 0.00, instability 0.20, distance 0.80 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: dl_uri — dl_uri: abstractness 0.00, instability 0.20, distance 0.80 — zone of pain — concrete and depended on by 20 project(s), so it's rigid to change.
Off the main sequence: dl_backoff — dl_backoff: abstractness 0.00, instability 0.25, distance 0.75 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
X12 · Unreachable branch· Branch is unreachable · ×17
Branch is unreachable — its condition is a constant crates/viewer/dl_web_viewer_server/src/lib.rs:506— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:596— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/viewer/dl_view_tensor/src/tensor_dimension_mapper.rs:283— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/viewer/dl_view_dataframe/src/view_query/ui.rs:409— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/viewer/dl_ui/src/list_item/property_content.rs:111— The `if` on line 109 tests the literal `true`, so control always takes it and this `else` never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:148— The `if` on line 137 tests the literal `true`, so control always takes it and this `else` never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/utils/dl_video/src/demux/mp4.rs:152— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs:479— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/store/dl_redap_client/src/grpc.rs:84— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs:175— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/store/dl_importer/src/importer_urdf/mod.rs:407— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/store/dl_grpc_client/src/write_table.rs:25— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/build/dl_types_builder/src/objects/from_fbs.rs:128— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/build/dl_types_builder/src/codegen/rust/reflection.rs:117— The `if` on line 115 tests the literal `true`, so control always takes it and this `else` never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/build/dl_types_builder/src/codegen/rust/reflection.rs:254— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/build/dl_types_builder/src/codegen/python/mod.rs:2314— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
Branch is unreachable — its condition is a constant crates/build/dl_types_builder/src/codegen/docs/website.rs:562— The condition is the literal `false`, so this body never runs. The branch can never run. If it is a switch, make it a `const` or a `#[cfg(…)]` so the intent is stated; otherwise delete the dead branch.
App::run_system_command (cognitive 134) crates/viewer/dl_viewer/src/app/command_handling.rs:73— App::run_system_command has cognitive complexity 134 (threshold 15). Drivers by points: if/else 43 (97 pts), match/switch 14 (29 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 71). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
App::ui (cognitive 60) crates/viewer/dl_viewer/src/app/mod.rs:1233— App::ui has cognitive complexity 60 (threshold 15). Drivers by points: if/else 32 (46 pts), match/switch 4 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::run_recording_command (cognitive 53) crates/viewer/dl_viewer/src/app/command_handling.rs:1147— App::run_recording_command has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 2 (6 pts), match/switch 3 (6 pts) (nesting depth added 29). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
App::run_ui_command (cognitive 35) crates/viewer/dl_viewer/src/app/command_handling.rs:790— App::run_ui_command has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
App::receive_messages (cognitive 34) crates/viewer/dl_viewer/src/app/logic.rs:149— App::receive_messages has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::receive_log_msg (cognitive 34) crates/viewer/dl_viewer/src/app/logic.rs:273— App::receive_log_msg has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
App::load_data_source (cognitive 31) crates/viewer/dl_viewer/src/app/add_data_source.rs:63— App::load_data_source has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::with_commands (cognitive 30) crates/viewer/dl_viewer/src/app/mod.rs:206— App::with_commands has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
App::receive_fetched_chunks (cognitive 28) crates/viewer/dl_viewer/src/app/logic.rs:799— App::receive_fetched_chunks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::validate_loaded_events (cognitive 25) crates/viewer/dl_viewer/src/app/logic.rs:917— App::validate_loaded_events has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (8 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.
App::purge_memory_if_needed (cognitive 19) crates/viewer/dl_viewer/src/app/logic.rs:944— App::purge_memory_if_needed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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.
App::on_new_store (cognitive 18) crates/viewer/dl_viewer/src/app/logic.rs:461— App::on_new_store has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::receive_data_source_ui_command (cognitive 18) crates/viewer/dl_viewer/src/app/logic.rs:544— App::receive_data_source_ui_command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
App::move_time (cognitive 18) crates/viewer/dl_viewer/src/app/mod.rs:634— App::move_time has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::prefetch_chunks (cognitive 17) crates/viewer/dl_viewer/src/app/logic.rs:1042— App::prefetch_chunks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), 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.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×15
Edited copy of a member (8 corresponding lines) crates/store/dl_datafusion/src/pushdown_expressions.rs:21— crates/store/dl_datafusion/src/pushdown_expressions.rs:21-28 | crates/store/dl_datafusion/src/pushdown_expressions.rs:30-37 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) dalaran_py/src/python_bridge.rs:2603— dalaran_py/src/python_bridge.rs:2603-2612 | dalaran_py/src/python_bridge.rs:2618-2625 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/viewer/dl_viewer/src/web.rs:417— crates/viewer/dl_viewer/src/web.rs:417-424 | crates/viewer/dl_viewer/src/web.rs:460-472 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/store/dl_lenses_core/src/selector/eval.rs:71— crates/store/dl_lenses_core/src/selector/eval.rs:71-78 | crates/store/dl_lenses_core/src/selector/eval.rs:137-146 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/store/dl_log_types/src/index/time_cell.rs:136— crates/store/dl_log_types/src/index/time_cell.rs:136-143 | crates/store/dl_log_types/src/index/time_cell.rs:152-159 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/store/dl_datafusion/src/pipeline_budget.rs:1007— crates/store/dl_datafusion/src/pipeline_budget.rs:1007-1018 | crates/store/dl_datafusion/src/pipeline_budget.rs:1054-1061 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs:136— crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs:136-144 | crates/viewer/dl_view_map/src/visualizers/geo_points.rs:148-155 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:947— crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:947-954 | crates/viewer/dl_dataframe_ui/src/display_record_batch.rs:208-215 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/store/dl_query/src/latest_at.rs:314— crates/store/dl_query/src/latest_at.rs:314-324 | crates/store/dl_query/src/range.rs:128-135 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/utils/dl_video/src/h264.rs:182— crates/utils/dl_video/src/h264.rs:182-195 | crates/utils/dl_video/src/h265.rs:197-204 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) crates/store/dl_mcap/src/recover.rs:380— crates/store/dl_mcap/src/recover.rs:380-387 | dalaran_py/src/chunk_stream/mcap_reader.rs:385-392 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) examples/python/minimal/minimal.py:15— examples/python/minimal/minimal.py:15-22 | examples/python/minimal_options/minimal_options.py:14-27 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) scripts/generate_view_coordinate_defs.py:120— scripts/generate_view_coordinate_defs.py:120-127 | scripts/generate_view_coordinate_defs.py:141-148 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) scripts/ci/check_speculative_links.py:33— scripts/ci/check_speculative_links.py:33-40 | scripts/ci/mdlint.py:430-437 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) examples/python/ros_node/main.py:134— examples/python/ros_node/main.py:134-141 | examples/python/ros_node/main.py:144-151 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (15 lines × 2) crates/store/dl_chunk_store/src/query.rs:124— crates/store/dl_chunk_store/src/query.rs:124-138 | crates/store/dl_chunk_store/src/query.rs:144-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (15 lines × 2) crates/store/dl_log_channel/src/receiver_set.rs:152— crates/store/dl_log_channel/src/receiver_set.rs:152-166 | crates/store/dl_log_channel/src/receiver_set.rs:188-202 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_log_channel/src/receiver_set.rs:152` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/store/dl_log_encoding/src/transport_to_app.rs:256— crates/store/dl_log_encoding/src/transport_to_app.rs:256-270 | crates/store/dl_log_encoding/src/transport_to_app.rs:286-300 — both copies are in the same file, so extract the 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 `crates/store/dl_log_encoding/src/transport_to_app.rs:256` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/store/dl_server/src/dalaran_cloud/mod.rs:1247— crates/store/dl_server/src/dalaran_cloud/mod.rs:1247-1261 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1308-1322 — both copies are in the same file, so extract the 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 `crates/store/dl_server/src/dalaran_cloud/mod.rs:1247` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind `request` to `tonic::Request<dl_protos::cloud::v1alpha1::ScanSegmentTableRequest>` in one and `Request<ScanDatasetManifestRequest>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (15 lines × 2) crates/utils/dl_perf_telemetry/src/prometheus.rs:220— crates/utils/dl_perf_telemetry/src/prometheus.rs:220-234 | crates/utils/dl_perf_telemetry/src/prometheus.rs:395-409 — both copies are in the same file, so extract the 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 `crates/utils/dl_perf_telemetry/src/prometheus.rs:220` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/viewer/dl_component_ui/src/time_range.rs:124— crates/viewer/dl_component_ui/src/time_range.rs:124-138 | crates/viewer/dl_component_ui/src/time_range.rs:168-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_component_ui/src/time_range.rs:124` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:801— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:801-815 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:829-844 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:801` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (15 lines × 2) crates/viewer/dl_selection_panel/src/visualizer_ui.rs:253— crates/viewer/dl_selection_panel/src/visualizer_ui.rs:253-267 | crates/viewer/dl_selection_panel/src/visualizer_ui.rs:500-514 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_selection_panel/src/visualizer_ui.rs:253` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/viewer/dl_ui/src/command/recording_command.rs:436— crates/viewer/dl_ui/src/command/recording_command.rs:436-450 | crates/viewer/dl_ui/src/command/ui_command.rs:486-500 — before extracting anything, compare `crates/viewer/dl_ui/src/command/recording_command.rs` and `crates/viewer/dl_ui/src/command/ui_command.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (15 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:242— crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:242-256 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:246-260 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:242` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (15 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/video/encoded_depth_image.rs:72— crates/viewer/dl_view_spatial/src/visualizers/video/encoded_depth_image.rs:72-86 | crates/viewer/dl_view_spatial/src/visualizers/video/encoded_image.rs:53-67 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/video/encoded_depth_image.rs:72` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) docs/snippets/all/howto/any_batch_value_column_updates.rs:12— docs/snippets/all/howto/any_batch_value_column_updates.rs:12-26 | docs/snippets/all/howto/any_values_column_updates.rs:14-28 — 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 `docs/snippets/all/howto/any_batch_value_column_updates.rs:12` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/viewer/dl_view_bar_chart/src/view_class.rs:110— crates/viewer/dl_view_bar_chart/src/view_class.rs:110-124 | crates/viewer/dl_view_tensor/src/view_class.rs:108-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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_bar_chart/src/view_class.rs:110` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:585— crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:585-599 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:617-631 — both copies are in the same file, so extract the 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 `crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:585` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) crates/store/dl_chunk/src/chunk.rs:1288— crates/store/dl_chunk/src/chunk.rs:1288-1302 | crates/store/dl_chunk/src/chunk.rs:1317-1331 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk/src/chunk.rs:1288` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×14
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×14
Edited copy of a member (17 corresponding lines) crates/top/dalaran/src/commands/mcap/mod.rs:129— crates/top/dalaran/src/commands/mcap/mod.rs:129-145 | dalaran_py/src/chunk_stream/mcap_reader.rs:546-569 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/store/dl_lenses/src/semantic/helpers.rs:13— crates/store/dl_lenses/src/semantic/helpers.rs:13-34 | crates/store/dl_lenses/src/semantic/helpers.rs:60-76 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:44— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:44-61 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:43-59 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_map_elem_ext.py:34— dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_map_elem_ext.py:34-50 | dalaran_py/dalaran_sdk/dalaran/datatypes/keypoint_pair_ext.py:31-47 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/store/dl_mcap/src/decoders/raw.rs:36— crates/store/dl_mcap/src/decoders/raw.rs:36-52 | crates/store/dl_mcap/src/parsers/ros2msg/scalar_parser.rs:117-139 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/store/dl_chunk_store/src/events.rs:51— crates/store/dl_chunk_store/src/events.rs:51-67 | crates/store/dl_chunk_store/src/events.rs:398-417 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/viewer/dl_viewer_context/src/store_hub.rs:667— crates/viewer/dl_viewer_context/src/store_hub.rs:667-683 | crates/viewer/dl_viewer_context/src/store_hub.rs:711-730 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/top/dalaran_c/src/lib.rs:1194— crates/top/dalaran_c/src/lib.rs:1194-1210 | crates/top/dalaran_c/src/lib.rs:1235-1257 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/viewer/dl_time_panel/src/time_control_ui.rs:108— crates/viewer/dl_time_panel/src/time_control_ui.rs:108-126 | crates/viewer/dl_time_panel/src/time_control_ui.rs:291-307 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/store/dl_redap_client/src/connection_client.rs:646— crates/store/dl_redap_client/src/connection_client.rs:646-662 | crates/store/dl_redap_client/src/connection_client.rs:748-769 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/store/dl_types_core/src/chunk_id.rs:74— crates/store/dl_types_core/src/chunk_id.rs:74-90 | crates/store/dl_types_core/src/row_id.rs:82-98 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:405— crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:405-421 | crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:427-443 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/viewer/dl_data_ui/src/instance_path_ui.rs:464— crates/viewer/dl_data_ui/src/instance_path_ui.rs:464-481 | crates/viewer/dl_time_panel/src/time_panel.rs:1657-1673 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) crates/store/dl_chunk/src/chunk.rs:307— crates/store/dl_chunk/src/chunk.rs:307-323 | crates/store/dl_chunk/src/chunk.rs:452-469 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×14
Edited copy of a member (12 corresponding lines) crates/viewer/dl_time_panel/src/time_selection_ui.rs:454— crates/viewer/dl_time_panel/src/time_selection_ui.rs:454-465 | crates/viewer/dl_time_panel/src/time_selection_ui.rs:472-483 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:236— crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:236-247 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:231-244 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/store/dl_redap_client/src/grpc.rs:319— crates/store/dl_redap_client/src/grpc.rs:319-330 | crates/store/dl_redap_client/src/grpc.rs:405-419 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) dalaran_py/src/lenses.rs:65— dalaran_py/src/lenses.rs:65-76 | dalaran_py/src/lenses.rs:84-99 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/viewer/dl_view_graph/src/view.rs:45— crates/viewer/dl_view_graph/src/view.rs:45-56 | crates/viewer/dl_view_spatial/src/ui_2d.rs:181-192 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/store/dl_redap_client/src/connection_client.rs:1500— crates/store/dl_redap_client/src/connection_client.rs:1500-1516 | crates/store/dl_redap_client/src/connection_client.rs:1529-1540 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/store/dl_chunk_store/src/subscribers.rs:330— crates/store/dl_chunk_store/src/subscribers.rs:330-341 | crates/viewer/dl_view_spatial/src/spatial_topology.rs:143-157 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/store/dl_chunk/src/unit_chunk.rs:366— crates/store/dl_chunk/src/unit_chunk.rs:366-377 | crates/store/dl_chunk/src/unit_chunk.rs:411-422 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/store/dl_chunk_store/src/query.rs:525— crates/store/dl_chunk_store/src/query.rs:525-536 | crates/store/dl_chunk_store/src/query.rs:657-669 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/top/dl_sdk/src/recording_stream.rs:2642— crates/top/dl_sdk/src/recording_stream.rs:2642-2653 | crates/top/dl_sdk/src/recording_stream.rs:2677-2692 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/store/dl_redap_client/src/connection_registry.rs:63— crates/store/dl_redap_client/src/connection_registry.rs:63-74 | crates/store/dl_redap_client/src/connection_registry.rs:81-92 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/viewer/dl_viewer/src/web.rs:221— crates/viewer/dl_viewer/src/web.rs:221-232 | crates/viewer/dl_viewer/src/web.rs:260-274 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:104— crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:104-116 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:162-173 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) crates/viewer/dl_renderer/src/draw_phases/screenshot.rs:106— crates/viewer/dl_renderer/src/draw_phases/screenshot.rs:106-117 | crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:266-277 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (14 lines × 2) crates/store/dl_lenses_core/src/selector/parser.rs:505— crates/store/dl_lenses_core/src/selector/parser.rs:505-518 | crates/store/dl_lenses_core/src/selector/parser.rs:610-623 — both copies are in the same file, so extract the 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 `crates/store/dl_lenses_core/src/selector/parser.rs:505` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs:33— crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs:33-46 | crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_multi_array.rs:33-46 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (14 lines × 2) crates/utils/dl_perf_telemetry/src/prometheus.rs:277— crates/utils/dl_perf_telemetry/src/prometheus.rs:277-290 | crates/utils/dl_perf_telemetry/src/prometheus.rs:452-465 — both copies are in the same file, so extract the 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 `crates/utils/dl_perf_telemetry/src/prometheus.rs:277` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) crates/viewer/dl_view_map/src/map_view.rs:636— crates/viewer/dl_view_map/src/map_view.rs:636-649 | crates/viewer/dl_view_spatial/src/picking.rs:214-227 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_map/src/map_view.rs:636` 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 (14 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:76— crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:76-89 | crates/viewer/dl_view_spatial/src/visualizers/meshes.rs:78-91 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:76` 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 (14 lines × 2) crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:265— crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:265-278 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:310-323 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:280` calls `blueprint_timepoint_for_writes` and `crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:325` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (14 lines × 2) crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:84— crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:84-97 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:80-93 — before extracting anything, compare `crates/viewer/dl_viewer_context/src/tensor/image_stats.rs` and `crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:84` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) dalaran_py/src/catalog/dataset_entry.rs:246— dalaran_py/src/catalog/dataset_entry.rs:246-259 | dalaran_py/src/catalog/dataset_entry.rs:270-283 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dalaran_py/src/catalog/dataset_entry.rs:246` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) crates/store/dl_server/src/dalaran_cloud/mod.rs:163— crates/store/dl_server/src/dalaran_cloud/mod.rs:163-176 | crates/store/dl_server/src/store/in_memory_store.rs:273-289 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_server/src/dalaran_cloud/mod.rs:163` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:81— crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:81-94 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:105-118 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:81` 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 (14 lines × 2) crates/store/dl_importer/src/importer_lerobot.rs:65— crates/store/dl_importer/src/importer_lerobot.rs:65-78 | crates/store/dl_importer/src/importer_lerobot.rs:103-116 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_importer/src/importer_lerobot.rs:65` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:158— crates/store/dl_redap_tests/src/utils/dalaran.rs:158-171 | crates/store/dl_redap_tests/src/utils/dalaran.rs:257-270 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:158` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) crates/viewer/dl_test_context/src/lib.rs:1011— crates/viewer/dl_test_context/src/lib.rs:1011-1024 | crates/viewer/dl_test_context/src/lib.rs:1033-1046 — both copies are in the same file, so extract the 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 `crates/viewer/dl_test_context/src/lib.rs:1011` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) examples/python/lidar/lidar/__main__.py:78— examples/python/lidar/lidar/__main__.py:78-91 | examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:290-303 — 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.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/cpp/mod.rs:430— `new` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/arrow.rs:186— `quoted_arrow_primitive_type` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:459— `quote_arrow_deserializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:899— `quote_arrow_field_deserializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:1112— `quote_arrow_deserializer_buffer_slice` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:1195— `quote_arrow_field_deserializer_buffer_slice` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/deserializer.rs:1224— `quote_buffer_slice_element_type` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/serializer.rs:448— `quote_arrow_serializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/codegen/rust/serializer.rs:970— `quote_arrow_field_serializer` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/build/dl_types_builder/src/objects/from_fbs.rs:560— `type_from_raw_type` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/store/dl_lenses_core/src/selector/eval.rs:450— `eval` does real work, but one of its branches is `Err` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/store/dl_lenses_core/src/selector/eval.rs:555— `eval` does real work, but one of its branches is `Err` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/store/dl_server/src/dalaran_cloud/mod.rs:1446— `query_dataset` does real work, but one of its branches is `Err` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
Unfinished branch — a todo!() / unimplemented!() arm in a real function crates/top/dalaran/src/commands/dlr/print.rs:102— `run` does real work, but one of its branches is `panic!` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×13
Edited copy of a member (13 corresponding lines) dalaran_py/src/catalog/dataset_entry.rs:104— dalaran_py/src/catalog/dataset_entry.rs:104-116 | dalaran_py/src/catalog/dataset_entry.rs:119-131 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/store/dl_chunk/src/chunk.rs:1673— crates/store/dl_chunk/src/chunk.rs:1673-1685 | crates/store/dl_chunk/src/chunk.rs:1688-1700 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/store/dl_importer/src/importer_urdf/joint_transform.rs:24— crates/store/dl_importer/src/importer_urdf/joint_transform.rs:24-36 | crates/store/dl_importer/src/importer_urdf/urdf_tree.rs:222-234 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/store/dl_dataframe/src/query.rs:1240— crates/store/dl_dataframe/src/query.rs:1240-1252 | crates/store/dl_dataframe/src/query.rs:1720-1734 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/viewer/dl_context_menu/src/collapse_expand.rs:59— crates/viewer/dl_context_menu/src/collapse_expand.rs:59-73 | crates/viewer/dl_context_menu/src/collapse_expand.rs:81-93 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/utils/dl_crash_handler/src/lib.rs:251— crates/utils/dl_crash_handler/src/lib.rs:251-263 | crates/utils/dl_memory/src/backtrace_native.rs:39-58 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/store/dl_log_encoding/src/dlr/frames.rs:163— crates/store/dl_log_encoding/src/dlr/frames.rs:163-187 | crates/store/dl_log_encoding/src/dlr/frames.rs:510-522 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/store/dl_types_core/src/archetype.rs:160— crates/store/dl_types_core/src/archetype.rs:160-172 | crates/store/dl_types_core/src/loggable.rs:133-147 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:64— crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:64-77 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:79-91 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/store/dl_hdf5/src/streaming.rs:222— crates/store/dl_hdf5/src/streaming.rs:222-236 | crates/store/dl_hdf5/src/streaming.rs:243-255 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) scripts/ci/compare.py:48— scripts/ci/compare.py:48-60 | scripts/ci/count_bytes.py:53-65 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) scripts/ci/check_doc_order.py:17— scripts/ci/check_doc_order.py:17-29 | scripts/ci/check_skills.py:22-34 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:23— crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:23-35 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:27-39 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×13
Edited copy of a member (10 corresponding lines) dalaran_py/src/python_bridge.rs:2139— dalaran_py/src/python_bridge.rs:2139-2148 | dalaran_py/src/python_bridge.rs:2152-2161 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/store/dl_chunk/src/iter.rs:325— crates/store/dl_chunk/src/iter.rs:325-334 | crates/store/dl_chunk/src/iter.rs:416-429 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/top/dalaran_c/src/lib.rs:310— crates/top/dalaran_c/src/lib.rs:310-319 | crates/top/dalaran_c/src/lib.rs:1038-1049 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) dalaran_py/src/catalog/catalog_client.rs:242— dalaran_py/src/catalog/catalog_client.rs:242-251 | dalaran_py/src/catalog/catalog_client.rs:260-269 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/store/dl_log_types/src/index/time_int.rs:255— crates/store/dl_log_types/src/index/time_int.rs:255-264 | crates/store/dl_log_types/src/index/time_int.rs:271-280 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:82— crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:82-91 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:237-246 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/utils/dl_perf_telemetry/src/lib.rs:100— crates/utils/dl_perf_telemetry/src/lib.rs:100-109 | crates/utils/dl_perf_telemetry/src/trace_id_format.rs:31-43 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/viewer/dl_ui/src/list_item/custom_content.rs:131— crates/viewer/dl_ui/src/list_item/custom_content.rs:131-140 | crates/viewer/dl_ui/src/list_item/item_buttons.rs:214-224 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) dalaran_py/src/chunk_stream/hdf5_reader.rs:54— dalaran_py/src/chunk_stream/hdf5_reader.rs:54-63 | dalaran_py/src/chunk_stream/parquet_reader.rs:28-37 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/top/dl_sdk/src/grpc_server.rs:85— crates/top/dl_sdk/src/grpc_server.rs:85-94 | crates/top/dl_sdk/src/web_viewer.rs:107-116 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) docs/snippets/all/concepts/how-does-dalaran-work/log-to-dlr.rs:1— docs/snippets/all/concepts/how-does-dalaran-work/log-to-dlr.rs:1-10 | docs/snippets/all/concepts/how-does-dalaran-work/log-to-grpc.rs:1-11 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) scripts/ci/compare.py:64— scripts/ci/compare.py:64-73 | scripts/ci/count_bytes.py:69-78 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) crates/store/dl_redap_tests/src/utils/client.rs:100— crates/store/dl_redap_tests/src/utils/client.rs:100-113 | crates/store/dl_redap_tests/src/utils/client.rs:118-127 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×13
Edited copy of a member (11 corresponding lines) crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:23— crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:23-35 | crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:54-64 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) dalaran_py/src/catalog/datafusion_catalog.rs:44— dalaran_py/src/catalog/datafusion_catalog.rs:44-54 | dalaran_py/src/catalog/table_entry.rs:135-148 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) docs/snippets/all/archetypes/line_strips2d_segments_simple.rs:3— docs/snippets/all/archetypes/line_strips2d_segments_simple.rs:3-14 | docs/snippets/all/archetypes/line_strips2d_simple.rs:3-13 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/viewer/dl_ui/src/ui_ext.rs:286— crates/viewer/dl_ui/src/ui_ext.rs:286-298 | crates/viewer/dl_ui/src/ui_ext.rs:306-316 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/store/dl_sorbet/src/sorbet_batch.rs:120— crates/store/dl_sorbet/src/sorbet_batch.rs:120-130 | crates/store/dl_sorbet/src/sorbet_batch.rs:135-145 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/utils/dl_arrow_util/src/arrays.rs:517— crates/utils/dl_arrow_util/src/arrays.rs:517-527 | crates/utils/dl_arrow_util/src/arrays.rs:537-547 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:193— crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:193-204 | crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:199-209 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/viewer/dl_ui/src/list_item/item_buttons.rs:187— crates/viewer/dl_ui/src/list_item/item_buttons.rs:187-197 | crates/viewer/dl_ui/src/list_item/custom_content.rs:107-117 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/viewer/dl_viewer_context/src/viewer_context.rs:239— crates/viewer/dl_viewer_context/src/viewer_context.rs:239-249 | crates/viewer/dl_test_context/src/lib.rs:473-483 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/store/dl_mcap/src/decoders/protobuf.rs:594— crates/store/dl_mcap/src/decoders/protobuf.rs:594-604 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:616-631 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/utils/dl_quota_channel/src/async_broadcast_channel.rs:376— crates/utils/dl_quota_channel/src/async_broadcast_channel.rs:376-386 | crates/utils/dl_quota_channel/src/sync/mod.rs:321-331 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs:38— crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs:38-48 | crates/store/dl_log_encoding/src/dlr/decoder/stream.rs:25-35 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) scripts/zombie_todos.py:299— scripts/zombie_todos.py:299-309 | scripts/zombie_todos.py:313-323 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
dl_view_spatial::visualizers::video::execute_video_stream_like (cognitive 41) crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs:164— dl_view_spatial::visualizers::video::execute_video_stream_like has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
dl_view_spatial::picking_ui_pixel::format_pixel_value (cognitive 35) crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:400— dl_view_spatial::picking_ui_pixel::format_pixel_value has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 8 (16 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_view_spatial::picking_ui::picking (cognitive 33) crates/viewer/dl_view_spatial/src/picking_ui.rs:30— dl_view_spatial::picking_ui::picking has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_spatial::shared_fallbacks::register_fallbacks (cognitive 29) crates/viewer/dl_view_spatial/src/shared_fallbacks.rs:27— dl_view_spatial::shared_fallbacks::register_fallbacks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
dl_view_spatial::visualizers::utilities::transform_retrieval::is_valid_space_for_content (cognitive 29) crates/viewer/dl_view_spatial/src/visualizers/utilities/transform_retrieval.rs:238— dl_view_spatial::visualizers::utilities::transform_retrieval::is_valid_space_for_content has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_spatial::proc_mesh::capsule_wireframe_lines (cognitive 25) crates/viewer/dl_view_spatial/src/proc_mesh.rs:382— dl_view_spatial::proc_mesh::capsule_wireframe_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_spatial::visualizers::video::show_video_frame (cognitive 25) crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs:539— dl_view_spatial::visualizers::video::show_video_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
dl_view_spatial::picking::picking_gpu (cognitive 22) crates/viewer/dl_view_spatial/src/picking.rs:189— dl_view_spatial::picking::picking_gpu has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_spatial::ui::create_labels (cognitive 21) crates/viewer/dl_view_spatial/src/ui.rs:199— dl_view_spatial::ui::create_labels has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 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.
dl_view_spatial::visualizers::utilities::transform_retrieval::format_transform_info_result (cognitive 20) crates/viewer/dl_view_spatial/src/visualizers/utilities/transform_retrieval.rs:154— dl_view_spatial::visualizers::utilities::transform_retrieval::format_transform_info_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 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.
dl_view_spatial::ui::resolve_label_positions (cognitive 19) crates/viewer/dl_view_spatial/src/ui.rs:360— dl_view_spatial::ui::resolve_label_positions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_spatial::proc_mesh::generate_wireframe (cognitive 16) crates/viewer/dl_view_spatial/src/proc_mesh.rs:215— dl_view_spatial::proc_mesh::generate_wireframe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 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.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×12
Edited copy of a member (14 corresponding lines) docs/snippets/all/archetypes/pinhole_simple.rs:6— docs/snippets/all/archetypes/pinhole_simple.rs:6-27 | docs/snippets/all/archetypes/tensor_simple.rs:6-19 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/store/dl_chunk_store/src/store.rs:1160— crates/store/dl_chunk_store/src/store.rs:1160-1173 | crates/store/dl_chunk_store/src/store.rs:1184-1199 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:764— crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:764-782 | crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:786-799 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) docs/snippets/all/archetypes/asset3d_simple.rs:5— docs/snippets/all/archetypes/asset3d_simple.rs:5-18 | docs/snippets/all/archetypes/gaussian_splats3d_ply.rs:5-20 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/store/dl_lenses_core/src/selector/lexer.rs:121— crates/store/dl_lenses_core/src/selector/lexer.rs:121-134 | crates/store/dl_lenses_core/src/selector/lexer.rs:208-221 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/store/dl_chunk_store/src/query.rs:442— crates/store/dl_chunk_store/src/query.rs:442-455 | crates/store/dl_chunk_store/src/query.rs:468-484 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/store/dl_log_types/src/index/time_cell.rs:165— crates/store/dl_log_types/src/index/time_cell.rs:165-178 | crates/store/dl_log_types/src/index/time_cell.rs:180-194 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:81— crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:81-94 | crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:100-113 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/viewer/dl_viewer/src/app_blueprint.rs:175— crates/viewer/dl_viewer/src/app_blueprint.rs:175-188 | crates/viewer/dl_viewer/src/app_blueprint.rs:190-204 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/utils/dl_perf_telemetry/src/grpc.rs:324— crates/utils/dl_perf_telemetry/src/grpc.rs:324-342 | crates/utils/dl_perf_telemetry/src/grpc.rs:353-366 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs:263— crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs:263-276 | crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs:284-297 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) crates/viewer/dl_view_state_timeline/src/view_class.rs:182— crates/viewer/dl_view_state_timeline/src/view_class.rs:182-195 | crates/viewer/dl_view_text_log/src/view_class.rs:155-169 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D30 · Dependency Vulnerabilities· Medium CVE · ×11
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×11
Edited copy of a member (18 corresponding lines) crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:68— crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:68-85 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:88-113 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/utils/dl_crash_handler/src/lib.rs:296— crates/utils/dl_crash_handler/src/lib.rs:296-317 | crates/utils/dl_memory/src/backtrace_native.rs:91-108 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:3— docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:3-21 | docs/snippets/all/archetypes/line_strips3d_simple.rs:3-20 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/store/dl_chunk/src/unit_chunk.rs:69— crates/store/dl_chunk/src/unit_chunk.rs:69-86 | crates/store/dl_chunk/src/unit_chunk.rs:123-140 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/store/dl_server/src/dalaran_cloud/mod.rs:520— crates/store/dl_server/src/dalaran_cloud/mod.rs:520-538 | crates/store/dl_server/src/dalaran_cloud/mod.rs:544-561 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/store/dl_grpc_server/src/lib.rs:1192— crates/store/dl_grpc_server/src/lib.rs:1192-1209 | crates/store/dl_grpc_server/src/lib.rs:1211-1228 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/store/dl_entity_db/src/entity_db.rs:1194— crates/store/dl_entity_db/src/entity_db.rs:1194-1211 | crates/store/dl_entity_db/src/entity_db.rs:1221-1238 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/viewer/dl_view_state_timeline/src/view_class.rs:269— crates/viewer/dl_view_state_timeline/src/view_class.rs:269-286 | crates/viewer/dl_view_time_series/src/view_class.rs:421-438 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/store/dl_log_encoding/src/dlr/encoder.rs:348— crates/store/dl_log_encoding/src/dlr/encoder.rs:348-365 | crates/store/dl_log_encoding/src/dlr/encoder.rs:375-393 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) crates/store/dl_chunk/src/chunk.rs:1721— crates/store/dl_chunk/src/chunk.rs:1721-1740 | crates/store/dl_protos/src/lib.rs:396-413 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) scripts/zombie_todos.py:327— scripts/zombie_todos.py:327-344 | scripts/zombie_todos.py:348-365 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×10
Animation without a prefers-reduced-motion guard dalaran_js/web-viewer/index.ts:517— <div> moves — its inline style sets `transition: width 0.2s` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard dalaran_py/dalaran_sdk/dalaran/_loading_widget.css:23— `.dalaran-notebook-loading__spinner` moves (`animation: dalaran-notebook-spin 0.8s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:464— `.sm-dox ul` moves (`animation: ease-out 150ms slideInMenu`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:664— `#MSearchResultsWindow` moves (`animation: ease-out 280ms slideInSearchResults`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:750— `#MSearchResultsWindow` moves (`animation: ease-out 280ms slideInSearchResultsMobile`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1177— `div.contents .toc.interactive > h3::before` moves (`transition: transform 0.25s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1187— `div.contents .toc.interactive.open` moves (`transition: max-height 0.2s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1869— `table.memberdecls img[src="closed.png"]` moves (`transition: transform 0.25s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:1948— `table.memberdecls tr[style="display: table-row "]` moves (`animation: fade .5s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:2347— `doxygen-awesome-dark-mode-toggle > svg` moves (`transition: transform .1s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
ChunkStore::insert_chunk_impl (cognitive 106) crates/store/dl_chunk_store/src/writes.rs:280— ChunkStore::insert_chunk_impl has cognitive complexity 106 (threshold 15). Drivers by points: if/else 33 (73 pts), loops 11 (30 pts), boolean chains 3 (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ChunkStore::remove_chunk_from_virtual_indices (cognitive 51) crates/store/dl_chunk_store/src/gc.rs:498— ChunkStore::remove_chunk_from_virtual_indices has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (44 pts), loops 3 (7 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChunkStore::find_and_elect_compaction_candidate (cognitive 37) crates/store/dl_chunk_store/src/writes.rs:917— ChunkStore::find_and_elect_compaction_candidate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 5 (14 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChunkStore::drop_time_range (cognitive 33) crates/store/dl_chunk_store/src/drop_time_range.rs:47— ChunkStore::drop_time_range has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 3 (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.
ChunkStore::finalize_compaction (cognitive 21) crates/store/dl_chunk_store/src/compact.rs:91— ChunkStore::finalize_compaction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (9 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.
ChunkStore::gc_find_candidates (cognitive 20) crates/store/dl_chunk_store/src/gc.rs:381— ChunkStore::gc_find_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 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.
ChunkStore::drop_lineage_reference (cognitive 20) crates/store/dl_chunk_store/src/writes.rs:846— ChunkStore::drop_lineage_reference has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 1 (2 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.
ChunkStore::format_lineage (cognitive 17) crates/store/dl_chunk_store/src/lineage.rs:281— ChunkStore::format_lineage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2, loops 1 (nesting depth added 4). None of this is in the body itself: all 17 points belong to 2 function items inside it that branch (compute_staticness, recurse). 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.
ChunkStore::next_time_on_timeline (cognitive 16) crates/store/dl_chunk_store/src/query.rs:554— ChunkStore::next_time_on_timeline has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ChunkStore::prev_time_on_timeline) 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.
ChunkStore::prev_time_on_timeline (cognitive 16) crates/store/dl_chunk_store/src/query.rs:607— ChunkStore::prev_time_on_timeline has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ChunkStore::next_time_on_timeline) 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.
D4 · Code Duplication· Edited copy of a member (26 corresponding lines) · ×10
Edited copy of a member (26 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/mod.rs:73— crates/viewer/dl_view_spatial/src/visualizers/mod.rs:73-98 | crates/viewer/dl_view_spatial/src/visualizers/mod.rs:102-130 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) crates/store/dl_importer/src/importer_parquet.rs:29— crates/store/dl_importer/src/importer_parquet.rs:29-54 | crates/store/dl_importer/src/importer_parquet.rs:62-88 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) crates/store/dl_chunk_store/src/properties.rs:264— crates/store/dl_chunk_store/src/properties.rs:264-289 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:837-868 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) dalaran_py/src/python_bridge.rs:1402— dalaran_py/src/python_bridge.rs:1402-1433 | dalaran_py/src/python_bridge.rs:1484-1509 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) crates/viewer/dl_dataframe_ui/src/dl_table_utils.rs:45— crates/viewer/dl_dataframe_ui/src/dl_table_utils.rs:45-73 | crates/viewer/dl_dataframe_ui/src/dl_table_utils.rs:80-105 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) crates/viewer/dl_viewer/src/web.rs:431— crates/viewer/dl_viewer/src/web.rs:431-456 | crates/viewer/dl_viewer/src/web.rs:476-504 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) crates/store/dl_mcap/src/decoders/protobuf.rs:153— crates/store/dl_mcap/src/decoders/protobuf.rs:153-179 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:177-202 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) crates/store/dl_redap_client/src/connection_client.rs:617— crates/store/dl_redap_client/src/connection_client.rs:617-642 | crates/store/dl_redap_client/src/connection_client.rs:719-744 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) crates/store/dl_datafusion/src/dataframe_query_provider.rs:878— crates/store/dl_datafusion/src/dataframe_query_provider.rs:878-903 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:537-562 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) dalaran_py/src/chunk_stream/stream.rs:188— dalaran_py/src/chunk_stream/stream.rs:188-213 | dalaran_py/src/chunk_stream/stream.rs:221-251 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×10
Edited copy of a member (21 corresponding lines) crates/top/dalaran/src/demo_util.rs:105— crates/top/dalaran/src/demo_util.rs:105-128 | crates/viewer/dl_renderer/src/colormap.rs:239-259 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) crates/utils/dl_crash_handler/src/lib.rs:268— crates/utils/dl_crash_handler/src/lib.rs:268-288 | crates/utils/dl_memory/src/backtrace_native.rs:63-83 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) crates/utils/dl_auth/src/oauth/api.rs:64— crates/utils/dl_auth/src/oauth/api.rs:64-84 | crates/utils/dl_auth/src/oauth/api.rs:89-109 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) crates/top/dalaran/src/commands/mcap/check.rs:41— crates/top/dalaran/src/commands/mcap/check.rs:41-71 | crates/top/dalaran/src/commands/mcap/info.rs:21-41 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:435— crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:435-455 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:461-488 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) dalaran_py/src/trace_context.rs:100— dalaran_py/src/trace_context.rs:100-120 | dalaran_py/src/tracing_session.rs:77-97 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) crates/store/dl_query/src/latest_at.rs:648— crates/store/dl_query/src/latest_at.rs:648-669 | crates/store/dl_query/src/range.rs:228-248 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) dalaran_py/src/catalog/registration_handle.rs:235— dalaran_py/src/catalog/registration_handle.rs:235-255 | dalaran_py/src/catalog/unregistration_handle.rs:135-155 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) crates/store/dl_chunk_store/src/stats.rs:251— crates/store/dl_chunk_store/src/stats.rs:251-271 | crates/store/dl_chunk_store/src/stats.rs:306-326 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) dalaran_py/src/catalog/dataset_view.rs:158— dalaran_py/src/catalog/dataset_view.rs:158-178 | dalaran_py/src/catalog/dataset_view.rs:186-208 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×10
Edited copy of a member (22 corresponding lines) dalaran_py/src/catalog/dataset_entry.rs:238— dalaran_py/src/catalog/dataset_entry.rs:238-259 | dalaran_py/src/catalog/dataset_entry.rs:262-283 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) crates/store/dl_log_types/src/example_components.rs:170— crates/store/dl_log_types/src/example_components.rs:170-191 | crates/store/dl_log_types/src/example_components.rs:275-296 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) dalaran_py/dalaran_sdk/dalaran/datatypes/mat3x3_ext.py:19— dalaran_py/dalaran_sdk/dalaran/datatypes/mat3x3_ext.py:19-40 | dalaran_py/dalaran_sdk/dalaran/datatypes/mat4x4_ext.py:18-39 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) crates/viewer/dl_view_graph/src/ui/draw.rs:140— crates/viewer/dl_view_graph/src/ui/draw.rs:140-161 | crates/viewer/dl_view_graph/src/ui/draw.rs:164-196 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) crates/viewer/dl_context_menu/src/actions/show_hide.rs:11— crates/viewer/dl_context_menu/src/actions/show_hide.rs:11-32 | crates/viewer/dl_context_menu/src/actions/show_hide.rs:71-92 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:152— crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:152-183 | crates/viewer/dl_viewer_context/src/cache/tensor_stats_cache.rs:56-77 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) crates/store/dl_lenses/src/semantic/foxglove/camera_calibration.rs:13— crates/store/dl_lenses/src/semantic/foxglove/camera_calibration.rs:13-38 | crates/store/dl_lenses/src/semantic/ros2msg/camera_info.rs:10-31 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:468— crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:468-491 | crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:496-517 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) dalaran_py/src/python_bridge.rs:2285— dalaran_py/src/python_bridge.rs:2285-2306 | dalaran_py/src/python_bridge.rs:2331-2355 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) examples/python/structure_from_motion/structure_from_motion/read_write_model.py:226— examples/python/structure_from_motion/structure_from_motion/read_write_model.py:226-258 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:340-361 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×10
Edited copy of a member (5 corresponding lines) crates/store/dl_datafusion/src/dataframe_query_common.rs:1002— crates/store/dl_datafusion/src/dataframe_query_common.rs:1002-1006 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:259-263 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) dalaran_py/src/catalog/dataset_entry.rs:72— dalaran_py/src/catalog/dataset_entry.rs:72-76 | dalaran_py/src/catalog/table_entry.rs:52-56 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) crates/store/dl_log_types/src/example_components.rs:384— crates/store/dl_log_types/src/example_components.rs:384-390 | docs/snippets/all/tutorials/custom_data.rs:65-69 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) crates/store/dl_log_types/src/app_id.rs:176— crates/store/dl_log_types/src/app_id.rs:176-180 | crates/store/dl_types_core/src/layer_name.rs:176-180 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) crates/store/dl_query/src/bin/clamped_zip.rs:40— crates/store/dl_query/src/bin/clamped_zip.rs:40-44 | crates/store/dl_query/src/bin/range_zip.rs:42-46 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) crates/store/dl_query/src/bin/clamped_zip.rs:71— crates/store/dl_query/src/bin/clamped_zip.rs:71-75 | crates/store/dl_query/src/bin/range_zip.rs:73-77 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) crates/store/dl_query/src/bin/clamped_zip.rs:108— crates/store/dl_query/src/bin/clamped_zip.rs:108-112 | crates/store/dl_query/src/bin/range_zip.rs:80-84 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) crates/viewer/dl_dataframe_ui/src/filters/boolean.rs:294— crates/viewer/dl_dataframe_ui/src/filters/boolean.rs:294-298 | crates/viewer/dl_dataframe_ui/src/filters/string.rs:43-47 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) crates/top/dl_sdk/src/grpc_server.rs:78— crates/top/dl_sdk/src/grpc_server.rs:78-82 | crates/top/dl_sdk/src/web_viewer.rs:100-104 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) examples/python/objectron/objectron/download_dataset.py:32— examples/python/objectron/objectron/download_dataset.py:32-38 | examples/python/human_pose_tracking/human_pose_tracking.py:193-197 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (16 lines × 2) crates/store/dl_parquet/src/streaming.rs:77— crates/store/dl_parquet/src/streaming.rs:77-92 | crates/store/dl_parquet/src/streaming.rs:103-118 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_parquet/src/streaming.rs:77` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) crates/top/dl_sdk/src/grpc_server.rs:46— crates/top/dl_sdk/src/grpc_server.rs:46-61 | crates/top/dl_sdk/src/web_viewer.rs:53-68 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (16 lines × 2) crates/utils/dl_crash_handler/src/lib.rs:273— crates/utils/dl_crash_handler/src/lib.rs:273-288 | crates/utils/dl_memory/src/backtrace_native.rs:68-83 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_crash_handler/src/lib.rs:273` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) crates/viewer/dl_view_dataframe/src/view_query/ui.rs:96— crates/viewer/dl_view_dataframe/src/view_query/ui.rs:96-111 | crates/viewer/dl_view_dataframe/src/view_query/ui.rs:137-152 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view_dataframe/src/view_query/ui.rs:96` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/images.rs:154— crates/viewer/dl_view_spatial/src/visualizers/images.rs:154-169 | crates/viewer/dl_view_spatial/src/visualizers/segmentation_images.rs:119-134 — 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 `crates/viewer/dl_view_spatial/src/visualizers/images.rs:154` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/viewer/dl_view_spatial/src/visualizers/segmentation_images.rs:117` calls `default` and `crates/viewer/dl_view_spatial/src/visualizers/images.rs:152` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:110— crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:110-125 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:328-343 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/points2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/points3d.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:110` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:214— crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:214-229 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:415-430 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/points2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/points3d.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 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 (16 lines × 2) crates/viewer/dl_viewer/src/web.rs:203— crates/viewer/dl_viewer/src/web.rs:203-218 | crates/viewer/dl_viewer/src/web.rs:826-841 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/web.rs:203` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) crates/viewer/dl_viewport/src/viewport_ui.rs:1247— crates/viewer/dl_viewport/src/viewport_ui.rs:1247-1262 | crates/viewer/dl_viewport/src/viewport_ui.rs:1269-1284 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewport/src/viewport_ui.rs:1247` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/viewer/dl_viewport/src/viewport_ui.rs:1262` calls `Some` and `crates/viewer/dl_viewport/src/viewport_ui.rs:1284` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16 lines × 2) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:745— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:745-762 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:758-773 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:745` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Configuration option is read nowhere crates/build/dl_dev_tools/src/build_search_index/ingest/python.rs:220— `SphinxObjectInv.project` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/top/dalaran/src/clap.rs:46— `DalaranArgs.spawn` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/top/dalaran/src/commands/dlr/merge_optimize.rs:422— `CompactCommand._ignored` is offered as a command-line argument option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/utils/dl_auth/src/oauth/api.rs:329— `User.email_verified` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/utils/dl_auth/src/oauth/api.rs:330— `User.profile_picture_url` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/utils/dl_auth/src/oauth/api.rs:331— `User.first_name` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/utils/dl_auth/src/oauth/api.rs:332— `User.last_name` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/utils/dl_auth/src/oauth/api.rs:333— `User.last_sign_in_at` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/utils/dl_auth/src/oauth/api.rs:336— `User.external_id` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
Configuration option is read nowhere crates/utils/dl_auth/src/oauth/api.rs:357— `GetDeviceAuthUrlResponse.expires_in` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
dl_types_builder::codegen::python::code_for_struct (cyclomatic 40) crates/build/dl_types_builder/src/codegen/python/mod.rs:773— dl_types_builder::codegen::python::code_for_struct 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.
dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cyclomatic 39) crates/build/dl_types_builder/src/codegen/rust/serializer.rs:472— dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dl_types_builder::codegen::python::quote_arrow_serialization (cyclomatic 29) crates/build/dl_types_builder/src/codegen/python/mod.rs:2446— dl_types_builder::codegen::python::quote_arrow_serialization 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.
dl_types_builder::docs::doclink_translation::try_translate_doclink (cyclomatic 28) crates/build/dl_types_builder/src/docs.rs:287— dl_types_builder::docs::doclink_translation::try_translate_doclink 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.
dl_types_builder::objects::from_fbs::type_from_raw_type (cyclomatic 28) crates/build/dl_types_builder/src/objects/from_fbs.rs:465— dl_types_builder::objects::from_fbs::type_from_raw_type has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder (cyclomatic 26) crates/build/dl_types_builder/src/codegen/cpp/mod.rs:1870— dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder 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.
dl_types_builder::codegen::python::check_ext_consistency (cyclomatic 21) crates/build/dl_types_builder/src/codegen/python/mod.rs:324— dl_types_builder::codegen::python::check_ext_consistency 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.
dl_types_builder::codegen::python::quote_field_converter_from_field (cyclomatic 20) crates/build/dl_types_builder/src/codegen/python/mod.rs:1979— dl_types_builder::codegen::python::quote_field_converter_from_field 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. This is NOT this file's highest cyclomatic complexity: dl_types_builder::codegen::python::quote_arrow_datatype (cyclomatic 21) 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.
dl_types_builder::codegen::python::code_for_union (cyclomatic 16) crates/build/dl_types_builder/src/codegen/python/mod.rs:1248— dl_types_builder::codegen::python::code_for_union 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. This is NOT this file's highest cyclomatic complexity: dl_types_builder::codegen::python::quote_arrow_datatype (cyclomatic 21) 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.
dalaran::commands::dlr::route::process_messages (cognitive 43) crates/top/dalaran/src/commands/dlr/route.rs:103— dalaran::commands::dlr::route::process_messages has cognitive complexity 43 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 4 (12 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dalaran::commands::entrypoint::assert_receive_into_entity_db (cognitive 33) crates/top/dalaran/src/commands/entrypoint.rs:1544— dalaran::commands::entrypoint::assert_receive_into_entity_db has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (18 pts), if/else 7 (14 pts), loops 1 (nesting depth added 20). 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.
dalaran::commands::doctor::recording::check_recording (cognitive 21) crates/top/dalaran/src/commands/doctor/recording.rs:26— dalaran::commands::doctor::recording::check_recording has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (8 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dalaran::commands::dlr::merge_optimize::optimize_dir_mirror (cognitive 20) crates/top/dalaran/src/commands/dlr/merge_optimize.rs:302— dalaran::commands::dlr::merge_optimize::optimize_dir_mirror has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 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.
dalaran::commands::dlr::split::extract_chunks_for_single_split (cognitive 19) crates/top/dalaran/src/commands/dlr/split.rs:866— dalaran::commands::dlr::split::extract_chunks_for_single_split has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 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.
dalaran::commands::dlr::merge_optimize::merge_and_compact (cognitive 18) crates/top/dalaran/src/commands/dlr/merge_optimize.rs:437— dalaran::commands::dlr::merge_optimize::merge_and_compact has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dalaran::commands::dlr::print::print_msg (cognitive 18) crates/top/dalaran/src/commands/dlr/print.rs:212— dalaran::commands::dlr::print::print_msg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dalaran::commands::dlr::stats::compute_stats (cognitive 16) crates/top/dalaran/src/commands/dlr/stats.rs:505— dalaran::commands::dlr::stats::compute_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dalaran::commands::entrypoint::connect_to_existing_server (cognitive 16) crates/top/dalaran/src/commands/entrypoint.rs:1352— dalaran::commands::entrypoint::connect_to_existing_server has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (5 pts), match/switch 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components (cognitive 37) crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs:196— dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk (cognitive 31) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1974— dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 5 (6 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.
dl_viewer_context::cache::video_stream_cache::handle_deletion (cognitive 29) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:505— dl_viewer_context::cache::video_stream_cache::handle_deletion has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (26 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer_context::cache::video_stream_cache::update_sample_durations (cognitive 23) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1238— dl_viewer_context::cache::video_stream_cache::update_sample_durations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 3, 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.
dl_viewer_context::cache::video_stream_cache::find_affected_sample_range (cognitive 23) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1865— dl_viewer_context::cache::video_stream_cache::find_affected_sample_range has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer_context::cache::video_stream_cache::handle_compacted_chunk_addition (cognitive 22) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:671— dl_viewer_context::cache::video_stream_cache::handle_compacted_chunk_addition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
dl_viewer_context::gpu_bridge::image_to_gpu::color_image_to_gpu (cognitive 20) crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs:72— dl_viewer_context::gpu_bridge::image_to_gpu::color_image_to_gpu has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 2 (3 pts), boolean chains 1 (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.
dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image (cognitive 19) crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs:249— dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer_context::cache::video_stream_cache::load_known_chunk_ranges (cognitive 16) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1756— dl_viewer_context::cache::video_stream_cache::load_known_chunk_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_time_series::series_query::collect_colors (cognitive 36) crates/viewer/dl_view_time_series/src/series_query.rs:194— dl_view_time_series::series_query::collect_colors has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (18 pts), if/else 10 (17 pts), boolean chains 1 (nesting depth added 20). 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.
dl_view_time_series::fallbacks::register_fallbacks (cognitive 32) crates/viewer/dl_view_time_series/src/fallbacks.rs:13— dl_view_time_series::fallbacks::register_fallbacks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_time_series::series_query::collect_radius_ui (cognitive 25) crates/viewer/dl_view_time_series/src/series_query.rs:358— dl_view_time_series::series_query::collect_radius_ui has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_time_series::view_class::update_series_visibility_from_legend (cognitive 22) crates/viewer/dl_view_time_series/src/view_class.rs:1547— dl_view_time_series::view_class::update_series_visibility_from_legend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, 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.
dl_view_time_series::line_visualizer_system::build_nan_island_marker_draw_data (cognitive 21) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:263— dl_view_time_series::line_visualizer_system::build_nan_island_marker_draw_data has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_time_series::view_class::find_nearest_data_point_and_show_tooltip (cognitive 21) crates/viewer/dl_view_time_series/src/view_class.rs:1307— dl_view_time_series::view_class::find_nearest_data_point_and_show_tooltip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_time_series::visualizer_ui::visualizer_ui_element (cognitive 20) crates/viewer/dl_view_time_series/src/visualizer_ui.rs:25— dl_view_time_series::visualizer_ui::visualizer_ui_element has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
dl_view_time_series::series_query::collect_scalars (cognitive 17) crates/viewer/dl_view_time_series/src/series_query.rs:144— dl_view_time_series::series_query::collect_scalars has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_time_series::view_class::all_scalar_mappings (cognitive 17) crates/viewer/dl_view_time_series/src/view_class.rs:1182— dl_view_time_series::view_class::all_scalar_mappings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 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.
D4 · Code Duplication· Edited copy of a member (24 corresponding lines) · ×9
Edited copy of a member (24 corresponding lines) crates/utils/dl_format/src/lib.rs:592— crates/utils/dl_format/src/lib.rs:592-615 | crates/utils/dl_format/src/lib.rs:643-666 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) crates/utils/dl_ros_msg/src/deserialize/mod.rs:197— crates/utils/dl_ros_msg/src/deserialize/mod.rs:197-220 | crates/utils/dl_ros_msg/src/deserialize/mod.rs:226-256 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) crates/viewer/dl_view_graph/src/layout/provider.rs:121— crates/viewer/dl_view_graph/src/layout/provider.rs:121-144 | crates/viewer/dl_view_graph/src/layout/provider.rs:150-183 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) crates/viewer/dl_view_spatial/src/view_2d.rs:240— crates/viewer/dl_view_spatial/src/view_2d.rs:240-263 | crates/viewer/dl_view_spatial/src/view_3d.rs:496-526 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:114— dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:114-139 | dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:143-166 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) crates/store/dl_datafusion/src/dataframe_query_common.rs:836— crates/store/dl_datafusion/src/dataframe_query_common.rs:836-860 | crates/store/dl_datafusion/src/dataframe_query_common.rs:917-940 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) examples/python/structure_from_motion/structure_from_motion/read_write_model.py:191— examples/python/structure_from_motion/structure_from_motion/read_write_model.py:191-222 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:313-336 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) examples/python/structure_from_motion/structure_from_motion/read_write_model.py:262— examples/python/structure_from_motion/structure_from_motion/read_write_model.py:262-288 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:365-388 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) scripts/append_web_viewer.py:65— scripts/append_web_viewer.py:65-88 | scripts/create_web_viewer_zip.py:60-86 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×9
Edited copy of a member (25 corresponding lines) crates/store/dl_log_types/src/example_components.rs:195— crates/store/dl_log_types/src/example_components.rs:195-219 | crates/store/dl_log_types/src/example_components.rs:300-324 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) crates/viewer/dl_renderer/src/draw_phases/outlines.rs:356— crates/viewer/dl_renderer/src/draw_phases/outlines.rs:356-380 | crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs:315-345 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) docs/snippets/all/archetypes/state_configuration.rs:3— docs/snippets/all/archetypes/state_configuration.rs:3-27 | docs/snippets/all/howto/state_timeline.rs:3-40 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) dalaran_py/src/catalog/dataset_entry.rs:407— dalaran_py/src/catalog/dataset_entry.rs:407-431 | dalaran_py/src/catalog/dataset_entry.rs:468-492 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) crates/viewer/dl_view/src/visualizer_query.rs:68— crates/viewer/dl_view/src/visualizer_query.rs:68-100 | crates/viewer/dl_view/src/visualizer_query.rs:117-141 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/grid_map.rs:83— crates/viewer/dl_view_spatial/src/visualizers/grid_map.rs:83-107 | crates/viewer/dl_view_spatial/src/visualizers/images.rs:56-80 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) crates/top/dl_sdk/src/log_sink.rs:75— crates/top/dl_sdk/src/log_sink.rs:75-99 | crates/top/dl_sdk/src/recording_stream.rs:2449-2473 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) crates/store/dl_sorbet/src/index_column_descriptor.rs:100— crates/store/dl_sorbet/src/index_column_descriptor.rs:100-124 | crates/store/dl_sorbet/src/row_id_column_descriptor.rs:43-68 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) scripts/run_all.py:243— scripts/run_all.py:243-274 | scripts/run_all.py:318-342 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×9
Edited copy of a member (19 corresponding lines) crates/viewer/dl_renderer/src/colormap.rs:106— crates/viewer/dl_renderer/src/colormap.rs:106-124 | crates/viewer/dl_renderer/src/colormap.rs:141-168 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) crates/viewer/dl_viewer_context/src/cache/memoizers.rs:92— crates/viewer/dl_viewer_context/src/cache/memoizers.rs:92-111 | crates/viewer/dl_viewer_context/src/cache/memoizers.rs:262-280 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) crates/top/dl_sdk/src/recording_stream.rs:632— crates/top/dl_sdk/src/recording_stream.rs:632-653 | crates/top/dl_sdk/src/recording_stream.rs:2266-2284 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) crates/store/dl_lenses_core/src/selector/parser.rs:267— crates/store/dl_lenses_core/src/selector/parser.rs:267-285 | crates/store/dl_lenses_core/src/selector/parser.rs:399-417 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) docs/snippets/all/archetypes/graph_directed.rs:3— docs/snippets/all/archetypes/graph_directed.rs:3-21 | docs/snippets/all/archetypes/graph_undirected.rs:3-22 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:384— crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:384-402 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:408-433 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) crates/store/dl_log_types/src/path/entity_path_filter.rs:436— crates/store/dl_log_types/src/path/entity_path_filter.rs:436-457 | crates/store/dl_log_types/src/path/entity_path_filter.rs:463-481 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) crates/top/dl_sdk/src/global.rs:116— crates/top/dl_sdk/src/global.rs:116-134 | crates/top/dl_sdk/src/global.rs:140-158 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) crates/viewer/dl_test_context/src/lib.rs:1006— crates/viewer/dl_test_context/src/lib.rs:1006-1024 | crates/viewer/dl_test_context/src/lib.rs:1027-1046 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×9
Edited copy of a member (7 corresponding lines) crates/store/dl_importer/src/lerobot/datasetv2.rs:246— crates/store/dl_importer/src/lerobot/datasetv2.rs:246-252 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1263-1269 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_multi_array.rs:24— crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_multi_array.rs:24-30 | crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs:24-30 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) crates/store/dl_sorbet/src/column_descriptor.rs:77— crates/store/dl_sorbet/src/column_descriptor.rs:77-83 | crates/store/dl_sorbet/src/column_descriptor_ref.rs:18-24 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:716— crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:716-723 | crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs:512-518 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:151— dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:151-157 | dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py:276-285 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) crates/store/dl_query/src/bin/clamped_zip.rs:47— crates/store/dl_query/src/bin/clamped_zip.rs:47-53 | crates/store/dl_query/src/bin/range_zip.rs:49-55 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) crates/store/dl_query/src/bin/clamped_zip.rs:78— crates/store/dl_query/src/bin/clamped_zip.rs:78-84 | crates/store/dl_query/src/bin/range_zip.rs:87-93 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) crates/viewer/dl_context_menu/src/actions/move_contents_to_new_container.rs:33— crates/viewer/dl_context_menu/src/actions/move_contents_to_new_container.rs:33-39 | crates/viewer/dl_context_menu/src/actions/remove.rs:14-21 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs:62— crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs:62-68 | crates/viewer/dl_viewer_context/src/annotations.rs:290-296 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×8
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
D4 · Code Duplication· Edited copy of a member (35 corresponding lines) · ×8
Edited copy of a member (35 corresponding lines) docs/snippets/all/tutorials/dna.py:16— docs/snippets/all/tutorials/dna.py:16-96 | examples/python/dna/dna.py:26-60 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (35 corresponding lines) crates/store/dl_importer/src/lerobot/datasetv3.rs:1354— crates/store/dl_importer/src/lerobot/datasetv3.rs:1354-1388 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1396-1430 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (35 corresponding lines) docs/snippets/all/howto/any_batch_value_column_updates.rs:9— docs/snippets/all/howto/any_batch_value_column_updates.rs:9-45 | docs/snippets/all/howto/any_values_column_updates.rs:11-45 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (35 corresponding lines) docs/snippets/all/archetypes/arrows3d_column_updates.rs:7— docs/snippets/all/archetypes/arrows3d_column_updates.rs:7-41 | docs/snippets/all/archetypes/arrows3d_row_updates.rs:7-42 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (35 corresponding lines) crates/store/dl_log_encoding/src/transport_to_app.rs:426— crates/store/dl_log_encoding/src/transport_to_app.rs:426-464 | crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:1182-1216 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (35 corresponding lines) docs/snippets/all/archetypes/capsules3d_batch.rs:5— docs/snippets/all/archetypes/capsules3d_batch.rs:5-39 | docs/snippets/all/archetypes/cylinders3d_batch.rs:5-39 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (35 corresponding lines) dalaran_py/dalaran_sdk/dalaran/archetypes/arrows3d_ext.py:25— dalaran_py/dalaran_sdk/dalaran/archetypes/arrows3d_ext.py:25-67 | dalaran_py/dalaran_sdk/dalaran/blueprint/archetypes/line_grid3d_ext.py:23-57 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (35 corresponding lines) examples/python/graph_lattice/graph_lattice.py:25— examples/python/graph_lattice/graph_lattice.py:25-61 | examples/python/graphs/graphs.py:47-81 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×8
Edited copy of a member (23 corresponding lines) docs/snippets/all/archetypes/points2d_random.rs:5— docs/snippets/all/archetypes/points2d_random.rs:5-27 | docs/snippets/all/archetypes/points3d_random.rs:5-27 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) crates/store/dl_query/src/latest_all.rs:57— crates/store/dl_query/src/latest_all.rs:57-83 | crates/store/dl_query/src/latest_all.rs:89-111 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) crates/store/dl_log_encoding/src/transport_to_app.rs:476— crates/store/dl_log_encoding/src/transport_to_app.rs:476-500 | crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:1224-1246 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:380— crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:380-402 | crates/viewer/dl_dataframe_ui/src/filters/string.rs:86-120 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) crates/viewer/dl_selection_panel/src/item_title.rs:190— crates/viewer/dl_selection_panel/src/item_title.rs:190-215 | crates/viewer/dl_selection_panel/src/item_title.rs:221-243 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) crates/viewer/dl_viewer_context/src/view/view_query.rs:385— crates/viewer/dl_viewer_context/src/view/view_query.rs:385-407 | crates/viewer/dl_viewer_context/src/view/view_query.rs:420-442 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) crates/store/dl_chunk_store/src/dataframe.rs:251— crates/store/dl_chunk_store/src/dataframe.rs:251-273 | crates/store/dl_chunk_store/src/dataframe.rs:275-303 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (23 corresponding lines) crates/utils/dl_test_mocks/src/otlp.rs:228— crates/utils/dl_test_mocks/src/otlp.rs:228-250 | crates/utils/dl_test_mocks/src/posthog.rs:261-283 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×8
Edited copy of a member (16 corresponding lines) crates/viewer/dl_ui/src/fuzzy.rs:145— crates/viewer/dl_ui/src/fuzzy.rs:145-160 | crates/viewer/dl_ui/src/fuzzy.rs:172-198 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) crates/viewer/dl_data_ui/src/item_ui.rs:549— crates/viewer/dl_data_ui/src/item_ui.rs:549-564 | crates/viewer/dl_data_ui/src/item_ui.rs:570-585 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) crates/store/dl_lenses_core/src/selector/parser.rs:338— crates/store/dl_lenses_core/src/selector/parser.rs:338-353 | crates/store/dl_lenses_core/src/selector/parser.rs:463-478 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) crates/top/dalaran_c/src/lib.rs:477— crates/top/dalaran_c/src/lib.rs:477-492 | crates/top/dalaran_c/src/lib.rs:959-974 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) crates/store/dl_lenses_core/src/combinators/map.rs:245— crates/store/dl_lenses_core/src/combinators/map.rs:245-260 | crates/store/dl_lenses_core/src/combinators/map.rs:295-310 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) crates/store/dl_tf/src/transform_queries.rs:541— crates/store/dl_tf/src/transform_queries.rs:541-556 | crates/store/dl_tf/src/transform_queries.rs:567-582 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) examples/python/structure_from_motion/structure_from_motion/read_write_model.py:292— examples/python/structure_from_motion/structure_from_motion/read_write_model.py:292-309 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:392-407 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:37— crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:37-52 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:41-56 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
X18 · Disposal-pattern correctness· Explicit release owed and not made on every path · ×8
Explicit release owed and not made on every path crates/viewer/dl_viewer/src/app/mod.rs:1701— `writer` (line 1701) is a `BufWriter` this function owns and never releases: no `flush()` (or `into_inner()`) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends.
Explicit release owed and not made on every path crates/viewer/dl_view_time_series/src/visualizer_ui.rs:68— `frame` (line 68) is a transaction this function owns and never releases: no `commit()` (or a deliberate `rollback()`) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends.
Explicit release owed and not made on every path crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:401— `table_state` (line 401) is a `DataFusionAdapter` released by `update_query()` only on the path that reaches line 504; the `return` on line 438 leaves before that with a success value, and on that path `DataFusionAdapter` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it before that `return` too (or return an error there, if the early exit is a failure).
Explicit release owed and not made on every path crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:1160— `selection` (line 1160) is a `TableSelectionState` this function owns and never releases: no `store()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `TableSelectionState` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends.
Explicit release owed and not made on every path crates/viewer/dl_dataframe_ui/src/preview_renderer.rs:72— `viewport` (line 72) is a `ViewportBlueprint` this function owns and never releases: no `save_to_blueprint_store()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `ViewportBlueprint` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends.
Explicit release owed and not made on every path crates/viewer/dl_arrow_ui/src/arrow_node.rs:76— `data_type_ui` (line 76) is a `DataTypeUi` this function owns and never releases: no `list_item_ui()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `DataTypeUi` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends.
Explicit release owed and not made on every path crates/viewer/dl_arrow_ui/src/datatype_ui.rs:130— `data_type_ui` (line 130) is a `DataTypeUi` this function owns and never releases: no `list_item_ui()` on any path, and it is not handed on. Rust drops it at the end of the scope, and `DataTypeUi` has no `Drop`, so what it holds is only completed by that call and is lost without it. Release it where the work ends.
Explicit release owed and not made on every path crates/top/dalaran/src/commands/dlr/migrate.rs:152— `buffered_writer` (line 152) is a `BufWriter` this function owns and never releases: no `flush()` (or `into_inner()`) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends.
App::run_system_command (cyclomatic 94) crates/viewer/dl_viewer/src/app/command_handling.rs:73— App::run_system_command has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
App::run_ui_command (cyclomatic 55) crates/viewer/dl_viewer/src/app/command_handling.rs:790— App::run_ui_command has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
App::ui (cyclomatic 45) crates/viewer/dl_viewer/src/app/mod.rs:1233— App::ui 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.
App::run_recording_command (cyclomatic 37) crates/viewer/dl_viewer/src/app/command_handling.rs:1147— App::run_recording_command has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
App::load_data_source (cyclomatic 23) crates/viewer/dl_viewer/src/app/add_data_source.rs:63— App::load_data_source 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.
App::with_commands (cyclomatic 23) crates/viewer/dl_viewer/src/app/mod.rs:206— App::with_commands has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
App::receive_messages (cyclomatic 20) crates/viewer/dl_viewer/src/app/logic.rs:149— App::receive_messages 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.
dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread (cognitive 76) crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:728— dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread has cognitive complexity 76 (threshold 15). Drivers by points: if/else 23 (61 pts), match/switch 4 (7 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop (cognitive 32) crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:931— dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_datafusion::pushdown_expressions::merge_queries_and (cognitive 30) crates/store/dl_datafusion/src/pushdown_expressions.rs:491— dl_datafusion::pushdown_expressions::merge_queries_and has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_datafusion::dataframe_query_provider::io_loop::create_request_batches_with_segment_limit (cognitive 28) crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:337— dl_datafusion::dataframe_query_provider::io_loop::create_request_batches_with_segment_limit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, loops 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.
dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries (cognitive 25) crates/store/dl_datafusion/src/pushdown_expressions.rs:256— dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (9 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.
dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls (cognitive 22) crates/store/dl_datafusion/src/chunk_fetcher.rs:626— dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), loops 3, 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.
dl_datafusion::dataframe_query_provider::queried_uncompressed_segment_size (cognitive 16) crates/store/dl_datafusion/src/dataframe_query_provider.rs:444— dl_datafusion::dataframe_query_provider::queried_uncompressed_segment_size has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_selection_panel::view_entity_picker::add_entities_line_ui (cognitive 40) crates/viewer/dl_selection_panel/src/view_entity_picker.rs:179— dl_selection_panel::view_entity_picker::add_entities_line_ui has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (40 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.
dl_selection_panel::visualizer_ui::visualizer_components (cognitive 22) crates/viewer/dl_selection_panel/src/visualizer_ui.rs:226— dl_selection_panel::visualizer_ui::visualizer_components has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 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.
dl_selection_panel::item_heading_with_breadcrumbs::item_bread_crumbs_ui (cognitive 21) crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs:79— dl_selection_panel::item_heading_with_breadcrumbs::item_bread_crumbs_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 1 (nesting depth added 11). 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.
dl_selection_panel::visible_time_range_ui::resolved_visible_history_boundary_ui (cognitive 20) crates/viewer/dl_selection_panel/src/visible_time_range_ui.rs:347— dl_selection_panel::visible_time_range_ui::resolved_visible_history_boundary_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 5 (8 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui (cognitive 19) crates/viewer/dl_selection_panel/src/view_space_origin_ui.rs:79— dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
dl_selection_panel::visible_time_range_ui::query_range_ui (cognitive 19) crates/viewer/dl_selection_panel/src/visible_time_range_ui.rs:164— dl_selection_panel::visible_time_range_ui::query_range_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 3 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
dl_selection_panel::visualizer_ui::visualizer_ui_impl (cognitive 18) crates/viewer/dl_selection_panel/src/visualizer_ui.rs:117— dl_selection_panel::visualizer_ui::visualizer_ui_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_data_ui::entity_db_ui::grid_content_ui (cognitive 35) crates/viewer/dl_data_ui/src/entity_db_ui.rs:103— dl_data_ui::entity_db_ui::grid_content_ui has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_data_ui::video_ui::video_data_ui (cognitive 35) crates/viewer/dl_data_ui/src/video_ui.rs:93— dl_data_ui::video_ui::video_data_ui has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 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.
dl_data_ui::video_ui::decoded_frame_ui (cognitive 33) crates/viewer/dl_data_ui/src/video_ui.rs:390— dl_data_ui::video_ui::decoded_frame_ui has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 2 (6 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.
dl_data_ui::item_ui::entity_tree_stats_ui (cognitive 22) crates/viewer/dl_data_ui/src/item_ui.rs:280— dl_data_ui::item_ui::entity_tree_stats_ui has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
dl_data_ui::instance_path_ui::component_list_ui (cognitive 21) crates/viewer/dl_data_ui/src/instance_path_ui.rs:271— dl_data_ui::instance_path_ui::component_list_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 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.
dl_data_ui::item_ui::entity_db_button_ui (cognitive 21) crates/viewer/dl_data_ui/src/item_ui.rs:610— dl_data_ui::item_ui::entity_db_button_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
dl_data_ui::video_ui::frame_info_ui (cognitive 20) crates/viewer/dl_data_ui/src/video_ui.rs:541— dl_data_ui::video_ui::frame_info_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5 (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.
D4 · Code Duplication· Edited copy of a member (30 corresponding lines) · ×7
Edited copy of a member (30 corresponding lines) crates/store/dl_server/src/dalaran_cloud/mod.rs:1239— crates/store/dl_server/src/dalaran_cloud/mod.rs:1239-1270 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1302-1331 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) docs/snippets/all/archetypes/line_strips2d_ui_radius.rs:3— docs/snippets/all/archetypes/line_strips2d_ui_radius.rs:3-34 | docs/snippets/all/archetypes/line_strips3d_ui_radius.rs:3-32 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:57— crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:57-86 | crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:93-127 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) crates/viewer/dl_test_context/src/lib.rs:815— crates/viewer/dl_test_context/src/lib.rs:815-847 | crates/viewer/dl_viewer/src/app/mod.rs:929-958 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:284— crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:284-320 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:327-356 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) docs/snippets/all/archetypes/points2d_ui_radius.rs:3— docs/snippets/all/archetypes/points2d_ui_radius.rs:3-34 | docs/snippets/all/archetypes/points3d_ui_radius.rs:3-32 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (30 corresponding lines) crates/store/dl_tf/src/transform_forest.rs:596— crates/store/dl_tf/src/transform_forest.rs:596-625 | crates/store/dl_tf/src/transform_forest.rs:632-671 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (21 lines × 2) crates/store/dl_chunk/src/iter.rs:559— crates/store/dl_chunk/src/iter.rs:559-579 | crates/store/dl_chunk/src/iter.rs:787-807 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_chunk/src/iter.rs:559` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/store/dl_chunk/src/iter.rs:784` calls `offsets`, `lengths`, `collect_vec` and `crates/store/dl_chunk/src/iter.rs:557` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (21 lines × 2) crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:818— crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:818-838 | crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:889-909 — both copies are in the same file, so extract the 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 `crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:818` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 2) crates/store/dl_mcap/src/decoders/ros2_reflection.rs:148— crates/store/dl_mcap/src/decoders/ros2_reflection.rs:148-168 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:303-323 — both copies are in the same file, so extract the block into 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/viewer/dl_view_spatial/src/visualizers/points2d.rs:299— crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:299-319 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:515-535 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/points2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/points3d.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:299` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 2) crates/viewer/dl_viewer/src/app/command_handling.rs:566— crates/viewer/dl_viewer/src/app/command_handling.rs:566-586 | crates/viewer/dl_viewer/src/app/command_handling.rs:598-618 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/app/command_handling.rs:566` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 2) crates/viewer/dl_viewer_context/src/component_ui_registry.rs:367— crates/viewer/dl_viewer_context/src/component_ui_registry.rs:367-387 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:412-432 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer_context/src/component_ui_registry.rs:367` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (21 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:708— crates/store/dl_redap_tests/src/utils/dalaran.rs:708-728 | crates/store/dl_redap_tests/src/utils/dalaran.rs:835-855 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–13 lines × 2) crates/store/dl_importer/src/lerobot/common.rs:130— crates/store/dl_importer/src/lerobot/common.rs:130-141 | crates/store/dl_importer/src/lerobot/common.rs:162-174 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_importer/src/lerobot/common.rs:130` 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.
Duplicated block (12–13 lines × 2) crates/store/dl_log_types/src/index/time_point.rs:210— crates/store/dl_log_types/src/index/time_point.rs:210-221 | crates/store/dl_log_types/src/index/time_point.rs:227-239 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12–13 lines × 2) crates/viewer/dl_ui/src/list_item/label_content.rs:218— crates/viewer/dl_ui/src/list_item/label_content.rs:218-229 | crates/viewer/dl_ui/src/list_item/property_content.rs:273-285 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12–13 lines × 2) crates/viewer/dl_view_state_timeline/src/view_class.rs:1127— crates/viewer/dl_view_state_timeline/src/view_class.rs:1127-1138 | crates/viewer/dl_view_state_timeline/src/view_class.rs:1157-1169 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view_state_timeline/src/view_class.rs:1127` 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.
Duplicated block (12–13 lines × 2) crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs:533— crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs:533-544 | crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs:558-570 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs:533` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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.
Duplicated block (12–13 lines × 2) dalaran_py/src/trace_context.rs:101— dalaran_py/src/trace_context.rs:101-113 | dalaran_py/src/tracing_session.rs:78-89 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12–13 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:509— crates/store/dl_redap_tests/src/utils/dalaran.rs:509-521 | crates/store/dl_redap_tests/src/utils/dalaran.rs:551-562 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:509` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
HackComment examples/python/arkit_scenes/arkit_scenes/__main__.py:34— # hack for now since dataset does not provide orientation information, only known after initial visual inspection — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/viewer/dl_viewer/src/app/command_handling.rs:745— // Hacky: Shrink so we don't accidentally include the border of the view. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/viewer/dl_viewer/src/app/logic.rs:318— // Hack: we cannot go to a specific timeline or entity until we know about it. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/viewer/dl_ui/src/ui_ext.rs:1149— // Hack: ensure we don't paint outside the lines on the Y-axis. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/viewer/dl_component_ui/src/lib.rs:161— // Hack to make this field never editable. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/store/dl_uri/src/redap_uri.rs:76— // Hacky, but I don't want to have to memorize ports. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
TimeControl::handle_time_command (cognitive 105) crates/viewer/dl_viewer_context/src/time_control/command.rs:202— TimeControl::handle_time_command has cognitive complexity 105 (threshold 15). Drivers by points: if/else 51 (99 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 51). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TimeControl::update (cognitive 56) crates/viewer/dl_viewer_context/src/time_control/mod.rs:435— TimeControl::update has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 3 (12 pts), boolean chains 8 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
TimeControl::update_from_blueprint (cognitive 26) crates/viewer/dl_viewer_context/src/time_control/mod.rs:341— TimeControl::update_from_blueprint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TimeControl::step_time_back_no_pause (cognitive 21) crates/viewer/dl_viewer_context/src/time_control/command.rs:546— TimeControl::step_time_back_no_pause has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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. This shape REPEATS in the file: one other method here (TimeControl::step_time_fwd_no_pause) 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.
TimeControl::step_time_fwd_no_pause (cognitive 21) crates/viewer/dl_viewer_context/src/time_control/command.rs:583— TimeControl::step_time_fwd_no_pause has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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. This shape REPEATS in the file: one other method here (TimeControl::step_time_back_no_pause) 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.
TimeControl::set_play_state (cognitive 20) crates/viewer/dl_viewer_context/src/time_control/mod.rs:646— TimeControl::set_play_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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.
QueryHandle::_next_n_rows (cognitive 101) crates/store/dl_dataframe/src/query.rs:1788— QueryHandle::_next_n_rows has cognitive complexity 101 (threshold 15). Drivers by points: if/else 27 (73 pts), match/switch 6 (19 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
QueryHandle::try_bulk_emit_run (cognitive 78) crates/store/dl_dataframe/src/query.rs:2132— QueryHandle::try_bulk_emit_run has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (65 pts), match/switch 3 (7 pts), loops 4 (5 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.
QueryHandle::_resolve_one_row (cognitive 70) crates/store/dl_dataframe/src/query.rs:1427— QueryHandle::_resolve_one_row has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (49 pts), loops 6 (14 pts), match/switch 4 (6 pts), boolean chains 1 (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.
QueryHandle::init_ (cognitive 28) crates/store/dl_dataframe/src/query.rs:564— QueryHandle::init_ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 2 (4 pts), loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
QueryHandle::fill_bulk_metadata (cognitive 19) crates/store/dl_dataframe/src/query.rs:776— QueryHandle::fill_bulk_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
QueryHandle::seek_to_index_value_impl (cognitive 17) crates/store/dl_dataframe/src/query.rs:1144— QueryHandle::seek_to_index_value_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 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.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×6
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
D4 · Code Duplication· Edited copy of a member (31 corresponding lines) · ×6
Edited copy of a member (31 corresponding lines) crates/store/dl_chunk_store/src/rebatch_videos.rs:751— crates/store/dl_chunk_store/src/rebatch_videos.rs:751-781 | crates/store/dl_chunk_store/src/rebatch_videos.rs:788-822 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (31 corresponding lines) crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:22— crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:22-52 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:279-312 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (31 corresponding lines) crates/store/dl_log_channel/src/receiver_set.rs:136— crates/store/dl_log_channel/src/receiver_set.rs:136-166 | crates/store/dl_log_channel/src/receiver_set.rs:172-202 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (31 corresponding lines) docs/snippets/all/archetypes/clear_recursive.rs:5— docs/snippets/all/archetypes/clear_recursive.rs:5-35 | docs/snippets/all/archetypes/clear_simple.rs:5-36 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (31 corresponding lines) crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:68— crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:68-110 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/nav_sat_fix.rs:75-105 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (31 corresponding lines) crates/viewer/dl_renderer/src/allocator/data_texture_source.rs:205— crates/viewer/dl_renderer/src/allocator/data_texture_source.rs:205-235 | crates/viewer/dl_renderer/src/allocator/data_texture_source.rs:264-294 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (37 corresponding lines) · ×6
Edited copy of a member (37 corresponding lines) crates/store/dl_lenses_core/src/selector/parser.rs:482— crates/store/dl_lenses_core/src/selector/parser.rs:482-518 | crates/store/dl_lenses_core/src/selector/parser.rs:587-623 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (37 corresponding lines) crates/store/dl_lenses_core/src/selector/parser.rs:287— crates/store/dl_lenses_core/src/selector/parser.rs:287-335 | crates/store/dl_lenses_core/src/selector/parser.rs:424-460 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (37 corresponding lines) crates/viewer/dl_redap_browser/src/entries.rs:371— crates/viewer/dl_redap_browser/src/entries.rs:371-408 | crates/viewer/dl_redap_browser/src/entries.rs:416-452 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (37 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:32— crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:32-68 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:32-70 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (37 corresponding lines) dalaran_py/dalaran_sdk/dalaran/__init__.py:503— dalaran_py/dalaran_sdk/dalaran/__init__.py:503-543 | dalaran_py/dalaran_sdk/dalaran/recording_stream.py:786-822 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (37 corresponding lines) crates/store/dl_redap_tests/src/utils/dalaran.rs:954— crates/store/dl_redap_tests/src/utils/dalaran.rs:954-992 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1026-1062 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (29 corresponding lines) · ×6
Edited copy of a member (29 corresponding lines) dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:67— dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:67-148 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:49-77 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (29 corresponding lines) crates/store/dl_lenses_core/src/combinators/map.rs:37— crates/store/dl_lenses_core/src/combinators/map.rs:37-65 | crates/store/dl_lenses_core/src/combinators/map.rs:93-121 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (29 corresponding lines) crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:55— crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:55-83 | crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:340-372 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (29 corresponding lines) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:489— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:489-522 | crates/viewer/dl_renderer/src/renderer/rectangles.rs:811-839 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (29 corresponding lines) crates/viewer/dl_data_ui/src/video_ui.rs:28— crates/viewer/dl_data_ui/src/video_ui.rs:28-56 | crates/viewer/dl_data_ui/src/video_ui.rs:63-91 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (29 corresponding lines) crates/viewer/dl_renderer_examples/depth_cloud.rs:407— crates/viewer/dl_renderer_examples/depth_cloud.rs:407-435 | crates/viewer/dl_renderer_examples/depth_cloud.rs:449-478 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×6
Edited copy of a member (15 corresponding lines) crates/store/dl_sorbet/src/column_kind.rs:41— crates/store/dl_sorbet/src/column_kind.rs:41-60 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:66-80 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) crates/store/dl_entity_db/src/entity_db.rs:1147— crates/store/dl_entity_db/src/entity_db.rs:1147-1161 | crates/store/dl_entity_db/src/entity_db.rs:1170-1184 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) crates/viewer/dl_arrow_ui/src/show_index.rs:300— crates/viewer/dl_arrow_ui/src/show_index.rs:300-316 | crates/viewer/dl_arrow_ui/src/show_index.rs:343-357 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:307— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:307-321 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:303-317 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) docs/snippets/all/archetypes/scalars_row_updates.rs:5— docs/snippets/all/archetypes/scalars_row_updates.rs:5-19 | docs/snippets/all/archetypes/scalars_simple.rs:3-17 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) crates/utils/dl_analytics/src/event.rs:159— crates/utils/dl_analytics/src/event.rs:159-173 | crates/utils/dl_analytics/src/event.rs:616-631 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (20 lines × 2) crates/store/dl_query/src/bin/range_zip.rs:129— crates/store/dl_query/src/bin/range_zip.rs:129-148 | crates/store/dl_query/src/bin/range_zip.rs:339-358 — both copies are in the same file, so extract the block into 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/viewer/dl_dataframe_ui/src/filters/numerical.rs:146— crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:146-165 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:298-317 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (20 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:33— crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:33-52 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:34-53 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:33` 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 (20 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:192— crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:192-211 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:203-222 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 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 (20 lines × 2) crates/viewer/dl_renderer_examples/outlines.rs:122— crates/viewer/dl_renderer_examples/outlines.rs:122-141 | crates/viewer/dl_renderer_examples/picking.rs:187-206 — 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 `crates/viewer/dl_renderer_examples/outlines.rs:122` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20 lines × 2) examples/python/lidar/lidar/__main__.py:30— examples/python/lidar/lidar/__main__.py:30-49 | examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:41-60 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) crates/store/dl_chunk_store/src/writes.rs:696— crates/store/dl_chunk_store/src/writes.rs:696-712 | crates/store/dl_chunk_store/src/writes.rs:731-747 — both copies are in the same file, so extract the 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 `crates/store/dl_chunk_store/src/writes.rs:696` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) crates/store/dl_datafusion/src/dataframe_query_provider.rs:879— crates/store/dl_datafusion/src/dataframe_query_provider.rs:879-895 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:538-554 — before extracting anything, compare `crates/store/dl_datafusion/src/dataframe_query_provider.rs` and `crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_datafusion/src/dataframe_query_provider.rs:879` 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 (17 lines × 2) crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:93— crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:93-109 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:395-411 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) crates/store/dl_grpc_server/src/lib.rs:381— crates/store/dl_grpc_server/src/lib.rs:381-397 | crates/store/dl_grpc_server/src/lib.rs:479-495 — both copies are in the same file, so extract the 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 `crates/store/dl_grpc_server/src/lib.rs:381` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/store/dl_grpc_server/src/lib.rs:496` calls `is_empty` and `crates/store/dl_grpc_server/src/lib.rs:398` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17 lines × 2) crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:72— crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:72-88 | crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs:66-82 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (17 lines × 2) dalaran_py/src/chunk_stream/stream.rs:195— dalaran_py/src/chunk_stream/stream.rs:195-211 | dalaran_py/src/chunk_stream/stream.rs:228-244 — both copies are in the same file, so extract the 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 `dalaran_py/src/chunk_stream/stream.rs:195` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 3) crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:138— crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:138-146 | crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs:50-58 | crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs:70-79 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:138` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 3) crates/viewer/dl_selection_panel/src/selection_panel.rs:711— crates/viewer/dl_selection_panel/src/selection_panel.rs:711-720 | crates/viewer/dl_selection_panel/src/visualizer_ui.rs:1244-1252 | crates/viewer/dl_view/src/component_drop.rs:259-267 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_selection_panel/src/selection_panel.rs:711` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 3) crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:28— crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:28-36 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:91-99 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:216-224 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:28` 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 × 3) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:361— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:361-369 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:442-450 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:652-660 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs` and `crates/viewer/dl_renderer/src/renderer/mesh_renderer.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. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:361` 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 × 3) dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:116— dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:116-124 | dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py:208-216 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:49-57 — before extracting anything, compare `dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py` and `dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 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 × 3) crates/store/dl_redap_tests/src/utils/dalaran.rs:474— crates/store/dl_redap_tests/src/utils/dalaran.rs:474-482 | crates/store/dl_redap_tests/src/utils/dalaran.rs:494-502 | crates/store/dl_redap_tests/src/utils/dalaran.rs:555-563 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_redap_tests/src/utils/dalaran.rs:474` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:178— crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:178-185 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:92-102 | crates/store/dl_sorbet/src/migrations/v0_1_2__to__v0_1_3.rs:63-72 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:178` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) crates/utils/dl_auth/src/oauth/api.rs:45— crates/utils/dl_auth/src/oauth/api.rs:45-52 | crates/utils/dl_auth/src/oauth/api.rs:74-81 | crates/utils/dl_auth/src/oauth/api.rs:99-106 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_auth/src/oauth/api.rs:45` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) crates/viewer/dl_viewer_context/src/item.rs:383— crates/viewer/dl_viewer_context/src/item.rs:383-390 | crates/viewer/dl_viewer_context/src/selection_state.rs:207-214 | crates/viewer/dl_viewer_context/src/selection_state.rs:228-235 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 3) docs/snippets/all/archetypes/line_strips3d_batch.rs:9— docs/snippets/all/archetypes/line_strips3d_batch.rs:9-16 | docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:8-15 | docs/snippets/all/archetypes/line_strips3d_simple.rs:7-14 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/line_strips3d_batch.rs:9` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:15— docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:15-22 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:27-36 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:41-50 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:15` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:405— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:405-412 | crates/viewer/dl_renderer/src/renderer/lines.rs:452-459 | crates/viewer/dl_renderer/src/renderer/lines.rs:466-473 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/lines.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:405` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) docs/snippets/all/archetypes/transform3d_hierarchy.rs:19— docs/snippets/all/archetypes/transform3d_hierarchy.rs:19-25 | docs/snippets/all/archetypes/transform3d_hierarchy.rs:29-35 | docs/snippets/all/archetypes/transform3d_hierarchy.rs:39-45 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/transform3d_hierarchy.rs:19` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) crates/viewer/dl_component_ui/src/geo_line_string.rs:44— crates/viewer/dl_component_ui/src/geo_line_string.rs:44-50 | crates/viewer/dl_component_ui/src/line_strip.rs:50-56 | crates/viewer/dl_component_ui/src/line_strip.rs:112-118 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_component_ui/src/geo_line_string.rs:44` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `&mut MaybeMutRef<'_, GeoLineString>` in one and `&mut MaybeMutRef<'_, LineStrip3D>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 3) crates/store/dl_uri/src/endpoints/dataset.rs:143— crates/store/dl_uri/src/endpoints/dataset.rs:143-149 | crates/store/dl_uri/src/endpoints/entry.rs:30-36 | crates/store/dl_uri/src/endpoints/folder.rs:43-49 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (7 lines × 3) crates/viewer/dl_component_ui/src/color.rs:11— crates/viewer/dl_component_ui/src/color.rs:11-17 | crates/viewer/dl_component_ui/src/datatype_uis/range1d.rs:10-16 | crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:42-48 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_component_ui/src/color.rs:11` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `&mut MaybeMutRef<'_, impl std::ops::DerefMut<Target = Rgba32>>` in one and `&mut MaybeMutRef<'_, impl std::ops::DerefMut<Target = Range1D>>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 3) crates/viewer/dl_renderer/src/renderer/lines.rs:678— crates/viewer/dl_renderer/src/renderer/lines.rs:678-686 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:705-713 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:309-315 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/lines.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/lines.rs:678` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) crates/store/dl_redap_tests/src/utils/dalaran.rs:281— crates/store/dl_redap_tests/src/utils/dalaran.rs:281-287 | crates/store/dl_redap_tests/src/utils/dalaran.rs:326-332 | crates/store/dl_redap_tests/src/utils/dalaran.rs:604-610 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_redap_tests/src/utils/dalaran.rs:281` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/store/dl_redap_tests/src/utils/dalaran.rs:290` calls `blueprint` and `crates/store/dl_redap_tests/src/utils/dalaran.rs:335` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Chunk::latest_at (cognitive 48) crates/store/dl_chunk/src/latest_at.rs:91— Chunk::latest_at has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 4 (12 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chunk::row_id_range_per_component (cognitive 24) crates/store/dl_chunk/src/chunk.rs:842— Chunk::row_id_range_per_component has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chunk::sanity_check (cognitive 22) crates/store/dl_chunk/src/chunk.rs:1801— Chunk::sanity_check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Chunk::range (cognitive 19) crates/store/dl_chunk/src/range.rs:210— Chunk::range has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (19 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.
Chunk::concatenated_unsorted (cognitive 18) crates/store/dl_chunk/src/merge.rs:59— Chunk::concatenated_unsorted has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
TimePanel::show_entity_contents (cognitive 47) crates/viewer/dl_time_panel/src/time_panel.rs:962— TimePanel::show_entity_contents has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TimePanel::data_density_graph_ui (cognitive 20) crates/viewer/dl_time_panel/src/time_panel.rs:1194— TimePanel::data_density_graph_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (6 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.
TimePanel::collapsed_ui (cognitive 19) crates/viewer/dl_time_panel/src/time_panel.rs:361— TimePanel::collapsed_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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.
TimePanel::expanded_ui (cognitive 19) crates/viewer/dl_time_panel/src/time_panel.rs:462— TimePanel::expanded_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (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.
TimePanel::current_time_ui (cognitive 16) crates/viewer/dl_time_panel/src/time_panel.rs:1583— TimePanel::current_time_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). Of this number, 10 points are the body's own statements and 6 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.
dl_video::decode::av1::create_frame (cognitive 37) crates/utils/dl_video/src/decode/av1.rs:142— dl_video::decode::av1::create_frame has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (12 pts), match/switch 5 (7 pts), boolean chains 2 (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.
dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output (cognitive 29) crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs:648— dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 17). Of this number, 25 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_video::player::request_keyframe_before (cognitive 21) crates/utils/dl_video/src/player/mod.rs:354— dl_video::player::request_keyframe_before has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_video::av1::detect_av1_keyframe_start (cognitive 19) crates/utils/dl_video/src/av1.rs:25— dl_video::av1::detect_av1_keyframe_start 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.
dl_video::demux::mp4::codec_details_from_stds (cognitive 18) crates/utils/dl_video/src/demux/mp4.rs:233— dl_video::demux::mp4::codec_details_from_stds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 11). 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.
dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents (cognitive 32) crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:214— dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 4, boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer::ui::top_panel::top_bar_ui (cognitive 28) crates/viewer/dl_viewer/src/ui/top_panel.rs:92— dl_viewer::ui::top_panel::top_bar_ui has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings (cognitive 23) crates/viewer/dl_viewer/src/prefetch_chunks.rs:29— dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts), loops 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer::ui::top_panel::panel_buttons_r2l (cognitive 23) crates/viewer/dl_viewer/src/ui/top_panel.rs:364— dl_viewer::ui::top_panel::panel_buttons_r2l has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewer::web::create_app (cognitive 16) crates/viewer/dl_viewer/src/web.rs:710— dl_viewer::web::create_app has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 6, loops 1 (2 pts) (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D4 · Code Duplication· Edited copy of a member (38 corresponding lines) · ×5
Edited copy of a member (38 corresponding lines) crates/store/dl_importer/src/importer_urdf/mod.rs:65— crates/store/dl_importer/src/importer_urdf/mod.rs:65-102 | crates/store/dl_importer/src/importer_urdf/mod.rs:110-147 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (38 corresponding lines) crates/store/dl_chunk_store/src/query.rs:172— crates/store/dl_chunk_store/src/query.rs:172-209 | crates/store/dl_chunk_store/src/query.rs:221-258 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (38 corresponding lines) crates/store/dl_log_types/src/path/entity_path_part.rs:59— crates/store/dl_log_types/src/path/entity_path_part.rs:59-118 | crates/store/dl_log_types/src/path/entity_path_part.rs:121-158 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (38 corresponding lines) crates/store/dl_query/src/bin/clamped_zip.rs:315— crates/store/dl_query/src/bin/clamped_zip.rs:315-352 | crates/store/dl_query/src/bin/range_zip.rs:456-496 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (38 corresponding lines) dalaran_py/dalaran_sdk/dalaran/blueprint/api.py:715— dalaran_py/dalaran_sdk/dalaran/blueprint/api.py:715-753 | dalaran_py/dalaran_sdk/dalaran/notebook.py:289-326 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (27 corresponding lines) · ×5
Edited copy of a member (27 corresponding lines) crates/store/dl_importer/src/lerobot/common.rs:129— crates/store/dl_importer/src/lerobot/common.rs:129-155 | crates/store/dl_importer/src/lerobot/common.rs:161-189 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1425— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1425-1451 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1460-1489 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) crates/utils/dl_perf_telemetry/src/telemetry.rs:385— crates/utils/dl_perf_telemetry/src/telemetry.rs:385-411 | crates/utils/dl_perf_telemetry/src/telemetry.rs:413-445 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) crates/store/dl_lenses/src/semantic/foxglove/frame_transform.rs:11— crates/store/dl_lenses/src/semantic/foxglove/frame_transform.rs:11-37 | crates/store/dl_lenses/src/semantic/foxglove/frame_transforms.rs:11-37 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) crates/store/dl_mp4_reader/src/lib.rs:43— crates/store/dl_mp4_reader/src/lib.rs:43-70 | crates/store/dl_mp4_reader/src/lib.rs:92-118 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 15+ corresponding lines) · ×5
Edited copies of one member (3 members, 15+ corresponding lines) crates/store/dl_lenses/src/op/semantic.rs:225— crates/store/dl_lenses/src/op/semantic.rs:225-239 | crates/store/dl_lenses/src/op/semantic.rs:243-257 | crates/store/dl_lenses/src/op/semantic.rs:281-295 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 15+ corresponding lines) crates/store/dl_server/src/dalaran_cloud/mod.rs:1210— crates/store/dl_server/src/dalaran_cloud/mod.rs:1210-1232 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1275-1295 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1336-1350 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 15+ corresponding lines) dalaran_py/src/catalog/dataset_entry.rs:171— dalaran_py/src/catalog/dataset_entry.rs:171-185 | dalaran_py/src/catalog/dataset_entry.rs:204-220 | dalaran_py/src/catalog/table_entry.rs:115-129 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 15+ corresponding lines) crates/utils/dl_mutex/src/lib.rs:151— crates/utils/dl_mutex/src/lib.rs:151-165 | crates/utils/dl_mutex/src/lib.rs:177-192 | crates/utils/dl_mutex/src/lib.rs:209-223 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 15+ corresponding lines) crates/store/dl_datafusion/src/dataset_manifest.rs:125— crates/store/dl_datafusion/src/dataset_manifest.rs:125-139 | crates/store/dl_datafusion/src/segment_table.rs:125-139 | crates/store/dl_datafusion/src/table_entry_provider.rs:273-287 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×5
Edited copy of a member (9 corresponding lines) crates/viewer/dl_view_graph/src/layout/geometry.rs:56— crates/viewer/dl_view_graph/src/layout/geometry.rs:56-64 | crates/viewer/dl_view_graph/src/layout/geometry.rs:67-75 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) crates/store/dl_server/src/store/table.rs:110— crates/store/dl_server/src/store/table.rs:110-118 | crates/store/dl_server/src/store/table.rs:120-132 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:13— crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:13-21 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:17-25 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) examples/python/openstreetmap_data/openstreetmap_data.py:61— examples/python/openstreetmap_data/openstreetmap_data.py:61-69 | examples/python/openstreetmap_data/openstreetmap_data.py:73-83 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) crates/viewer/dl_renderer_examples/multiview.rs:167— crates/viewer/dl_renderer_examples/multiview.rs:167-175 | crates/viewer/dl_renderer_examples/picking.rs:28-36 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×5
Edited copy of a member (6 corresponding lines) crates/store/dl_mcap/src/decoders/protobuf.rs:185— crates/store/dl_mcap/src/decoders/protobuf.rs:185-193 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:228-233 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) dalaran_py/dalaran_sdk/dalaran/robot/_math.py:48— dalaran_py/dalaran_sdk/dalaran/robot/_math.py:48-67 | REDACTED:87-92 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py:196— dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py:196-212 | dalaran_py/dalaran_sdk/dalaran/ros2/naming.py:208-213 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) dalaran_py/src/chunk_stream/chunk_store.rs:64— dalaran_py/src/chunk_stream/chunk_store.rs:64-74 | dalaran_py/src/chunk_stream/lazy_store.rs:48-53 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) examples/python/human_pose_tracking/human_pose_tracking.py:116— examples/python/human_pose_tracking/human_pose_tracking.py:116-121 | examples/python/human_pose_tracking/human_pose_tracking.py:127-132 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (13–14 lines × 2) crates/store/dl_datafusion/src/dataframe_query_common.rs:315— crates/store/dl_datafusion/src/dataframe_query_common.rs:315-328 | dalaran_py/src/catalog/connection_handle.rs:560-572 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_datafusion/src/dataframe_query_common.rs:315` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) crates/store/dl_query/src/latest_at.rs:106— crates/store/dl_query/src/latest_at.rs:106-119 | crates/store/dl_query/src/latest_at.rs:170-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13–14 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:409— crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:409-422 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:448-460 — 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 `crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:409` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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.
Duplicated block (13–14 lines × 2) crates/viewer/dl_viewer_context/src/image_info.rs:398— crates/viewer/dl_viewer_context/src/image_info.rs:398-410 | crates/viewer/dl_viewer_context/src/image_info.rs:413-426 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer_context/src/image_info.rs:413` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) examples/python/droid_semantic_search/ingest.py:57— examples/python/droid_semantic_search/ingest.py:57-70 | examples/python/droid_semantic_search/search.py:47-59 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `examples/python/droid_semantic_search/ingest.py:57` 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.
Duplicated block (10–12 lines × 2) crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:39— crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:39-50 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:35-44 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:39` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–12 lines × 2) crates/viewer/dl_data_ui/src/item_ui.rs:714— crates/viewer/dl_data_ui/src/item_ui.rs:714-725 | crates/viewer/dl_recording_panel/src/recording_panel_ui.rs:755-764 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_data_ui/src/item_ui.rs:714` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (10–12 lines × 2) crates/viewer/dl_viewer_context/src/app_context.rs:434— crates/viewer/dl_viewer_context/src/app_context.rs:434-445 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:171-180 — 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. 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.
Duplicated block (10–12 lines × 2) examples/python/dataloader/prepare_dataset.py:87— examples/python/dataloader/prepare_dataset.py:87-96 | examples/python/droid_semantic_search/prepare_dataset.py:128-139 — 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–12 lines × 2) scripts/update_docs_url_rewrite.py:93— scripts/update_docs_url_rewrite.py:93-102 | scripts/update_docs_url_rewrite.py:115-126 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Low cohesion: Chunk (LCOM4 4) crates/store/dl_chunk/src/chunk.rs:225— Chunk'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: McapImporter (LCOM4 4) crates/store/dl_importer/src/importer_mcap/importer.rs:31— McapImporter'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: Notification (LCOM4 4) crates/viewer/dl_ui/src/notifications.rs:100— Notification'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: History (LCOM4 4) crates/viewer/dl_viewer/src/history.rs:11— History'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: TilesDelegate (LCOM4 4) crates/viewer/dl_viewport/src/viewport_ui.rs:351— TilesDelegate'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.
IC1 · Incompleteness & stubs· Empty method body · ×5
Empty method body — does nothing with its inputs crates/top/dalaran/src/commands/mcap/info.rs:167— `print_property` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs crates/utils/dl_analytics/src/cli.rs:118— `print_details` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs crates/viewer/dl_gamepad/src/web.rs:7— `set_event_waker` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs crates/viewer/dl_ui/src/design_tokens.rs:946— `setup_table_header` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
Empty method body — does nothing with its inputs dalaran_py/src/tracing_session.rs:141— `log_tracing_session_started` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
X18 · Disposal-pattern correctness· Owned value's release suppressed and never restored · ×5
Owned value's release suppressed and never restored crates/top/dl_sdk/src/global.rs:62— `std::mem::forget(stream)` (line 62) takes `stream` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done.
Owned value's release suppressed and never restored crates/top/dl_sdk/src/global.rs:265— `std::mem::forget(global.write().take())` (line 265) takes `global.write().take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done.
Owned value's release suppressed and never restored crates/top/dl_sdk/src/global.rs:269— `std::mem::forget(cell.take())` (line 269) takes `cell.take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done.
Owned value's release suppressed and never restored crates/top/dl_sdk/src/global.rs:275— `std::mem::forget(global.write().take())` (line 275) takes `global.write().take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done.
Owned value's release suppressed and never restored crates/top/dl_sdk/src/global.rs:279— `std::mem::forget(cell.take())` (line 279) takes `cell.take()` out of Rust's ownership: its `Drop` never runs, so whatever it holds — a descriptor, a socket, a buffer, a lock — is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with `into_raw`/`into_raw_fd` and reclaim it with the matching `from_raw` when the owner is done.
QueryHandle::try_bulk_emit_run (cyclomatic 38) crates/store/dl_dataframe/src/query.rs:2132— QueryHandle::try_bulk_emit_run 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.
QueryHandle::_next_n_rows (cyclomatic 34) crates/store/dl_dataframe/src/query.rs:1788— QueryHandle::_next_n_rows has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
QueryHandle::_resolve_one_row (cyclomatic 27) crates/store/dl_dataframe/src/query.rs:1427— QueryHandle::_resolve_one_row 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.
QueryHandle::init_ (cyclomatic 16) crates/store/dl_dataframe/src/query.rs:564— QueryHandle::init_ 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.
dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread (cyclomatic 32) crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:728— dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread 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.
dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries (cyclomatic 17) crates/store/dl_datafusion/src/pushdown_expressions.rs:256— dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries 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.
dl_datafusion::pushdown_expressions::known_filter_column (cyclomatic 17) crates/store/dl_datafusion/src/pushdown_expressions.rs:440— dl_datafusion::pushdown_expressions::known_filter_column has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
dl_datafusion::pushdown_expressions::merge_queries_and (cyclomatic 16) crates/store/dl_datafusion/src/pushdown_expressions.rs:491— dl_datafusion::pushdown_expressions::merge_queries_and 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.
dl_view_spatial::shared_fallbacks::register_fallbacks (cyclomatic 24) crates/viewer/dl_view_spatial/src/shared_fallbacks.rs:27— dl_view_spatial::shared_fallbacks::register_fallbacks has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
dl_view_spatial::visualizers::video::show_video_frame (cyclomatic 20) crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs:539— dl_view_spatial::visualizers::video::show_video_frame 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.
dl_view_spatial::visualizers::video::execute_video_stream_like (cyclomatic 19) crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs:164— dl_view_spatial::visualizers::video::execute_video_stream_like 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.
dl_view_spatial::picking_ui::picking (cyclomatic 17) crates/viewer/dl_view_spatial/src/picking_ui.rs:30— dl_view_spatial::picking_ui::picking 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.
dl_viewer::viewer_analytics::event::open_recording (cyclomatic 23) crates/viewer/dl_viewer/src/viewer_analytics/event.rs:64— dl_viewer::viewer_analytics::event::open_recording has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents (cyclomatic 20) crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:214— dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents 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.
dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings (cyclomatic 18) crates/viewer/dl_viewer/src/prefetch_chunks.rs:29— dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings 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.
dl_viewer::ui::top_panel::panel_buttons_r2l (cyclomatic 16) crates/viewer/dl_viewer/src/ui/top_panel.rs:364— dl_viewer::ui::top_panel::panel_buttons_r2l 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.
dl_data_ui::entity_db_ui::grid_content_ui (cyclomatic 22) crates/viewer/dl_data_ui/src/entity_db_ui.rs:103— dl_data_ui::entity_db_ui::grid_content_ui 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.
dl_data_ui::video_ui::video_data_ui (cyclomatic 21) crates/viewer/dl_data_ui/src/video_ui.rs:93— dl_data_ui::video_ui::video_data_ui 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.
dl_data_ui::item_ui::entity_db_button_ui (cyclomatic 16) crates/viewer/dl_data_ui/src/item_ui.rs:610— dl_data_ui::item_ui::entity_db_button_ui 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.
dl_data_ui::video_ui::decoded_frame_ui (cyclomatic 16) crates/viewer/dl_data_ui/src/video_ui.rs:390— dl_data_ui::video_ui::decoded_frame_ui 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.
dalaran::commands::dlr::route::process_messages (cyclomatic 20) crates/top/dalaran/src/commands/dlr/route.rs:103— dalaran::commands::dlr::route::process_messages 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.
dalaran::commands::entrypoint::run (cyclomatic 19) crates/top/dalaran/src/commands/entrypoint.rs:694— dalaran::commands::entrypoint::run has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: dalaran::commands::entrypoint::record_cli_command_analytics (cyclomatic 21) 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.
dalaran::commands::doctor::recording::check_recording (cyclomatic 16) crates/top/dalaran/src/commands/doctor/recording.rs:26— dalaran::commands::doctor::recording::check_recording 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.
dalaran::commands::entrypoint::assert_receive_into_entity_db (cyclomatic 16) crates/top/dalaran/src/commands/entrypoint.rs:1544— dalaran::commands::entrypoint::assert_receive_into_entity_db has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: dalaran::commands::entrypoint::record_cli_command_analytics (cyclomatic 21) 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.
dl_lenses_core::execute::execute (cognitive 43) crates/store/dl_lenses_core/src/execute.rs:329— dl_lenses_core::execute::execute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 5 (15 pts), loops 3 (7 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.
dl_lenses_core::plan::plan (cognitive 24) crates/store/dl_lenses_core/src/plan.rs:93— dl_lenses_core::plan::plan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3, boolean chains 2, 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.
dl_lenses_core::execute::apply_one_to_many (cognitive 18) crates/store/dl_lenses_core/src/execute.rs:225— dl_lenses_core::execute::apply_one_to_many has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_lenses_core::selector::eval::eval_pack (cognitive 18) crates/store/dl_lenses_core/src/selector/eval.rs:249— dl_lenses_core::selector::eval::eval_pack has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 4 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_ui::drag_and_drop::find_drop_target (cognitive 40) crates/viewer/dl_ui/src/drag_and_drop.rs:178— dl_ui::drag_and_drop::find_drop_target has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 1, match/switch 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.
dl_ui::text_edit::autocomplete_text_edit (cognitive 28) crates/viewer/dl_ui/src/text_edit.rs:17— dl_ui::text_edit::autocomplete_text_edit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, 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.
dl_ui::notifications::show_notification (cognitive 25) crates/viewer/dl_ui/src/notifications.rs:549— dl_ui::notifications::show_notification has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_ui::relative_time_range::edit_boundary_ui (cognitive 23) crates/viewer/dl_ui/src/relative_time_range.rs:41— dl_ui::relative_time_range::edit_boundary_ui has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (6 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.
dl_view::query::latest_at_with_blueprint_resolved_data_polymorphic (cognitive 27) crates/viewer/dl_view/src/query.rs:415— dl_view::query::latest_at_with_blueprint_resolved_data_polymorphic has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view::query::range_with_blueprint_resolved_data_polymorphic (cognitive 24) crates/viewer/dl_view/src/query.rs:239— dl_view::query::range_with_blueprint_resolved_data_polymorphic has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (8 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view::query::component_not_found_error (cognitive 18) crates/viewer/dl_view/src/query.rs:145— dl_view::query::component_not_found_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view::view_property_ui::view_property_ui_impl (cognitive 16) crates/viewer/dl_view/src/view_property_ui.rs:72— dl_view::view_property_ui::view_property_ui_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, 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.
dl_tf::transform_forest::transforms_at (cognitive 23) crates/store/dl_tf/src/transform_forest.rs:719— dl_tf::transform_forest::transforms_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_tf::transform_queries::query_and_resolve_instance_poses_at_entity (cognitive 17) crates/store/dl_tf/src/transform_queries.rs:303— dl_tf::transform_queries::query_and_resolve_instance_poses_at_entity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 1 (nesting depth added 2). 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, 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.
dl_tf::transform_queries::query_and_resolve_tree_transform_at_entity (cognitive 16) crates/store/dl_tf/src/transform_queries.rs:160— dl_tf::transform_queries::query_and_resolve_tree_transform_at_entity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (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.
dl_tf::transform_resolution_cache::transform_cache_snapshot::latest_at (cognitive 16) crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs:139— dl_tf::transform_resolution_cache::transform_cache_snapshot::latest_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_mcap::decoders::protobuf::append_message_fields (cognitive 21) crates/store/dl_mcap/src/decoders/protobuf.rs:77— dl_mcap::decoders::protobuf::append_message_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_mcap::parsers::ros2msg::sensor_msgs::point_cloud_2::add_field_value (cognitive 20) crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs:213— dl_mcap::parsers::ros2msg::sensor_msgs::point_cloud_2::add_field_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_mcap::recover::reconstruct_summary (cognitive 20) crates/store/dl_mcap/src/recover.rs:217— dl_mcap::recover::reconstruct_summary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 pts), 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.
dl_mcap::recover::build_chunk_index (cognitive 19) crates/store/dl_mcap/src/recover.rs:78— dl_mcap::recover::build_chunk_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyFields: DesignTokens crates/viewer/dl_ui/src/design_tokens.rs:103— TooManyFields — 141 stored fields beside 41 methods. The bar is 30 stored fields; this is 111 over it, 4.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: App crates/viewer/dl_viewer/src/app/mod.rs:75— TooManyFields — 42 stored fields beside 84 methods. The bar is 30 stored fields; this is 12 over it, 1.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: QuerySnapshot crates/store/dl_datafusion/src/metrics_capture.rs:190— TooManyFields — 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17× 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: QueryMetrics crates/store/dl_datafusion/src/metrics_capture.rs:102— TooManyFields — 31 stored fields beside 1 method. 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.
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/store/dl_chunk/src/iter.rs:476— crates/store/dl_chunk/src/iter.rs:476-501 | crates/store/dl_chunk/src/iter.rs:553-590 | crates/store/dl_chunk/src/iter.rs:637-668 | crates/store/dl_chunk/src/iter.rs:778-825 — 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/store/dl_chunk/src/unit_chunk.rs:98— crates/store/dl_chunk/src/unit_chunk.rs:98-110 | crates/store/dl_chunk/src/unit_chunk.rs:151-163 | crates/store/dl_chunk/src/unit_chunk.rs:388-400 | crates/store/dl_chunk/src/unit_chunk.rs:431-443 — 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/viewer/dl_renderer/src/renderer/debug_overlay.rs:244— crates/viewer/dl_renderer/src/renderer/debug_overlay.rs:244-254 | crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:171-183 | crates/viewer/dl_renderer/src/renderer/world_grid.rs:197-207 | crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs:554-565 — 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) docs/snippets/all/descriptors/descr_builtin_archetype.rs:30— docs/snippets/all/descriptors/descr_builtin_archetype.rs:30-78 | docs/snippets/all/descriptors/descr_builtin_component.rs:40-83 | docs/snippets/all/descriptors/descr_custom_archetype.rs:75-121 | docs/snippets/all/descriptors/descr_custom_component.rs:35-76 — 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.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×4
Edited copy of a member (34 corresponding lines) docs/snippets/all/archetypes/points3d_column_updates.rs:5— docs/snippets/all/archetypes/points3d_column_updates.rs:5-43 | docs/snippets/all/archetypes/points3d_row_updates.rs:5-38 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (34 corresponding lines) crates/store/dl_datafusion/src/dataframe_query_provider.rs:826— crates/store/dl_datafusion/src/dataframe_query_provider.rs:826-874 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:448-481 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (34 corresponding lines) crates/utils/dl_arrow_util/src/arrays.rs:177— crates/utils/dl_arrow_util/src/arrays.rs:177-210 | crates/utils/dl_arrow_util/src/arrays.rs:215-248 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (34 corresponding lines) examples/python/using_index_values/using_index_values.py:53— examples/python/using_index_values/using_index_values.py:53-92 | examples/python/using_index_values/using_index_values.py:96-129 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (20 corresponding lines) · ×4
Edited copy of a member (20 corresponding lines) docs/snippets/all/archetypes/line_strips2d_batch.rs:3— docs/snippets/all/archetypes/line_strips2d_batch.rs:3-22 | docs/snippets/all/archetypes/line_strips3d_batch.rs:3-28 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) crates/store/dl_lenses_core/src/execute.rs:21— crates/store/dl_lenses_core/src/execute.rs:21-48 | crates/store/dl_lenses_core/src/execute.rs:56-75 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) crates/store/dl_chunk_store/src/lineage.rs:390— crates/store/dl_chunk_store/src/lineage.rs:390-409 | crates/store/dl_chunk_store/src/lineage.rs:427-446 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) crates/top/dl_sdk/src/recording_stream.rs:206— crates/top/dl_sdk/src/recording_stream.rs:206-227 | crates/top/dl_sdk/src/recording_stream.rs:233-252 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (26 lines × 2) crates/store/dl_datafusion/src/dataframe_query_provider.rs:555— crates/store/dl_datafusion/src/dataframe_query_provider.rs:555-580 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:285-310 — before extracting anything, compare `crates/store/dl_datafusion/src/dataframe_query_provider.rs` and `crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 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 (26 lines × 2) crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:229— crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:229-254 | crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:301-326 — both copies are in the same file, so extract the 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 `crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:229` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:228` calls `associated_entity_path` and `crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:300` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (26 lines × 2) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:718— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:718-743 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:731-756 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:718` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (26 lines × 2) dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:118— dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:118-143 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:51-76 — before extracting anything, compare `dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py` and `dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 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. Read the line range as the matched WINDOW rather than a finished unit: at `dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:118` 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 (23 lines × 2) crates/store/dl_chunk_store/src/gc.rs:532— crates/store/dl_chunk_store/src/gc.rs:532-554 | crates/store/dl_chunk_store/src/gc.rs:578-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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_chunk_store/src/gc.rs:532` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/store/dl_chunk_store/src/gc.rs:570` calls `time_range` and `crates/store/dl_chunk_store/src/gc.rs:524` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (23 lines × 2) crates/viewer/dl_component_ui/src/line_strip.rs:24— crates/viewer/dl_component_ui/src/line_strip.rs:24-46 | crates/viewer/dl_component_ui/src/line_strip.rs:89-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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_component_ui/src/line_strip.rs:24` 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 first that the copies are not typed on the same thing: the declarations holding them bind `value` to `&mut MaybeMutRef<'_, LineStrip3D>` in one and `&mut MaybeMutRef<'_, LineStrip2D>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/viewer/dl_component_ui/src/line_strip.rs:47` calls `col`, `label` and `crates/viewer/dl_component_ui/src/line_strip.rs:112` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (23 lines × 2) crates/viewer/dl_selection_panel/src/view_entity_picker.rs:338— crates/viewer/dl_selection_panel/src/view_entity_picker.rs:338-360 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:110-132 — before extracting anything, compare `crates/viewer/dl_selection_panel/src/view_entity_picker.rs` and `crates/viewer/dl_time_panel/src/streams_tree_data.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_selection_panel/src/view_entity_picker.rs:338` 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 (23 lines × 2) crates/viewer/dl_selection_panel/src/view_entity_picker.rs:408— crates/viewer/dl_selection_panel/src/view_entity_picker.rs:408-430 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:178-200 — before extracting anything, compare `crates/viewer/dl_selection_panel/src/view_entity_picker.rs` and `crates/viewer/dl_time_panel/src/streams_tree_data.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_selection_panel/src/view_entity_picker.rs:408` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (19 lines × 2) crates/store/dl_datafusion/src/dataframe_query_provider.rs:856— crates/store/dl_datafusion/src/dataframe_query_provider.rs:856-874 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:463-481 — before extracting anything, compare `crates/store/dl_datafusion/src/dataframe_query_provider.rs` and `crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_datafusion/src/dataframe_query_provider.rs:856` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:188— crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:188-206 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:360-378 — both copies are in the same file, so extract the 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 `crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:188` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (19 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:34— crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:34-52 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:43-61 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:34` 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 (19 lines × 2) crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:285— crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:285-303 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:329-347 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:285` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:128— crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:128-145 | crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs:40-57 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (18 lines × 2) crates/store/dl_server/src/store/in_memory_store.rs:234— crates/store/dl_server/src/store/in_memory_store.rs:234-251 | crates/store/dl_server/src/store/in_memory_store.rs:310-327 — both copies are in the same file, so extract the block into 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/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:137— crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:137-154 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:182-199 — both copies are in the same file, so extract the 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 `crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:137` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) crates/viewer/dl_selection_panel/src/view_entity_picker.rs:364— crates/viewer/dl_selection_panel/src/view_entity_picker.rs:364-381 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:137-154 — before extracting anything, compare `crates/viewer/dl_selection_panel/src/view_entity_picker.rs` and `crates/viewer/dl_time_panel/src/streams_tree_data.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_selection_panel/src/view_entity_picker.rs:364` 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 (15–16 lines × 2) crates/store/dl_log_types/src/path/entity_path_part.rs:60— crates/store/dl_log_types/src/path/entity_path_part.rs:60-75 | crates/store/dl_log_types/src/path/entity_path_part.rs:122-136 — both copies are in the same file, so extract the 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 `crates/store/dl_log_types/src/path/entity_path_part.rs:60` 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 (15–16 lines × 2) crates/store/dl_redap_client/src/connection_client.rs:1181— crates/store/dl_redap_client/src/connection_client.rs:1181-1196 | crates/store/dl_redap_client/src/connection_client.rs:1235-1249 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_client/src/connection_client.rs:1181` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15–16 lines × 2) crates/viewer/dl_redap_browser/src/servers.rs:549— crates/viewer/dl_redap_browser/src/servers.rs:549-564 | crates/viewer/dl_redap_browser/src/servers.rs:600-614 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_redap_browser/src/servers.rs:549` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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.
Duplicated block (15–16 lines × 2) crates/viewer/dl_view/src/query.rs:304— crates/viewer/dl_view/src/query.rs:304-319 | crates/viewer/dl_view/src/query.rs:488-502 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view/src/query.rs:304` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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.
Duplicated block (13–15 lines × 2) crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:66— crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:66-78 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:117-131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:66` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–15 lines × 2) crates/viewer/dl_viewport/src/view_highlights.rs:48— crates/viewer/dl_viewport/src/view_highlights.rs:48-60 | crates/viewer/dl_viewport/src/view_highlights.rs:100-114 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewport/src/view_highlights.rs:48` 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.
Duplicated block (13–15 lines × 2) docs/snippets/all/howto/any_batch_value_column_updates.rs:31— docs/snippets/all/howto/any_batch_value_column_updates.rs:31-45 | docs/snippets/all/howto/any_values_column_updates.rs:33-45 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/howto/any_batch_value_column_updates.rs:31` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–15 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:494— crates/store/dl_redap_tests/src/utils/dalaran.rs:494-506 | crates/store/dl_redap_tests/src/utils/dalaran.rs:669-683 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:494` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–14 lines × 2) crates/store/dl_data_source/src/stream_dlr_from_http.rs:21— crates/store/dl_data_source/src/stream_dlr_from_http.rs:21-32 | crates/viewer/dl_viewer_context/src/open_url.rs:867-880 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_data_source/src/stream_dlr_from_http.rs:21` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (12–14 lines × 2) crates/viewer/dl_time_panel/src/time_panel.rs:913— crates/viewer/dl_time_panel/src/time_panel.rs:913-926 | crates/viewer/dl_time_panel/src/time_panel.rs:1107-1118 — both copies are in the same file, so extract the 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 `crates/viewer/dl_time_panel/src/time_panel.rs:913` 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.
Duplicated block (12–14 lines × 2) crates/viewer/dl_view_spatial/src/view_3d.rs:585— crates/viewer/dl_view_spatial/src/view_3d.rs:585-596 | crates/viewer/dl_view_text_log/src/view_class.rs:498-511 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/view_3d.rs:585` 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.
Duplicated block (12–14 lines × 2) dalaran_py/src/catalog/connection_handle.rs:469— dalaran_py/src/catalog/connection_handle.rs:469-480 | dalaran_py/src/catalog/registration_handle.rs:186-199 — 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 `dalaran_py/src/catalog/connection_handle.rs:469` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) crates/utils/dl_perf_telemetry/src/prometheus.rs:299— crates/utils/dl_perf_telemetry/src/prometheus.rs:299-308 | crates/utils/dl_perf_telemetry/src/prometheus.rs:330-339 | crates/utils/dl_perf_telemetry/src/prometheus.rs:361-370 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_perf_telemetry/src/prometheus.rs:299` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/utils/dl_perf_telemetry/src/prometheus.rs:340` calls `value` and `crates/utils/dl_perf_telemetry/src/prometheus.rs:311` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 3) crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:141— crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:141-150 | crates/viewer/dl_view_spatial/src/proc_mesh.rs:508-517 | crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs:222-231 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:141` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:69— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:69-78 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:66-75 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:67-76 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:69` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs:12— crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs:12-21 | crates/store/dl_lenses/src/semantic/foxglove/compressed_video.rs:12-21 | crates/store/dl_lenses/src/semantic/foxglove/raw_image.rs:14-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (5 lines × 3) crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:324— crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:324-331 | crates/viewer/dl_view_time_series/src/series_query.rs:214-218 | crates/viewer/dl_view_time_series/src/series_query.rs:371-375 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:324` 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.
Duplicated block (5 lines × 3) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:669— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:669-695 | crates/viewer/dl_renderer/src/renderer/lines.rs:629-633 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:656-660 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/lines.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:669` 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.
Duplicated block (5 lines × 3) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:577— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:577-581 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:586-590 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:596-601 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:577` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (5 lines × 3) crates/viewer/dl_renderer/src/colormap.rs:319— crates/viewer/dl_renderer/src/colormap.rs:319-323 | crates/viewer/dl_renderer/src/colormap.rs:337-341 | crates/viewer/dl_renderer/src/colormap.rs:381-385 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) crates/viewer/dl_component_ui/src/geo_line_string.rs:10— crates/viewer/dl_component_ui/src/geo_line_string.rs:10-15 | crates/viewer/dl_component_ui/src/line_strip.rs:12-17 | crates/viewer/dl_component_ui/src/line_strip.rs:77-82 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_component_ui/src/geo_line_string.rs:10` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `&mut MaybeMutRef<'_, GeoLineString>` in one and `&mut MaybeMutRef<'_, LineStrip3D>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (6 lines × 3) docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:10— docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:10-15 | docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:19-26 | docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:30-37 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:10` 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 (6 lines × 3) crates/viewer/dl_component_ui/src/geo_line_string.rs:36— crates/viewer/dl_component_ui/src/geo_line_string.rs:36-41 | crates/viewer/dl_component_ui/src/line_strip.rs:39-44 | crates/viewer/dl_component_ui/src/line_strip.rs:104-109 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_component_ui/src/geo_line_string.rs:36` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 3) crates/store/dl_redap_tests/src/utils/dalaran.rs:108— crates/store/dl_redap_tests/src/utils/dalaran.rs:108-113 | crates/store/dl_redap_tests/src/utils/dalaran.rs:370-375 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1188-1193 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Low contrast colour pair in CSS (4.1:1) dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:493— `.sm-dox ul a:hover, .sm-dox ul a:active, .sm-dox ul a:focus` sets color: #1C1D1F on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
Low contrast colour pair in CSS (4.1:1) dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:515— `.sm-dox a:hover, .sm-dox a:active, .tablist li a:hover` sets color: #1C1D1F on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
Low contrast colour pair in CSS (4.1:1) dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css:713— `#MSearchSelectWindow a.SelectItem:hover` sets color: #1C1D1F on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
TimeControl::handle_time_command (cyclomatic 59) crates/viewer/dl_viewer_context/src/time_control/command.rs:202— TimeControl::handle_time_command 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.
TimeControl::update (cyclomatic 25) crates/viewer/dl_viewer_context/src/time_control/mod.rs:435— TimeControl::update 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.
TimeControl::update_from_blueprint (cyclomatic 17) crates/viewer/dl_viewer_context/src/time_control/mod.rs:341— TimeControl::update_from_blueprint 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.
ChunkStore::insert_chunk_impl (cyclomatic 43) crates/store/dl_chunk_store/src/writes.rs:280— ChunkStore::insert_chunk_impl has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ChunkStore::find_and_elect_compaction_candidate (cyclomatic 20) crates/store/dl_chunk_store/src/writes.rs:917— ChunkStore::find_and_elect_compaction_candidate 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.
ChunkStore::remove_chunk_from_virtual_indices (cyclomatic 17) crates/store/dl_chunk_store/src/gc.rs:498— ChunkStore::remove_chunk_from_virtual_indices 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.
dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output (cyclomatic 26) crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs:648— dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
dl_video::decode::av1::create_frame (cyclomatic 21) crates/utils/dl_video/src/decode/av1.rs:142— dl_video::decode::av1::create_frame has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
dl_video::demux::mp4::subsampling_mode (cyclomatic 16) crates/utils/dl_video/src/demux/mp4.rs:301— dl_video::demux::mp4::subsampling_mode 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.
dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk (cyclomatic 20) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1974— dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk 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.
dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components (cyclomatic 20) crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs:196— dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components 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.
dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image (cyclomatic 16) crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs:249— dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image 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. This is NOT this file's highest cyclomatic complexity: dl_viewer_context::gpu_bridge::image_to_gpu::general_texture_creation_desc_from_image (cyclomatic 33) 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.
ViewerOpenUrl::open (cyclomatic 18) crates/viewer/dl_viewer_context/src/open_url.rs:570— ViewerOpenUrl::open 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.
ViewerOpenUrl::sharable_url (cyclomatic 17) crates/viewer/dl_viewer_context/src/open_url.rs:424— ViewerOpenUrl::sharable_url has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
ViewerOpenUrl::parse_with_options (cyclomatic 16) crates/viewer/dl_viewer_context/src/open_url.rs:169— ViewerOpenUrl::parse_with_options 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.
dl_redap_browser::servers::error_ui (cognitive 54) crates/viewer/dl_redap_browser/src/servers.rs:428— dl_redap_browser::servers::error_ui has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 4 (13 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.
dl_redap_browser::server_modal::auth_ui (cognitive 19) crates/viewer/dl_redap_browser/src/server_modal.rs:417— dl_redap_browser::server_modal::auth_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 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.
dl_redap_browser::folder_card_ui::collect_cards (cognitive 17) crates/viewer/dl_redap_browser/src/folder_card_ui.rs:116— dl_redap_browser::folder_card_ui::collect_cards has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 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.
dl_time_panel::time_selection_ui::loop_selection_ui (cognitive 52) crates/viewer/dl_time_panel/src/time_selection_ui.rs:57— dl_time_panel::time_selection_ui::loop_selection_ui has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 6 (nesting depth added 24). 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.
dl_time_panel::data_density_graph::paint_loaded_indicator_bar (cognitive 26) crates/viewer/dl_time_panel/src/data_density_graph.rs:422— dl_time_panel::data_density_graph::paint_loaded_indicator_bar has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2, loops 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.
dl_time_panel::data_density_graph::build_density_graph (cognitive 17) crates/viewer/dl_time_panel/src/data_density_graph.rs:576— dl_time_panel::data_density_graph::build_density_graph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChunkFetcher::fetch_inner (cognitive 44) crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:1198— ChunkFetcher::fetch_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChunkFetcher::next_chunk (cognitive 41) crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:881— ChunkFetcher::next_chunk has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ChunkFetcher::high_prio_chunk_stage (cognitive 21) crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:1004— ChunkFetcher::high_prio_chunk_stage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_dataframe_ui::preview_renderer::preview_timeline (cognitive 37) crates/viewer/dl_dataframe_ui/src/preview_renderer.rs:379— dl_dataframe_ui::preview_renderer::preview_timeline has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (25 pts), boolean chains 7, loops 1 (5 pts) (nesting depth added 22). 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.
dl_dataframe_ui::grid_view::flag_button (cognitive 24) crates/viewer/dl_dataframe_ui/src/grid_view.rs:284— dl_dataframe_ui::grid_view::flag_button has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 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.
dl_dataframe_ui::grid_view::card_content_ui (cognitive 16) crates/viewer/dl_dataframe_ui/src/grid_view.rs:128— dl_dataframe_ui::grid_view::card_content_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, 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.
RawRrdManifest::check_index_columns_are_correct (cognitive 36) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:951— RawRrdManifest::check_index_columns_are_correct has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 5 (15 pts), loops 3 (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.
RawRrdManifest::check_manifest_schema_matches_sorbet_schema (cognitive 34) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1112— RawRrdManifest::check_manifest_schema_matches_sorbet_schema has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RawRrdManifest::calc_temporal_map (cognitive 21) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:532— RawRrdManifest::calc_temporal_map has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_importer::importer_dlr::decode_and_stream (cognitive 32) crates/store/dl_importer/src/importer_dlr.rs:194— dl_importer::importer_dlr::decode_and_stream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_importer::import_file::import (cognitive 18) crates/store/dl_importer/src/import_file.rs:121— dl_importer::import_file::import 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.
dl_importer::importer_mcap::robot_description::extract_urdf_from_robot_descriptions (cognitive 17) crates/store/dl_importer/src/importer_mcap/robot_description.rs:17— dl_importer::importer_mcap::robot_description::extract_urdf_from_robot_descriptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (5 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_renderer::importer::gltf::import_mesh (cognitive 32) crates/viewer/dl_renderer/src/importer/gltf.rs:175— dl_renderer::importer::gltf::import_mesh has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_renderer::importer::gltf::load_gltf_from_buffer (cognitive 17) crates/viewer/dl_renderer/src/importer/gltf.rs:43— dl_renderer::importer::gltf::load_gltf_from_buffer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_renderer::renderer::plane_clustering::overlapping_clusters (cognitive 16) crates/viewer/dl_renderer/src/renderer/plane_clustering.rs:112— dl_renderer::renderer::plane_clustering::overlapping_clusters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 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.
dl_grpc_server::spawn_from_rx_set (cognitive 28) crates/store/dl_grpc_server/src/lib.rs:455— dl_grpc_server::spawn_from_rx_set has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_grpc_server::spawn_with_recv_and_services (cognitive 23) crates/store/dl_grpc_server/src/lib.rs:565— dl_grpc_server::spawn_with_recv_and_services has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 3 (7 pts), loops 1 (nesting depth added 14). 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.
dl_grpc_server::serve_from_channel (cognitive 21) crates/store/dl_grpc_server/src/lib.rs:372— dl_grpc_server::serve_from_channel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 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.
dl_view_tensor::dimension_mapping::find_width_height_dim_indices (cognitive 24) crates/viewer/dl_view_tensor/src/dimension_mapping.rs:194— dl_view_tensor::dimension_mapping::find_width_height_dim_indices has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_tensor::view_class::paint_axis_names (cognitive 24) crates/viewer/dl_view_tensor/src/view_class.rs:512— dl_view_tensor::view_class::paint_axis_names has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (24 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.
dl_view_tensor::tensor_dimension_mapper::dimension_mapping_ui (cognitive 17) crates/viewer/dl_view_tensor/src/tensor_dimension_mapper.rs:167— dl_view_tensor::tensor_dimension_mapper::dimension_mapping_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ViewportBlueprint::save_tree_as_containers (cognitive 22) crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:833— ViewportBlueprint::save_tree_as_containers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ViewportBlueprint::set_content_visibility (cognitive 21) crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:707— ViewportBlueprint::set_content_visibility has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
ViewportBlueprint::from_db (cognitive 16) crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:81— ViewportBlueprint::from_db has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (6 pts), if/else 3 (5 pts), match/switch 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (5 members, 50+ identical tokens) crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:183— crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:183-197 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1596-1612 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1622-1638 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1650-1666 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1680-1696 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:5— crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:5-24 | crates/viewer/dl_viewer/data/quick_start_guides/quick_start_spawn.rs:5-25 | docs/snippets/all/howto/set_sinks.rs:5-34 | docs/snippets/all/quick_start/quick_start_connect.rs:5-25 | docs/snippets/all/quick_start/quick_start_spawn.rs:5-27 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) crates/store/dl_redap_tests/src/utils/dalaran.rs:76— crates/store/dl_redap_tests/src/utils/dalaran.rs:76-171 | crates/store/dl_redap_tests/src/utils/dalaran.rs:209-270 | crates/store/dl_redap_tests/src/utils/dalaran.rs:321-574 | crates/store/dl_redap_tests/src/utils/dalaran.rs:599-694 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1154-1235 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication· Edited copy of a member (33 corresponding lines) · ×3
Edited copy of a member (33 corresponding lines) crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:67— crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:67-130 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:58-90 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (33 corresponding lines) dalaran_py/src/chunk_stream/mcap_reader.rs:493— dalaran_py/src/chunk_stream/mcap_reader.rs:493-525 | dalaran_py/src/chunk_stream/urdf_tree_stream.rs:26-58 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (33 corresponding lines) crates/store/dl_importer/src/importer_lerobot.rs:59— crates/store/dl_importer/src/importer_lerobot.rs:59-91 | crates/store/dl_importer/src/importer_lerobot.rs:97-129 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (40 corresponding lines) · ×3
Edited copy of a member (40 corresponding lines) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:68— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:68-107 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:66-105 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (40 corresponding lines) crates/store/dl_dataframe/src/query.rs:1281— crates/store/dl_dataframe/src/query.rs:1281-1320 | crates/store/dl_dataframe/src/query.rs:1745-1785 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (40 corresponding lines) crates/store/dl_chunk_store/src/query.rs:558— crates/store/dl_chunk_store/src/query.rs:558-600 | crates/store/dl_chunk_store/src/query.rs:611-650 — These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (31 lines × 2) crates/viewer/dl_ui/src/command/recording_command.rs:402— crates/viewer/dl_ui/src/command/recording_command.rs:402-432 | crates/viewer/dl_ui/src/command/ui_command.rs:452-482 — before extracting anything, compare `crates/viewer/dl_ui/src/command/recording_command.rs` and `crates/viewer/dl_ui/src/command/ui_command.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (31 lines × 2) crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:403— crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:403-433 | crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:441-471 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:403` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (31 lines × 2) scripts/ci/pixi_install_wheel.py:54— scripts/ci/pixi_install_wheel.py:54-84 | scripts/ci/uv_install_wheel.py:48-78 — before extracting anything, compare `scripts/ci/pixi_install_wheel.py` and `scripts/ci/uv_install_wheel.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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 (26–27 lines × 2) crates/store/dl_redap_client/src/grpc.rs:472— crates/store/dl_redap_client/src/grpc.rs:472-498 | crates/store/dl_redap_client/src/grpc.rs:529-554 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_client/src/grpc.rs:472` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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.
Duplicated block (26–27 lines × 2) crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:809— crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:809-834 | crates/viewer/dl_time_panel/src/time_panel.rs:1356-1382 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:809` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (26–27 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:93— crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:93-119 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:111-136 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:93` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (27 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:393— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:393-419 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:245-271 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:393` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (27 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:544— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:544-570 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:424-450 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:544` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (27 lines × 2) scripts/upload_dlr.py:62— scripts/upload_dlr.py:62-88 | scripts/upload_image.py:285-311 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (24 lines × 2) crates/store/dl_datafusion/src/dataframe_query_provider.rs:589— crates/store/dl_datafusion/src/dataframe_query_provider.rs:589-612 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:317-340 — before extracting anything, compare `crates/store/dl_datafusion/src/dataframe_query_provider.rs` and `crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 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 (24 lines × 2) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:226— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:226-249 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:221-244 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:226` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 2) examples/python/any_scalar/any_scalar/market_demo.py:98— examples/python/any_scalar/any_scalar/market_demo.py:98-121 | examples/python/any_scalar/any_scalar/market_demo.py:122-145 — both copies are in the same file, so extract the block into 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/top/dalaran/src/commands/dlr/merge_optimize.rs:492— crates/top/dalaran/src/commands/dlr/merge_optimize.rs:492-502 | crates/top/dalaran/src/commands/dlr/stats.rs:170-181 — 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 `crates/top/dalaran/src/commands/dlr/merge_optimize.rs:492` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–12 lines × 2) crates/top/dalaran/src/commands/dlr/merge_optimize.rs:497— crates/top/dalaran/src/commands/dlr/merge_optimize.rs:497-507 | crates/top/dalaran/src/commands/dlr/split.rs:181-192 — 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 `crates/top/dalaran/src/commands/dlr/merge_optimize.rs:497` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–12 lines × 2) crates/viewer/dl_view_spatial/src/ui_2d.rs:338— crates/viewer/dl_view_spatial/src/ui_2d.rs:338-348 | crates/viewer/dl_view_spatial/src/ui_3d.rs:151-162 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 4) crates/store/dl_chunk/src/unit_chunk.rs:101— crates/store/dl_chunk/src/unit_chunk.rs:101-110 | crates/store/dl_chunk/src/unit_chunk.rs:154-163 | crates/store/dl_chunk/src/unit_chunk.rs:391-400 | crates/store/dl_chunk/src/unit_chunk.rs:434-443 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_chunk/src/unit_chunk.rs:101` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 4) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:455— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:455-464 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:789-798 | crates/viewer/dl_renderer/src/renderer/lines.rs:759-768 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:817-826 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs` and `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:455` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (10 lines × 4) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:212— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:212-221 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:214-223 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:216-225 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:219-228 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:212` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7–8 lines × 2) crates/utils/dl_video/src/decode/mod.rs:284— crates/utils/dl_video/src/decode/mod.rs:284-291 | crates/utils/dl_video/src/decode/mod.rs:338-344 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_video/src/decode/mod.rs:284` 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.
Duplicated block (7–8 lines × 2) crates/viewer/dl_viewer/src/app/mod.rs:832— crates/viewer/dl_viewer/src/app/mod.rs:832-839 | crates/viewer/dl_viewer/src/app/mod.rs:850-856 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7–8 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:359— crates/store/dl_redap_tests/src/utils/dalaran.rs:359-365 | crates/store/dl_redap_tests/src/utils/dalaran.rs:624-631 — both copies are in the same file, so extract the block into 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/store/dl_redap_tests/src/utils/dalaran.rs:81— crates/store/dl_redap_tests/src/utils/dalaran.rs:81-95 | crates/store/dl_redap_tests/src/utils/dalaran.rs:214-228 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1162-1176 — 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 (15 lines × 3) crates/store/dl_redap_tests/src/utils/dalaran.rs:712— crates/store/dl_redap_tests/src/utils/dalaran.rs:712-726 | crates/store/dl_redap_tests/src/utils/dalaran.rs:839-853 | crates/store/dl_redap_tests/src/utils/dalaran.rs:888-902 — 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 (15 lines × 3) examples/python/structure_from_motion/structure_from_motion/read_write_model.py:106— examples/python/structure_from_motion/structure_from_motion/read_write_model.py:106-120 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:191-205 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:313-327 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Unfinished stub — panics or fails with a "not implemented" message crates/store/dl_server/src/dalaran_cloud/mod.rs:2065— `do_maintenance`'s whole body panics or returns an error whose message says it isn't finished — generated scaffolding that was never completed. Implement it or remove it.
Unfinished stub — panics or fails with a "not implemented" message crates/store/dl_server/src/dalaran_cloud/mod.rs:2074— `do_global_maintenance`'s whole body panics or returns an error whose message says it isn't finished — generated scaffolding that was never completed. Implement it or remove it.
Unfinished stub — panics or fails with a "not implemented" message crates/store/dl_server/src/store/table.rs:310— `create_table_entry`'s whole body panics or returns an error whose message says it isn't finished — generated scaffolding that was never completed. Implement it or remove it.
Unfinished stub — panics or fails with a "not implemented" message crates/store/dl_server/src/dalaran_cloud/mod.rs:2065— `do_maintenance`'s whole body panics or returns an error whose message says it isn't finished — a not-implemented stub in ordinary clothes. Implement it or remove it.
Unfinished stub — panics or fails with a "not implemented" message crates/store/dl_server/src/dalaran_cloud/mod.rs:2074— `do_global_maintenance`'s whole body panics or returns an error whose message says it isn't finished — a not-implemented stub in ordinary clothes. Implement it or remove it.
Unfinished stub — panics or fails with a "not implemented" message crates/store/dl_server/src/store/table.rs:310— `create_table_entry`'s whole body panics or returns an error whose message says it isn't finished — a not-implemented stub in ordinary clothes. Implement it or remove it.
Hollow method — returns a constant without doing the work crates/viewer/dl_gamepad/src/web.rs:11— `navigation_from_active_gamepad` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
Hollow method — returns a constant without doing the work crates/viewer/dl_renderer/src/file_server.rs:313— `collect` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
Hollow method — returns a constant without doing the work dalaran_py/src/catalog/dataframe_rendering.rs:62— `build_table_container_end` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
X2 · Cancellation propagation· Async function without AbortSignal · ×3
Async function without AbortSignal: url_exists dalaran_notebook/src/dalaran_notebook/error_widget.js:18— `url_exists` 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: fetch_viewer_wasm dalaran_js/web-viewer/index.ts:39— `fetch_viewer_wasm` 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: isPublished dalaran_js/scripts/common.mjs:84— `isPublished` 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 })`.
QueryCache::on_events (cyclomatic 37) crates/store/dl_query/src/cache.rs:312— QueryCache::on_events has cyclomatic complexity 37 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
QueryCache::latest_at (cyclomatic 20) crates/store/dl_query/src/latest_at.rs:43— QueryCache::latest_at 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.
SpatialView3D::view_3d (cyclomatic 28) crates/viewer/dl_view_spatial/src/ui_3d.rs:124— SpatialView3D::view_3d 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.
SpatialView3D::on_register (cyclomatic 16) crates/viewer/dl_view_spatial/src/view_3d.rs:66— SpatialView3D::on_register 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.
Expr::eval (cyclomatic 25) crates/store/dl_lenses_core/src/selector/eval.rs:420— Expr::eval has cyclomatic complexity 25 (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.
Expr::fmt (cyclomatic 16) crates/store/dl_lenses_core/src/selector/parser.rs:171— Expr::fmt has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
ChunkFetcher::next_chunk (cyclomatic 22) crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:881— ChunkFetcher::next_chunk 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.
ChunkFetcher::fetch_inner (cyclomatic 19) crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:1198— ChunkFetcher::fetch_inner 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.
dl_lenses_core::execute::execute (cyclomatic 20) crates/store/dl_lenses_core/src/execute.rs:329— dl_lenses_core::execute::execute 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.
dl_lenses_core::plan::plan (cyclomatic 16) crates/store/dl_lenses_core/src/plan.rs:93— dl_lenses_core::plan::plan 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.
dl_sdk::spawn::spawn (cyclomatic 20) crates/top/dl_sdk/src/spawn.rs:206— dl_sdk::spawn::spawn 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.
dl_sdk::recording_stream::forwarding_thread (cyclomatic 16) crates/top/dl_sdk/src/recording_stream.rs:1593— dl_sdk::recording_stream::forwarding_thread has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (handle_cmd). 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.
dl_selection_panel::view_entity_picker::add_entities_line_ui (cyclomatic 20) crates/viewer/dl_selection_panel/src/view_entity_picker.rs:179— dl_selection_panel::view_entity_picker::add_entities_line_ui 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.
dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui (cyclomatic 18) crates/viewer/dl_selection_panel/src/view_space_origin_ui.rs:79— dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui 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.
dl_ui::drag_and_drop::find_drop_target (cyclomatic 20) crates/viewer/dl_ui/src/drag_and_drop.rs:178— dl_ui::drag_and_drop::find_drop_target 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.
dl_ui::text_edit::autocomplete_text_edit (cyclomatic 19) crates/viewer/dl_ui/src/text_edit.rs:17— dl_ui::text_edit::autocomplete_text_edit 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.
SegmentUrlUdf::return_type (cyclomatic 19) dalaran_py/src/catalog/segment_url_udf.rs:72— SegmentUrlUdf::return_type 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.
SegmentUrlUdf::invoke_with_args (cyclomatic 16) dalaran_py/src/catalog/segment_url_udf.rs:168— SegmentUrlUdf::invoke_with_args 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.
dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components (cyclomatic 18) crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:29— dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components has cyclomatic complexity 18 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata (cyclomatic 16) crates/store/dl_sorbet/src/dataframe_to_chunks.rs:407— dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata 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.
ImageInfo::get_xyc (cyclomatic 18) crates/viewer/dl_viewer_context/src/image_info.rs:253— ImageInfo::get_xyc 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.
ImageInfo::to_dynamic_image (cyclomatic 18) crates/viewer/dl_viewer_context/src/image_info.rs:357— ImageInfo::to_dynamic_image 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.
QueryCache::on_events (cognitive 99) crates/store/dl_query/src/cache.rs:312— QueryCache::on_events has cognitive complexity 99 (threshold 15). Drivers by points: loops 20 (62 pts), if/else 10 (30 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 65). 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.
QueryCache::latest_at (cognitive 38) crates/store/dl_query/src/latest_at.rs:43— QueryCache::latest_at has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DalaranCloudHandler::query_dataset (cognitive 69) crates/store/dl_server/src/dalaran_cloud/mod.rs:1441— DalaranCloudHandler::query_dataset has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 7 (21 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DalaranCloudHandler::find_entries (cognitive 17) crates/store/dl_server/src/dalaran_cloud/mod.rs:655— DalaranCloudHandler::find_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_text_log::view_class::table_ui (cognitive 49) crates/viewer/dl_view_text_log/src/view_class.rs:296— dl_view_text_log::view_class::table_ui has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 6, match/switch 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_text_log::view_class::view_property_ui_rows (cognitive 19) crates/viewer/dl_view_text_log/src/view_class.rs:495— dl_view_text_log::view_class::view_property_ui_rows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SplitCommand::run (cognitive 48) crates/top/dalaran/src/commands/dlr/split.rs:85— SplitCommand::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 9 (15 pts), match/switch 3 (9 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SplitCommand::split_store (cognitive 28) crates/top/dalaran/src/commands/dlr/split.rs:532— SplitCommand::split_store has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), boolean chains 3 (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.
SeriesPointsSystem::load_series (cognitive 43) crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:188— SeriesPointsSystem::load_series has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 6 (19 pts), boolean chains 2, match/switch 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.
SeriesPointsSystem::build_draw_data (cognitive 17) crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:109— SeriesPointsSystem::build_draw_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_component_ui::variant_uis::redap_uri_button::redap_uri_button (cognitive 39) crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs:15— dl_component_ui::variant_uis::redap_uri_button::redap_uri_button has cognitive complexity 39 (threshold 15). Drivers by points: if/else 27 (36 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_component_ui::datatype_uis::enum_ui::edit_view_enum_impl (cognitive 18) crates/viewer/dl_component_ui/src/datatype_uis/enum_ui.rs:65— dl_component_ui::datatype_uis::enum_ui::edit_view_enum_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_arrow_util::format::format_dataframe_without_metadata (cognitive 38) crates/utils/dl_arrow_util/src/format.rs:331— dl_arrow_util::format::format_dataframe_without_metadata has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (7 pts), match/switch 2 (7 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.
dl_arrow_util::compare::ensure_buffers_equal (cognitive 19) crates/utils/dl_arrow_util/src/compare.rs:61— dl_arrow_util::compare::ensure_buffers_equal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SpatialView3D::view_3d (cognitive 38) crates/viewer/dl_view_spatial/src/ui_3d.rs:124— SpatialView3D::view_3d has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SpatialView3D::on_register (cognitive 19) crates/viewer/dl_view_spatial/src/view_3d.rs:66— SpatialView3D::on_register has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply (cognitive 36) crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:308— dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_sdk_types::archetypes::points3d_ext::read_ply (cognitive 25) crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs:224— dl_sdk_types::archetypes::points3d_ext::read_ply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_sdk::spawn::spawn (cognitive 35) crates/top/dl_sdk/src/spawn.rs:206— dl_sdk::spawn::spawn has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_sdk::recording_stream::forwarding_thread (cognitive 18) crates/top/dl_sdk/src/recording_stream.rs:1593— dl_sdk::recording_stream::forwarding_thread has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (handle_cmd). 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.
SegmentUrlUdf::invoke_with_args (cognitive 34) dalaran_py/src/catalog/segment_url_udf.rs:168— SegmentUrlUdf::invoke_with_args has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SegmentUrlUdf::return_type (cognitive 18) dalaran_py/src/catalog/segment_url_udf.rs:72— SegmentUrlUdf::return_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata (cognitive 31) crates/store/dl_sorbet/src/dataframe_to_chunks.rs:407— dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components (cognitive 21) crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:29— dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). Of this number, 20 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.
Expr::eval (cognitive 28) crates/store/dl_lenses_core/src/selector/eval.rs:420— Expr::eval has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 3 (6 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Expr::fmt (cognitive 18) crates/store/dl_lenses_core/src/selector/parser.rs:171— Expr::fmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_log_encoding::dlr::stream_from_http::stream_from_http (cognitive 28) crates/store/dl_log_encoding/src/dlr/stream_from_http.rs:45— dl_log_encoding::dlr::stream_from_http::stream_from_http has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 4 (12 pts), loops 1 (3 pts) (nesting depth added 19). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_log_encoding::dlr::stream_from_http::web_decode::decode_dlr_async (cognitive 16) crates/store/dl_log_encoding/src/dlr/stream_from_http.rs:166— dl_log_encoding::dlr::stream_from_http::web_decode::decode_dlr_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TilesDelegate::reports_button (cognitive 28) crates/viewer/dl_viewport/src/viewport_ui.rs:748— TilesDelegate::reports_button has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (11 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.
TilesDelegate::top_bar_right_ui (cognitive 21) crates/viewer/dl_viewport/src/viewport_ui.rs:574— TilesDelegate::top_bar_right_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 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.
ResolvedEntityPathFilter::is_superset_of (cognitive 27) crates/store/dl_log_types/src/path/entity_path_filter.rs:710— ResolvedEntityPathFilter::is_superset_of has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 4 (12 pts), loops 2, 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.
ResolvedEntityPathFilter::evaluate (cognitive 16) crates/store/dl_log_types/src/path/entity_path_filter.rs:779— ResolvedEntityPathFilter::evaluate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EntityPathPart::parse_forgiving_with_warning (cognitive 27) crates/store/dl_log_types/src/path/entity_path_part.rs:56— EntityPathPart::parse_forgiving_with_warning has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (9 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EntityPathPart::parse_strict (cognitive 20) crates/store/dl_log_types/src/path/entity_path_part.rs:121— EntityPathPart::parse_strict has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 2 (9 pts), if/else 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
VideoPlayer::enqueue_samples (cognitive 27) crates/utils/dl_video/src/player/mod.rs:620— VideoPlayer::enqueue_samples has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VideoPlayer::frame_at (cognitive 23) crates/utils/dl_video/src/player/mod.rs:492— VideoPlayer::frame_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_state_timeline::view_class::show_group (cognitive 25) crates/viewer/dl_view_state_timeline/src/view_class.rs:898— dl_view_state_timeline::view_class::show_group has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_view_state_timeline::view_class::compute_render_items (cognitive 21) crates/viewer/dl_view_state_timeline/src/view_class.rs:648— dl_view_state_timeline::view_class::compute_render_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), 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.
CachedTransformsForTimeline::remove_chunk (cognitive 24) crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:198— CachedTransformsForTimeline::remove_chunk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CachedTransformsForTimeline::add_temporal_chunk (cognitive 17) crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:115— CachedTransformsForTimeline::add_temporal_chunk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 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.
VideoStreamCache::handle_store_event (cognitive 24) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:305— VideoStreamCache::handle_store_event has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (10 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.
VideoStreamCache::on_store_events (cognitive 16) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1498— VideoStreamCache::on_store_events has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_log_types::path::entity_path_filter::split_whitespace_smart (cognitive 23) crates/store/dl_log_types/src/path/entity_path_filter.rs:210— dl_log_types::path::entity_path_filter::split_whitespace_smart has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_log_types::path::parse_path::entity_path_parts_from_tokens_strict (cognitive 18) crates/store/dl_log_types/src/path/parse_path.rs:269— dl_log_types::path::parse_path::entity_path_parts_from_tokens_strict has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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.
StoreHub::purge_fraction_of_ram (cognitive 23) crates/viewer/dl_viewer_context/src/store_hub.rs:1039— StoreHub::purge_fraction_of_ram has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StoreHub::gc_blueprints (cognitive 17) crates/viewer/dl_viewer_context/src/store_hub.rs:1206— StoreHub::gc_blueprints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (15 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.
dl_memory_view::flamegraph::render_flamegraph_node (cognitive 22) crates/viewer/dl_memory_view/src/flamegraph.rs:262— dl_memory_view::flamegraph::render_flamegraph_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_memory_view::flamegraph::flamegraph_ui (cognitive 18) crates/viewer/dl_memory_view/src/flamegraph.rs:156— dl_memory_view::flamegraph::flamegraph_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_lenses::semantic::foxglove::packed_element_field::extract_voxel_indices (cognitive 21) crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:244— dl_lenses::semantic::foxglove::packed_element_field::extract_voxel_indices has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
dl_lenses::semantic::ros2msg::ros_map_helpers::ros_map_buffer_to_image_buffer (cognitive 16) crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:101— dl_lenses::semantic::ros2msg::ros_map_helpers::ros_map_buffer_to_image_buffer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (50 corresponding lines) · ×2
Edited copy of a member (50 corresponding lines) crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:741— crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:741-790 | crates/viewer/dl_time_panel/src/time_panel.rs:1285-1335 — These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (50 corresponding lines) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:200— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:200-249 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:190-244 — These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (7 members, 50+ identical tokens) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:187— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:187-275 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:189-277 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:191-288 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:120-234 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:195-293 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:122-235 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:213-319 — These 7 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 7 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 7 times.
Members sharing a duplicated core (7 members, 50+ identical tokens) examples/python/face_tracking/face_tracking.py:325— examples/python/face_tracking/face_tracking.py:325-336 | examples/python/gesture_detection/gesture_detection.py:173-184 | examples/python/lidar/lidar/download_dataset.py:28-40 | examples/python/nuscenes_dataset/nuscenes_dataset/download_dataset.py:28-40 | examples/python/ocr/ocr.py:450-461 | examples/python/open_photogrammetry_format/open_photogrammetry_format.py:59-70 | scripts/upload_image.py:321-332 — These 7 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 7 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 7 times.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (6 members, 50+ identical tokens) crates/store/dl_lenses/src/op/semantic.rs:261— crates/store/dl_lenses/src/op/semantic.rs:261-275 | crates/store/dl_lenses/src/op/string.rs:11-26 | crates/store/dl_lenses/src/op/string.rs:31-46 | crates/store/dl_lenses/src/op/string.rs:51-66 | crates/store/dl_lenses/src/op/string.rs:71-86 | crates/store/dl_lenses/src/semantic/foxglove/log.rs:30-55 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) crates/utils/dl_perf_telemetry/src/prometheus.rs:212— crates/utils/dl_perf_telemetry/src/prometheus.rs:212-234 | crates/utils/dl_perf_telemetry/src/prometheus.rs:242-261 | crates/utils/dl_perf_telemetry/src/prometheus.rs:269-290 | crates/utils/dl_perf_telemetry/src/prometheus.rs:387-409 | crates/utils/dl_perf_telemetry/src/prometheus.rs:417-436 | crates/utils/dl_perf_telemetry/src/prometheus.rs:444-465 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Edited copy of a member (89 corresponding lines) · ×2
Edited copy of a member (89 corresponding lines) crates/store/dl_importer/src/lerobot/datasetv2.rs:366— crates/store/dl_importer/src/lerobot/datasetv2.rs:366-454 | crates/store/dl_importer/src/lerobot/datasetv3.rs:410-507 — These two members are one piece of code written twice and then edited apart: 89 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (89 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/images.rs:89— crates/viewer/dl_view_spatial/src/visualizers/images.rs:89-177 | crates/viewer/dl_view_spatial/src/visualizers/segmentation_images.rs:53-152 — These two members are one piece of code written twice and then edited apart: 89 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 43+ corresponding lines) · ×2
Edited copies of one member (3 members, 43+ corresponding lines) crates/viewer/dl_component_ui/src/geo_line_string.rs:21— crates/viewer/dl_component_ui/src/geo_line_string.rs:21-70 | crates/viewer/dl_component_ui/src/line_strip.rs:23-71 | crates/viewer/dl_component_ui/src/line_strip.rs:88-130 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 43 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 43+ corresponding lines) crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:105— crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:105-154 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:157-199 | crates/store/dl_sorbet/src/migrations/v0_1_2__to__v0_1_3.rs:24-72 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 43 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (41 corresponding lines) · ×2
Edited copy of a member (41 corresponding lines) crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:18— crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:18-61 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:84-124 — These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (41 corresponding lines) crates/viewer/dl_view_bar_chart/src/view_class.rs:45— crates/viewer/dl_view_bar_chart/src/view_class.rs:45-85 | crates/viewer/dl_view_time_series/src/view_class.rs:135-185 — These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (49 corresponding lines) · ×2
Edited copy of a member (49 corresponding lines) crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:211— crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:211-259 | crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:279-340 — These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (49 corresponding lines) examples/python/face_tracking/face_tracking.py:351— examples/python/face_tracking/face_tracking.py:351-411 | examples/python/gesture_detection/gesture_detection.py:210-258 — These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (39 corresponding lines) · ×2
Edited copy of a member (39 corresponding lines) crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:264— crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:264-303 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:309-347 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (39 corresponding lines) crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:803— crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:803-841 | crates/viewer/dl_time_panel/src/time_panel.rs:1349-1389 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 30+ corresponding lines) · ×2
Edited copies of one member (3 members, 30+ corresponding lines) crates/utils/dl_perf_telemetry/src/prometheus.rs:612— crates/utils/dl_perf_telemetry/src/prometheus.rs:612-641 | crates/utils/dl_perf_telemetry/src/prometheus.rs:649-678 | crates/utils/dl_perf_telemetry/src/prometheus.rs:686-715 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 30+ corresponding lines) crates/store/dl_importer/src/lerobot/datasetv2.rs:470— crates/store/dl_importer/src/lerobot/datasetv2.rs:470-499 | crates/store/dl_importer/src/lerobot/datasetv3.rs:513-542 | crates/store/dl_importer/src/lerobot/datasetv3.rs:548-577 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (32 corresponding lines) · ×2
Edited copy of a member (32 corresponding lines) crates/utils/dl_memory/src/accounting_allocator.rs:346— crates/utils/dl_memory/src/accounting_allocator.rs:346-378 | crates/utils/dl_memory/src/accounting_allocator.rs:381-412 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (32 corresponding lines) docs/snippets/all/tutorials/any_values.rs:7— docs/snippets/all/tutorials/any_values.rs:7-38 | docs/snippets/all/tutorials/dynamic_archetype.rs:7-39 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (28 corresponding lines) · ×2
Edited copy of a member (28 corresponding lines) crates/utils/dl_case/src/lib.rs:105— crates/utils/dl_case/src/lib.rs:105-132 | crates/utils/dl_case/src/lib.rs:193-226 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:34— crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:34-66 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/nav_sat_fix.rs:46-73 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 20+ corresponding lines) · ×2
Edited copies of one member (3 members, 20+ corresponding lines) crates/utils/dl_perf_telemetry/src/prometheus.rs:298— crates/utils/dl_perf_telemetry/src/prometheus.rs:298-321 | crates/utils/dl_perf_telemetry/src/prometheus.rs:329-352 | crates/utils/dl_perf_telemetry/src/prometheus.rs:360-379 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 20+ corresponding lines) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:628— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:628-647 | crates/viewer/dl_renderer/src/renderer/lines.rs:597-618 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:625-645 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 15+ corresponding lines) · ×2
Edited copies of one member (4 members, 15+ corresponding lines) docs/snippets/all/archetypes/annotation_context_segmentation.rs:5— docs/snippets/all/archetypes/annotation_context_segmentation.rs:5-31 | docs/snippets/all/archetypes/depth_image_simple.rs:5-19 | docs/snippets/all/archetypes/image_simple.rs:5-23 | docs/snippets/all/archetypes/segmentation_image_simple.rs:5-27 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Edited copies of one member (4 members, 15+ corresponding lines) crates/viewer/dl_viewer_context/src/app_context.rs:433— crates/viewer/dl_viewer_context/src/app_context.rs:433-447 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:112-131 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:170-184 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:191-210 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 19+ corresponding lines) · ×2
Edited copies of one member (3 members, 19+ corresponding lines) crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:112— crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:112-137 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:267-289 | crates/viewer/dl_dataframe_ui/src/filters/string.rs:60-78 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 19+ corresponding lines) crates/store/dl_redap_client/src/connection_client.rs:693— crates/store/dl_redap_client/src/connection_client.rs:693-711 | crates/store/dl_redap_client/src/connection_client.rs:803-830 | crates/store/dl_redap_client/src/connection_client.rs:901-928 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (4 corresponding lines) · ×2
Edited copy of a member (4 corresponding lines) dalaran_py/dalaran_sdk/dalaran/robot/robot.py:78— dalaran_py/dalaran_sdk/dalaran/robot/robot.py:78-81 | REDACTED:67-83 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) dalaran_py/src/catalog/dataset_entry.rs:78— dalaran_py/src/catalog/dataset_entry.rs:78-81 | dalaran_py/src/catalog/table_entry.rs:58-61 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 16+ corresponding lines) · ×2
Edited copies of one member (3 members, 16+ corresponding lines) docs/snippets/all/archetypes/mesh3d_indexed.rs:3— docs/snippets/all/archetypes/mesh3d_indexed.rs:3-21 | docs/snippets/all/archetypes/mesh3d_simple.rs:3-19 | docs/snippets/all/archetypes/view_coordinates_simple.rs:3-18 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 16+ corresponding lines) crates/store/dl_entity_db/src/instance_path.rs:101— crates/store/dl_entity_db/src/instance_path.rs:101-118 | crates/store/dl_log_types/src/path/parse_path.rs:173-188 | crates/store/dl_log_types/src/path/parse_path.rs:247-266 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (1 corresponding lines) · ×2
Edited copy of a member (1 corresponding lines) crates/store/dl_types_core/src/chunk_id.rs:185— crates/store/dl_types_core/src/chunk_id.rs:185-185 | crates/store/dl_types_core/src/row_id.rs:177-177 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (1 corresponding lines) dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py:157— dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py:157-157 | examples/python/droid_semantic_search/ingest.py:107-107 — These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 18+ corresponding lines) · ×2
Edited copies of one member (3 members, 18+ corresponding lines) crates/store/dl_importer/src/importer_archetype.rs:196— crates/store/dl_importer/src/importer_archetype.rs:196-215 | crates/store/dl_importer/src/importer_archetype.rs:294-311 | crates/store/dl_importer/src/importer_archetype.rs:350-368 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 18+ corresponding lines) crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:1277— crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:1277-1294 | crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:1395-1412 | crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:1518-1535 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 8+ corresponding lines) · ×2
Edited copies of one member (3 members, 8+ corresponding lines) crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs:334— crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs:334-341 | crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs:346-353 | crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs:358-365 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Edited copies of one member (3 members, 8+ corresponding lines) scripts/ci/generate_prerelease_pip_index.py:95— scripts/ci/generate_prerelease_pip_index.py:95-102 | scripts/ci/pixi_install_wheel.py:96-109 | scripts/ci/uv_install_wheel.py:96-108 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
Duplicated block (30 lines × 2) crates/store/dl_importer/src/importer_urdf/mod.rs:73— crates/store/dl_importer/src/importer_urdf/mod.rs:73-102 | crates/store/dl_importer/src/importer_urdf/mod.rs:118-147 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_importer/src/importer_urdf/mod.rs:73` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (30 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:733— crates/store/dl_redap_tests/src/utils/dalaran.rs:733-762 | crates/store/dl_redap_tests/src/utils/dalaran.rs:779-808 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:733` 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 (29 lines × 2) crates/viewer/dl_redap_browser/src/entries.rs:376— crates/viewer/dl_redap_browser/src/entries.rs:376-404 | crates/viewer/dl_redap_browser/src/entries.rs:420-448 — both copies are in the same file, so extract the 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 `crates/viewer/dl_redap_browser/src/entries.rs:376` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (29 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:69— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:69-97 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:67-95 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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–19 lines × 2) crates/viewer/dl_selection_panel/src/view_entity_picker.rs:242— crates/viewer/dl_selection_panel/src/view_entity_picker.rs:242-259 | crates/viewer/dl_selection_panel/src/view_entity_picker.rs:298-316 — both copies are in the same file, so extract the 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 `crates/viewer/dl_selection_panel/src/view_entity_picker.rs:242` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/viewer/dl_selection_panel/src/view_entity_picker.rs:241` calls `remove_filter_rule_for` and `crates/viewer/dl_selection_panel/src/view_entity_picker.rs:297` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (18–19 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:341— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:341-359 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:196-213 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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. 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.
Duplicated block (14–17 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:304— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:304-317 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:155-171 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:304` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–17 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:326— crates/store/dl_redap_tests/src/utils/dalaran.rs:326-342 | crates/store/dl_redap_tests/src/utils/dalaran.rs:604-617 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 2) crates/viewer/dl_view_graph/src/layout/provider.rs:130— crates/viewer/dl_view_graph/src/layout/provider.rs:130-144 | crates/viewer/dl_view_graph/src/layout/provider.rs:170-183 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view_graph/src/layout/provider.rs:130` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 2) crates/store/dl_redap_tests/src/utils/dalaran.rs:468— crates/store/dl_redap_tests/src/utils/dalaran.rs:468-482 | crates/store/dl_redap_tests/src/utils/dalaran.rs:489-502 — both copies are in the same file, so extract the 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 `crates/store/dl_redap_tests/src/utils/dalaran.rs:468` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 3) crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:112— crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:112-124 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:254-266 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:305-317 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:112` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 3) crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:520— crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:520-532 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:579-591 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:611-623 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:520` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (10–13 lines × 2) crates/viewer/dl_viewer/src/ui/share_modal.rs:302— crates/viewer/dl_viewer/src/ui/share_modal.rs:302-311 | crates/viewer/dl_viewer/src/ui/share_modal.rs:330-342 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/ui/share_modal.rs:302` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–13 lines × 2) crates/utils/dl_crash_handler/src/lib.rs:300— crates/utils/dl_crash_handler/src/lib.rs:300-312 | crates/utils/dl_memory/src/backtrace_native.rs:95-104 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_crash_handler/src/lib.rs:300` 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.
Duplicated block (12 lines × 3) crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:827— crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:827-838 | crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:898-909 | crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:984-995 — 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/viewer/dl_renderer/src/renderer/depth_cloud.rs:417— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:417-429 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:474-485 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:325-337 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs` and `crates/viewer/dl_renderer/src/renderer/mesh_renderer.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. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:417` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (11 lines × 3) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:700— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:700-710 | crates/viewer/dl_renderer/src/renderer/lines.rs:687-697 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:714-724 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/lines.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:700` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 3) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062-1072 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1206-1216 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1269-1279 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–10 lines × 2) crates/top/dalaran/src/commands/doctor/recording.rs:39— crates/top/dalaran/src/commands/doctor/recording.rs:39-46 | crates/top/dalaran/src/commands/doctor/recording.rs:95-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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.
Duplicated block (8–10 lines × 2) crates/viewer/dl_viewer_context/src/component_ui_registry.rs:224— crates/viewer/dl_viewer_context/src/component_ui_registry.rs:224-233 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:361-368 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer_context/src/component_ui_registry.rs:224` 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.
Duplicated block (8–9 lines × 2) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:47— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:47-55 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:46-53 — before extracting anything, compare `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs` and `crates/viewer/dl_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:47` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–9 lines × 2) crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:108— crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:108-116 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:104-111 — before extracting anything, compare `crates/viewer/dl_viewer_context/src/tensor/image_stats.rs` and `crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:108` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 7) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:211— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:211-219 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:213-221 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:215-222 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:146-153 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:218-225 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:149-156 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:244-252 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:211` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 7) crates/store/dl_lenses/src/op/semantic.rs:245— crates/store/dl_lenses/src/op/semantic.rs:245-252 | crates/store/dl_lenses/src/op/semantic.rs:283-290 | crates/store/dl_lenses/src/semantic/helpers.rs:62-69 | crates/store/dl_lenses/src/semantic/image_helpers.rs:22-29 | crates/store/dl_lenses/src/semantic/ros2msg/log.rs:49-56 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:24-31 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:59-66 — there are 7 copies across 5 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 4) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:233— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:233-237 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:235-239 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:237-241 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:241-245 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:233` 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 (5 lines × 4) crates/store/dl_redap_tests/src/utils/dalaran.rs:109— crates/store/dl_redap_tests/src/utils/dalaran.rs:109-114 | crates/store/dl_redap_tests/src/utils/dalaran.rs:371-376 | crates/store/dl_redap_tests/src/utils/dalaran.rs:630-634 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1189-1194 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/store/dl_redap_tests/src/utils/dalaran.rs:117` calls `MyLabel`, `to_owned` and `crates/store/dl_redap_tests/src/utils/dalaran.rs:638` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 6) crates/store/dl_lenses/src/op/semantic.rs:263— crates/store/dl_lenses/src/op/semantic.rs:263-270 | crates/store/dl_lenses/src/op/string.rs:14-21 | crates/store/dl_lenses/src/op/string.rs:34-41 | crates/store/dl_lenses/src/op/string.rs:54-61 | crates/store/dl_lenses/src/op/string.rs:74-81 | crates/store/dl_lenses/src/semantic/foxglove/log.rs:32-39 — there are 6 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 6) crates/store/dl_lenses/src/semantic/helpers.rs:62— crates/store/dl_lenses/src/semantic/helpers.rs:62-69 | crates/store/dl_lenses/src/semantic/image_helpers.rs:22-29 | crates/store/dl_lenses/src/semantic/image_helpers.rs:62-69 | crates/store/dl_lenses/src/semantic/ros2msg/log.rs:49-56 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:24-31 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:59-66 — there are 6 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart.
Unused dependency 'typedoc-github-theme' dalaran_js/web-viewer/package.json:58— Declared in dalaran_js/web-viewer/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'typedoc-github-theme' dalaran_js/web-viewer-react/package.json:48— Declared in dalaran_js/web-viewer-react/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
X12 · Unreachable branch· Statement is unreachable · ×2
Statement is unreachable — control never gets past the statement before it crates/viewer/dl_viewer_context/src/cache/memoizers.rs:161— `let mut caches = { dl_tracing::profile_wait !("master-cache-write-lock"); sel…` follows `{ return cache; }` (line 157) in the same block, and control never passes that statement — it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns `unreachable_code` on it. Delete it, or move it before the statement that leaves if it was meant to run.
Statement is unreachable — control never gets past the statement before it crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:1069— `None` follows `{ * idx = if let Some(idx) = if before { current_idx.checked_sub(1) } else { …` (line 1051) in the same block, and control never passes that statement — it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns `unreachable_code` on it. Delete it, or move it before the statement that leaves if it was meant to run.
X18 · Disposal-pattern correctness· Raw handle taken from an owned value and never reclaimed · ×2
Raw handle taken from an owned value and never reclaimed crates/top/dalaran_c/src/lib.rs:1407— `part.into_raw()` (line 1407) gives up ownership in exchange for a raw handle — the value's `Drop` will no longer run — and nothing in the crate's code ever reclaims a `dl_sdk` from a raw pointer (`dl_sdk::from_raw`). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a `free` function that rebuilds the owner with `from_raw` and drops it), or keep the owning value.
Raw handle taken from an owned value and never reclaimed crates/store/dl_redap_client/src/connection_client.rs:287— `hub.into_raw()` (line 287) gives up ownership in exchange for a raw handle — the value's `Drop` will no longer run — and nothing in the crate's code ever reclaims a `dl_log_encoding` from a raw pointer (`dl_log_encoding::from_raw`). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a `free` function that rebuilds the owner with `from_raw` and drops it), or keep the owning value.
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark REDACTED:3— 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.
dl_types_core::reflection::generic_placeholder_for_datatype (cyclomatic 49) crates/store/dl_types_core/src/reflection.rs:79— dl_types_core::reflection::generic_placeholder_for_datatype has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
compare_snippet_output.main (cyclomatic 41) docs/snippets/compare_snippet_output.py:91— compare_snippet_output.main 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.
TimeSeriesView::ui (cyclomatic 40) crates/viewer/dl_view_time_series/src/view_class.rs:440— TimeSeriesView::ui 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.
AppState::show (cyclomatic 38) crates/viewer/dl_viewer/src/app_state.rs:208— AppState::show 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.
BarChartView::ui (cyclomatic 34) crates/viewer/dl_view_bar_chart/src/view_class.rs:156— BarChartView::ui 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.
StateTimelineView::ui (cyclomatic 32) crates/viewer/dl_view_state_timeline/src/view_class.rs:288— StateTimelineView::ui has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DalaranCloudHandler::query_dataset (cyclomatic 31) crates/store/dl_server/src/dalaran_cloud/mod.rs:1441— DalaranCloudHandler::query_dataset 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.
DurationFormatOptions::format_nanos (cyclomatic 31) crates/utils/dl_format/src/duration.rs:100— DurationFormatOptions::format_nanos 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.
ServerModal::ui (cyclomatic 31) crates/viewer/dl_redap_browser/src/server_modal.rs:165— ServerModal::ui 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.
ViewportUi::viewport_ui (cyclomatic 31) crates/viewer/dl_viewport/src/viewport_ui.rs:54— ViewportUi::viewport_ui 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.
dl_view_text_log::view_class::table_ui (cyclomatic 29) crates/viewer/dl_view_text_log/src/view_class.rs:296— dl_view_text_log::view_class::table_ui 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.
CommandPaletteProviderImpl::all_matching (cyclomatic 29) crates/viewer/dl_viewer/src/command_palette.rs:122— CommandPaletteProviderImpl::all_matching 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.
ImageExt.__init__ (cyclomatic 29) dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py:77— ImageExt.__init__ 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.
Objects::resolve_and_validate (cyclomatic 28) crates/build/dl_types_builder/src/objects/mod.rs:40— Objects::resolve_and_validate 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.
LogDataSource::from_uri (cyclomatic 28) crates/store/dl_data_source/src/data_source.rs:83— LogDataSource::from_uri has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body's own statements and 10 belong to 2 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.
Telemetry::init (cyclomatic 28) crates/utils/dl_perf_telemetry/src/telemetry.rs:483— Telemetry::init 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.
ItemCollection::copy_to_clipboard (cyclomatic 28) crates/viewer/dl_viewer_context/src/item_collection.rs:200— ItemCollection::copy_to_clipboard has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
dl_time_panel::time_selection_ui::loop_selection_ui (cyclomatic 27) crates/viewer/dl_time_panel/src/time_selection_ui.rs:57— dl_time_panel::time_selection_ui::loop_selection_ui 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.
ListItem::ui (cyclomatic 27) crates/viewer/dl_ui/src/list_item/list_item.rs:439— ListItem::ui 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.
CommandPalette::alternatives_ui (cyclomatic 26) crates/viewer/dl_ui/src/command_palette.rs:286— CommandPalette::alternatives_ui 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.
dl_viewport_blueprint::viewport_blueprint::apply_viewport_command (cyclomatic 26) crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:983— dl_viewport_blueprint::viewport_blueprint::apply_viewport_command 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.
CrateVersion::try_parse (cyclomatic 25) crates/build/dl_build_info/src/crate_version.rs:352— CrateVersion::try_parse has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body's own statements and 4 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.
MessageDecoderRunner::process (cyclomatic 25) crates/store/dl_mcap/src/decoders/mod.rs:353— MessageDecoderRunner::process has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
SelectionPanel::item_ui (cyclomatic 25) crates/viewer/dl_selection_panel/src/selection_panel.rs:161— SelectionPanel::item_ui 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.
SplitCommand::run (cyclomatic 24) crates/top/dalaran/src/commands/dlr/split.rs:85— SplitCommand::run 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.
StatsCommand::run (cyclomatic 24) crates/top/dalaran/src/commands/dlr/stats.rs:33— StatsCommand::run 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.
DataQueryPropertyResolver::update_overrides_recursive (cyclomatic 24) crates/viewer/dl_viewport_blueprint/src/view_contents.rs:475— DataQueryPropertyResolver::update_overrides_recursive 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.
PythonCodeGenerator::generate_folder (cyclomatic 23) crates/build/dl_types_builder/src/codegen/python/mod.rs:448— PythonCodeGenerator::generate_folder 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.
VideoDataDescription::load_mp4_from_reader (cyclomatic 23) crates/utils/dl_video/src/demux/mp4.rs:36— VideoDataDescription::load_mp4_from_reader has cyclomatic complexity 23 (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.
MeshRenderer::draw (cyclomatic 23) crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:649— MeshRenderer::draw has cyclomatic complexity 23 (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.
MaxImageDimensionsStoreSubscriber::on_events (cyclomatic 23) crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs:98— MaxImageDimensionsStoreSubscriber::on_events 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.
ImageStats::from_image (cyclomatic 23) crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:22— ImageStats::from_image has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
PinholeExt.__init__ (cyclomatic 23) dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py:16— PinholeExt.__init__ 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.
dl_component_ui::variant_uis::redap_uri_button::redap_uri_button (cyclomatic 22) crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs:15— dl_component_ui::variant_uis::redap_uri_button::redap_uri_button 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.
Query::column_visibility_ui_impl (cyclomatic 22) crates/viewer/dl_view_dataframe/src/view_query/ui.rs:347— Query::column_visibility_ui_impl has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
AppContext::handle_select_hover_drag_interactions (cyclomatic 22) crates/viewer/dl_viewer_context/src/app_context.rs:241— AppContext::handle_select_hover_drag_interactions 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.
TensorStats::from_tensor (cyclomatic 22) crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:21— TensorStats::from_tensor has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
msg_map.convert_marker (cyclomatic 22) dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py:856— msg_map.convert_marker has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DataframeQueryTableProvider::scan (cyclomatic 21) crates/store/dl_datafusion/src/dataframe_query_common.rs:446— DataframeQueryTableProvider::scan 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.
Decoder::try_read_impl (cyclomatic 21) crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs:173— Decoder::try_read_impl 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.
dl_redap_browser::servers::error_ui (cyclomatic 21) crates/viewer/dl_redap_browser/src/servers.rs:428— dl_redap_browser::servers::error_ui 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.
Boxes2DExt.__init__ (cyclomatic 21) dalaran_py/dalaran_sdk/dalaran/archetypes/boxes2d_ext.py:40— Boxes2DExt.__init__ 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.
_manifest_build._resolve_rows (cyclomatic 21) dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest_build.py:274— _manifest_build._resolve_rows 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.
Parser::parse_named_type (cyclomatic 20) crates/build/dl_types_builder/src/objects/from_rust.rs:673— Parser::parse_named_type has cyclomatic complexity 20 (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.
dl_redap_client::grpc::stream_segment_from_server (cyclomatic 20) crates/store/dl_redap_client/src/grpc.rs:803— dl_redap_client::grpc::stream_segment_from_server 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.
TimestampFilter::popup_ui (cyclomatic 20) crates/viewer/dl_dataframe_ui/src/filters/timestamp.rs:219— TimestampFilter::popup_ui 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.
VideoFrameDecoder._decode_to_target (cyclomatic 20) dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py:314— VideoFrameDecoder._decode_to_target 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.
SnippetsRefCodeGenerator::generate_fallible (cyclomatic 19) crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs:126— SnippetsRefCodeGenerator::generate_fallible has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body's own statements and 8 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.
RawRrdManifest::check_index_columns_are_correct (cyclomatic 19) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:951— RawRrdManifest::check_index_columns_are_correct 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.
dl_mcap::decoders::ros2_reflection::append_value (cyclomatic 19) crates/store/dl_mcap/src/decoders/ros2_reflection.rs:285— dl_mcap::decoders::ros2_reflection::append_value has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Args::generate_markdown_manual (cyclomatic 19) crates/top/dalaran/src/commands/entrypoint.rs:383— Args::generate_markdown_manual has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (generate_markdown_manual, generate_arg_doc). 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. This is NOT this file's highest cyclomatic complexity: dalaran::commands::entrypoint::record_cli_command_analytics (cyclomatic 21) 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.
SeriesPointsSystem::load_series (cyclomatic 19) crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:188— SeriesPointsSystem::load_series 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.
VideoStreamCache::handle_store_event (cyclomatic 19) crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:305— VideoStreamCache::handle_store_event has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
url_generation.segment_url (cyclomatic 19) dalaran_py/dalaran_sdk/dalaran/utilities/datafusion/functions/url_generation.py:19— url_generation.segment_url 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.
Chunk::latest_at (cyclomatic 18) crates/store/dl_chunk/src/latest_at.rs:91— Chunk::latest_at 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.
dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops (cyclomatic 18) crates/store/dl_chunk_store/src/rebatch_videos.rs:46— dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops 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.
dl_server::dalaran_cloud::get_chunks_for_query_results (cyclomatic 18) crates/store/dl_server/src/dalaran_cloud/mod.rs:2231— dl_server::dalaran_cloud::get_chunks_for_query_results 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.
ListItemNavigation::end_if_root (cyclomatic 18) crates/viewer/dl_ui/src/list_item/navigation.rs:75— ListItemNavigation::end_if_root 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.
UiExt::native_window_buttons_ui (cyclomatic 18) crates/viewer/dl_ui/src/ui_ext.rs:999— UiExt::native_window_buttons_ui has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (window_button). 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.
Transform3DExt.__init__ (cyclomatic 18) dalaran_py/dalaran_sdk/dalaran/archetypes/transform3d_ext.py:23— Transform3DExt.__init__ 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.
TensorDataExt.__init__ (cyclomatic 18) dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py:53— TensorDataExt.__init__ 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.
PipelineBudget::reserve_with_priority (cyclomatic 17) crates/store/dl_datafusion/src/pipeline_budget.rs:1472— PipelineBudget::reserve_with_priority 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.
Flatten::transform (cyclomatic 17) crates/store/dl_lenses_core/src/combinators/reshape.rs:112— Flatten::transform 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.
dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply (cyclomatic 17) crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:308— dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply 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.
VideoPlayer::enqueue_samples (cyclomatic 17) crates/utils/dl_video/src/player/mod.rs:620— VideoPlayer::enqueue_samples 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.
GaussianSplatBatchBuilder::add_gaussians (cyclomatic 17) crates/viewer/dl_renderer/src/gaussian_splat_builder.rs:203— GaussianSplatBatchBuilder::add_gaussians 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.
dl_view_time_series::fallbacks::register_fallbacks (cyclomatic 17) crates/viewer/dl_view_time_series/src/fallbacks.rs:13— dl_view_time_series::fallbacks::register_fallbacks 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.
ExternalImporter::import_from_path (cyclomatic 16) crates/store/dl_importer/src/importer_external.rs:141— ExternalImporter::import_from_path 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.
dl_dataframe_ui::preview_renderer::preview_timeline (cyclomatic 16) crates/viewer/dl_dataframe_ui/src/preview_renderer.rs:379— dl_dataframe_ui::preview_renderer::preview_timeline 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.
UniformBuffer::from_textured_rect_with_outline_mask (cyclomatic 16) crates/viewer/dl_renderer/src/renderer/rectangles.rs:344— UniformBuffer::from_textured_rect_with_outline_mask 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.
DataframeTableDelegate::header_cell_ui (cyclomatic 16) crates/viewer/dl_view_dataframe/src/dataframe_ui.rs:254— DataframeTableDelegate::header_cell_ui 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.
SeriesLinesSystem::build_draw_data (cyclomatic 16) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:111— SeriesLinesSystem::build_draw_data 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.
urdf_model._joint_from_xml (cyclomatic 16) REDACTED:266— urdf_model._joint_from_xml has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Repeated repair: dalaran_py/dalaran_sdk/dalaran/robot/robot.py dalaran_py/dalaran_sdk/dalaran/robot/robot.py:674— dalaran_py/dalaran_sdk/dalaran/robot/robot.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is Robot.log_joint_states at line 674), AT OR 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(robot): move URDF meshes by publishing frame transforms, not just hierarchy”; “fix(urdf): nest URDF geometry under its entity path prefix, accept inline markup”; “fix(viewer): do not leak the StoreHub when quitting after a screenshot”. 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-09 21:35:49 +05:00' --until='2026-08-07 21:35:49 +05:00' --full-history --no-merges -- dalaran_py/dalaran_sdk/dalaran/robot/robot.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.
compare_snippet_output.main (cognitive 77) docs/snippets/compare_snippet_output.py:91— compare_snippet_output.main has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (46 pts), loops 9 (15 pts), error handling 3 (11 pts), boolean chains 5 (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.
CommandPaletteProviderImpl::all_matching (cognitive 75) crates/viewer/dl_viewer/src/command_palette.rs:122— CommandPaletteProviderImpl::all_matching has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (52 pts), loops 7 (20 pts), boolean chains 3 (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.
Objects::resolve_and_validate (cognitive 74) crates/build/dl_types_builder/src/objects/mod.rs:40— Objects::resolve_and_validate has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (49 pts), loops 5 (9 pts), match/switch 2 (9 pts), boolean chains 7 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MaxImageDimensionsStoreSubscriber::on_events (cognitive 67) crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs:98— MaxImageDimensionsStoreSubscriber::on_events has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 6 (18 pts), boolean chains 2 (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.
TimeSeriesView::ui (cognitive 65) crates/viewer/dl_view_time_series/src/view_class.rs:440— TimeSeriesView::ui has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 9, match/switch 6 (8 pts), loops 4 (5 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.
AppState::show (cognitive 61) crates/viewer/dl_viewer/src/app_state.rs:208— AppState::show has cognitive complexity 61 (threshold 15). Drivers by points: if/else 33 (54 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StatsCommand::run (cognitive 56) crates/top/dalaran/src/commands/dlr/stats.rs:33— StatsCommand::run has cognitive complexity 56 (threshold 15). Drivers by points: loops 8 (26 pts), if/else 10 (21 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 33). 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.
ViewportUi::viewport_ui (cognitive 53) crates/viewer/dl_viewport/src/viewport_ui.rs:54— ViewportUi::viewport_ui has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 5, loops 5, 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.
DataQueryPropertyResolver::update_overrides_recursive (cognitive 51) crates/viewer/dl_viewport_blueprint/src/view_contents.rs:475— DataQueryPropertyResolver::update_overrides_recursive has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 27). 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.
Decoder::try_read_impl (cognitive 50) crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs:173— Decoder::try_read_impl has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 7 (18 pts), loops 1 (4 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.
CommandPalette::alternatives_ui (cognitive 50) crates/viewer/dl_ui/src/command_palette.rs:286— CommandPalette::alternatives_ui has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AppContext::handle_select_hover_drag_interactions (cognitive 49) crates/viewer/dl_viewer_context/src/app_context.rs:241— AppContext::handle_select_hover_drag_interactions has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (40 pts), boolean chains 5, loops 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.
PythonCodeGenerator::generate_folder (cognitive 48) crates/build/dl_types_builder/src/codegen/python/mod.rs:448— PythonCodeGenerator::generate_folder has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (40 pts), loops 3 (4 pts), match/switch 2 (4 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.
DurationFormatOptions::format_nanos (cognitive 48) crates/utils/dl_format/src/duration.rs:100— DurationFormatOptions::format_nanos has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 11, match/switch 4 (5 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.
MessageDecoderRunner::process (cognitive 45) crates/store/dl_mcap/src/decoders/mod.rs:353— MessageDecoderRunner::process has cognitive complexity 45 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 8 (15 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImageExt.__init__ (cognitive 45) dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py:77— ImageExt.__init__ has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 6, error handling 2 (3 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_viewport_blueprint::viewport_blueprint::apply_viewport_command (cognitive 44) crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs:983— dl_viewport_blueprint::viewport_blueprint::apply_viewport_command has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 4 (9 pts), loops 3 (6 pts) (nesting depth added 24). 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.
dl_server::dalaran_cloud::get_chunks_for_query_results (cognitive 43) crates/store/dl_server/src/dalaran_cloud/mod.rs:2231— dl_server::dalaran_cloud::get_chunks_for_query_results has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (11 pts), match/switch 3 (11 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServerModal::ui (cognitive 43) crates/viewer/dl_redap_browser/src/server_modal.rs:165— ServerModal::ui has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 5, match/switch 4 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Query::column_visibility_ui_impl (cognitive 42) crates/viewer/dl_view_dataframe/src/view_query/ui.rs:347— Query::column_visibility_ui_impl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 3, boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Telemetry::init (cognitive 41) crates/utils/dl_perf_telemetry/src/telemetry.rs:483— Telemetry::init has cognitive complexity 41 (threshold 15). Drivers by points: if/else 31 (36 pts), boolean chains 3, match/switch 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
PinholeExt.__init__ (cognitive 41) dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py:16— PinholeExt.__init__ has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 7, error handling 2 (5 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.
_manifest_build._resolve_rows (cognitive 41) dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest_build.py:274— _manifest_build._resolve_rows has cognitive complexity 41 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 6 (14 pts), boolean chains 5, ternaries 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Flatten::transform (cognitive 40) crates/store/dl_lenses_core/src/combinators/reshape.rs:112— Flatten::transform has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 4 (6 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ForceLayoutProvider::layout (cognitive 40) crates/viewer/dl_view_graph/src/layout/provider.rs:185— ForceLayoutProvider::layout has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 4 (10 pts), match/switch 1 (3 pts), boolean chains 2 (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.
StateTimelineView::ui (cognitive 39) crates/viewer/dl_view_state_timeline/src/view_class.rs:288— StateTimelineView::ui has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 8, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
LogDataSource::from_uri (cognitive 38) crates/store/dl_data_source/src/data_source.rs:83— LogDataSource::from_uri has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 7 (nesting depth added 6). Of this number, 25 points are the body's own statements and 13 belong to 2 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.
dl_redap_client::grpc::stream_segment_from_server (cognitive 38) crates/store/dl_redap_client/src/grpc.rs:803— dl_redap_client::grpc::stream_segment_from_server has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SelectionPanel::item_ui (cognitive 38) crates/viewer/dl_selection_panel/src/selection_panel.rs:161— SelectionPanel::item_ui has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 2, match/switch 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ListItem::ui (cognitive 38) crates/viewer/dl_ui/src/list_item/list_item.rs:439— ListItem::ui has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 6, 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.
CrateVersion::try_parse (cognitive 36) crates/build/dl_build_info/src/crate_version.rs:352— CrateVersion::try_parse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 9). Of this number, 30 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MeshRenderer::draw (cognitive 36) crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:649— MeshRenderer::draw has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Boxes2DExt.__init__ (cognitive 36) dalaran_py/dalaran_sdk/dalaran/archetypes/boxes2d_ext.py:40— Boxes2DExt.__init__ has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (36 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.
FilterCommand::run (cognitive 35) crates/top/dalaran/src/commands/dlr/filter.rs:40— FilterCommand::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (9 pts), loops 2, boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DataframeQueryTableProvider::scan (cognitive 34) crates/store/dl_datafusion/src/dataframe_query_common.rs:446— DataframeQueryTableProvider::scan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (8 pts), match/switch 2 (4 pts), boolean chains 3 (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.
FloatFormatOptions::format_f64 (cognitive 34) crates/utils/dl_format/src/lib.rs:188— FloatFormatOptions::format_f64 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 1 (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.
Sender::send_impl (cognitive 34) crates/utils/dl_quota_channel/src/sync/mod.rs:112— Sender::send_impl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (5 pts), boolean chains 2 (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.
EyeState::handle_tracking_entity (cognitive 34) crates/viewer/dl_view_spatial/src/eye.rs:878— EyeState::handle_tracking_entity has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 3, match/switch 2 (3 pts) (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.
PipelineBudget::reserve_with_priority (cognitive 33) crates/store/dl_datafusion/src/pipeline_budget.rs:1472— PipelineBudget::reserve_with_priority has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServerEntriesData::new (cognitive 33) crates/viewer/dl_recording_panel/src/data.rs:330— ServerEntriesData::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TransformAxes3DVisualizer::execute (cognitive 33) crates/viewer/dl_view_spatial/src/visualizers/transform_axes_3d.rs:58— TransformAxes3DVisualizer::execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RrdManifest::concat (cognitive 32) crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs:275— RrdManifest::concat has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (21 pts), if/else 8 (10 pts), boolean chains 1 (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.
CompareCommand::run (cognitive 32) crates/top/dalaran/src/commands/dlr/compare.rs:47— CompareCommand::run has cognitive complexity 32 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 8 (15 pts), boolean chains 1 (nesting depth added 17). 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.
VerifyCommand::run (cognitive 32) crates/top/dalaran/src/commands/dlr/verify.rs:27— VerifyCommand::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProcMeshDrawableBuilder::add_batch (cognitive 32) crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs:163— ProcMeshDrawableBuilder::add_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (27 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.
Rgba32Ext.native_to_pa_array_override (cognitive 32) dalaran_py/dalaran_sdk/dalaran/datatypes/rgba32_ext.py:63— Rgba32Ext.native_to_pa_array_override has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 2 (5 pts), boolean chains 2 (nesting depth added 17). 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.
dl_grpc_client::write::message_proxy_client (cognitive 31) crates/store/dl_grpc_client/src/write.rs:333— dl_grpc_client::write::message_proxy_client has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 6 (14 pts), loops 2 (nesting depth added 17). 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.
dl_parquet::grouping::compute_column_groups (cognitive 31) crates/store/dl_parquet/src/grouping.rs:38— dl_parquet::grouping::compute_column_groups has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (9 pts), match/switch 2 (4 pts) (nesting depth added 20). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
VideoDataDescription::load_mp4_from_reader (cognitive 31) crates/utils/dl_video/src/demux/mp4.rs:36— VideoDataDescription::load_mp4_from_reader has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
QuotedObject::from_union (cognitive 30) crates/build/dl_types_builder/src/codegen/cpp/mod.rs:987— QuotedObject::from_union has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ExternalImporter::import_from_path (cognitive 30) crates/store/dl_importer/src/importer_external.rs:141— ExternalImporter::import_from_path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (9 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaussianSplatBatchBuilder::add_gaussians (cognitive 30) crates/viewer/dl_renderer/src/gaussian_splat_builder.rs:203— GaussianSplatBatchBuilder::add_gaussians has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (10 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
RrdManifestIndex::mark_roots_as (cognitive 29) crates/store/dl_entity_db/src/dlr_manifest_index.rs:433— RrdManifestIndex::mark_roots_as has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 2 (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.
DataResultData::from_data_result_and_filter (cognitive 29) crates/viewer/dl_blueprint_tree/src/data.rs:372— DataResultData::from_data_result_and_filter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 2, 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.
BarChartView::ui (cognitive 29) crates/viewer/dl_view_bar_chart/src/view_class.rs:156— BarChartView::ui has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PendingRow::many_into_chunks (cognitive 28) crates/store/dl_chunk/src/batcher.rs:879— PendingRow::many_into_chunks has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 3 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
EntityDb::app_ui (cognitive 28) crates/viewer/dl_data_ui/src/entity_db_ui.rs:17— EntityDb::app_ui has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 2 (5 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.
Transform3DExt.__init__ (cognitive 28) dalaran_py/dalaran_sdk/dalaran/archetypes/transform3d_ext.py:23— Transform3DExt.__init__ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 2 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DataMetaPerTimeline::handle_event_for_row_count (cognitive 27) crates/store/dl_entity_db/src/data_meta_per_timeline.rs:42— DataMetaPerTimeline::handle_event_for_row_count has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (21 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 17). 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.
Client::flush_blocking (cognitive 27) crates/store/dl_grpc_client/src/write.rs:215— Client::flush_blocking has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DecoderRegistry::plan (cognitive 27) crates/store/dl_mcap/src/decoders/mod.rs:748— DecoderRegistry::plan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_log::add_builtin_log_filter (cognitive 27) crates/utils/dl_log/src/lib.rs:221— dl_log::add_builtin_log_filter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (9 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.
Boxes3DExt.__init__ (cognitive 27) dalaran_py/dalaran_sdk/dalaran/archetypes/boxes3d_ext.py:16— Boxes3DExt.__init__ has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2 (7 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DataframeTableDelegate::header_cell_ui (cognitive 26) crates/viewer/dl_view_dataframe/src/dataframe_ui.rs:254— DataframeTableDelegate::header_cell_ui has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IntroItem::show (cognitive 26) crates/viewer/dl_viewer/src/ui/welcome_screen/intro_section.rs:93— IntroItem::show has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 3 (5 pts), boolean chains 2 (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.
TabWidget::new (cognitive 26) crates/viewer/dl_viewport/src/viewport_ui.rs:938— TabWidget::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VideoFrameDecoder._decode_to_target (cognitive 26) dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py:314— VideoFrameDecoder._decode_to_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 6 (8 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Args::generate_markdown_manual (cognitive 25) crates/top/dalaran/src/commands/entrypoint.rs:383— Args::generate_markdown_manual has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 5, loops 1 (nesting depth added 2). None of this is in the body itself: all 25 points belong to 2 function items inside it that branch (generate_arg_doc, generate_markdown_manual). 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.
dl_analytics::native::pipeline::flush_pending_events (cognitive 25) crates/utils/dl_analytics/src/native/pipeline.rs:182— dl_analytics::native::pipeline::flush_pending_events has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (7 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LatestAllInstanceResult::data_ui (cognitive 25) crates/viewer/dl_data_ui/src/latest_all_instance_ui.rs:31— LatestAllInstanceResult::data_ui has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DataFusionQuery::execute_streaming (cognitive 25) crates/viewer/dl_dataframe_ui/src/datafusion_adapter.rs:240— DataFusionQuery::execute_streaming has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (6 pts), loops 1 (2 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.
MeshDrawData::new (cognitive 25) crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:226— MeshDrawData::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TensorDataExt.__init__ (cognitive 25) dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py:53— TensorDataExt.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 3 (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.
Server.__init__ (cognitive 25) dalaran_py/dalaran_sdk/dalaran/server.py:49— Server.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
url_generation.segment_url (cognitive 25) dalaran_py/dalaran_sdk/dalaran/utilities/datafusion/functions/url_generation.py:19— url_generation.segment_url has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4, ternaries 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.
SnippetsRefCodeGenerator::generate_fallible (cognitive 24) crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs:126— SnippetsRefCodeGenerator::generate_fallible has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, boolean chains 3, match/switch 1. Of this number, 14 points are the body's own statements and 10 belong to one function item 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.
FrameIdRegistry::register_all_frames_in_chunk (cognitive 24) crates/store/dl_tf/src/frame_id_registry.rs:58— FrameIdRegistry::register_all_frames_in_chunk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 3 (6 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.
SeriesLinesSystem::build_draw_data (cognitive 24) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:111— SeriesLinesSystem::build_draw_data has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (8 pts), loops 2, 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.
ExampleSection::ui (cognitive 24) crates/viewer/dl_viewer/src/ui/welcome_screen/example_section.rs:244— ExampleSection::ui has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (8 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CompileContext::take_split_receiver (cognitive 24) dalaran_py/src/chunk_stream/engine.rs:98— CompileContext::take_split_receiver has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops (cognitive 23) crates/store/dl_chunk_store/src/rebatch_videos.rs:46— dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5, 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.
LeRobotEpisodeData::parse_feature_metadata (cognitive 23) crates/store/dl_importer/src/lerobot/datasetv3.rs:1153— LeRobotEpisodeData::parse_feature_metadata has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Fragment::from_str (cognitive 23) crates/store/dl_uri/src/fragment.rs:70— Fragment::from_str has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 2 (6 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks (cognitive 23) crates/viewer/dl_component_fallbacks/src/component_fallbacks.rs:30— dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 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.
ReceiversFromUrlParams::new (cognitive 22) crates/top/dalaran/src/commands/entrypoint.rs:1850— ReceiversFromUrlParams::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TimestampFilter::popup_ui (cognitive 22) crates/viewer/dl_dataframe_ui/src/filters/timestamp.rs:219— TimestampFilter::popup_ui has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TableSelectionState::handle_row_click (cognitive 22) crates/viewer/dl_dataframe_ui/src/table_selection.rs:37— TableSelectionState::handle_row_click has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (3 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.
dl_view_bar_chart::view_class::find_nearest_bar (cognitive 22) crates/viewer/dl_view_bar_chart/src/view_class.rs:451— dl_view_bar_chart::view_class::find_nearest_bar has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, 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.
Blueprint.__init__ (cognitive 22) dalaran_py/dalaran_sdk/dalaran/blueprint/api.py:578— Blueprint.__init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 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.
QueryResults::from_chunk_ids (cognitive 21) crates/store/dl_chunk_store/src/query.rs:733— QueryResults::from_chunk_ids has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LocalChunkStoreExec::execute (cognitive 21) crates/store/dl_datafusion/src/local_chunk_store_provider.rs:201— LocalChunkStoreExec::execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 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.
LensesSink::send (cognitive 21) crates/top/dl_sdk/src/lenses/sink.rs:48— LensesSink::send has cognitive complexity 21 (threshold 15). Drivers by points: loops 2 (8 pts), match/switch 3 (7 pts), if/else 1 (5 pts), boolean chains 1 (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.
dl_perf_telemetry::prometheus::convert_to_prometheus (cognitive 21) crates/utils/dl_perf_telemetry/src/prometheus.rs:69— dl_perf_telemetry::prometheus::convert_to_prometheus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaussianSplatDrawData::new (cognitive 21) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:334— GaussianSplatDrawData::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ListItemNavigation::end_if_root (cognitive 21) crates/viewer/dl_ui/src/list_item/navigation.rs:75— ListItemNavigation::end_if_root has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
ConnectionRegistryHandle::connect_and_validate_client_stack (cognitive 20) crates/store/dl_redap_client/src/connection_registry.rs:508— ConnectionRegistryHandle::connect_and_validate_client_stack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (7 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Source::index_ranges (cognitive 20) crates/store/dl_server/src/store/source.rs:218— Source::index_ranges has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (19 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
TransformResolutionCache::add_static_chunk (cognitive 20) crates/store/dl_tf/src/transform_resolution_cache/cache.rs:281— TransformResolutionCache::add_static_chunk has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 3 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PrintCommand::run (cognitive 20) crates/top/dalaran/src/commands/dlr/print.rs:70— PrintCommand::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 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.
BlueprintTree::data_result_ui (cognitive 20) crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:525— BlueprintTree::data_result_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatastoreUi::ui (cognitive 20) crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:189— DatastoreUi::ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ReTable::header_cell_ui (cognitive 20) crates/viewer/dl_dataframe_ui/src/dl_table.rs:168— ReTable::header_cell_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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.
MinMaxAggregator::aggregate (cognitive 20) crates/viewer/dl_view_time_series/src/aggregation.rs:128— MinMaxAggregator::aggregate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts), loops 2 (3 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.
UrdfModel.resolve_positions (cognitive 20) REDACTED:521— UrdfModel.resolve_positions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (5 pts), loops 3 (4 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.
ParquetChunkIterator::next (cognitive 19) crates/store/dl_parquet/src/streaming.rs:241— ParquetChunkIterator::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_types_core::reflection::generic_placeholder_for_datatype (cognitive 19) crates/store/dl_types_core/src/reflection.rs:79— dl_types_core::reflection::generic_placeholder_for_datatype has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 4 (6 pts) (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.
Origin::replace_and_parse (cognitive 19) crates/store/dl_uri/src/origin.rs:76— Origin::replace_and_parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Verifier::verify_component_column (cognitive 19) crates/top/dalaran/src/commands/dlr/verify.rs:158— Verifier::verify_component_column has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_byte_size_derive::enum_body (cognitive 19) crates/utils/dl_byte_size_derive/src/lib.rs:202— dl_byte_size_derive::enum_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_ros_msg::deserialize::decode_value (cognitive 19) crates/utils/dl_ros_msg/src/deserialize/mod.rs:142— dl_ros_msg::deserialize::decode_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
DataFusionTableWidget::table_ui (cognitive 19) crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:515— DataFusionTableWidget::table_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
PointCloudDrawData::new (cognitive 19) crates/viewer/dl_renderer/src/renderer/point_cloud.rs:333— PointCloudDrawData::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RectangleDrawData::new (cognitive 19) crates/viewer/dl_renderer/src/renderer/rectangles.rs:502— RectangleDrawData::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SceneBoundingBoxes::update (cognitive 19) crates/viewer/dl_view_spatial/src/scene_bounding_boxes.rs:45— SceneBoundingBoxes::update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VisualizerEntityMapping::add_visualizability_reason (cognitive 19) crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs:104— VisualizerEntityMapping::add_visualizability_reason has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
AnyBatchValue.__init__ (cognitive 19) dalaran_py/dalaran_sdk/dalaran/any_batch_value.py:194— AnyBatchValue.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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.
_entry._python_objects_to_record_batch (cognitive 19) dalaran_py/dalaran_sdk/dalaran/catalog/_entry.py:1535— _entry._python_objects_to_record_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_recording_panel::recording_panel_ui::dataset_entry_ui (cognitive 18) crates/viewer/dl_recording_panel/src/recording_panel_ui.rs:440— dl_recording_panel::recording_panel_ui::dataset_entry_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 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.
ImageStats::from_image (cognitive 18) crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:22— ImageStats::from_image has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 2). Of this number, 12 points are the body's own statements and 6 belong to 3 function items inside it that branch. 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.
View._log_to_stream (cognitive 18) dalaran_py/dalaran_sdk/dalaran/blueprint/api.py:152— View._log_to_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (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.
Robot.log_joint_states (cognitive 18) dalaran_py/dalaran_sdk/dalaran/robot/robot.py:674— Robot.log_joint_states has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 3, 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.
msg_map.convert_marker (cognitive 18) dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py:856— msg_map.convert_marker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (6 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.
ExampleInfo::parse (cognitive 17) crates/build/dl_types_builder/src/codegen/common.rs:38— ExampleInfo::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). Of this number, 10 points are the body's own statements and 7 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.
ExtensionClass::new (cognitive 17) crates/build/dl_types_builder/src/codegen/python/mod.rs:216— ExtensionClass::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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.
RecordBatchGrpcOutputStream::poll_next (cognitive 17) crates/store/dl_datafusion/src/table_entry_provider.rs:531— RecordBatchGrpcOutputStream::poll_next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DirectoryImporter::import_from_path (cognitive 17) crates/store/dl_importer/src/importer_directory.rs:17— DirectoryImporter::import_from_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
McapImporter::emit_chunks (cognitive 17) crates/store/dl_importer/src/importer_mcap/importer.rs:139— McapImporter::emit_chunks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (6 pts), match/switch 1 (3 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.
EntityPath::short_names_with_disambiguation (cognitive 17) crates/store/dl_log_types/src/path/entity_path.rs:336— EntityPath::short_names_with_disambiguation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 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.
InMemoryStore::load_directory_as_dataset (cognitive 17) crates/store/dl_server/src/store/in_memory_store.rs:228— InMemoryStore::load_directory_as_dataset has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 3 (6 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
dalaran_c::dl_recording_stream_flush_blocking (cognitive 17) crates/top/dalaran_c/src/lib.rs:725— dalaran_c::dl_recording_stream_flush_blocking has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DisplayComponentColumn::data_ui (cognitive 17) crates/viewer/dl_dataframe_ui/src/display_record_batch.rs:217— DisplayComponentColumn::data_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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.
CardLayout::show (cognitive 17) crates/viewer/dl_ui/src/egui_ext/card_layout.rs:83— CardLayout::show has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 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.
VoxelGridMapVisualizer::process_voxel_grid_map (cognitive 17) crates/viewer/dl_view_spatial/src/visualizers/voxel_grid_map.rs:189— VoxelGridMapVisualizer::process_voxel_grid_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bundle.format_manifest (cognitive 17) dalaran_py/dalaran_sdk/dalaran/tools/bundle.py:524— bundle.format_manifest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (4 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.
bundle.main_unpack (cognitive 17) dalaran_py/dalaran_sdk/dalaran/tools/bundle.py:632— bundle.main_unpack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 2 (5 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dl_build_tools::export_build_info_vars_for_crate (cognitive 16) crates/build/dl_build_tools/src/lib.rs:122— dl_build_tools::export_build_info_vars_for_crate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 3 (4 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Visitor::visit_children (cognitive 16) crates/build/dl_dev_tools/src/build_search_index/ingest/cpp.rs:79— Visitor::visit_children has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 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.
TimeColumn::sanity_check (cognitive 16) crates/store/dl_chunk/src/chunk.rs:1934— TimeColumn::sanity_check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, 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.
ChunkPrioritizer::find_chunks_with_component_prefix (cognitive 16) crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs:471— ChunkPrioritizer::find_chunks_with_component_prefix has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 1 (4 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
UrdfTree::compute_joint_transform_batches (cognitive 16) crates/store/dl_importer/src/importer_urdf/urdf_tree.rs:246— UrdfTree::compute_joint_transform_batches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LeRobotDatasetV3::log_episode_language (cognitive 16) crates/store/dl_importer/src/lerobot/datasetv3.rs:589— LeRobotDatasetV3::log_episode_language has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (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.
RrdManifestBuilder::append (cognitive 16) crates/store/dl_log_encoding/src/dlr/footer/builders.rs:79— RrdManifestBuilder::append has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Timestamp::format_opt (cognitive 16) crates/store/dl_log_types/src/index/timestamp.rs:165— Timestamp::format_opt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 6). 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.
DownloadCommand::run (cognitive 16) crates/top/dalaran/src/commands/download.rs:27— DownloadCommand::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), 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.
Vp9KeyframeHeader::parse (cognitive 16) crates/utils/dl_video/src/vp9.rs:40— Vp9KeyframeHeader::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
LatestAtInstanceResult::data_ui (cognitive 16) crates/viewer/dl_data_ui/src/latest_at_instance_ui.rs:30— LatestAtInstanceResult::data_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
LegendWidget::show_entries (cognitive 16) crates/viewer/dl_plot/src/legend.rs:77— LegendWidget::show_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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.
ViewBuilder::new (cognitive 16) crates/viewer/dl_renderer/src/view_builder.rs:441— ViewBuilder::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4 (5 pts), loops 1 (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.
dl_time_ruler::paint_ticks::paint_ticks (cognitive 16) crates/viewer/dl_time_ruler/src/paint_ticks.rs:98— dl_time_ruler::paint_ticks::paint_ticks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ComboItem::ui (cognitive 16) crates/viewer/dl_ui/src/combo_item.rs:60— ComboItem::ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UiExt::native_window_buttons_ui::window_button (cognitive 16) crates/viewer/dl_ui/src/ui_ext.rs:1014— UiExt::native_window_buttons_ui::window_button has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
dl_view_dataframe::dataframe_ui::line_ui (cognitive 16) crates/viewer/dl_view_dataframe/src/dataframe_ui.rs:554— dl_view_dataframe::dataframe_ui::line_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2, boolean chains 1 (nesting depth added 6). 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.
Points3DVisualizer::process_data (cognitive 16) crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:256— Points3DVisualizer::process_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 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.
StateVisualizer::execute (cognitive 16) crates/viewer/dl_view_state_timeline/src/visualizer.rs:260— StateVisualizer::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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.
TimeColumn.__init__ (cognitive 16) dalaran_py/dalaran_sdk/dalaran/_send_columns.py:60— TimeColumn.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Mesh3DExt.__init__ (cognitive 16) dalaran_py/dalaran_sdk/dalaran/archetypes/mesh3d_ext.py:47— Mesh3DExt.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 1 (4 pts), ternaries 1 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_utils._build_query_indices (cognitive 16) dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_utils.py:536— _utils._build_query_indices has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
urdf_model._joint_from_xml (cognitive 16) REDACTED:266— urdf_model._joint_from_xml has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, if/else 5 (6 pts), boolean chains 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.
bundle.extract_bundle (cognitive 16) dalaran_py/dalaran_sdk/dalaran/tools/bundle.py:450— bundle.extract_bundle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Near-duplicate member family (5 members, 10 shared lines) · ×1
Near-duplicate member family (5 members, 10 shared lines) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:360— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:360-481 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:653-817 | crates/viewer/dl_renderer/src/renderer/lines.rs:624-795 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:651-847 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:306-407 — These 5 members are variants of one another: a block of 10 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 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Near-duplicate member pair (85 shared lines) crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:340— crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:340-578 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:195-459 — These two members are variants of one another: 85 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (64 shared lines) crates/viewer/dl_selection_panel/src/view_entity_picker.rs:337— crates/viewer/dl_selection_panel/src/view_entity_picker.rs:337-441 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:109-212 — These two members are variants of one another: 64 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (58 shared lines) crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:174— crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:174-263 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:185-274 — These two members are variants of one another: 58 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (57 shared lines) crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:33— crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:33-142 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:42-149 — These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (24 shared lines) crates/viewer/dl_view_time_series/src/series_query.rs:200— crates/viewer/dl_view_time_series/src/series_query.rs:200-289 | crates/viewer/dl_view_time_series/src/series_query.rs:365-424 — These two members are variants of one another: 24 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (156 corresponding lines) · ×1
Edited copy of a member (156 corresponding lines) crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:22— crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:22-189 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:21-176 — These two members are one piece of code written twice and then edited apart: 156 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (100 corresponding lines) · ×1
Edited copy of a member (100 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:160— crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:160-259 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:155-255 — These two members are one piece of code written twice and then edited apart: 100 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (95 corresponding lines) · ×1
Edited copy of a member (95 corresponding lines) docs/snippets/all/archetypes/transform3d_hierarchy.rs:3— docs/snippets/all/archetypes/transform3d_hierarchy.rs:3-97 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:3-121 — These two members are one piece of code written twice and then edited apart: 95 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (103 corresponding lines) · ×1
Edited copy of a member (103 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:384— crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:384-486 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:413-535 — These two members are one piece of code written twice and then edited apart: 103 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (133 corresponding lines) · ×1
Edited copy of a member (133 corresponding lines) crates/viewer/dl_view/src/query.rs:247— crates/viewer/dl_view/src/query.rs:247-380 | crates/viewer/dl_view/src/query.rs:423-555 — These two members are one piece of code written twice and then edited apart: 133 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 95+ corresponding lines) · ×1
Edited copies of one member (3 members, 95+ corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:33— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:33-138 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:32-126 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:33-137 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 95 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (72 corresponding lines) · ×1
Edited copy of a member (72 corresponding lines) crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:166— crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:166-241 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:342-413 — These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (75 corresponding lines) · ×1
Edited copy of a member (75 corresponding lines) crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs:57— crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs:57-131 | crates/viewer/dl_view_map/src/visualizers/geo_points.rs:60-143 — These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (65 corresponding lines) · ×1
Edited copy of a member (65 corresponding lines) crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:99— crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:99-163 | crates/viewer/dl_renderer/src/renderer/world_grid.rs:118-189 — These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (67 corresponding lines) · ×1
Edited copy of a member (67 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:33— crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:33-103 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:32-98 — These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (77 corresponding lines) · ×1
Edited copy of a member (77 corresponding lines) crates/store/dl_query/src/bin/clamped_zip.rs:119— crates/store/dl_query/src/bin/clamped_zip.rs:119-195 | crates/store/dl_query/src/bin/clamped_zip.rs:236-313 — These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (59 corresponding lines) · ×1
Edited copy of a member (59 corresponding lines) crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:40— crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:40-99 | crates/viewer/dl_view_spatial/src/visualizers/meshes.rs:42-100 — These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (69 corresponding lines) · ×1
Edited copy of a member (69 corresponding lines) crates/store/dl_grpc_server/src/lib.rs:377— crates/store/dl_grpc_server/src/lib.rs:377-445 | crates/store/dl_grpc_server/src/lib.rs:460-540 — These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (55 corresponding lines) · ×1
Edited copy of a member (55 corresponding lines) crates/viewer/dl_view_map/src/map_view.rs:616— crates/viewer/dl_view_map/src/map_view.rs:616-670 | crates/viewer/dl_view_spatial/src/picking.rs:194-263 — These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (53 corresponding lines) · ×1
Edited copy of a member (53 corresponding lines) crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:525— crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:525-587 | crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs:264-316 — These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (54 corresponding lines) · ×1
Edited copy of a member (54 corresponding lines) crates/viewer/dl_selection_panel/src/selection_panel.rs:690— crates/viewer/dl_selection_panel/src/selection_panel.rs:690-743 | crates/viewer/dl_view/src/component_drop.rs:234-292 — These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (46 corresponding lines) · ×1
Edited copy of a member (46 corresponding lines) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:825— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:825-870 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:855-906 — These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 41+ corresponding lines) · ×1
Edited copies of one member (3 members, 41+ corresponding lines) dalaran_py/src/chunk_stream/hdf5_reader.rs:207— dalaran_py/src/chunk_stream/hdf5_reader.rs:207-247 | dalaran_py/src/chunk_stream/mp4_reader.rs:196-237 | dalaran_py/src/chunk_stream/parquet_reader.rs:180-225 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 41 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 16+ corresponding lines) · ×1
Edited copies of one member (6 members, 16+ corresponding lines) crates/viewer/dl_renderer/src/colormap.rs:276— crates/viewer/dl_renderer/src/colormap.rs:276-291 | crates/viewer/dl_renderer/src/colormap.rs:294-309 | crates/viewer/dl_renderer/src/colormap.rs:312-327 | crates/viewer/dl_renderer/src/colormap.rs:330-345 | crates/viewer/dl_renderer/src/colormap.rs:370-389 | crates/viewer/dl_renderer/src/colormap.rs:399-416 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 35+ corresponding lines) · ×1
Edited copies of one member (3 members, 35+ corresponding lines) docs/snippets/all/archetypes/scalars_multiple_plots.rs:3— docs/snippets/all/archetypes/scalars_multiple_plots.rs:3-60 | docs/snippets/all/archetypes/series_lines_style.rs:3-41 | docs/snippets/all/archetypes/series_points_style.rs:3-37 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (36 corresponding lines) · ×1
Edited copy of a member (36 corresponding lines) crates/viewer/dl_viewer_context/src/time_control/command.rs:546— crates/viewer/dl_viewer_context/src/time_control/command.rs:546-581 | crates/viewer/dl_viewer_context/src/time_control/command.rs:583-618 — These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (45 corresponding lines) · ×1
Edited copy of a member (45 corresponding lines) crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs:12— crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs:12-57 | crates/store/dl_lenses/src/semantic/foxglove/voxel_grid.rs:12-56 — These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 33+ corresponding lines) · ×1
Edited copies of one member (3 members, 33+ corresponding lines) crates/viewer/dl_viewer_context/src/component_ui_registry.rs:223— crates/viewer/dl_viewer_context/src/component_ui_registry.rs:223-263 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:360-392 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:405-437 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (42 corresponding lines) · ×1
Edited copy of a member (42 corresponding lines) crates/utils/dl_auth/src/oauth/login_flow.rs:30— crates/utils/dl_auth/src/oauth/login_flow.rs:30-71 | crates/utils/dl_auth/src/oauth/login_flow.rs:113-157 — These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 22+ corresponding lines) · ×1
Edited copies of one member (3 members, 22+ corresponding lines) crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:118— crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:118-143 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:146-167 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:170-191 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 16+ corresponding lines) · ×1
Edited copies of one member (4 members, 16+ corresponding lines) crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:187— crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:187-202 | crates/viewer/dl_view_spatial/src/proc_mesh.rs:499-517 | crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs:212-231 | crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs:146-166 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 23+ corresponding lines) · ×1
Edited copies of one member (3 members, 23+ corresponding lines) crates/store/dl_datafusion/src/dataset_manifest.rs:78— crates/store/dl_datafusion/src/dataset_manifest.rs:78-109 | crates/store/dl_datafusion/src/segment_table.rs:78-109 | crates/store/dl_datafusion/src/table_entry_provider.rs:245-267 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 42+ corresponding lines) · ×1
Edited copies of one member (3 members, 42+ corresponding lines) dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py:23— dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py:23-70 | dalaran_py/dalaran_sdk/dalaran/archetypes/asset_video_ext.py:27-68 | dalaran_py/dalaran_sdk/dalaran/archetypes/encoded_image_ext.py:43-106 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 21+ corresponding lines) · ×1
Edited copies of one member (4 members, 21+ corresponding lines) crates/store/dl_chunk/src/chunk.rs:1231— crates/store/dl_chunk/src/chunk.rs:1231-1251 | crates/store/dl_chunk/src/chunk.rs:1257-1277 | crates/store/dl_chunk/src/chunk.rs:1283-1306 | crates/store/dl_chunk/src/chunk.rs:1312-1335 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 50+ corresponding lines) · ×1
Edited copies of one member (4 members, 50+ corresponding lines) dalaran_py/dalaran_sdk/dalaran/sinks.py:124— dalaran_py/dalaran_sdk/dalaran/sinks.py:124-173 | dalaran_py/dalaran_sdk/dalaran/sinks.py:183-246 | dalaran_py/dalaran_sdk/dalaran/sinks.py:255-311 | dalaran_py/dalaran_sdk/dalaran/sinks.py:344-418 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 50 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (6 members, 21+ corresponding lines) · ×1
Edited copies of one member (6 members, 21+ corresponding lines) crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs:11— crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs:11-33 | crates/store/dl_lenses/src/semantic/foxglove/compressed_video.rs:11-31 | crates/store/dl_lenses/src/semantic/foxglove/location_fix.rs:15-37 | crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs:11-33 | crates/store/dl_lenses/src/semantic/foxglove/poses_in_frame.rs:11-33 | crates/store/dl_lenses/src/semantic/foxglove/raw_image.rs:13-33 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 17+ corresponding lines) · ×1
Edited copies of one member (4 members, 17+ corresponding lines) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1500— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1500-1516 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1528-1544 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1570-1586 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1711-1727 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 17+ corresponding lines) · ×1
Edited copies of one member (3 members, 17+ corresponding lines) crates/viewer/dl_viewport_blueprint/src/container.rs:343— crates/viewer/dl_viewport_blueprint/src/container.rs:343-362 | crates/viewer/dl_viewport_blueprint/src/container.rs:377-393 | crates/viewer/dl_viewport_blueprint/src/view.rs:324-343 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (44 corresponding lines) · ×1
Edited copy of a member (44 corresponding lines) dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py:207— dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py:207-250 | dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py:254-301 — These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 9+ corresponding lines) · ×1
Edited copies of one member (4 members, 9+ corresponding lines) dalaran_py/src/python_bridge.rs:2182— dalaran_py/src/python_bridge.rs:2182-2190 | dalaran_py/src/python_bridge.rs:2199-2207 | dalaran_py/src/python_bridge.rs:2216-2224 | dalaran_py/src/python_bridge.rs:2229-2237 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (8 members, 7+ corresponding lines) · ×1
Edited copies of one member (8 members, 7+ corresponding lines) crates/viewer/dl_component_ui/src/datatype_uis/bool_toggle.rs:9— crates/viewer/dl_component_ui/src/datatype_uis/bool_toggle.rs:9-15 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:23-29 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:45-51 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:95-101 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:125-131 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:138-144 | crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs:15-21 | crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs:29-35 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (56 corresponding lines) · ×1
Edited copy of a member (56 corresponding lines) dalaran_py/dalaran_sdk/dalaran/dynamic_archetype.py:199— dalaran_py/dalaran_sdk/dalaran/dynamic_archetype.py:199-258 | dalaran_py/dalaran_sdk/dalaran/any_value.py:97-152 — These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 9+ corresponding lines) · ×1
Edited copies of one member (3 members, 9+ corresponding lines) crates/store/dl_chunk_store/src/subscribers.rs:195— crates/store/dl_chunk_store/src/subscribers.rs:195-204 | crates/store/dl_chunk_store/src/subscribers.rs:217-225 | crates/store/dl_chunk_store/src/subscribers.rs:238-246 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 7+ corresponding lines) · ×1
Edited copies of one member (3 members, 7+ corresponding lines) crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:10— crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:10-16 | crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:24-30 | crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:36-42 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 10+ corresponding lines) · ×1
Edited copies of one member (4 members, 10+ corresponding lines) docs/snippets/all/descriptors/descr_builtin_archetype.rs:18— docs/snippets/all/descriptors/descr_builtin_archetype.rs:18-27 | docs/snippets/all/descriptors/descr_builtin_component.rs:28-37 | docs/snippets/all/descriptors/descr_custom_archetype.rs:63-72 | docs/snippets/all/descriptors/descr_custom_component.rs:23-32 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 4+ corresponding lines) · ×1
Edited copies of one member (3 members, 4+ corresponding lines) crates/store/dl_chunk/src/batcher.rs:440— crates/store/dl_chunk/src/batcher.rs:440-443 | crates/store/dl_log_encoding/src/dlr/file_sink.rs:53-56 | crates/top/dl_sdk/src/recording_stream.rs:1105-1108 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (3 corresponding lines) · ×1
Edited copy of a member (3 corresponding lines) crates/viewer/dl_view_graph/src/layout/result.rs:48— crates/viewer/dl_view_graph/src/layout/result.rs:48-50 | crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:424-429 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (39 lines × 2) crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:752— crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:752-790 | crates/viewer/dl_time_panel/src/time_panel.rs:1297-1335 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:752` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (35–36 lines × 2) crates/viewer/dl_view/src/query.rs:266— crates/viewer/dl_view/src/query.rs:266-300 | crates/viewer/dl_view/src/query.rs:448-483 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (28–29 lines × 6) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248-275 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:250-277 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:261-288 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:265-293 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:236-263 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:247-274 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24–27 lines × 2) crates/store/dl_importer/src/lerobot/datasetv2.rs:368— crates/store/dl_importer/src/lerobot/datasetv2.rs:368-391 | crates/store/dl_importer/src/lerobot/datasetv3.rs:412-438 — before extracting anything, compare `crates/store/dl_importer/src/lerobot/datasetv2.rs` and `crates/store/dl_importer/src/lerobot/datasetv3.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_importer/src/lerobot/datasetv2.rs:368` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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.
Duplicated block (25–27 lines × 2) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:844— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:844-870 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:882-906 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:844` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (25 lines × 2) crates/store/dl_query/src/bin/clamped_zip.rs:316— crates/store/dl_query/src/bin/clamped_zip.rs:316-340 | crates/store/dl_query/src/bin/range_zip.rs:457-481 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_query/src/bin/clamped_zip.rs:316` 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 (19–24 lines × 3) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:435— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:435-453 | crates/viewer/dl_renderer/src/renderer/lines.rs:719-740 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:775-798 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs` and `crates/viewer/dl_renderer/src/renderer/lines.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:435` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (23–24 lines × 2) crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1138— crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1138-1160 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1219-1242 — both copies are in the same file, so extract the 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 `crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1138` 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 (15–23 lines × 2) crates/store/dl_dataframe/src/query.rs:1298— crates/store/dl_dataframe/src/query.rs:1298-1320 | crates/store/dl_dataframe/src/query.rs:1771-1785 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_dataframe/src/query.rs:1298` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (22–23 lines × 2) dalaran_py/src/chunk_stream/hdf5_reader.rs:85— dalaran_py/src/chunk_stream/hdf5_reader.rs:85-107 | dalaran_py/src/chunk_stream/parquet_reader.rs:107-128 — 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 `dalaran_py/src/chunk_stream/hdf5_reader.rs:85` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (22 lines × 2) crates/store/dl_grpc_server/src/lib.rs:404— crates/store/dl_grpc_server/src/lib.rs:404-425 | crates/store/dl_grpc_server/src/lib.rs:509-530 — both copies are in the same file, so extract the 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 `crates/store/dl_grpc_server/src/lib.rs:404` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20–22 lines × 2) docs/snippets/all/archetypes/clear_recursive.rs:8— docs/snippets/all/archetypes/clear_recursive.rs:8-29 | docs/snippets/all/archetypes/clear_simple.rs:9-28 — 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 `docs/snippets/all/archetypes/clear_recursive.rs:8` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20–21 lines × 2) crates/viewer/dl_viewer/src/web.rs:432— crates/viewer/dl_viewer/src/web.rs:432-451 | crates/viewer/dl_viewer/src/web.rs:477-497 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/web.rs:432` 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.
Duplicated block (13–21 lines × 2) docs/snippets/all/archetypes/state_configuration.rs:6— docs/snippets/all/archetypes/state_configuration.rs:6-18 | docs/snippets/all/howto/state_timeline.rs:6-26 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/state_configuration.rs:6` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20 lines × 3) crates/store/dl_grpc_client/src/lib.rs:48— crates/store/dl_grpc_client/src/lib.rs:48-67 | crates/store/dl_grpc_server/src/lib.rs:128-147 | crates/store/dl_redap_client/src/lib.rs:124-143 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (19–20 lines × 2) crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:82— crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:82-101 | crates/store/dl_sorbet/src/migrations/v0_1_2__to__v0_1_3.rs:53-71 — 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 `crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:82` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (17–20 lines × 2) crates/viewer/dl_view/src/blueprint_resolved_results.rs:334— crates/viewer/dl_view/src/blueprint_resolved_results.rs:334-353 | crates/viewer/dl_view/src/blueprint_resolved_results.rs:362-378 — both copies are in the same file, so extract the 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 `crates/viewer/dl_view/src/blueprint_resolved_results.rs:334` 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.
Duplicated block (16–19 lines × 2) crates/viewer/dl_viewer/src/texture_readback.rs:132— crates/viewer/dl_viewer/src/texture_readback.rs:132-147 | crates/viewer/dl_viewer/src/texture_readback.rs:159-177 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer/src/texture_readback.rs:132` 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 (18 lines × 3) crates/utils/dl_perf_telemetry/src/prometheus.rs:613— crates/utils/dl_perf_telemetry/src/prometheus.rs:613-630 | crates/utils/dl_perf_telemetry/src/prometheus.rs:650-667 | crates/utils/dl_perf_telemetry/src/prometheus.rs:687-704 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_perf_telemetry/src/prometheus.rs:613` 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 (14–18 lines × 2) crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:206— crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:206-219 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:197-214 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer/dl_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:206` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (28 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:201— crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:201-228 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:197-224 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:201` 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 (15–17 lines × 2) crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:123— crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:123-137 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:273-289 — both copies are in the same file, so extract the 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 `crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:123` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16–17 lines × 2) crates/viewer/dl_viewer/src/app_state.rs:739— crates/viewer/dl_viewer/src/app_state.rs:739-755 | crates/viewer/dl_viewer/src/app_state.rs:763-778 — both copies are in the same file, so extract the 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 `crates/viewer/dl_viewer/src/app_state.rs:739` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (16 lines × 4) crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:219— crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:219-234 | crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:244-259 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:240-255 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:220-235 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs` as WHOLE FILES: this scan already matched 5 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. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:219` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:217` calls `unwrap_or_default` and `crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:241` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12–16 lines × 2) crates/store/dl_datafusion/src/pipeline_budget.rs:1488— crates/store/dl_datafusion/src/pipeline_budget.rs:1488-1503 | crates/store/dl_datafusion/src/pipeline_budget.rs:1519-1530 — both copies are in the same file, so extract the 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 `crates/store/dl_datafusion/src/pipeline_budget.rs:1488` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13–15 lines × 5) crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:12— crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:12-24 | crates/viewer/dl_viewer/data/quick_start_guides/quick_start_spawn.rs:11-25 | docs/snippets/all/howto/set_sinks.rs:22-34 | docs/snippets/all/quick_start/quick_start_connect.rs:13-25 | docs/snippets/all/quick_start/quick_start_spawn.rs:13-27 — before extracting anything, compare `crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs` and `docs/snippets/all/howto/set_sinks.rs` as WHOLE FILES: 83% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:12` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 4) crates/store/dl_chunk/src/iter.rs:479— crates/store/dl_chunk/src/iter.rs:479-492 | crates/store/dl_chunk/src/iter.rs:567-581 | crates/store/dl_chunk/src/iter.rs:640-653 | crates/store/dl_chunk/src/iter.rs:795-809 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_chunk/src/iter.rs:479` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 4) crates/viewer/dl_viewer/src/app_state.rs:641— crates/viewer/dl_viewer/src/app_state.rs:641-655 | crates/viewer/dl_viewer/src/app_state.rs:679-693 | crates/viewer/dl_viewer/src/app_state.rs:740-754 | crates/viewer/dl_viewer/src/app_state.rs:764-778 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_viewer/src/app_state.rs:641` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–15 lines × 2) dalaran_py/src/python_bridge.rs:1408— dalaran_py/src/python_bridge.rs:1408-1422 | dalaran_py/src/python_bridge.rs:1625-1636 — both copies are in the same file, so extract the 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 `dalaran_py/src/python_bridge.rs:1408` 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.
Duplicated block (13–14 lines × 4) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:466— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:466-479 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:800-812 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:828-841 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:392-404 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs` and `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:466` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (14 lines × 4) docs/snippets/all/descriptors/descr_builtin_archetype.rs:36— docs/snippets/all/descriptors/descr_builtin_archetype.rs:36-49 | docs/snippets/all/descriptors/descr_builtin_component.rs:46-59 | docs/snippets/all/descriptors/descr_custom_archetype.rs:81-94 | docs/snippets/all/descriptors/descr_custom_component.rs:41-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 all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/descriptors/descr_builtin_archetype.rs:36` 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 (13–14 lines × 3) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:205— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:205-218 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:207-220 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:239-251 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:205` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10–14 lines × 2) crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:438— crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:438-447 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:464-477 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:438` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (8–14 lines × 2) crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:146— crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:146-153 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:149-162 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs` as WHOLE FILES: this scan already matched 5 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. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:146` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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.
Duplicated block (12–13 lines × 5) crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:186— crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:186-197 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1600-1612 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1626-1638 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1654-1666 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1684-1696 — there are 5 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:186` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–13 lines × 4) crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:209— crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:209-221 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:141-152 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:213-224 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:143-155 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:209` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9–13 lines × 2) crates/viewer/dl_data_ui/src/video_ui.rs:833— crates/viewer/dl_data_ui/src/video_ui.rs:833-845 | crates/viewer/dl_data_ui/src/video_ui.rs:869-877 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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.
Duplicated block (11–13 lines × 2) docs/snippets/all/archetypes/state_change.rs:7— docs/snippets/all/archetypes/state_change.rs:7-17 | docs/snippets/all/archetypes/state_configuration.rs:15-27 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/state_change.rs:7` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–12 lines × 6) crates/utils/dl_perf_telemetry/src/prometheus.rs:213— crates/utils/dl_perf_telemetry/src/prometheus.rs:213-224 | crates/utils/dl_perf_telemetry/src/prometheus.rs:243-252 | crates/utils/dl_perf_telemetry/src/prometheus.rs:270-280 | crates/utils/dl_perf_telemetry/src/prometheus.rs:388-399 | crates/utils/dl_perf_telemetry/src/prometheus.rs:418-427 | crates/utils/dl_perf_telemetry/src/prometheus.rs:445-455 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_perf_telemetry/src/prometheus.rs:213` 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.
Duplicated block (8–12 lines × 2) crates/utils/dl_perf_telemetry/src/prometheus.rs:301— crates/utils/dl_perf_telemetry/src/prometheus.rs:301-312 | crates/utils/dl_perf_telemetry/src/prometheus.rs:363-370 — both copies are in the same file, so extract the 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 `crates/utils/dl_perf_telemetry/src/prometheus.rs:301` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (4–12 lines × 3) docs/snippets/all/archetypes/scalars_multiple_plots.rs:38— docs/snippets/all/archetypes/scalars_multiple_plots.rs:38-49 | docs/snippets/all/archetypes/series_lines_style.rs:26-37 | docs/snippets/all/archetypes/series_points_style.rs:26-29 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/archetypes/scalars_multiple_plots.rs:38` 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.
Duplicated block (8–11 lines × 11) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:250— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:250-260 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:252-262 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:263-273 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:217-224 | crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:242-249 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:238-245 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:268-278 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:218-225 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:238-248 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:249-259 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:292-302 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:250` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:266` calls `map_or`, `cast_slice` and `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 4) crates/viewer/dl_renderer/src/renderer/debug_overlay.rs:245— crates/viewer/dl_renderer/src/renderer/debug_overlay.rs:245-254 | crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:174-183 | crates/viewer/dl_renderer/src/renderer/world_grid.rs:198-207 | crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs:555-565 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:174` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5–10 lines × 3) crates/utils/dl_format/src/duration.rs:129— crates/utils/dl_format/src/duration.rs:129-133 | crates/utils/dl_format/src/duration.rs:135-144 | crates/utils/dl_format/src/duration.rs:147-157 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/utils/dl_format/src/duration.rs:129` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/utils/dl_format/src/duration.rs:146` calls `push`, `to_string` and `crates/utils/dl_format/src/duration.rs:159` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (3–7 lines × 3) crates/store/dl_chunk/src/iter.rs:661— crates/store/dl_chunk/src/iter.rs:661-663 | crates/store/dl_chunk/src/iter.rs:683-689 | crates/store/dl_chunk/src/iter.rs:697-703 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_chunk/src/iter.rs:683` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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.
Duplicated block (5 lines × 8) crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248— crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248-252 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:250-254 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:261-265 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:265-270 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:236-240 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:247-251 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:288-292 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:502-506 — before extracting anything, compare `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs` and `crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:507` calls `map_or`, `cast_slice` and `crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:253` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 5) crates/store/dl_uri/src/endpoints/catalog.rs:47— crates/store/dl_uri/src/endpoints/catalog.rs:47-51 | crates/store/dl_uri/src/endpoints/dataset.rs:168-172 | crates/store/dl_uri/src/endpoints/folder.rs:66-70 | crates/store/dl_uri/src/endpoints/proxy.rs:46-50 | crates/store/dl_uri/src/redap_uri.rs:141-145 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (7 lines × 6) dalaran_py/src/chunk_stream/engine.rs:666— dalaran_py/src/chunk_stream/engine.rs:666-672 | dalaran_py/src/chunk_stream/hdf5_reader.rs:256-262 | dalaran_py/src/chunk_stream/mcap_reader.rs:534-540 | dalaran_py/src/chunk_stream/mp4_reader.rs:246-252 | dalaran_py/src/chunk_stream/parquet_reader.rs:234-240 | dalaran_py/src/chunk_stream/urdf_tree_stream.rs:66-72 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 6 call sites, so a change lands once.
Duplicated block (10 lines × 5) crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:452— crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:452-461 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:786-795 | crates/viewer/dl_renderer/src/renderer/lines.rs:756-765 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:814-823 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:378-387 — before extracting anything, compare `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs` and `crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:452` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 4) crates/store/dl_lenses/src/op/string.rs:18— crates/store/dl_lenses/src/op/string.rs:18-26 | crates/store/dl_lenses/src/op/string.rs:38-46 | crates/store/dl_lenses/src/op/string.rs:58-66 | crates/store/dl_lenses/src/op/string.rs:78-86 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_lenses/src/op/string.rs:18` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 5) crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:170— crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:170-176 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:200-206 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:250-256 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:346-352 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:370-378 — 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. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:170` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (8 lines × 5) crates/store/dl_lenses/src/op/semantic.rs:263— crates/store/dl_lenses/src/op/semantic.rs:263-270 | crates/store/dl_lenses/src/op/string.rs:14-21 | crates/store/dl_lenses/src/op/string.rs:34-41 | crates/store/dl_lenses/src/op/string.rs:54-61 | crates/store/dl_lenses/src/op/string.rs:74-81 — there are 5 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (51–57 lines × 2) dalaran_py/dalaran_sdk/dalaran/sinks.py:183— dalaran_py/dalaran_sdk/dalaran/sinks.py:183-239 | dalaran_py/dalaran_sdk/dalaran/sinks.py:255-305 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (55 lines × 2) dalaran_py/dalaran_sdk/dalaran/archetypes/capsules3d_ext.py:29— dalaran_py/dalaran_sdk/dalaran/archetypes/capsules3d_ext.py:29-83 | dalaran_py/dalaran_sdk/dalaran/archetypes/cylinders3d_ext.py:29-83 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (52–53 lines × 2) dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py:26— dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py:26-78 | dalaran_py/dalaran_sdk/dalaran/archetypes/points3d_ext.py:26-77 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (37–43 lines × 2) dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py:23— dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py:23-65 | dalaran_py/dalaran_sdk/dalaran/archetypes/asset_video_ext.py:27-63 — 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 (28–29 lines × 2) dalaran_py/dalaran_sdk/dalaran/robot/_math.py:104— dalaran_py/dalaran_sdk/dalaran/robot/_math.py:104-131 | dalaran_py/dalaran_sdk/dalaran/robot/_math.py:203-231 — both copies are in the same file, so extract the block into 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–16 lines × 3) docs/snippets/all/tutorials/dna.py:49— docs/snippets/all/tutorials/dna.py:49-55 | docs/snippets/all/tutorials/dna.py:59-74 | examples/python/dna/dna.py:42-50 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `docs/snippets/all/tutorials/dna.py:59` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `docs/snippets/all/tutorials/dna.py:75` calls `bounce_lerp` and `docs/snippets/all/tutorials/dna.py:55` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (43 lines × 2) dalaran_py/dalaran_sdk/dalaran/archetypes/arrows2d_ext.py:26— dalaran_py/dalaran_sdk/dalaran/archetypes/arrows2d_ext.py:26-73 | dalaran_py/dalaran_sdk/dalaran/archetypes/ellipses2d_ext.py:26-68 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 4) dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:43— dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:43-50 | dalaran_py/dalaran_sdk/dalaran/archetypes/mesh3d_ext.py:34-41 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:29-36 | dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py:36-43 — before extracting anything, compare `dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py` and `dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `tensor` to `ImageLike` in one and `TensorLike` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Near-duplicate member pair (48 shared lines) scripts/ci/pixi_install_wheel.py:33— scripts/ci/pixi_install_wheel.py:33-92 | scripts/ci/uv_install_wheel.py:32-92 — These two members are variants of one another: 48 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copies of one member (8 members, 9+ corresponding lines) · ×1
Edited copies of one member (8 members, 9+ corresponding lines) scripts/generate_view_coordinate_defs.py:162— scripts/generate_view_coordinate_defs.py:162-171 | scripts/generate_view_coordinate_defs.py:179-187 | scripts/generate_view_coordinate_defs.py:202-211 | scripts/generate_view_coordinate_defs.py:219-227 | scripts/generate_view_coordinate_defs.py:241-249 | scripts/generate_view_coordinate_defs.py:261-269 | scripts/generate_view_coordinate_defs.py:283-291 | scripts/generate_view_coordinate_defs.py:303-311 — These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 12+ corresponding lines) · ×1
Edited copies of one member (3 members, 12+ corresponding lines) examples/python/drone_lidar/drone_lidar.py:30— examples/python/drone_lidar/drone_lidar.py:30-47 | examples/python/segment_anything_model/segment_anything_model.py:47-63 | examples/python/structure_from_motion/structure_from_motion/__main__.py:79-90 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 10+ corresponding lines) · ×1
Edited copies of one member (3 members, 10+ corresponding lines) examples/python/clock/clock.py:68— examples/python/clock/clock.py:68-77 | examples/python/live_depth_sensor/live_depth_sensor.py:93-103 | examples/python/robot_arm_teleop/main.py:193-202 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 2+ corresponding lines) · ×1
Edited copies of one member (4 members, 2+ corresponding lines) scripts/ci/build_and_upload_dalaran_notebook.py:26— scripts/ci/build_and_upload_dalaran_notebook.py:26-27 | scripts/ci/build_and_upload_wheels.py:31-32 | scripts/ci/publish_wheels.py:33-34 | scripts/ci/update_dalaran_notebook_version.py:29-30 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Duplicated block (29–30 lines × 2) crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:57— crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:57-86 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:61-89 — 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 `crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:57` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (38 lines × 2) crates/viewer/dl_renderer_examples/depth_cloud.rs:110— crates/viewer/dl_renderer_examples/depth_cloud.rs:110-147 | crates/viewer/dl_renderer_examples/depth_cloud.rs:192-229 — both copies are in the same file, so extract the 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 `crates/viewer/dl_renderer_examples/depth_cloud.rs:110` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 5) crates/store/dl_redap_tests/src/utils/dalaran.rs:157— crates/store/dl_redap_tests/src/utils/dalaran.rs:157-165 | crates/store/dl_redap_tests/src/utils/dalaran.rs:256-264 | crates/store/dl_redap_tests/src/utils/dalaran.rs:519-527 | crates/store/dl_redap_tests/src/utils/dalaran.rs:529-537 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1219-1227 — 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 (8 lines × 8) crates/store/dl_redap_tests/src/utils/dalaran.rs:88— crates/store/dl_redap_tests/src/utils/dalaran.rs:88-95 | crates/store/dl_redap_tests/src/utils/dalaran.rs:221-228 | crates/store/dl_redap_tests/src/utils/dalaran.rs:333-343 | crates/store/dl_redap_tests/src/utils/dalaran.rs:611-618 | crates/store/dl_redap_tests/src/utils/dalaran.rs:719-729 | crates/store/dl_redap_tests/src/utils/dalaran.rs:846-856 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1105-1112 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1169-1176 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `crates/store/dl_redap_tests/src/utils/dalaran.rs:88` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (17–18 lines × 2) examples/python/face_tracking/face_tracking.py:438— examples/python/face_tracking/face_tracking.py:438-455 | examples/python/gesture_detection/gesture_detection.py:277-293 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `examples/python/face_tracking/face_tracking.py:438` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `examples/python/gesture_detection/gesture_detection.py:276` calls `add_argument` and `examples/python/face_tracking/face_tracking.py:438` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11–14 lines × 2) examples/python/live_depth_sensor/live_depth_sensor.py:27— examples/python/live_depth_sensor/live_depth_sensor.py:27-37 | examples/python/live_depth_sensor/live_depth_sensor.py:51-64 — both copies are in the same file, so extract the 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 `examples/python/live_depth_sensor/live_depth_sensor.py:51` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–11 lines × 2) examples/python/imu_signals/imu_signals.py:94— examples/python/imu_signals/imu_signals.py:94-102 | examples/python/imu_signals/imu_signals.py:153-163 — both copies are in the same file, so extract the 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 `examples/python/imu_signals/imu_signals.py:94` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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.
Duplicated block (9 lines × 7) examples/python/face_tracking/face_tracking.py:328— examples/python/face_tracking/face_tracking.py:328-336 | examples/python/gesture_detection/gesture_detection.py:176-184 | examples/python/lidar/lidar/download_dataset.py:32-40 | examples/python/nuscenes_dataset/nuscenes_dataset/download_dataset.py:32-40 | examples/python/ocr/ocr.py:453-461 | examples/python/open_photogrammetry_format/open_photogrammetry_format.py:62-70 | scripts/upload_image.py:324-332 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times.
End-of-life runtime: Rust 1.95 rust-toolchain:1— rust-toolchain declares Rust 1.95 as this project's toolchain file, and Rust 1.95, superseded by 1.96 on 2026-05-28 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-05-28 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
Sync-over-async blocking crates/utils/dl_auth/src/cli.rs:51— `login` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs.
Duplicated block (15 lines × 2 locations) dalaran_js/web-viewer/index.ts:768— dalaran_js/web-viewer/index.ts:768 · dalaran_js/web-viewer/index.ts: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 (13 lines × 2 locations) dalaran_js/web-viewer/index.ts:899— dalaran_js/web-viewer/index.ts:899 · dalaran_js/web-viewer/index.ts:914 — both copies are in the same file, so extract the block into 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 locations) dalaran_js/web-viewer/index.ts:688— dalaran_js/web-viewer/index.ts:688 · dalaran_js/web-viewer/index.ts:710 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Complex function start (cyclomatic 14, cognitive 13) dalaran_js/web-viewer/index.ts:490— start has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function on_custom_message (cyclomatic 14, cognitive 9) dalaran_notebook/src/js/widget.ts:112— on_custom_message has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function (top-level) (cyclomatic 11, cognitive 21) dalaran_js/scripts/version.mjs:4— (top-level) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· dalaran_js/web-viewer/index.ts · ×1
dalaran_js/web-viewer/index.ts: 1170 lines of code dalaran_js/web-viewer/index.ts:1— dalaran_js/web-viewer/index.ts has 1170 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
No test or lint script — test ✗ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
Unused dependency 'dts-buddy' dalaran_js/web-viewer/package.json:56— Declared in dalaran_js/web-viewer/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Third-party script without Subresource Integrity scripts/ci/templates/benchmark.html:111— `https://cdn.jsdelivr.net/npm/chart.js@4.4.0/dist/chart.umd.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session.
Blocking `thread::sleep` inside an `async` body crates/utils/dl_auth/src/cli.rs:90— This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`.
Documentation: no build, run or usage example crates/store/dl_chunk/README.md:1— `dl_chunk` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_chunk/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_chunk_store/README.md:1— `dl_chunk_store` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_chunk_store/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_data_source/README.md:1— `dl_data_source` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_data_source/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_dataframe/README.md:1— `dl_dataframe` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_dataframe/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_entity_db/README.md:1— `dl_entity_db` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_entity_db/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_grpc_client/README.md:1— `dl_grpc_client` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_grpc_client/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_grpc_server/README.md:1— `dl_grpc_server` is a binary crate (`src/main.rs`) and neither `crates/store/dl_grpc_server/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_hdf5/README.md:1— `dl_hdf5` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_hdf5/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_importer/README.md:1— `dl_importer` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_importer/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_lenses/README.md:1— `dl_lenses` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_lenses/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_lenses_core/README.md:1— `dl_lenses_core` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_lenses_core/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_log_channel/README.md:1— `dl_log_channel` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_log_channel/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_log_encoding/README.md:1— `dl_log_encoding` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_log_encoding/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_log_types/README.md:1— `dl_log_types` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_log_types/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_mcap/README.md:1— `dl_mcap` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_mcap/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_mp4_reader/README.md:1— `dl_mp4_reader` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_mp4_reader/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_protos/README.md:1— `dl_protos` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_protos/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_query/README.md:1— `dl_query` is a binary crate (`[[bin]]` in `Cargo.toml`) and neither `crates/store/dl_query/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_redap_client/README.md:1— `dl_redap_client` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_redap_client/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_sdk_types/README.md:1— `dl_sdk_types` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_sdk_types/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_server/README.md:1— `dl_server` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_server/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_sorbet/README.md:1— `dl_sorbet` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_sorbet/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_tf/README.md:1— `dl_tf` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_tf/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_types_core/README.md:1— `dl_types_core` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_types_core/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Documentation: no build, run or usage example crates/store/dl_uri/README.md:1— `dl_uri` is a published crate (`[package]` without `publish = false`) and neither `crates/store/dl_uri/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
Orphaned file crates/store/dl_types_core/src/as_components.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file scripts/generate_view_coordinate_defs.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_py/dalaran_sdk/dalaran/error_utils.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_query/src/storage_engine.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_log_types/src/vec_deque_ext.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_sdk_types/src/datatypes/blob_ext.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_py/dalaran_sdk/dalaran/blueprint/containers.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_ext.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_py/dalaran_sdk/dalaran/datatypes/rgba32_ext.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/top/dl_sdk/src/blueprint/panel.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file scripts/fetch_crashes.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_sdk_types/src/datatypes/image_format_ext.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/viewer/dl_renderer/src/file_system.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file dalaran_py/dalaran_sdk/dalaran/_script_helpers.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_sdk_types/src/view_coordinates.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/top/dalaran/src/log_integration.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/top/dalaran/src/demo_util.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_importer/src/importer_directory.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/utils/dl_perf_telemetry/src/metrics_server.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_sdk_types/src/archetypes/capsules3d_ext.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/utils/dl_analytics/src/native/config.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/store/dl_query/src/cache_stats.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.
Interpolated log message defeats structured logging dalaran_notebook/src/dalaran_notebook/__init__.py:248— `warning` at line 248 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging dalaran_py/src/trace_context.rs:153— `debug!` at line 153 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 dalaran_py/src/trace_context.rs:164— `debug!` at line 164 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 dalaran_py/src/tracing_session.rs:142— `info!` at line 142 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 dalaran_py/src/catalog/connection_handle.rs:272— `warn!` at line 272 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/utils/dl_perf_telemetry/src/metrics_server.rs:48— `error!` at line 48 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/utils/dl_perf_telemetry/src/metrics_server.rs:52— `info!` at line 52 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/utils/dl_perf_telemetry/src/metrics_server.rs:87— `error!` at line 87 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/utils/dl_perf_telemetry/src/metrics_server.rs:97— `error!` at line 97 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/utils/dl_perf_telemetry/src/telemetry.rs:183— `warn!` at line 183 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/utils/dl_perf_telemetry/src/telemetry.rs:281— `warn!` at line 281 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/utils/dl_perf_telemetry/src/tracestate.rs:139— `debug!` at line 139 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/utils/dl_perf_telemetry/src/tracing_session.rs:331— `info!` at line 331 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/store/dl_server/src/server.rs:112— `info!` at line 112 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `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/store/dl_server/src/server.rs:120— `error!` at line 120 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/store/dl_server/src/server.rs:179— `error!` at line 179 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/store/dl_redap_client/src/lib.rs:295— `trace!` at line 295 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/store/dl_redap_client/src/lib.rs:306— `trace!` at line 306 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/store/dl_redap_client/src/lib.rs:314— `trace!` at line 314 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Interpolated log message defeats structured logging crates/store/dl_redap_client/src/lib.rs:325— `debug!` at line 325 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/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:457— `debug!` at line 457 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/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:522— `debug!` at line 522 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
Duplicated predicate dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py:64— `class_ids is None and keypoint_ids is not None` appears character-identically in 2 files — dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py, dalaran_py/dalaran_sdk/dalaran/archetypes/points3d_ext.py. 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 dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py:210— `fnmatchcase(normalized, pattern) or fnmatchcase(normalized, "/" + pattern.strip("/"))` appears character-identically in 2 files — dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py, dalaran_py/dalaran_sdk/dalaran/ros2/naming.py. 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 dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py:55— `isinstance(data[0], Sequence) and len(data[0]) > 0 and isinstance(data[0][0], numbers.Number)` appears character-identically in 3 files — dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py, dalaran_py/dalaran_sdk/dalaran/components/line_strip2d_ext.py, dalaran_py/dalaran_sdk/dalaran/components/line_strip3d_ext.py. 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 dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py:64— `isinstance(data[0], np.ndarray) and data[0].shape == (2,)` appears character-identically in 2 files — dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py, dalaran_py/dalaran_sdk/dalaran/components/line_strip2d_ext.py. 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/viewer/dl_selection_panel/src/view_entity_picker.rs:423— `!node_info.is_leaf && !entity_tree.path.is_root()` appears character-identically in 2 files — crates/viewer/dl_selection_panel/src/view_entity_picker.rs, crates/viewer/dl_time_panel/src/streams_tree_data.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/viewer/dl_view_time_series/src/line_visualizer_system.rs:184— `!series.visible || series.points.is_empty()` appears character-identically in 3 files — crates/viewer/dl_view_time_series/src/line_visualizer_system.rs, crates/viewer/dl_view_time_series/src/point_visualizer_system.rs, crates/viewer/dl_view_time_series/src/view_class.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/utils/dl_quota_channel/src/async_broadcast_channel.rs:229— `!warned && BLOCKED_WARNING_THRESHOLD < start.elapsed()` appears character-identically in 2 files — crates/utils/dl_quota_channel/src/async_broadcast_channel.rs, crates/utils/dl_quota_channel/src/sync/mod.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:411— `all_scalar_chunks.chunks.first() && chunk.is_static()` appears character-identically in 2 files — crates/viewer/dl_view_time_series/src/line_visualizer_system.rs, crates/viewer/dl_view_time_series/src/point_visualizer_system.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/viewer/dl_data_ui/src/component_path_ui.rs:39— `any_missing_chunks && ctx.db.can_fetch_chunks_from_redap()` appears character-identically in 2 files — crates/viewer/dl_data_ui/src/component_path_ui.rs, crates/viewer/dl_data_ui/src/instance_path_ui.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/top/dalaran/src/commands/entrypoint.rs:710— `cfg!(feature = "perf_telemetry") && dl_log::env_var_is_truthy("TELEMETRY_ENABLED")` appears character-identically in 2 files — crates/top/dalaran/src/commands/entrypoint.rs, dalaran_py/src/python_bridge.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/utils/dl_video/src/h264.rs:189— `chunk.is_sync && !state.previous_frame_was_idr` appears character-identically in 2 files — crates/utils/dl_video/src/h264.rs, crates/utils/dl_video/src/h265.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/viewer/dl_view_spatial/src/ui_3d.rs:207— `resolution_in_pixel[0] == 0 || resolution_in_pixel[1] == 0` appears character-identically in 3 files — crates/viewer/dl_view_spatial/src/ui_3d.rs, crates/viewer/dl_view_time_series/src/view_class.rs, crates/viewer/dl_viewer_context/src/gpu_bridge/mod.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate crates/store/dl_sdk_types/src/components/draw_order_ext.rs:33— `self.0.is_nan() && other.0.is_nan() || self.0 == other.0` appears character-identically in 2 files — crates/store/dl_sdk_types/src/components/draw_order_ext.rs, crates/viewer/dl_renderer/src/size.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/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:263— `suspicious_length.is_finite() && suspicious_length > 0.0` appears character-identically in 2 files — crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs, crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.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.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×8
Projects may be oversized for their cohesion dalaran_py/Cargo.toml:1— `dalaran_py` (43601 LoC, 959 module-visible types across 26 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Projects may be oversized for their cohesion crates/viewer/dl_viewer_context/Cargo.toml:1— `crates/viewer/dl_viewer_context` (22748 LoC, 204 module-visible types across 8 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Projects may be oversized for their cohesion crates/viewer/dl_renderer/Cargo.toml:1— `crates/viewer/dl_renderer` (21843 LoC, 273 module-visible types across 9 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Projects may be oversized for their cohesion crates/build/dl_types_builder/Cargo.toml:1— `crates/build/dl_types_builder` (18062 LoC, 80 module-visible types across 11 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Projects may be oversized for their cohesion crates/viewer/dl_view_spatial/Cargo.toml:1— `crates/viewer/dl_view_spatial` (17523 LoC, 123 module-visible types across 6 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Projects may be oversized for their cohesion crates/viewer/dl_viewer/Cargo.toml:1— `crates/viewer/dl_viewer` (17290 LoC, 101 module-visible types across 11 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Projects may be oversized for their cohesion crates/viewer/dl_ui/Cargo.toml:1— `crates/viewer/dl_ui` (13494 LoC, 129 module-visible types across 5 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Projects may be oversized for their cohesion docs/snippets/Cargo.toml:1— `docs/snippets` (10237 LoC, 145 module-visible types across 10 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/10. 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.
Silent fallback default on Err crates/utils/dl_tuid/src/lib.rs:298— `nanos_since_epoch` turns every `Err` into `0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs:807— `download_advice` (in `read_ffmpeg_output`) 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/viewer/dl_renderer/src/file_resolver.rs:209— `from_env` turns every `Err` into `Self::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err crates/viewer/dl_view_graph/src/view.rs:70— `on_register` turns every `Err` into `dl_sdk_types::blueprint::components::VisualBounds2D::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err crates/viewer/dl_view_spatial/src/view_2d.rs:64— `on_register` turns every `Err` into `dl_sdk_types::blueprint::components::VisualBounds2D::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err crates/viewer/dl_view_spatial/src/view_3d.rs:138— `on_register` turns every `Err` into `1.0.into()` — 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/viewer/dl_view_spatial/src/shared_fallbacks.rs:65— `register_fallbacks` turns every `Err` into `Default::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 32 significant file(s) lose their only recent owner: dalaran_py/dalaran_sdk/dalaran/robot/robot.py, dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py, dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py, crates/store/dl_importer/src/lib.rs, dalaran_py/dalaran_sdk/dalaran/robot/conventions.py, REDACTED, dalaran_py/dalaran_sdk/dalaran/tools/bundle.py, crates/store/dl_log_encoding/src/dlr/frames.rs (+24 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 7 significant file(s) lose their only recent owner: crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs, crates/utils/dl_quota_channel/src/async_broadcast_channel.rs, crates/viewer/dl_renderer/src/gaussian_splat_builder.rs, crates/store/dl_types_core/src/layer_name.rs, scripts/check_forbidden_dependencies.py, crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs, crates/store/dl_redap_client/src/api_response_stream.rs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs, crates/top/dalaran/src/commands/mcap/check.rs, crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/model.rs, crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/layout.rs, crates/store/dl_mcap/src/parsers/ros2msg/tf2_msgs/tf_message.rs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #4 — If anonymized user #4 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/utils/dl_web/src/fs.rs, crates/utils/dl_async/src/lib.rs, crates/viewer/dl_viewer/src/background_tasks.rs, crates/store/dl_log_encoding/src/dlr/fingerprint.rs, crates/store/dl_redap_client/src/analytics_exporter.rs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #5 — If anonymized user #5 becomes unavailable, 4 significant file(s) lose their only recent owner: dalaran_py/dalaran_sdk/dalaran/experimental/_hdf5_reader.py, crates/store/dl_hdf5/src/walk.rs, crates/store/dl_hdf5/src/load.rs, dalaran_py/dalaran_sdk/dalaran/experimental/_dlr_reader.py. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #6 — If anonymized user #6 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/utils/dl_video/src/decode/ffmpeg_cli/transcode.rs, dalaran_py/dalaran_sdk/dalaran/experimental/_mp4_reader.py, scripts/ci/check_skills.py. Pair on, review, or document these before any departure.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×2
REDACTED
REDACTED
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 9 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 (69 single-owned of 1170 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; 1170 of the 1713 production source files in this repository met that bar). They are anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (2 file(s)), anonymized user #10 (2 file(s)), anonymized user #11 (1 file(s)), anonymized user #12 (1 file(s)) (+3 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/viewer/dl_view_state_timeline/src/visualizer.rs, crates/viewer/dl_component_ui/src/color_swatch.rs, dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest_build.py, dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest.py, scripts/update_docs_url_rewrite.py, scripts/ci/generate_prerelease_pip_index.py, crates/store/dl_sdk_types/src/transform_frame_id_hash.rs, crates/viewer/dl_view/src/visualizer_query.rs (+5 more).
No ADRs found run_wasm/src/main.rs:1— No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `run_wasm/src/main.rs` makes this repository a deployable product (line 1).
D21 · Naming Consistency· `do_GET` spells `GET` where 78 names in the project spell it `get` · ×1
`do_GET` spells `GET` where 78 names in the project spell it `get` dalaran_notebook/src/dalaran_notebook/asset_server.py:39— 78 of 80 names in project dalaran-workspace spell the token `get` (78 of 80; unit: names in project dalaran-workspace containing `get`). Peers: dalaran_pixi_env.get_pixi_project_root (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:12); dalaran_pixi_env.get_scripts_dir (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:21); pyo3_config.get_python_config (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:21); pyo3_config.get_python_executable (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:90); CatalogClient.get_dataset (dalaran_py/dalaran_sdk/dalaran/catalog/_catalog_client.py:310). Rename to `do_get`. [rule N6]
D21 · Naming Consistency· `_serve_GET` spells `GET` where 78 names in the project spell it `get` · ×1
`_serve_GET` spells `GET` where 78 names in the project spell it `get` dalaran_notebook/src/dalaran_notebook/asset_server.py:48— 78 of 80 names in project dalaran-workspace spell the token `get` (78 of 80; unit: names in project dalaran-workspace containing `get`). Peers: dalaran_pixi_env.get_pixi_project_root (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:12); dalaran_pixi_env.get_scripts_dir (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:21); pyo3_config.get_python_config (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:21); pyo3_config.get_python_executable (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:90); CatalogClient.get_dataset (dalaran_py/dalaran_sdk/dalaran/catalog/_catalog_client.py:310). Rename to `_serve_get`. [rule N6]
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×1
REDACTED
D30 · Dependency Vulnerabilities· High vulnerability · ×1
REDACTED
D30 · Dependency Vulnerabilities· Medium vulnerability · ×1
REDACTED
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 39 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: crates/store/dl_types_core/src/as_components.rs, scripts/generate_view_coordinate_defs.py, dalaran_py/dalaran_sdk/dalaran/error_utils.py, crates/store/dl_query/src/storage_engine.rs, crates/store/dl_log_types/src/vec_deque_ext.rs, dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py, crates/store/dl_sdk_types/src/datatypes/blob_ext.rs, dalaran_py/dalaran_sdk/dalaran/blueprint/containers.py (and 31 more) (41 orphaned of 1170 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; 1170 of the 1713 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
Logging is not universal — Only 57/65 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/build/dl_dev_tools`, `crates/build/dl_web_tests`, `crates/store/dl_query`, `crates/top/dalaran-cli`, `crates/utils/dl_test_mocks` and 3 more.
No dependency-update automation dalaran_js/package.json:13— `dalaran_js/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
Unused private field '#id' dalaran_js/web-viewer/index.ts:468— Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect.
R7 · Dead Code· Unused private method '_on_raw_event' · ×1
Unused private method '_on_raw_event' dalaran_js/web-viewer/index.ts:647— Nothing in its class calls or references this private method — no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used.
R7 · Dead Code· Unused module-local declaration 'error' · ×1
Unused module-local declaration 'error' dalaran_notebook/build.mjs:40— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
X2 · Cancellation propagation· Not all async functions that make a request accept an AbortSignal · ×1
Not all async functions that make a request accept an AbortSignal — Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) 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.
X23 · Unguarded diagnostic materialisation· Diagnostic log message is built whether or not it is wanted · ×1
Diagnostic log message is built whether or not it is wanted crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:522— `tracing::debug!` at line 522 is called with an argument built by `chunk_sizes.iter().sum::<u64>()` (line 525), whose cost grows with the collection it walks. Rust evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because tracing::debug! is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `log_enabled!`/`tracing::enabled!` test, no debug flag, no `cfg(debug_assertions)`, and the work is in the argument itself, not deferred into a field the subscriber formats or a closure the formatter calls.
Subsumed condition operand crates/store/dl_datafusion/src/chunk_fetcher.rs:333— `msg.contains("connection")` can never decide this `||` — every value satisfying `msg.contains("connection")` also satisfies `msg.contains("connect")`, 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: async-trait — `async-trait` is locked at 0.1.91 but 0.1.92 is the current stable release on crates.io, and it already satisfies the `"0.1.91"` requirement declared in crates/store/dl_datafusion/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: backtrace — `backtrace` is locked at 0.3.76 but 0.3.77 is the current stable release on crates.io, and it already satisfies the `"0.3.76"` requirement declared in crates/utils/dl_crash_handler/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p backtrace` and commit the updated REDACTED.
Outdated: base64 — `base64` is locked at 0.23.0 but 0.23.1 is the current stable release on crates.io, and it already satisfies the `"0.23.0"` requirement declared in crates/utils/dl_auth/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p base64` and commit the updated REDACTED.
Outdated: bitflags — `bitflags` is locked at 2.13.1 but 2.13.2 is the current stable release on crates.io, and it already satisfies the `"2.13"` requirement declared in crates/store/dl_redap_client/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bitflags` and commit the updated REDACTED.
Outdated: camino — `camino` is locked at 1.2.3 but 1.2.6 is the current stable release on crates.io, and it already satisfies the `"1.2"` requirement declared in crates/build/dl_dev_tools/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p camino` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.6.1 but 4.6.8 is the current stable release on crates.io, and it already satisfies the `"4.6"` requirement declared in crates/store/dl_server/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: const_format — `const_format` is locked at 0.2.36 but 0.2.37 is the current stable release on crates.io, and it already satisfies the `"0.2.36"` requirement declared in crates/top/dl_sdk/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p const_format` and commit the updated REDACTED.
Outdated: crossbeam — `crossbeam` is locked at 0.8.4 but 0.8.5 is the current stable release on crates.io, and it already satisfies the `"0.8.4"` requirement declared in dalaran_py/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam` and commit the updated REDACTED.
Outdated: ehttp — `ehttp` 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.1"` requirement declared in crates/store/dl_data_source/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ehttp` and commit the updated REDACTED.
Outdated: enumset — `enumset` is locked at 1.1.13 but 1.1.15 is the current stable release on crates.io, and it already satisfies the `"1.1"` requirement declared in crates/viewer/dl_renderer/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p enumset` and commit the updated REDACTED.
Outdated: ffmpeg-sidecar — `ffmpeg-sidecar` is locked at 2.5.2 but 2.7.0 is the current stable release on crates.io, and it already satisfies the `"2.5"` requirement declared in crates/utils/dl_video/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ffmpeg-sidecar` and commit the updated REDACTED.
Outdated: futures — `futures` is locked at 0.3.33 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3.33"` requirement declared in dalaran_py/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.33 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3.33"` requirement declared in crates/store/dl_datafusion/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: gilrs — `gilrs` is locked at 0.11.1 but 0.11.2 is the current stable release on crates.io, and it already satisfies the `"0.11.1"` requirement declared in crates/viewer/dl_gamepad/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p gilrs` and commit the updated REDACTED.
Outdated: image — `image` is locked at 0.25.6 but 0.25.10 is the current stable release on crates.io, and it already satisfies the `"0.25.6"` requirement declared in crates/store/dl_importer/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p image` and commit the updated REDACTED.
Outdated: indexmap — `indexmap` is locked at 2.14.0 but 2.14.2 is the current stable release on crates.io, and it already satisfies the `"2.14"` requirement declared in crates/store/dl_entity_db/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p indexmap` and commit the updated REDACTED.
Outdated: insta — `insta` is locked at 1.48.0 but 1.49.0 is the current stable release on crates.io, and it already satisfies the `"1.48"` requirement declared in crates/store/dl_redap_tests/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p insta` and commit the updated REDACTED.
Outdated: js-sys — `js-sys` is locked at 0.3.103 but 0.3.107 is the current stable release on crates.io, and it already satisfies the `"0.3.103"` requirement declared in crates/store/dl_log_encoding/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p js-sys` and commit the updated REDACTED.
Outdated: libc — `libc` is locked at 0.2.189 but 0.2.191 is the current stable release on crates.io, and it already satisfies the `"0.2.189"` requirement declared in crates/top/dalaran/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libc` and commit the updated REDACTED.
Outdated: log — `log` is locked at 0.4.33 but 0.4.35 is the current stable release on crates.io, and it already satisfies the `"0.4.33"` requirement declared in crates/top/dalaran/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p log` and commit the updated REDACTED.
Outdated: memmap2 — `memmap2` is locked at 0.9.11 but 0.9.12 is the current stable release on crates.io, and it already satisfies the `"0.9.11"` requirement declared in dalaran_py/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p memmap2` and commit the updated REDACTED.
Outdated: notify — `notify` is locked at 8.2.0 but 8.2.2 is the current stable release on crates.io, and it already satisfies the `"8.2"` requirement declared in crates/viewer/dl_renderer/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p notify` and commit the updated REDACTED.
Outdated: ordered-float — `ordered-float` is locked at 5.3.0 but 5.5.1 is the current stable release on crates.io, and it already satisfies the `"5.3"` requirement declared in crates/viewer/dl_dataframe_ui/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ordered-float` and commit the updated REDACTED.
Outdated: pollster — `pollster` is locked at 1.0.1 but 1.0.2 is the current stable release on crates.io, and it already satisfies the `"1.0"` requirement declared in crates/viewer/dl_renderer_examples/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p pollster` and commit the updated REDACTED.
Outdated: prost — `prost` is locked at 0.14.4 but 0.14.6 is the current stable release on crates.io, and it already satisfies the `"0.14.4"` requirement declared in crates/store/dl_protos/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p prost` and commit the updated REDACTED.
doc comments repeat the names dalaran_js/web-viewer/index.ts:991— 0 of 13 documented parameters and 1 of 60 summaries in `@dalaran/web-viewer` only repeat the member or parameter name (e.g. "Get the active recording id." for `get_active_recording_id`). 3 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
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) — `dalaran_py/dalaran_sdk/dalaran/catalog/_entry.py` — so the PII/GDPR sweep did not cover them at all.
provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
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 01a1eadf-ed30-7cdd-b9e5-73177d92f0bf · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 60 · Warnings: 3302 · Recommendations: 202 · Info: 56 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 17-11-2026 @ 18:58 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.