Public report of rerun-io/rerun, published 27 October 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 27 October 2026, 04:26 UTC · Survey ID cd_b7a43e5ef94e42fb896ac1586fd1c7f9

rerun-io/rerun

Measured 27 October 2026, 04:00 UTC, at code version dfb1b97

Regression: 1 dimension fell since the last survey Code coverage: not measured

A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.

Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureTestRunFailed).

CAI score 61out of 100 At risk Down 3 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A very large codebase: 558,184 lines of product code in 124 projects, tests not counted · Estimated rebuild effort: about 5.0 person-years · Weakest lens: Accessibility, 55

Findings by how serious they are

144 critical 3081 serious 206 minor

15 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
27 October 2026, 04:00 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that implements it, and today Watchdog is the only one that does.

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. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

87of 87 dimensions measured by tools.
3258of 3431 findings point to an exact file and line, so you can open each one in the code. The other 173 concern the repository as a whole, such as missing documentation.
87dimensions across 8 lenses, read from 558,184 lines of product code in 124 projects.
Chapters

Executive summary

rerun-io/rerun is rated At risk because critical security findings are open, most of them in the build pipeline. It scores 61 out of 100, which the At risk rating leaves unchanged. We judged it as a preview release, against a lower bar.

Accessibility, at 55, is the weakest lens and counts most in the score. The best first steps are fixing focus, motion and contrast and automating accessibility checks, each worth about 3 points. Raising Accessibility to 65 would lift the score to about 64.

Seventy-nine secrets can leak from the build pipeline. Forty-one pipeline steps put outside input straight into a shell command, so an attacker can run commands in the build pipeline. Limiting each secret to its own step and passing outside input through environment variables would close both risks. Fixing the weaknesses the scanner points to would fix the five security weaknesses in the code, and the three unsafe settings in infrastructure or container files need changing to safe values. The three pages that block zooming need the zoom block removed.

The product code is 558,184 lines, about €730,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 for The 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.
Accessibility 55 · counts for 45%Code Health 60 · counts for 25%Production Readiness 61 · counts for 14%Maturity 70 · counts for 8%Security and Compliance 72 · counts for 4%Performance 87 · counts for 2%Architecture 95 · counts for 1%Event Sourcing 100 · counts for 1%

If Accessibility rose from 55 to 65, the lowest score rated Strong, the score would rise from 61 to about 64.

Code composition: what the lines of code are
Product code 83%Tests 17%
New since the last survey: 282 findings

These 282 critical or serious findings weren't in the previous survey, on 13 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.

  • Cyclomatic Complexity · AppCore::run_system_command (cyclomatic 97) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · AppCore::run_ui_command (cyclomatic 61) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · AppCore::frame_ui (cyclomatic 36) crates/top/re_viewer/src/app/mod.rs
  • Cyclomatic Complexity · AppCore::run_recording_command (cyclomatic 35) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy (cyclomatic 34) crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.legacy_adapter.rs
  • Cyclomatic Complexity · AppCore::serve_viewer_control (cyclomatic 34) crates/top/re_viewer/src/app/viewer_control.rs
  • Cyclomatic Complexity · re_dataframe_ui::filters::column_filter_ui::column_picker_ui (cyclomatic 31) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs
  • Cyclomatic Complexity · DataFusionTableWidget::table_ui (cyclomatic 28) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs
  • Cyclomatic Complexity · FieldInput::value (cyclomatic 22) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs
  • Cyclomatic Complexity · re_agent_ui::ui::elicitation_ui::field_ui (cyclomatic 22) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs
  • Cyclomatic Complexity · AppCore::load_data_source (cyclomatic 22) crates/top/re_viewer/src/app/add_data_source.rs
  • Cyclomatic Complexity · ViewerUrl::open (cyclomatic 21) crates/viewer_support/re_viewer_context/src/viewer_url.rs
  • Cyclomatic Complexity · AppCore::is_back_destination_open (cyclomatic 20) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · FilterState::filter_bar_ui (cyclomatic 19) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs
  • Cyclomatic Complexity · ViewerUrl::parse_with_options (cyclomatic 19) crates/viewer_support/re_viewer_context/src/viewer_url.rs
  • Cyclomatic Complexity · ViewerUrl::sharable_url (cyclomatic 19) crates/viewer_support/re_viewer_context/src/viewer_url.rs
  • Cyclomatic Complexity · VideoPlayer::frame_at (cyclomatic 18) crates/utils/re_video/src/player/mod.rs
  • Cyclomatic Complexity · re_agent_ui::ui::chat_ui::permissions_ui (cyclomatic 17) crates/panels/re_agent_ui/src/ui/chat_ui.rs
  • Cyclomatic Complexity · CoverageEditor::show_mode (cyclomatic 17) crates/panels/re_redap_browser/src/asset_coverage_modal.rs
  • Cyclomatic Complexity · AssetCoverageModal::ui (cyclomatic 17) crates/panels/re_redap_browser/src/asset_coverage_modal.rs
  • Cyclomatic Complexity · ArrowNode::show (cyclomatic 17) crates/viewer_support/re_arrow_ui/src/arrow_node.rs
  • Cyclomatic Complexity · collect_targets (cyclomatic 17) rerun_js/web-viewer/typedoc-used-by.mjs
  • Cyclomatic Complexity · AppCore::receive_messages (cyclomatic 16) crates/top/re_viewer/src/app/logic.rs
  • Cyclomatic Complexity · TextLogTableDelegate::cell_ui (cyclomatic 16) crates/views/re_view_text_log/src/view_class.rs
  • Cognitive Complexity · AppCore::run_system_command (cognitive 123) crates/top/re_viewer/src/app/command_handling.rs
  • Cognitive Complexity · AppCore::run_recording_command (cognitive 51) crates/top/re_viewer/src/app/command_handling.rs
  • Cognitive Complexity · AppCore::frame_ui (cognitive 46) crates/top/re_viewer/src/app/mod.rs
  • Cognitive Complexity · re_agent_ui::ui::elicitation_ui::field_ui (cognitive 44) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs
  • Cognitive Complexity · re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy (cognitive 43) crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.legacy_adapter.rs
  • Cognitive Complexity · re_dataframe_ui::filters::column_filter_ui::column_picker_ui (cognitive 40) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs
  • Cognitive Complexity · AppCore::run_ui_command (cognitive 37) crates/top/re_viewer/src/app/command_handling.rs
  • Cognitive Complexity · AppCore::load_data_source (cognitive 35) crates/top/re_viewer/src/app/add_data_source.rs
  • Cognitive Complexity · AppCore::receive_log_msg (cognitive 34) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · FieldInput::value (cognitive 27) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs
  • Cognitive Complexity · AppCore::serve_viewer_control (cognitive 27) crates/top/re_viewer/src/app/viewer_control.rs
  • Cognitive Complexity · AppCore::receive_fetched_chunks (cognitive 25) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · ArrowNode::show (cognitive 24) crates/viewer_support/re_arrow_ui/src/arrow_node.rs
  • Cognitive Complexity · TextLogSpanIndex::reconcile (cognitive 24) crates/views/re_view_text_log/src/text_log_span_index.rs
  • Cognitive Complexity · repack_wheel.collect_added_files (cognitive 24) scripts/ci/repack_wheel.py
  • Cognitive Complexity · AppCore::answer_pending_viewer_control_replies (cognitive 23) crates/top/re_viewer/src/app/viewer_control.rs
  • Cognitive Complexity · NativeMenu::new (cognitive 23) crates/top/re_viewer/src/native_menu.rs
  • Cognitive Complexity · FilterState::filter_bar_ui (cognitive 23) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs
  • Cognitive Complexity · TextLogTableDelegate::cell_ui (cognitive 23) crates/views/re_view_text_log/src/view_class.rs
  • Cognitive Complexity · PooledBatchCollator._collate (cognitive 23) rerun_py/rerun_sdk/rerun/experimental/dataloader/_pooled_batches.py
  • Cognitive Complexity · re_datafusion::pipeline::driver::advance_head (cognitive 22) crates/store_app/re_datafusion/src/pipeline/driver.rs
  • Cognitive Complexity · re_server::rerun_cloud::chunk_selection::select_chunks (cognitive 21) crates/store_app/re_server/src/rerun_cloud/chunk_selection.rs
  • Cognitive Complexity · AppCore::validate_loaded_events (cognitive 21) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · re_arrow_ui::arrow_ui::arrow_ui (cognitive 21) crates/viewer_support/re_arrow_ui/src/arrow_ui.rs
  • Cognitive Complexity · RegisterAssetModal::ui (cognitive 20) crates/panels/re_redap_browser/src/register_asset_modal.rs
  • Cognitive Complexity · PartitionDriver::run_inner (cognitive 20) crates/store_app/re_datafusion/src/pipeline/driver.rs
  • Cognitive Complexity · AppCore::receive_messages (cognitive 20) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · CommandPalette::window_content_ui (cognitive 20) crates/viewer_support/re_ui/src/command_palette.rs
  • Cognitive Complexity · collect_targets (cognitive 20) rerun_js/web-viewer/typedoc-used-by.mjs
  • Cognitive Complexity · CoverageEditor::show_mode (cognitive 19) crates/panels/re_redap_browser/src/asset_coverage_modal.rs
  • Cognitive Complexity · AssetCoverageModal::ui (cognitive 19) crates/panels/re_redap_browser/src/asset_coverage_modal.rs
  • Cognitive Complexity · ViewerClient.quit (cognitive 19) rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py
  • Cognitive Complexity · _LeaseTracker._collect_released (cognitive 19) rerun_py/rerun_sdk/rerun/experimental/dataloader/_pooled_batches.py
  • Cognitive Complexity · FetchExecutor::issue (cognitive 18) crates/store_app/re_datafusion/src/pipeline/executor.rs
  • Cognitive Complexity · AppCore::on_new_store (cognitive 18) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · PooledBatchCollator._acquire (cognitive 18) rerun_py/rerun_sdk/rerun/experimental/dataloader/_pooled_batches.py
  • Cognitive Complexity · AppCore::prefetch_chunks (cognitive 17) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · AppCore::move_time (cognitive 17) crates/top/re_viewer/src/app/mod.rs
  • Cognitive Complexity · AppCore::ui_impl (cognitive 17) crates/top/re_viewer/src/app/ui.rs
  • Cognitive Complexity · ViewerUrl::parse_with_options (cognitive 17) crates/viewer_support/re_viewer_context/src/viewer_url.rs
  • Cognitive Complexity · verify_release.check_website (cognitive 17) scripts/ci/verify_release.py
  • Cognitive Complexity · AgentPanel::ui (cognitive 16) crates/panels/re_agent_ui/src/ui/agent_panel.rs
  • Cognitive Complexity · re_datafusion::pushdown_expressions::known_filter_column (cognitive 16) crates/store_app/re_datafusion/src/pushdown_expressions.rs
  • Cognitive Complexity · AppCore::purge_memory_if_needed (cognitive 16) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · re_dataframe_ui::datafusion_table_widget::toolbar_controls_ui (cognitive 16) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs
  • Cognitive Complexity · FilterState::section_title_ui_impl (cognitive 16) crates/viewer_support/re_ui/src/filter_widget.rs
  • God Classes · TooManyMethods: AppCore crates/top/re_viewer/src/app/mod.rs
  • God Classes · MethodTooLong: AppCore.run_system_command crates/top/re_viewer/src/app/command_handling.rs
  • God Classes · MethodTooLong: AppCore.frame_ui crates/top/re_viewer/src/app/mod.rs
  • God Classes · MethodTooLong: AppCore.run_ui_command crates/top/re_viewer/src/app/command_handling.rs
  • God Classes · MethodTooLong: AppCore.serve_viewer_control crates/top/re_viewer/src/app/viewer_control.rs
  • God Classes · FunctionTooLong: re_dataframe_ui::filters::column_filter_ui::column_picker_ui crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs
  • God Classes · ClassTooLong: AppCore crates/top/re_viewer/src/app/mod.rs
  • God Classes · MethodTooLong: RegisterAssetModal.ui crates/panels/re_redap_browser/src/register_asset_modal.rs
  • God Classes · FunctionTooLong: re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.legacy_adapter.rs
  • God Classes · TooManyMethods: CatalogClient crates/data_flow/re_catalog_client/src/lib.rs
  • God Classes · FileTooLong: ui/top_panel.rs crates/top/re_viewer/src/ui/top_panel.rs
  • God Classes · MethodTooLong: MenuGroup.items crates/top/re_viewer/src/command_catalog.rs
  • God Classes · FileTooLong: src/viewer_url.rs crates/viewer_support/re_viewer_context/src/viewer_url.rs
  • God Classes · FileTooLong: experimental/_viewer_client.py rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py
  • God Classes · TooManyMethods: ViewerClient rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py
  • God Classes · ClassTooLong: PyDatasetEntryInternal rerun_py/src/catalog/dataset_entry.rs
  • God Classes · TooManyMethods: _ValueFilters rerun_py/rerun_sdk/rerun/blueprint/_table_filters.py
  • God Classes · MethodTooLong: AppCore.run_recording_command crates/top/re_viewer/src/app/command_handling.rs
  • God Classes · ClassTooLong: ViewerUrl crates/viewer_support/re_viewer_context/src/viewer_url.rs
  • God Classes · MethodTooLong: AppCore.load_data_source crates/top/re_viewer/src/app/add_data_source.rs
  • God Classes · FileTooLong: src/pushdown_expressions.rs crates/store_app/re_datafusion/src/pushdown_expressions.rs
  • God Classes · FileTooLong: catalog/dataset_entry.rs rerun_py/src/catalog/dataset_entry.rs
  • God Classes · MethodTooLong: Server.asset_ui crates/panels/re_redap_browser/src/servers/dataset.rs
  • God Classes · MethodTooLong: DurationFormatOptions.format_nanos crates/utils/re_format/src/duration.rs
  • God Classes · ClassTooLong: RrdManifest crates/store/re_chunk_index/src/rrd_manifest.rs
  • God Classes · FileTooLong: v1alpha1/rerun.cloud.v1alpha1.ext.queries.rs crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.queries.rs
  • God Classes · MethodTooLong: ExampleSection.ui crates/top/re_viewer/src/ui/welcome_screen/example_section.rs
  • God Classes · ClassTooLong: AgentSession crates/utils/re_agent/src/session.rs
  • God Classes · MethodTooLong: DataframeQueryTableProvider.new_from_client crates/store_app/re_datafusion/src/dataframe_query_common.rs
  • God Classes · MethodTooLong: AppCore.ui_impl crates/top/re_viewer/src/app/ui.rs

Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 203 findings

These 203 critical or serious findings were in the previous survey, on 13 October 2026, and are gone from this one. The first 100 are listed here.

  • Cyclomatic Complexity · App::run_system_command (cyclomatic 99) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · App::run_ui_command (cyclomatic 59) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · App::run_recording_command (cyclomatic 35) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · App::ui (cyclomatic 34) crates/top/re_viewer/src/app/mod.rs
  • Cyclomatic Complexity · RerunCloudHandler::query_dataset (cyclomatic 31) crates/store_app/re_server/src/rerun_cloud/mod.rs
  • Cyclomatic Complexity · App::load_data_source (cyclomatic 22) crates/top/re_viewer/src/app/add_data_source.rs
  • Cyclomatic Complexity · re_redap_client::grpc::stream_segment_from_server (cyclomatic 21) crates/data_flow/re_redap_client/src/grpc.rs
  • Cyclomatic Complexity · RawRrdManifest::check_index_columns_are_correct (cyclomatic 19) crates/store/re_chunk_index/src/raw_rrd_manifest.rs
  • Cyclomatic Complexity · ViewerOpenUrl::open (cyclomatic 19) crates/viewer_support/re_viewer_context/src/open_url.rs
  • Cyclomatic Complexity · re_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui (cyclomatic 18) crates/panels/re_selection_panel/src/view_space_origin_ui.rs
  • Cyclomatic Complexity · re_server::rerun_cloud::get_chunks_for_query_results (cyclomatic 18) crates/store_app/re_server/src/rerun_cloud/mod.rs
  • Cyclomatic Complexity · re_agent_ui::ui::transcript_ui::transcript_ui (cyclomatic 17) crates/panels/re_agent_ui/src/ui/transcript_ui.rs
  • Cyclomatic Complexity · App::is_back_destination_open (cyclomatic 17) crates/top/re_viewer/src/app/command_handling.rs
  • Cyclomatic Complexity · App::receive_messages (cyclomatic 17) crates/top/re_viewer/src/app/logic.rs
  • Cyclomatic Complexity · ViewerOpenUrl::parse_with_options (cyclomatic 17) crates/viewer_support/re_viewer_context/src/open_url.rs
  • Cyclomatic Complexity · ViewerOpenUrl::sharable_url (cyclomatic 17) crates/viewer_support/re_viewer_context/src/open_url.rs
  • Cyclomatic Complexity · SpatialView3D::on_register (cyclomatic 16) crates/views/re_view_spatial/src/view_3d.rs
  • Cognitive Complexity · App::run_system_command (cognitive 135) crates/top/re_viewer/src/app/command_handling.rs
  • Cognitive Complexity · RerunCloudHandler::query_dataset (cognitive 69) crates/store_app/re_server/src/rerun_cloud/mod.rs
  • Cognitive Complexity · App::run_recording_command (cognitive 51) crates/top/re_viewer/src/app/command_handling.rs
  • Cognitive Complexity · App::ui (cognitive 46) crates/top/re_viewer/src/app/mod.rs
  • Cognitive Complexity · re_server::rerun_cloud::get_chunks_for_query_results (cognitive 43) crates/store_app/re_server/src/rerun_cloud/mod.rs
  • Cognitive Complexity · App::run_ui_command (cognitive 37) crates/top/re_viewer/src/app/command_handling.rs
  • Cognitive Complexity · App::load_data_source (cognitive 35) crates/top/re_viewer/src/app/add_data_source.rs
  • Cognitive Complexity · App::receive_log_msg (cognitive 34) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · re_agent_ui::ui::transcript_ui::transcript_ui (cognitive 26) crates/panels/re_agent_ui/src/ui/transcript_ui.rs
  • Cognitive Complexity · IntroItem::show (cognitive 26) crates/top/re_viewer/src/ui/welcome_screen/intro_section.rs
  • Cognitive Complexity · App::receive_fetched_chunks (cognitive 25) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · ExampleSection::ui (cognitive 24) crates/top/re_viewer/src/ui/welcome_screen/example_section.rs
  • Cognitive Complexity · re_redap_client::grpc::stream_manifest (cognitive 23) crates/data_flow/re_redap_client/src/grpc.rs
  • Cognitive Complexity · App::receive_messages (cognitive 23) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · re_types_builder::codegen::rust::deserializer::quote_iterator_transparency (cognitive 21) crates/build/re_types_builder/src/codegen/rust/deserializer.rs
  • Cognitive Complexity · App::validate_loaded_events (cognitive 21) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · re_types_builder::codegen::docs::website::write_used_by (cognitive 19) crates/build/re_types_builder/src/codegen/docs/website.rs
  • Cognitive Complexity · re_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui (cognitive 19) crates/panels/re_selection_panel/src/view_space_origin_ui.rs
  • Cognitive Complexity · ViewerClient.close (cognitive 19) rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py
  • Cognitive Complexity · Chunk::concatenated_unsorted (cognitive 18) crates/store/re_chunk/src/merge.rs
  • Cognitive Complexity · App::on_new_store (cognitive 18) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · App::move_time (cognitive 18) crates/top/re_viewer/src/app/mod.rs
  • Cognitive Complexity · App::prefetch_chunks (cognitive 17) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · re_agent_ui::ui::chat_ui::input_ui (cognitive 16) crates/panels/re_agent_ui/src/ui/chat_ui.rs
  • Cognitive Complexity · App::purge_memory_if_needed (cognitive 16) crates/top/re_viewer/src/app/logic.rs
  • Cognitive Complexity · App::ui_impl (cognitive 16) crates/top/re_viewer/src/app/ui.rs
  • God Classes · MethodTooLong: App.run_system_command crates/top/re_viewer/src/app/command_handling.rs
  • God Classes · TooManyMethods: App crates/top/re_viewer/src/app/mod.rs
  • God Classes · ClassTooLong: App crates/top/re_viewer/src/app/mod.rs
  • God Classes · MethodTooLong: App.run_ui_command crates/top/re_viewer/src/app/command_handling.rs
  • God Classes · MethodTooLong: App.ui crates/top/re_viewer/src/app/mod.rs
  • God Classes · MethodTooLong: RerunCloudHandler.query_dataset crates/store_app/re_server/src/rerun_cloud/mod.rs
  • God Classes · FunctionTooLong: re_redap_client::grpc::stream_segment_from_server crates/data_flow/re_redap_client/src/grpc.rs
  • God Classes · TooManyFields: App crates/top/re_viewer/src/app/mod.rs
  • God Classes · MethodTooLong: RawRrdManifest.check_manifest_schema_matches_sorbet_schema crates/store/re_chunk_index/src/raw_rrd_manifest.rs
  • God Classes · MethodTooLong: App.run_recording_command crates/top/re_viewer/src/app/command_handling.rs
  • God Classes · MethodTooLong: App.load_data_source crates/top/re_viewer/src/app/add_data_source.rs
  • God Classes · FunctionTooLong: re_redap_client::grpc::stream_manifest crates/data_flow/re_redap_client/src/grpc.rs
  • God Classes · FileTooLong: src/open_url.rs crates/viewer_support/re_viewer_context/src/open_url.rs
  • God Classes · MethodTooLong: App.ui_impl crates/top/re_viewer/src/app/ui.rs
  • God Classes · ClassTooLong: WebHandle crates/top/re_viewer/src/web.rs
  • God Classes · FileTooLong: src/blueprint_resolved_results.rs crates/viewer_support/re_view/src/blueprint_resolved_results.rs
  • God Classes · ClassTooLong: ViewerOpenUrl crates/viewer_support/re_viewer_context/src/open_url.rs
  • Code Duplication · Edited copy of a member (50 corresponding lines) crates/panels/re_blueprint_tree/src/blueprint_tree.rs
  • Code Duplication · Edited copy of a member (13 corresponding lines) scripts/ci/compare.py
  • Code Duplication · Edited copy of a member (10 corresponding lines) scripts/ci/compare.py
  • Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) examples/python/face_tracking/face_tracking.py
  • Code Duplication · Duplicated block (23–24 lines × 2) crates/store/re_chunk_index/src/raw_rrd_manifest.rs
  • Code Duplication · Duplicated block (22 lines × 2) crates/panels/re_redap_browser/src/register_asset_modal.rs
  • Code Duplication · Duplicated block (20–21 lines × 2) crates/top/re_viewer/src/web.rs
  • Code Duplication · Duplicated block (15–17 lines × 2) crates/viewer_support/re_dataframe_ui/src/filters/numerical.rs
  • Code Duplication · Duplicated block (16 lines × 2) crates/top/re_viewer/src/web.rs
  • Code Duplication · Duplicated block (15 lines × 2) crates/store_app/re_datafusion/src/dataset_manifest.rs
  • Code Duplication · Duplicated block (15 lines × 2) crates/store_app/re_server/src/rerun_cloud/mod.rs
  • Code Duplication · Duplicated block (14 lines × 2) crates/data_flow/re_redap_client/src/grpc.rs
  • Code Duplication · Duplicated block (10 lines × 2) crates/data_flow/re_redap_client/src/connection_client.rs
  • Code Duplication · Duplicated block (9–10 lines × 2) crates/data_flow/re_redap_client/src/connection_client.rs
  • Code Duplication · Duplicated block (7 lines × 2) crates/top/re_viewer/src/app/viewer_control.rs
  • Code Duplication · Duplicated block (6 lines × 2) crates/viewer_support/re_dataframe_ui/src/filters/numerical.rs
  • Cohesion (LCOM4) · Low cohesion: TabsBehavior (LCOM4 6) crates/panels/re_agent_ui/src/ui/agent_panel.rs
  • Test Reliability · Test declared unreliable: viewer_catalog_uses_rrd_fingerprint_layers tests/rust/re_integration_test/tests/inspection/internal_catalog.rs
  • Churn × Complexity Hotspots · Hotspot: crates/store_app/re_server/src/rerun_cloud/mod.rs crates/store_app/re_server/src/rerun_cloud/mod.rs
  • Churn × Complexity Hotspots · Hotspot: crates/data_flow/re_redap_client/src/grpc.rs crates/data_flow/re_redap_client/src/grpc.rs
  • Churn × Complexity Hotspots · Hotspot: crates/viewer_support/re_viewer_context/src/open_url.rs crates/viewer_support/re_viewer_context/src/open_url.rs
  • Churn × Complexity Hotspots · Hotspot: crates/store/re_chunk_index/src/raw_rrd_manifest.rs crates/store/re_chunk_index/src/raw_rrd_manifest.rs
  • Churn × Complexity Hotspots · Hotspot: crates/viewer_support/re_viewport_blueprint/src/view_contents.rs crates/viewer_support/re_viewport_blueprint/src/view_contents.rs
  • Churn × Complexity Hotspots · Hotspot: crates/views/re_view_spatial/src/view_3d.rs crates/views/re_view_spatial/src/view_3d.rs
  • Churn × Complexity Hotspots · Hotspot: crates/store_app/re_datafusion/src/pipeline_budget.rs crates/store_app/re_datafusion/src/pipeline_budget.rs
  • Churn × Complexity Hotspots · Hotspot: crates/utils/re_video/src/demux/mp4.rs crates/utils/re_video/src/demux/mp4.rs
  • Churn × Complexity Hotspots · Hotspot: crates/panels/re_agent_ui/src/ui/transcript_ui.rs crates/panels/re_agent_ui/src/ui/transcript_ui.rs
  • Churn × Complexity Hotspots · Hotspot: crates/views/re_view_spatial/src/visualizers/utilities/transform_retrieval.rs crates/views/re_view_spatial/src/visualizers/utilities/transform_retrieval.rs
  • Churn × Complexity Hotspots · Hotspot: crates/views/re_view_spatial/src/picking_ui.rs crates/views/re_view_spatial/src/picking_ui.rs
  • Explicit Debt · TodoComment crates/data_flow/re_data_source/src/data_source.rs
  • Explicit Debt · TodoComment crates/data_flow/re_redap_client/src/staging.rs
  • Explicit Debt · TodoComment crates/data_flow/re_redap_client/src/connection_client.rs
  • Explicit Debt · TodoComment crates/panels/re_selection_panel/src/view_entity_picker.rs
  • Explicit Debt · TodoComment crates/panels/re_selection_panel/src/view_entity_picker.rs
  • Explicit Debt · TodoComment crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.rs
  • Explicit Debt · TodoComment crates/store_app/re_datafusion/src/dataframe_query_common.rs
  • Explicit Debt · TodoComment crates/store_app/re_datafusion/src/pipeline/mod.rs
  • Explicit Debt · TodoComment crates/store_app/re_server/src/rerun_cloud/mod.rs
  • Explicit Debt · TodoComment crates/tests/re_redap_tests/src/tests/query_dataset.rs
  • Explicit Debt · TodoComment crates/tests/re_redap_tests/src/tests/fetch_chunks.rs
Rebuild cost: about €730,000 · Estimate
Cost to rebuild€240,000 to €1,200,000, for 4,053 to 12,859 hours of work, about 5.0 person-years for 3 to 10 engineers
Difficulty of the problemStandard, 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.8 at a score of 61. 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.
SizeVery large: 558,184 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
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.
Raises the score by about 3 points · Medium effort · Visual & motion safety
2
Enforce accessibility in the toolchain you already use: add `jsx-a11y` to the `plugins` array in your oxlint config (its a11y rules are off until the plugin is listed), then assert with @axe-core/playwright in tests, then gate axe/pa11y/Lighthouse in CI.
Raises the score by about 3 points · Medium effort · A11y enforcement
3
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Raises the score by about 3 points · Medium effort · Page structure

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €730,000 to build again, about 5.0 person-years of work. Its weakest lens is Accessibility, at 55 (Adequate). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
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. Of all the actions in this report, it raises the score most for the work it takes: about 3 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — 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.

arch re_arrow_util re_arrow_util re_log re_log re_arrow_util->re_log re_tracing re_tracing re_arrow_util->re_tracing re_byte_size re_byte_size re_chunk re_chunk re_chunk->re_arrow_util re_chunk->re_byte_size re_format re_format re_chunk->re_format re_chunk->re_log re_log_types re_log_types re_chunk->re_log_types re_chunk->re_tracing re_types_core re_types_core re_chunk->re_types_core re_chunk_store re_chunk_store re_chunk_store->re_arrow_util re_chunk_store->re_byte_size re_chunk_store->re_chunk re_chunk_store->re_format re_chunk_store->re_log re_chunk_store->re_log_types re_sdk_types re_sdk_types re_chunk_store->re_sdk_types re_chunk_store->re_tracing re_chunk_store->re_types_core re_data_ui re_data_ui re_data_ui->re_chunk_store re_entity_db re_entity_db re_data_ui->re_entity_db re_data_ui->re_format re_data_ui->re_log re_data_ui->re_log_types re_data_ui->re_sdk_types re_data_ui->re_tracing re_data_ui->re_types_core re_ui re_ui re_data_ui->re_ui re_viewer_context re_viewer_context re_data_ui->re_viewer_context re_viewport_blueprint re_viewport_blueprint re_data_ui->re_viewport_blueprint re_dataframe_ui re_dataframe_ui re_dataframe_ui->re_arrow_util re_dataframe_ui->re_chunk_store re_dataframe_ui->re_entity_db re_dataframe_ui->re_format re_dataframe_ui->re_log re_dataframe_ui->re_log_types re_dataframe_ui->re_sdk_types re_dataframe_ui->re_tracing re_dataframe_ui->re_types_core re_dataframe_ui->re_ui re_view re_view re_dataframe_ui->re_view re_dataframe_ui->re_viewer_context re_dataframe_ui->re_viewport_blueprint re_entity_db->re_arrow_util re_entity_db->re_byte_size re_entity_db->re_chunk re_entity_db->re_chunk_store re_entity_db->re_format re_entity_db->re_log re_entity_db->re_log_types re_entity_db->re_tracing re_entity_db->re_types_core re_format->re_log re_log_types->re_arrow_util re_log_types->re_byte_size re_log_types->re_format re_log_types->re_log re_log_types->re_tracing re_log_types->re_types_core re_sdk_types->re_arrow_util re_sdk_types->re_byte_size re_sdk_types->re_format re_sdk_types->re_log re_sdk_types->re_log_types re_sdk_types->re_tracing re_sdk_types->re_types_core re_tracing->re_log re_types_core->re_arrow_util re_types_core->re_byte_size re_types_core->re_log re_types_core->re_tracing re_ui->re_entity_db re_ui->re_format re_ui->re_log re_ui->re_log_types re_ui->re_tracing re_view->re_arrow_util re_view->re_chunk re_view->re_chunk_store re_view->re_entity_db re_view->re_format re_view->re_log re_view->re_log_types re_view->re_sdk_types re_view->re_tracing re_view->re_types_core re_view->re_ui re_view->re_viewer_context re_view->re_viewport_blueprint re_viewer re_viewer re_viewer->re_byte_size re_viewer->re_chunk re_viewer->re_chunk_store re_viewer->re_data_ui re_viewer->re_dataframe_ui re_viewer->re_entity_db re_viewer->re_format re_viewer->re_log re_viewer->re_log_types re_viewer->re_sdk_types re_viewer->re_tracing re_viewer->re_types_core re_viewer->re_ui re_viewer->re_view re_viewer->re_viewer_context re_viewer->re_viewport_blueprint re_viewer_context->re_arrow_util re_viewer_context->re_byte_size re_viewer_context->re_chunk re_viewer_context->re_chunk_store re_viewer_context->re_entity_db re_viewer_context->re_format re_viewer_context->re_log re_viewer_context->re_log_types re_viewer_context->re_sdk_types re_viewer_context->re_tracing re_viewer_context->re_types_core re_viewer_context->re_ui re_viewport_blueprint->re_byte_size re_viewport_blueprint->re_chunk re_viewport_blueprint->re_chunk_store re_viewport_blueprint->re_entity_db re_viewport_blueprint->re_log re_viewport_blueprint->re_log_types re_viewport_blueprint->re_sdk_types re_viewport_blueprint->re_tracing re_viewport_blueprint->re_types_core re_viewport_blueprint->re_ui re_viewport_blueprint->re_viewer_context rerun rerun rerun->re_arrow_util rerun->re_byte_size rerun->re_chunk rerun->re_chunk_store rerun->re_entity_db rerun->re_format rerun->re_log rerun->re_log_types rerun->re_sdk_types rerun->re_tracing rerun->re_ui rerun->re_viewer rerun_py rerun_py rerun_py->re_arrow_util rerun_py->re_chunk rerun_py->re_chunk_store rerun_py->re_format rerun_py->re_log rerun_py->re_log_types rerun_py->re_sdk_types rerun_py->re_tracing rerun_py->re_types_core __more__ +104 more projects

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.

2928 modules, with 9503 dependencies between them. 21 loops run through 463 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 2888 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.
uses →1 re_dev_tools.build_search_index.ingest2 re_quota_channel.async_broadcast_channel3 re_renderer.wgpu_buffer_types4 re_span5 re_type_definitions.rerun.blueprint.components.time_int.def6 re_type_definitions.rerun.components.entity_path.def7 re_types_core.archetype8 re_types_core.view9 re_uri.origin10 re_viewer.web11 rerun_py.rerun_sdk.rerun._baseclasses12 re_dev_tools.build_search_index.ingest.python13 re_log_types.index.duration14 re_memory_view.flamegraph15 re_type_definitions.rerun.blueprint.components.timeline_name.def16 re_types_core.as_components17 rerun_c.component_type_registry18 re_chunk_store.store19 re_types_core.component_batch20 re_chunk.latest_at21 re_types_builder.data_type22 re_types_core.loggable23 re_types_core.reflection24 re_log_types.index.time_type25 re_types_core.row_id26 re_chunk.chunk27 re_entity_db.entity_db28 re_viewer_context.app_context29 re_log_types.store_id30 re_protos.v1alpha1.rerun.common.v1alpha131 re_viewer_context.viewer_context32 re_analytics.event33 re_protos.v1alpha1.rerun.log_msg.v1alpha134 re_viewer_context.view.view_query35 re_types_core.wrapper_component36 re_viewer.app37 re_viewer_context.view.view_context_system38 re_viewer_context.view.visualizer_system39 re_viewer_context.view.view_context40 re_viewer_context.query_context
1 re_dev_tools.build_search_index.ingest
2 re_quota_channel.async_broadcast_channel
3 re_renderer.wgpu_buffer_types
4 re_span
5 re_type_definitions.rerun.blueprint.components.time_int.def
6 re_type_definitions.rerun.components.entity_path.def
7 re_types_core.archetype
8 re_types_core.view
9 re_uri.origin
10 re_viewer.web
11 rerun_py.rerun_sdk.rerun._baseclasses
12 re_dev_tools.build_search_index.ingest.python1
13 re_log_types.index.duration1
14 re_memory_view.flamegraph1
15 re_type_definitions.rerun.blueprint.components.timeline_name.def1
16 re_types_core.as_components1
17 rerun_c.component_type_registry22
18 re_chunk_store.store11111111
19 re_types_core.component_batch1113
20 re_chunk.latest_at111
21 re_types_builder.data_type11
22 re_types_core.loggable11
23 re_types_core.reflection10234
24 re_log_types.index.time_type11
25 re_types_core.row_id1142
26 re_chunk.chunk2112112212
27 re_entity_db.entity_db1111211111131
28 re_viewer_context.app_context111111111
29 re_log_types.store_id11
30 re_protos.v1alpha1.rerun.common.v1alpha11212
31 re_viewer_context.viewer_context111111111111
32 re_analytics.event4
33 re_protos.v1alpha1.rerun.log_msg.v1alpha1344
34 re_viewer_context.view.view_query144121211
35 re_types_core.wrapper_component11
36 re_viewer.app22111111212241
37 re_viewer_context.view.view_context_system11111
38 re_viewer_context.view.visualizer_system2212211
39 re_viewer_context.view.view_context111111111112
40 re_viewer_context.query_context1211111131
Uses a module listed above itPart of a loopThe module itself
1 re_dev_tools.build_search_index.ingest2 re_quota_channel.async_broadcast_channel3 re_renderer.wgpu_buffer_types4 re_span5 re_type_definitions.rerun.blueprint.components.time_int.def6 re_type_definitions.rerun.components.entity_path.def7 re_types_core.archetype8 re_types_core.view9 re_uri.origin10 re_viewer.web11 rerun_py.rerun_sdk.rerun._baseclasses12 re_dev_tools.build_search_index.ingest.python13 re_log_types.index.duration14 re_memory_view.flamegraph15 re_type_definitions.rerun.blueprint.components.timeline_name.def16 re_types_core.as_components17 rerun_c.component_type_registry18 re_chunk_store.store19 re_types_core.component_batch20 re_chunk.latest_at21 re_types_builder.data_type22 re_types_core.loggable23 re_types_core.reflection24 re_log_types.index.time_type25 re_types_core.row_id26 re_chunk.chunk27 re_entity_db.entity_db28 re_viewer_context.app_context29 re_log_types.store_id30 re_protos.v1alpha1.rerun.common.v1alpha131 re_viewer_context.viewer_context32 re_analytics.event33 re_protos.v1alpha1.rerun.log_msg.v1alpha134 re_viewer_context.view.view_query35 re_types_core.wrapper_component36 re_viewer.app37 re_viewer_context.view.view_context_system38 re_viewer_context.view.visualizer_system39 re_viewer_context.view.view_context40 re_viewer_context.query_contextre_dev_tools.build_search_index.ingest1re_quota_channel.async_broadcast_channel2re_renderer.wgpu_buffer_types3re_span4re_type_definitions.rerun.blueprint.components.time_int.def5re_type_definitions.rerun.components.entity_path.def6re_types_core.archetype7re_types_core.view8re_uri.origin9re_viewer.web10rerun_py.rerun_sdk.rerun._baseclasses11re_dev_tools.build_search_index.ingest.python12re_log_types.index.duration13re_memory_view.flamegraph14re_type_definitions.rerun.blueprint.components.timeline_name.def15re_types_core.as_components16rerun_c.component_type_registry17re_chunk_store.store18re_types_core.component_batch19re_chunk.latest_at20re_types_builder.data_type21re_types_core.loggable22re_types_core.reflection23re_log_types.index.time_type24re_types_core.row_id25re_chunk.chunk26re_entity_db.entity_db27re_viewer_context.app_context28re_log_types.store_id29re_protos.v1alpha1.rerun.common.v1alpha130re_viewer_context.viewer_context31re_analytics.event32re_protos.v1alpha1.rerun.log_msg.v1alpha133re_viewer_context.view.view_query34re_types_core.wrapper_component35re_viewer.app36re_viewer_context.view.view_context_system37re_viewer_context.view.visualizer_system38re_viewer_context.view.view_context39re_viewer_context.query_context40111112211111111111311111111023411114221121122121111211111131111111111111212111111111111434414412121111221111112122411111122122111111111111121211111131+2888 more modules (most-connected shown)

At a glance — Code Health · 60% · Adequate · gated by X4 ·

At a glance — Architecture · 95% · Exemplary ·

At a glance — Maturity · 70% · Adequate · gated by M2 ·

At a glance — Readiness · 61% · Adequate · gated by R4 ·

At a glance — Security · 72% · Adequate · gated by D29, D36 ·

At a glance — Event Sourcing · 100% · Exemplary ·

At a glance — Accessibility · 55% · Adequate · gated by AC6 ·

At a glance — Performance · 87% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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 categoryFindingsSeverity
A05:2025 — Injection136High / Critical
A03:2025 — Software Supply Chain Failures37High / Critical
A02:2025 — Security Misconfiguration5High / Critical

Roadmap

First, address visual and motion safety by ensuring visible focus styles, respecting reduced motion preferences, and correcting low-contrast colors. Next, enforce accessibility standards by integrating jsx-a11y into your linting configuration, adding axe-core assertions to tests, and gating checks in CI. Simultaneously, fix page structure issues such as missing language attributes, titles, and landmarks, while improving test coverage for unreached modules. Finally, resolve structured logging issues by replacing interpolated messages with proper structured formats.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
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.+3.3 ptsMediumVisual & motion safety
Enforce accessibility in the toolchain you already use: add `jsx-a11y` to the `plugins` array in your oxlint config (its a11y rules are off until the plugin is listed), then assert with @axe-core/playwright in tests, then gate axe/pa11y/Lighthouse in CI.+3.3 ptsMediumA11y enforcement
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.+3.1 ptsMediumPage structure
Resolve the 1 No ADRs found finding(s) in ADR Quality.+1.1 ptsLowADR Quality
Add tests that import the unreached modules (directly or through their public entry).+1.4 ptsMediumTest Coverage
Interpolated log message defeats structured logging+1.2 ptsMediumStructured logging
Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.+1.1 ptsMediumCancellation propagation
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.+1.0 ptsMediumArchitecture documentation

File quality

Per-file score 0–10 — a quality signature. Of 984 files carrying findings, judged against the Preview bar: 0% slop · 34% mixed · 66% near-clean.

FileScoreBandWorst signal
REDACTED2.0SlopIaC & Container Security: Critical IaC: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.0MixedDependency Vulnerabilities: High vulnerability: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
crates/views/re_view_time_series/src/line_visualizer_system.rs5.5MixedCyclomatic Complexity: re_view_time_series::line_visualizer_system::build_line_draw_data (cyclomatic 16)
crates/top/re_sdk/src/grpc_server.rs5.5MixedCode Duplication: Duplicated block (13 lines × 2)
crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs5.5MixedCode Duplication: Members sharing a duplicated core (5 members, 50+ identical tokens)
crates/views/re_view_bar_chart/src/view_class.rs5.7MixedCyclomatic Complexity: BarChartView::ui (cyclomatic 34)
crates/viewer_support/re_renderer/src/importer/gltf.rs5.7MixedCyclomatic Complexity: re_renderer::importer::gltf::import_mesh (cyclomatic 16)

How the grades work

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 — 144

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 — 3081

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 — 206

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 15

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 87 of 87 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 87 dimensions across the health lenses
D1D2D3D4D5D6D9D10D12D13D14D15D16D17D19D20D26D28D29D30D31D34D35D36D37D43D44AC1AC2AC3AC6AC7AX10AX3AX4AX6AX8AX9ES1ES2M1M2M3M4P1P10P2P3P4P6P7PF1PF3R1R10R2R3R4R5R6R7R8R9S1X1X12X13X14X15X16X17X18X19X2X21X22X23X24X25X26X27X28X29X3X30X4X5

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
  1. 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, 3258 of 3431 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.)
  2. Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Watchdog duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement—◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a17b83-eb38-7d88-b5dd-5cdcb6d439a1.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

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.

  • D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 35 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 687 test source file(s) (.py, .rs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source includes .rs, and the rust executor ran against the .rs half and never executed — so reliability was not measured for the repository as a whole. The JavaScript/TypeScript (node:test via `npm ci --ignore-scripts` in rerun_js/web-viewer/ (3 tests)): measured (0 flaky) suite(s) did re-run, and came back with 0 flaky across 1 measured tier(s) — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — test reliability is excluded from the score rather than counted. The half was driven by a runner we ship, so this is not a missing-runner gap.
  • D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares 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 — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For crates/store/re_protos/src/v1alpha1/rerun.viewer_control.v1alpha1.ext.rs that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
  • D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
  • D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `rerun_py/rerun_sdk/rerun/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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository defines its own container in rerun_py/rerun_sdk/rerun/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.
  • AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (dev). the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence.
  • C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
  • GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python, Rust, c, cpp is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Python, Rust, c, cpp is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • X4 Structured logging — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 13 further occurrence(s) are not listed individually; the score already reflects all 53.

Repo exclusion declarations: 1687 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • 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.
  • AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity6.0 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Prevented

196 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was AppCore::run_system_command at 97. A further 24 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 UICommand::kb_shortcuts at 45 — they are counted neither in the figure above nor in this dimension's score. 16 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_support/re_ui/src/command/ui_command.rs (UICommand::kb_shortcuts at 45), crates/viewer_support/re_ui/src/color_table.rs (Scale::from_str at 42), rerun_py/src/chunk_stream/hdf5_reader.rs (PyHdf5ReaderInternal::attributes at 25), crates/viewer_support/re_ui/src/command/recording_command.rs (RecordingCommandKind::text_and_tooltip at 24), crates/data_flow/re_hdf5/src/convert.rs (re_hdf5::convert::attr_to_component at 23), and 11 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.

re_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cyclomatic 42) · ×9crates/build/re_types_builder/src/codegen/rust/serializer.rs:568
AppCore::run_system_command (cyclomatic 97) · ×8crates/top/re_viewer/src/app/command_handling.rs:118
re_viewer::viewer_analytics::event::open_recording (cyclomatic 23) · ×6crates/top/re_viewer/src/viewer_analytics/event.rs:64
QueryHandle::try_bulk_emit_run (cyclomatic 38) · ×4crates/store_app/re_dataframe/src/query.rs:2132
re_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread (cyclomatic 32) · ×4crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:305

+ 126 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with AppCore::run_system_command (cyclomatic 97), lint.lint_line (cyclomatic 93), AppCore::run_ui_command (cyclomatic 61). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cyclomatic Complexity from 6.0 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity5.4 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 5.4 / 10 · rule-coverage 100% · ceiling Prevented

511 method(s) exceeded the cognitive complexity threshold of 15; the worst was AppCore::run_system_command at 123.

re_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cognitive 105) · ×30crates/build/re_types_builder/src/codegen/rust/serializer.rs:568
AppCore::run_system_command (cognitive 123) · ×16crates/top/re_viewer/src/app/command_handling.rs:118
re_view_spatial::visualizers::video::execute_video_stream_like (cognitive 49) · ×12crates/views/re_view_spatial/src/visualizers/video/mod.rs:166
re_view_time_series::series_query::collect_colors (cognitive 36) · ×12crates/views/re_view_time_series/src/series_query.rs:196
ChunkStore::insert_chunk_impl (cognitive 106) · ×10crates/store/re_chunk_store/src/writes.rs:113

+ 292 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 21 bodies over 60 down to 60 or less in Cognitive Complexity — start with AppCore::run_system_command (cognitive 123), lint.lint_line (cognitive 121), ChunkStore::insert_chunk_impl (cognitive 106). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 21 together lifts Cognitive Complexity from 5.4 to about 6.3/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D3 · God Classes8.3 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

Maturity: Documented → Verified → Prevented · effective 8.3 / 10 · rule-coverage 100% · ceiling Prevented

317 god class(es) detected.

FileTooLong: src/python_bridge.rs · ×105rerun_py/src/python_bridge.rs
MethodTooLong: AppState.show · ×100crates/top/re_viewer/src/app_state.rs:303
FunctionTooLong: re_component_fallbacks::component_fallbacks::archetype_field_fallbacks · ×52crates/viewer_support/re_component_fallbacks/src/component_fallbacks.rs:30
ClassTooLong: RerunCloudHandler · ×30crates/store_app/re_server/src/rerun_cloud/mod.rs:280
TooManyMethods: AppCore · ×25crates/top/re_viewer/src/app/mod.rs:125

+ 1 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 105 FileTooLong finding(s) in God Classes — start with mod.rs (9), view_class.rs (3), query.rs (3). — One of this dimension's main actionable groups (105 warning-level).
  2. Resolve the 100 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 (100 warning-level).
  3. Resolve the 52 FunctionTooLong finding(s) in God Classes — start with mod.rs (2), entrypoint.rs (2), visualizer_ui.rs (2). — One of this dimension's main actionable groups (52 warning-level).
  4. Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication9.6 / 10Stronggated by 456 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.6 / 10 · rule-coverage 100% · ceiling Verified

437 duplicated block group(s) detected. A further 19 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 27 of the 456 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.

Duplicated block (9 lines × 2) · ×38crates/data_flow/re_lenses/src/semantic/ros2msg/voxel_grid.rs:150
Duplicated block (5 lines × 2) · ×34crates/data_flow/re_lenses/src/semantic/helpers.rs:36
Duplicated block (8 lines × 2) · ×32crates/data_flow/re_importer/src/importer_parquet.rs:47
Duplicated block (11 lines × 2) · ×29crates/data_flow/re_importer/src/importer_rrd.rs:55
Duplicated block (10 lines × 2) · ×28crates/data_flow/re_catalog_client/src/staging.rs:109

+ 104 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 38 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with mod.rs (3), draw.rs (2), voxel_grid.rs. — One of this dimension's main actionable groups (38 warning-level).
  2. Resolve the 34 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with points2d_ext.rs (3), mod.rs (3), helpers.rs. — One of this dimension's main actionable groups (34 warning-level).
  3. Resolve the 32 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with example_components.rs (2), mod.rs (2), importer_parquet.rs. — One of this dimension's main actionable groups (32 warning-level).
  4. Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D5 · Coupling6.0 / 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.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Prevented

124 production modules (Cargo+npm+Python), 0 dependency cycle(s), 34 unstable depended-on module(s). Read from the build's own module declarations; 20 module(s) off the main sequence, with abstractness counted on 111 of the 124 (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: re_build_tools · ×20
Unstable project re_agent_ui
Unstable project re_arrow_json
Unstable project re_blueprint_tree
Unstable project re_catalog_client

+ 30 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 20 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (20 warning-level).
  2. Resolve the 1 Unstable project re_agent_ui finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 Unstable project re_arrow_json finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
  4. Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.

D6 · Cohesion (LCOM4)9.9 / 10Stronggated by 7 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Verified

7 of 1327 classes have LCOM4 above 3.

Low cohesion: TilesDelegate (LCOM4 5) · ×7crates/panels/re_viewport/src/viewport_ui.rs:396

What to do

  1. Resolve the 7 Low cohesion finding(s) in Cohesion (LCOM4) — start with viewport_ui.rs, importer.rs, chunk.rs. — One of this dimension's main actionable groups (7 warning-level).
  2. Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

4705 test methods: 3415 unit, 1290 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 35 `it`/`test` case(s) across 10 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 3544 `#[test]` function(s) across 746 file(s) declaring at least one; its unit/integration split is Cargo's own — 258 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test. The Python suite contributes 1126 test function(s) across 172 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 35 tests. Measured on the JavaScript/TypeScript suite only — at least 687 test source file(s) (.py, .rs) went unread, so its test quality is unmeasured and is not in these counts.

✓ On the Gold path — maintain.

Detailed fixes: d10_recommendation.md.

D12 · Dependency Hygiene8.0 7.7 / 10Strong✓ Tool-verified

What it measures: Whether dependencies are current, secure, and not bloated.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 7.7 / 10 · rule-coverage 96% · ceiling Verified

90 outdated, 0 yanked direct Cargo dependencies. 339 of 354 direct crates were graded against crates.io (0 not published there, 15 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: accesskit · ×90

What to do

  1. Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 1155 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT OR Apache-2.0, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares 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.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.8 / 10Stronggated by 108 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: crates/top/re_viewer/src/app/command_handling.rs (40×97=3880); crates/top/re_viewer/src/app/mod.rs (57×36=2052); scripts/lint.py (16×93=1488) Repeated repair below the complexity floor: crates/utils/re_video/src/decode/mod.rs (3 of 5 changes were fixes)

Hotspot: crates/top/re_viewer/src/app/command_handling.rs · ×107crates/top/re_viewer/src/app/command_handling.rs:118
Repeated repair: crates/utils/re_video/src/decode/mod.rscrates/utils/re_video/src/decode/mod.rs:618

What to do

  1. Resolve the 107 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (9), view_class.rs (4), visualizer_ui.rs (2). — One of this dimension's main actionable groups (107 warning-level).
  2. Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with mod.rs. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

D16 · Bus Factor9.5 / 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.

Maturity: Documented → Verified → Prevented · effective 9.5 / 10 · rule-coverage 100% · ceiling Documented

62 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is crates/store/re_chunk_optimizer/src/plan.rs. Counted over 1366 of the 1968 production source files in this repository: 599 are under the ~2,400-byte size floor this dimension measures over, and the remaining 3 have no attributable history left to measure.

Off-boarding risk: anonymized user #1 · ×8
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.

D17 · Explicit Debt9.5 / 10Stronggated by 1299 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.5 / 10 · rule-coverage 100% · ceiling Prevented

1299 deducted task-comment markers across 558184 LoC (0.2/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.

TodoComment · ×1293tests/rust/re_integration_test/tests/integration/blueprint_import_test.rs:110
HackComment · ×6examples/python/arkit_scenes/arkit_scenes/__main__.py:34

What to do

  1. Resolve the 1293 TodoComment finding(s) in Explicit Debt — start with mod.rs (62), lib.rs (45), query.rs (19). — One of this dimension's main actionable groups (1293 warning-level).
  2. Resolve the 6 HackComment finding(s) in Explicit Debt — start with __main__.py, ui_ext.rs, lib.rs. — One of this dimension's main actionable groups (6 warning-level).
  3. Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 1 documentation facets pass in full. 297 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs found

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

D26 · Project Cohesion8.2 / 10Strong✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic, LLM-independent.

Maturity: Documented → Verified → Prevented · effective 8.2 / 10 · rule-coverage 100% · ceiling Documented

11 of 122 build units (Cargo, Python, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)0.0 / 10Critical✓ Tool-verified

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).

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

136 finding(s): 0 critical, 130 high, 6 medium, 0 low. 1 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 10 file(s) — `crates/data_flow/re_data_source/src/data_source.rs` (line 275, line 277), `crates/data_flow/re_lerobot/src/language.rs` (lines 312–362, lines 424–427, lines 437–439, …), `crates/store_app/re_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs` (line 65, lines 67–70, line 71, …), `crates/top/re_viewer/src/app/add_data_source.rs` (lines 114–115, line 117, line 119, …), `crates/top/rerun_c/src/lib.rs` (line 1332), … (+5 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 27 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 10 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 73 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (26), REDACTED (15), REDACTED (9). — One of this dimension's main actionable groups (73 issue-level).
  2. Resolve the 41 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (4), REDACTED (4). — One of this dimension's main actionable groups (41 issue-level).
  3. Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (6 issue-level).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities4.9 / 10Weak✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 4.9 / 10 · rule-coverage 100% · ceiling Documented

25 finding(s): 0 critical, 1 high, 24 medium, 0 low.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 11 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED (11). — One of this dimension's main actionable groups (11 warning-level).
  2. Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. Resolve the 7 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (7). — One of this dimension's main actionable groups (7 warning-level).

Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.

D31 · IaC & Container Security8.5 / 10Adequategated by 3 critical findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 8.5 / 10 · rule-coverage 100% · ceiling Documented

5 finding(s): 1 critical, 2 high, 2 medium, 0 low.

REDACTED
REDACTED
REDACTED

What to do

  1. 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).
  2. 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).
  3. 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.

D34 · Knowledge Freshness9.8 / 10Adequategated by 1 critical finding✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

29 of 1369 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is crates/viewer_support/re_viewer_context/src/component_ui_registry.rs. Counted over 1369 of the 1968 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledgecrates/viewer_support/re_viewer_context/src/component_ui_registry.rs:1
Orphaned file · ×28crates/store/re_log_types/src/vec_deque_ext.rs:1
Further orphaned files (smaller)

What to do

  1. Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with component_ui_registry.rs. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 28 Orphaned file finding(s) in Knowledge Freshness — start with mod.rs (2), vec_deque_ext.rs, tensor_data_ext.py. — One of this dimension's main actionable groups (28 recommendation-level).
  3. 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.

D35 · Change Coupling9.8 / 10Stronggated by 36 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: viewport_ui.rs↔auto_layout.rs 88%; gltf.rs↔obj.rs 88%; widget.ts↔__init__.py 84%

Change coupling: viewport_ui.rs ↔ auto_layout.rs · ×35crates/panels/re_viewport/src/viewport_ui.rs:1
Change-coupling hub: view_class.rs → view_class.rs, view_class.rs, view_class.rscrates/views/re_view_text_document/src/view_class.rs

What to do

  1. Resolve the 35 Change coupling finding(s) in Change Coupling — start with widget.ts (2), grpc_server.rs (2), navigation.rs (2). — One of this dimension's main actionable groups (35 warning-level).
  2. Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with view_class.rs. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

0/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 7 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

A vulnerability-disclosure policy (SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

0 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.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

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.

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.

AC3 · Page structure4.5 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×3) — REDACTED:3, scripts/screenshot_compare/assets/templates/example.html:2, scripts/screenshot_compare/assets/templates/index.html:2
  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. This document's body is only the mount point <div>, so there is no content here to wrap — render the <main> from the component mounted into it. — 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. (×3) — REDACTED:7, scripts/screenshot_compare/assets/templates/example.html:6, scripts/screenshot_compare/assets/templates/index.html:6
  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×3) — REDACTED:2, scripts/screenshot_compare/assets/templates/example.html:2, scripts/screenshot_compare/assets/templates/index.html:2
  • An iframe with no title (or an empty one) is announced only as "frame". Add a non-empty title describing its content, or an aria-label. — scripts/screenshot_compare/assets/templates/example.html:18

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.
AC6 · Visual & motion safety4.0 / 10Weak✓ Tool-verified

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:. — rerun_js/web-viewer/index.ts:1357
  • `.sm-dox ul a:hover, .sm-dox ul a:active, .sm-dox ul a:focus` sets color: #1C1D1F !important on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — rerun_cpp/docs/doxygen-awesome/doxygen-awesome.css:493
  • `.rerun-notebook-loading__spinner` moves (`animation: rerun-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. — rerun_py/rerun_sdk/rerun/_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. — rerun_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. — rerun_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. — rerun_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. — rerun_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. — rerun_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. — rerun_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. — rerun_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. — rerun_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.
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.

Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.

Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.

  • No accessibility enforcement found — your oxlint config does not list the `jsx-a11y` plugin (its a11y rules are off until it does) and there's no axe/pa11y/Lighthouse in tests or CI. Start by enabling that plugin to catch issues at author time. What was searched, so you can tell an absence from a miss: the 16 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

What to do

  • Enforce accessibility in the toolchain you already use: add `jsx-a11y` to the `plugins` array in your oxlint config (its a11y rules are off until the plugin is listed), then assert with @axe-core/playwright in tests, then gate axe/pa11y/Lighthouse in CI.
AX10 · Code composition9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

  • The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

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.

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

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.

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

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_support/re_viewer_context/src/store_hub.rs:1394

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.
ES1 · Fold determinism10.0 / 10Exemplary✓ Tool-verified

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.

ES2 · Immutable events10.0 / 10Exemplary✓ Tool-verified

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.

M1 · Documentation (README)8.6 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
  • Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
  • Add a README to the 10 of 202 project(s) that lack one — worth up to 0.1 pts.
M2 · Architecture documentation2.0 / 10Weak✓ Tool-verified

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.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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.

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P2 · Observability8.8 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

  • Only 65/70 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/build/re_dev_tools`, `crates/store_app/re_query`, `crates/top/rerun-cli`, `rerun_pixi_env`, `run_wasm`.

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.
P3 · Security & performance tooling5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

What to do

  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

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.

P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

P7 · Outbound HTTP resilience10.0 / 10Exemplary○ Nothing flagged

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.

PF1 · Benchmark discipline9.0 / 10Exemplary✓ Tool-verified

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.

PF3 · Async & latency hygiene8.5 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

  • `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/re_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`.
R1 · Type Safety10.0 / 10Exemplary✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

R10 · Code Duplication9.7 / 10Exemplary✓ Tool-verified

React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.

Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.

  • rerun_js/web-viewer/index.ts:1744 · rerun_js/web-viewer/index.ts:1759 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — rerun_js/web-viewer/index.ts:1744
  • rerun_js/web-viewer/index.ts:1526 · rerun_js/web-viewer/index.ts:1548 — 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. — rerun_js/web-viewer/index.ts:1526

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.
R2 · Cyclomatic Complexity10.0 / 10Exemplary✓ Tool-verified

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.

  • collect_targets has cyclomatic complexity 17 and cognitive complexity 20; 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. — rerun_js/web-viewer/typedoc-used-by.mjs:97
  • 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. — rerun_js/web-viewer/index.ts:1330
  • close_target_of has cyclomatic complexity 13 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. — rerun_js/web-viewer/index.ts:663
  • (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. — rerun_js/scripts/version.mjs:4
R3 · Large Files7.3 / 10Strong✓ 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.

  • rerun_js/web-viewer/index.ts has 2318 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — rerun_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.
R4 · Test Coverage2.3 / 10Weak✓ Tool-verified

React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.

Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×10) — rerun_notebook/src/js/widget.ts:1, rerun_js/web-viewer-react/index.js:1, rerun_js/web-viewer/typedoc-used-by.mjs:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness9.3 / 10Exemplary✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

What to do

  • Bump outdated dependencies to current versions to limit upgrade debt.
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.

Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.

R7 · Dead Code9.4 / 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.

  • Unreachable from the 11 application, 5 tooling and 13 test entry point(s) detected in this repo. Gate removals on `npm run build:js` — an undetected custom entry would make these reachable.
  • no import path from any entry point (11 application, 5 tooling, 13 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make — rerun_js/web-viewer/typedoc-used-by.mjs
  • 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. — rerun_js/web-viewer/index.ts:1485

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene8.0 / 10Strong✓ Tool-verified

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 rerun_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. (×3)

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports10.0 / 10Exemplary✓ Tool-verified

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.

S1 · Web-Security Posture8.0 / 10Strong✓ Tool-verified

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.
X1 · Async correctness8.0 / 10Strong✓ Tool-verified

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/re_auth/src/cli.rs:90

What to do

  • Blocking `thread::sleep` inside an `async` body
X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

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.

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.

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

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.

X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

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.

X17 · Uncapped recursion over a caller-supplied document2.2 / 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.

  • `walk` is public and takes `node: dict[str, Any]` from its caller, and it calls itself at line 43 (`walk`) with a piece of `node` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. 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. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/investigate-puffin/compare_traces.py:43
  • `walk` is public and takes `node: dict[str, Any]` from its caller, and it calls itself at line 37 (`walk`) with a piece of `node` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. 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. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/investigate-puffin/find_scopes.py:37
  • `extract_segments` is public and takes `node: ET.Element` from its caller, and it calls itself at line 135 (`extract_segments`) with a piece of `node` — and nowhere in `extract_segments` is there a depth parameter, a descent counter, or any other cap. 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. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `extract_segments` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — scripts/render_d2.py:135

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.
X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

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.

X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation4.0 / 10Weak✓ Tool-verified

Other · Code Health — Whether async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).

Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.

  • Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
  • `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 })`. — rerun_notebook/src/rerun_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 })`. — rerun_js/web-viewer/index.ts:865
  • `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 })`. — rerun_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.
X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

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.

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

X23 · Unguarded diagnostic materialisation10.0 / 10Exemplary○ Nothing flagged

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.

X24 · Document value interpolated into markup unescaped6.3 / 10Adequate✓ Tool-verified

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

  • `String(e)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — rerun_notebook/src/js/widget.ts:243

What to do

  • Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

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.

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

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.

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.

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.

X3 · Exception handling6.5 / 10Adequate✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×5) — scripts/highlight_issues.py:47, scripts/ci/check_large_files.py:97, scripts/ci/python_check_signatures.py:218, …
  • `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×4) — rerun_py/rerun_sdk/rerun/_tracing_session.py:155, rerun_py/rerun_sdk/rerun/_tracing_session.py:160, rerun_py/rerun_sdk/rerun/_tracing_session.py:180, …
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `__del__()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch. — rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py:1538
  • `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — rerun_js/web-viewer-react/index.js:150

What to do

  • Swallowed exception (empty catch)
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.

X4 · Structured logging3.9 / 10Weak✓ Tool-verified

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.

  • `error` at line 24 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.error("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.error("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:24
  • `info` at line 64 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:64
  • `info` at line 67 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:67
  • `info` at line 75 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:75
  • `info` at line 92 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:92
  • `debug` at line 93 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.debug("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.debug("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:93
  • `info` at line 95 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:95
  • `debug` at line 160 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.debug("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.debug("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:160
  • `error` at line 189 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.error("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.error("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:189
  • `info` at line 198 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:198
  • `info` at line 201 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/fast_lint.py:201
  • `debug` at line 46 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.debug("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.debug("order moved", order_id=order_id, status=status)` with structlog. — scripts/nbstripout.py:46
  • `info` at line 328 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/render_d2.py:328
  • `info` at line 74 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/update_docs_url_rewrite.py:74
  • `info` at line 142 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/update_docs_url_rewrite.py:142
  • `info` at line 185 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/update_docs_url_rewrite.py:185
  • `error` at line 222 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.error("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.error("order moved", order_id=order_id, status=status)` with structlog. — scripts/update_docs_url_rewrite.py:222
  • `info` at line 83 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/upload_image.py:83
  • `info` at line 281 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/upload_image.py:281
  • `info` at line 314 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/upload_image.py:314
  • `info` at line 342 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/upload_image.py:342
  • `warning` at line 348 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. — scripts/upload_image.py:348
  • `info` at line 78 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/upload_rrd.py:78
  • `warning` at line 84 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. — scripts/upload_rrd.py:84
  • `info` at line 53 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/ci/bundle_and_upload_rerun_cpp.py:53
  • `info` at line 73 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/ci/bundle_and_upload_rerun_cpp.py:73
  • `info` at line 165 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/ci/bundle_and_upload_rerun_cpp.py:165
  • `info` at line 174 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/ci/bundle_and_upload_rerun_cpp.py:174
  • `warning` at line 180 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. — rerun_py/rerun_sdk/rerun/catalog/_catalog_client.py:180
  • `warning` at line 272 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. — rerun_notebook/src/rerun_notebook/__init__.py:272
  • `debug!` at line 149 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`. — rerun_py/src/trace_context.rs:149
  • `debug!` at line 160 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`. — rerun_py/src/trace_context.rs:160
  • `info!` at line 136 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`. — rerun_py/src/tracing_session.rs:136
  • `warn!` at line 346 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`. — rerun_py/src/catalog/connection_handle.rs:346
  • `error!` at line 49 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/re_perf_telemetry/src/metrics_server.rs:49
  • `info!` at line 53 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `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/re_perf_telemetry/src/metrics_server.rs:53
  • `error!` at line 78 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — crates/utils/re_perf_telemetry/src/metrics_server.rs:78
  • `error!` at line 98 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/re_perf_telemetry/src/metrics_server.rs:98
  • `warn!` at line 185 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/re_perf_telemetry/src/telemetry.rs:185
  • `warn!` at line 309 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/re_perf_telemetry/src/telemetry.rs:309

What to do

  • Interpolated log message defeats structured logging
X5 · Nullable reference types9.5 / 10Exemplary✓ Tool-verified

Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • ~1.3 `!` null assertions per 1k TypeScript source lines — 4 assertion(s) across the 3019 source line(s) of the 4 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: rerun_js/web-viewer/index.ts (4). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.

What to do

  • The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).

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).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC1 · Text alternatives1.1.1, 1.2.2, 1.2.5Partial signal
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only
AC7 · A11y enforcementenforcement — no page criterionEnforcement posture (process)

Not statically assessed — these 42 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.2.1, 1.2.3, 1.2.4, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.1, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.3, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

Reference — by lens

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.

LensScoreRatingImpact
Code Health60%Adequate — gated by X4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture95%ExemplarySolid.
Maturity70%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness61%Adequate — gated by R4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security72%Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Event Sourcing100%ExemplaryStrongest area.
Accessibility55%Adequate — gated by AC6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance87%ExemplarySolid.
Unscored — 3 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 17 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 8 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 — 39 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
  • 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 did not expose a crawlable HTTP endpoint in time — no runtime evidence 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.
  • D11 Test Reliability — Test reliability not scored — polyglot repository, one half's runner produced no measurement
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Python, Rust, TypeScript, html not measured.
  • D22 Internal API Consistency — API consistency is measured on C# only; the exposed JavaScript, Rust, TypeScript surface was not measured.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, .ts, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D32 Data Compliance (PII/GDPR) — 1 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • 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: the JavaScript/TypeScript half could not be measured — the node:test suite in rerun_js/web-viewer/ ran and not one test passed (throw new ERR_UNKNOWN_FILE_EXTENSION(ext, filepath);), so the coverage report describes the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 708 value object(s); 2 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb. Python runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • 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 — 144 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 48 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 16 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC3 · Page structure · <html> without a lang · ×3
  • <html> without a lang REDACTED:3 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang scripts/screenshot_compare/assets/templates/example.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
  • <html> without a lang scripts/screenshot_compare/assets/templates/index.html:2 — The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC3 · Page structure · Viewport restricts zoom · ×3
  • 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.
  • Viewport restricts zoom scripts/screenshot_compare/assets/templates/example.html:6 — 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.
  • Viewport restricts zoom scripts/screenshot_compare/assets/templates/index.html:6 — 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.
D31 · IaC & Container Security · High IaC · ×2
  • REDACTED
  • REDACTED
AC3 · Page structure · <iframe> without a title · ×1
  • <iframe> without a title scripts/screenshot_compare/assets/templates/example.html:18 — An iframe with no title (or an empty one) is announced only as "frame". Add a non-empty title describing its content, or an aria-label.
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_support/re_viewer_context/src/store_hub.rs:1394 — `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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High vulnerability · ×1
  • REDACTED
D31 · IaC & Container Security · Critical IaC · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×1
  • Orphaned knowledge crates/viewer_support/re_viewer_context/src/component_ui_registry.rs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
Serious — 3081 finding(s)
D17 · Explicit Debt · TodoComment · ×1293
  • TodoComment tests/rust/re_integration_test/tests/integration/blueprint_import_test.rs:110 — // TODO(RR-5258): Removing the flag will break this test since it implies a change in behavior.
  • TodoComment tests/rust/re_integration_test/tests/integration/rrd_bw_compat_test.rs:276 — // TODO(RR-5258): Removing the flag will break this test since it implies a change in behavior.
  • TodoComment tests/rust/re_integration_test/tests/integration/internal_catalog.rs:32 — // TODO(RR-4929): We should properly show the application id,
  • TodoComment tests/rust/re_integration_test/tests/integration/internal_catalog.rs:140 — // TODO(RR-4929): Remove this mask once the catalog app id matches recording app id.
  • TodoComment tests/rust/re_integration_test/tests/integration/multi_container_test.rs:252 — // 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/rust/re_integration_test/tests/integration/preview_table.rs:305 — /// TODO(andreas): Should use a higher level rust blueprint api. — 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/re_integration_test/tests/inspection/internal_catalog.rs:11 — // TODO(RR-5790): re-enable https://linear.app/rerun/issue/RR-5790
  • 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/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/gc_stress/many_large_single_row_recordings.py:33 — # TODO(#4185): Investigate this.
  • 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:577 — # 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:102 — # 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:185 — # TODO(#6077): figure out how we best link to our own code from our docs
  • TodoComment scripts/lint.py:2021 — # zombie TODO hunting job — 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/lint.py:2063 — # 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: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 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:47 — # 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:372 — # Check for internal issue references (TODO(#1234))
  • + 1268 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Hotspot · ×107
  • Hotspot: crates/top/re_viewer/src/app/command_handling.rs crates/top/re_viewer/src/app/command_handling.rs:118 — crates/top/re_viewer/src/app/command_handling.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in AppCore::run_system_command at line 118. 4 of those changes were fix/bug commits, and the other 36 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/re_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: crates/top/re_viewer/src/app/mod.rs crates/top/re_viewer/src/app/mod.rs:1323 — crates/top/re_viewer/src/app/mod.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in AppCore::frame_ui at line 1323. 4 of those changes were fix/bug commits, and the other 53 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/re_viewer/src/app/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: scripts/lint.py scripts/lint.py:194 — scripts/lint.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in lint.lint_line at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00: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/top/re_viewer/src/app/viewer_control.rs crates/top/re_viewer/src/app/viewer_control.rs:315 — crates/top/re_viewer/src/app/viewer_control.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in AppCore::serve_viewer_control at line 315. 1 of those changes was a fix/bug commit, and the other 33 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/re_viewer/src/app/viewer_control.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/re_viewer/src/app_state.rs crates/top/re_viewer/src/app_state.rs:303 — crates/top/re_viewer/src/app_state.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in AppState::show at line 303. 1 of those changes was a fix/bug commit, and the other 20 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/re_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_support/re_dataframe_ui/src/datafusion_table_widget.rs crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:914 — crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in DataFusionTableWidget::table_ui at line 914. 1 of those changes was a fix/bug commit, and the other 29 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.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/views/re_view_time_series/src/view_class.rs crates/views/re_view_time_series/src/view_class.rs:397 — crates/views/re_view_time_series/src/view_class.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in TimeSeriesView::ui at line 397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/views/re_view_time_series/src/view_class.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/panels/re_redap_browser/src/servers/mod.rs crates/panels/re_redap_browser/src/servers/mod.rs:1083 — crates/panels/re_redap_browser/src/servers/mod.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in RedapServers::handle_command at line 1083. 2 of those changes were fix/bug commits, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/panels/re_redap_browser/src/servers/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/top/re_viewer/src/app/add_data_source.rs crates/top/re_viewer/src/app/add_data_source.rs:74 — crates/top/re_viewer/src/app/add_data_source.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in AppCore::load_data_source at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/re_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/rerun/src/commands/entrypoint.rs crates/top/rerun/src/commands/entrypoint.rs:2071 — crates/top/rerun/src/commands/entrypoint.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rerun::commands::entrypoint::record_cli_command_analytics at line 2071. 1 of those changes was a fix/bug commit, and the other 26 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/rerun/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/re_types_builder/src/codegen/python/mod.rs crates/build/re_types_builder/src/codegen/python/mod.rs:735 — crates/build/re_types_builder/src/codegen/python/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in re_types_builder::codegen::python::code_for_struct at line 735. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/build/re_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/views/re_view_state_timeline/src/view_class.rs crates/views/re_view_state_timeline/src/view_class.rs:254 — crates/views/re_view_state_timeline/src/view_class.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in StateTimelineView::ui at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/views/re_view_state_timeline/src/view_class.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_app/re_datafusion/src/dataframe_query_common.rs crates/store_app/re_datafusion/src/dataframe_query_common.rs:739 — crates/store_app/re_datafusion/src/dataframe_query_common.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DataframeQueryTableProvider::scan at line 739. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/store_app/re_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/top/re_viewer/src/app/logic.rs crates/top/re_viewer/src/app/logic.rs:149 — crates/top/re_viewer/src/app/logic.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AppCore::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-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/re_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/panels/re_agent_ui/src/ui/chat_ui.rs crates/panels/re_agent_ui/src/ui/chat_ui.rs:680 — crates/panels/re_agent_ui/src/ui/chat_ui.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in re_agent_ui::ui::chat_ui::permissions_ui at line 680. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/panels/re_agent_ui/src/ui/chat_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/panels/re_selection_panel/src/selection_panel.rs crates/panels/re_selection_panel/src/selection_panel.rs:189 — crates/panels/re_selection_panel/src/selection_panel.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SelectionPanel::item_ui at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/panels/re_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/re_protos/src/v1alpha1/rerun.viewer_control.v1alpha1.ext.rs crates/store/re_protos/src/v1alpha1/rerun.viewer_control.v1alpha1.ext.rs:62 — crates/store/re_protos/src/v1alpha1/rerun.viewer_control.v1alpha1.ext.rs changed 16 times in last 90 days, max cyclomatic complexity 22 in ViewerControlResponse::kind_name at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/store/re_protos/src/v1alpha1/rerun.viewer_control.v1alpha1.ext.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/re_viewer/src/web.rs crates/top/re_viewer/src/web.rs:627 — crates/top/re_viewer/src/web.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in re_viewer::web::create_app at line 627. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/top/re_viewer/src/web.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: rerun_js/web-viewer/index.ts rerun_js/web-viewer/index.ts:1330 — rerun_js/web-viewer/index.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in WebViewer.start at line 1330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- rerun_js/web-viewer/index.ts`: 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/re_agent/src/session.rs crates/utils/re_agent/src/session.rs:780 — crates/utils/re_agent/src/session.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AgentSession::handle_event at line 780. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/utils/re_agent/src/session.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_support/re_viewer_context/src/viewer_url.rs crates/viewer_support/re_viewer_context/src/viewer_url.rs:708 — crates/viewer_support/re_viewer_context/src/viewer_url.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ViewerUrl::open at line 708. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/viewer_support/re_viewer_context/src/viewer_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_support/re_ui/src/command/ui_command.rs crates/viewer_support/re_ui/src/command/ui_command.rs:278 — crates/viewer_support/re_ui/src/command/ui_command.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in UICommand::kb_shortcuts at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/viewer_support/re_ui/src/command/ui_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/data_flow/re_data_source/src/data_source.rs crates/data_flow/re_data_source/src/data_source.rs:86 — crates/data_flow/re_data_source/src/data_source.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in LogDataSource::from_uri at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/data_flow/re_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/build/re_types_builder/src/objects/mod.rs crates/build/re_types_builder/src/objects/mod.rs:31 — crates/build/re_types_builder/src/objects/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Objects::validate at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/build/re_types_builder/src/objects/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/viewer_support/re_dataframe_ui/src/preview_renderer.rs crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs:535 — crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in re_dataframe_ui::preview_renderer::preview_playback_ui at line 535. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • + 82 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×105
  • FileTooLong: src/python_bridge.rs rerun_py/src/python_bridge.rs — FileTooLong — 1711 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 1211 over it, 3.42× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: v1alpha1/rerun.cloud.v1alpha1.ext.rs crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.rs — FileTooLong — 1675 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 1175 over it, 3.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: rerun_cloud/mod.rs crates/store_app/re_server/src/rerun_cloud/mod.rs — FileTooLong — 1494 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: RerunCloudHandler (5 blocks, 280-2223). The bar is 500 significant lines; this is 994 over it, 2.99× 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/viewer_control.rs crates/top/re_viewer/src/app/viewer_control.rs — FileTooLong — 1455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 78% of them inside a single declaration: AppCore (2 blocks, 206-1959). The bar is 500 significant lines; this is 955 over it, 2.91× 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/datafusion_table_widget.rs crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs — FileTooLong — 1409 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 909 over it, 2.82× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/view_class.rs crates/views/re_view_time_series/src/view_class.rs — FileTooLong — 1386 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 886 over it, 2.77× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: cache/video_stream_cache.rs crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs — FileTooLong — 1349 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 849 over it, 2.70× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/connection_client.rs crates/data_flow/re_redap_client/src/connection_client.rs — FileTooLong — 1348 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: RedapClient (5 blocks, 344-2012). The bar is 500 significant lines; this is 848 over it, 2.70× 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_app/re_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: src/time_panel.rs crates/panels/re_time_panel/src/time_panel.rs — FileTooLong — 1303 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, 101-2058). The bar is 500 significant lines; this is 803 over it, 2.61× 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: commands/entrypoint.rs crates/top/rerun/src/commands/entrypoint.rs — FileTooLong — 1300 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 800 over it, 2.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/recording_stream.rs crates/top/re_sdk/src/recording_stream.rs — FileTooLong — 1286 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 786 over it, 2.57× 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/top/re_viewer/src/app/command_handling.rs — FileTooLong — 1252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 88% of them inside a single declaration: AppCore (39-1819). The bar is 500 significant lines; this is 752 over it, 2.50× 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: scripts/lint.py scripts/lint.py — FileTooLong — 1205 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 705 over it, 2.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: web-viewer/index.ts rerun_js/web-viewer/index.ts — FileTooLong — 1190 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 690 over it, 2.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/chunk.rs crates/store/re_chunk/src/chunk.rs — FileTooLong — 1152 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, 242-1962). The bar is 500 significant lines; this is 652 over it, 2.30× 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/top/re_viewer/src/app/mod.rs — FileTooLong — 1090 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 61% of them inside a single declaration: AppCore (3 blocks, 125-1722). The bar is 500 significant lines; this is 590 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/selection_panel.rs crates/panels/re_selection_panel/src/selection_panel.rs — FileTooLong — 1030 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 530 over it, 2.06× 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: servers/mod.rs crates/panels/re_redap_browser/src/servers/mod.rs — FileTooLong — 1011 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 511 over it, 2.02× 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/raw_rrd_manifest.rs crates/store/re_chunk_index/src/raw_rrd_manifest.rs — FileTooLong — 977 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 83% of them inside a single declaration: RawRrdManifest (8 blocks, 145-1822). The bar is 500 significant lines; this is 477 over it, 1.95× 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: servers/dataset.rs crates/panels/re_redap_browser/src/servers/dataset.rs — FileTooLong — 971 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 471 over it, 1.94× 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/design_tokens.rs crates/viewer_support/re_ui/src/design_tokens.rs — FileTooLong — 941 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 65% of them inside a single declaration: DesignTokens (2 blocks, 251-1294). The bar is 500 significant lines; this is 441 over it, 1.88× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/lib.rs crates/top/rerun_c/src/lib.rs — FileTooLong — 939 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 44 free functions. The bar is 500 significant lines; this is 439 over it, 1.88× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/grpc.rs crates/data_flow/re_redap_client/src/grpc.rs — FileTooLong — 881 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 381 over it, 1.76× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/analytics.rs crates/store_app/re_datafusion/src/analytics.rs — FileTooLong — 881 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 381 over it, 1.76× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • + 80 more in this group — see findings.md.
D3 · God Classes · MethodTooLong · ×100
  • MethodTooLong: AppState.show crates/top/re_viewer/src/app_state.rs:303 — MethodTooLong — show runs 465 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 365 over it, 4.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.
  • MethodTooLong: AppCore.run_system_command crates/top/re_viewer/src/app/command_handling.rs:118 — MethodTooLong — run_system_command runs 429 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 329 over it, 4.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.
  • MethodTooLong: TimeSeriesView.ui crates/views/re_view_time_series/src/view_class.rs:397 — MethodTooLong — ui runs 380 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 280 over it, 3.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: DataFusionTableWidget.table_ui crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:914 — MethodTooLong — table_ui runs 327 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 227 over it, 3.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ChunkStore.insert_chunk_impl crates/store/re_chunk_store/src/writes.rs:113 — 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/re_perf_telemetry/src/telemetry.rs:512 — MethodTooLong — init runs 278 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 178 over it, 2.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: StatsCommand.run crates/top/rerun/src/commands/rrd/stats.rs:36 — MethodTooLong — run runs 272 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 172 over it, 2.72× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: AppCore.frame_ui crates/top/re_viewer/src/app/mod.rs:1323 — MethodTooLong — frame_ui runs 257 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 157 over it, 2.57× 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: AppCore.run_ui_command crates/top/re_viewer/src/app/command_handling.rs:879 — MethodTooLong — run_ui_command runs 253 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 153 over it, 2.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: StateTimelineView.ui crates/views/re_view_state_timeline/src/view_class.rs:254 — MethodTooLong — ui runs 232 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 132 over it, 2.32× 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/views/re_view_spatial/src/ui_3d.rs:126 — MethodTooLong — view_3d 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.
  • MethodTooLong: QueryHandle._next_n_rows crates/store_app/re_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: AppCore.serve_viewer_control crates/top/re_viewer/src/app/viewer_control.rs:315 — MethodTooLong — serve_viewer_control 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: TimeControl.handle_time_command crates/viewer_support/re_viewer_context/src/time_control/command.rs:214 — MethodTooLong — handle_time_command runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: SplitCommand.run crates/top/rerun/src/commands/rrd/split.rs:85 — MethodTooLong — run runs 207 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 107 over it, 2.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: App.with_commands crates/top/re_viewer/src/app/mod.rs:228 — MethodTooLong — with_commands 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: DataframeQueryTableProvider.scan crates/store_app/re_datafusion/src/dataframe_query_common.rs:739 — MethodTooLong — scan runs 203 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 103 over it, 2.03× 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_support/re_renderer/src/renderer/gaussian_splat.rs:337 — 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: ViewBuilder.new crates/viewer_support/re_renderer/src/view_builder.rs:445 — 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: PointCloudDrawData.new crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:336 — MethodTooLong — new 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: DesignTokens.load_with_color_table crates/viewer_support/re_ui/src/design_tokens.rs:590 — MethodTooLong — load_with_color_table runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: SegmentPreviewRenderer.show_preview crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs:227 — MethodTooLong — show_preview runs 190 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 90 over it, 1.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: BarChartView.ui crates/views/re_view_bar_chart/src/view_class.rs:139 — MethodTooLong — ui runs 189 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 89 over it, 1.89× 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/views/re_view_time_series/src/point_visualizer_system.rs:189 — MethodTooLong — load_series runs 186 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 86 over it, 1.86× 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: RedapServers.handle_command crates/panels/re_redap_browser/src/servers/mod.rs:1083 — MethodTooLong — handle_command 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.
  • + 75 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×52
  • FunctionTooLong: re_component_fallbacks::component_fallbacks::archetype_field_fallbacks crates/viewer_support/re_component_fallbacks/src/component_fallbacks.rs:30 — FunctionTooLong — re_component_fallbacks::component_fallbacks::archetype_field_fallbacks runs 346 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 246 over it, 3.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_view_spatial::visualizers::video::execute_video_stream_like crates/views/re_view_spatial/src/visualizers/video/mod.rs:166 — FunctionTooLong — re_view_spatial::visualizers::video::execute_video_stream_like runs 236 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 136 over it, 2.36× 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: re_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop crates/store_app/re_datafusion/src/dataframe_query_provider/io_loop.rs:694 — FunctionTooLong — re_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop runs 215 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 115 over it, 2.15× 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: re_datafusion::analytics::build_query_span crates/store_app/re_datafusion/src/analytics.rs:891 — FunctionTooLong — re_datafusion::analytics::build_query_span 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: re_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:305 — FunctionTooLong — re_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread 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.
  • FunctionTooLong: re_view_time_series::line_series_loader::load_line_series_with_styling crates/views/re_view_time_series/src/line_series_loader.rs:103 — FunctionTooLong — re_view_time_series::line_series_loader::load_line_series_with_styling runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_data_ui::entity_db_ui::grid_content_ui crates/viewer_support/re_data_ui/src/entity_db_ui.rs:102 — FunctionTooLong — re_data_ui::entity_db_ui::grid_content_ui runs 178 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 78 over it, 1.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.
  • FunctionTooLong: re_dataframe_ui::filters::column_filter_ui::column_picker_ui crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs:91 — FunctionTooLong — re_dataframe_ui::filters::column_filter_ui::column_picker_ui runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: rerun::commands::rrd::route::process_messages crates/top/rerun/src/commands/rrd/route.rs:104 — FunctionTooLong — rerun::commands::rrd::route::process_messages 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: re_view_spatial::visualizers::video::show_video_frame crates/views/re_view_spatial/src/visualizers/video/mod.rs:586 — FunctionTooLong — re_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: re_datafusion::chunk_fetcher::fetch_batch_via_direct_urls crates/store_app/re_datafusion/src/chunk_fetcher.rs:703 — FunctionTooLong — re_datafusion::chunk_fetcher::fetch_batch_via_direct_urls 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: re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.legacy_adapter.rs:53 — FunctionTooLong — re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_redap_client::connection_client::fetch_rrd_manifest_via_key crates/data_flow/re_redap_client/src/connection_client.rs:104 — FunctionTooLong — re_redap_client::connection_client::fetch_rrd_manifest_via_key runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: rerun::commands::entrypoint::start_native_viewer crates/top/rerun/src/commands/entrypoint.rs:1197 — FunctionTooLong — rerun::commands::entrypoint::start_native_viewer runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_view_spatial::picking_ui::picking crates/views/re_view_spatial/src/picking_ui.rs:30 — FunctionTooLong — re_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: re_selection_panel::visualizer_ui::visualizer_components crates/panels/re_selection_panel/src/visualizer_ui.rs:216 — FunctionTooLong — re_selection_panel::visualizer_ui::visualizer_components runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_sdk::spawn::spawn crates/top/re_sdk/src/spawn.rs:205 — FunctionTooLong — re_sdk::spawn::spawn runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_dataframe_ui::cards_view::card_content_ui crates/viewer_support/re_dataframe_ui/src/cards_view.rs:145 — FunctionTooLong — re_dataframe_ui::cards_view::card_content_ui runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_time_panel::time_selection_ui::loop_selection_ui crates/panels/re_time_panel/src/time_selection_ui.rs:55 — FunctionTooLong — re_time_panel::time_selection_ui::loop_selection_ui runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_view_spatial::shared_fallbacks::register_fallbacks crates/views/re_view_spatial/src/shared_fallbacks.rs:27 — FunctionTooLong — re_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: re_viewport_blueprint::viewport_blueprint::apply_viewport_command crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:977 — FunctionTooLong — re_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: rerun_py" # name of the rust crate::python_bridge::rerun_bindings rerun_py/src/python_bridge.rs:186 — FunctionTooLong — rerun_py" # name of the rust crate::python_bridge::rerun_bindings 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: rerun::commands::entrypoint::run_impl crates/top/rerun/src/commands/entrypoint.rs:1013 — FunctionTooLong — rerun::commands::entrypoint::run_impl runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:2028 — FunctionTooLong — re_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: re_datafusion::pushdown_expressions::apply_filter_expr_to_queries crates/store_app/re_datafusion/src/pushdown_expressions.rs:465 — FunctionTooLong — re_datafusion::pushdown_expressions::apply_filter_expr_to_queries runs 132 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 32 over it, 1.32× 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.
  • + 27 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×38
  • Duplicated block (9 lines × 2) crates/data_flow/re_lenses/src/semantic/ros2msg/voxel_grid.rs:150 — crates/data_flow/re_lenses/src/semantic/ros2msg/voxel_grid.rs:150-158 | crates/data_flow/re_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.
  • Duplicated block (9 lines × 2) crates/panels/re_chunk_store_ui/src/chunk_store_ui.rs:491 — crates/panels/re_chunk_store_ui/src/chunk_store_ui.rs:491-499 | crates/panels/re_chunk_store_ui/src/chunk_ui.rs:210-218 — 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/re_chunk/src/earliest_at.rs:99 — crates/store/re_chunk/src/earliest_at.rs:99-107 | crates/store/re_chunk/src/latest_at.rs:124-132 — 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/re_lenses_core/src/selector/eval.rs:498 — crates/store/re_lenses_core/src/selector/eval.rs:498-506 | crates/store/re_lenses_core/src/selector/eval.rs:582-590 — both copies are in the same file, so extract the block into 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/re_lenses_core/src/selector/lexer.rs:122 — crates/store/re_lenses_core/src/selector/lexer.rs:122-130 | crates/store/re_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.
  • Duplicated block (9 lines × 2) crates/store_app/re_dataframe/src/query.rs:1242 — crates/store_app/re_dataframe/src/query.rs:1242-1250 | crates/store_app/re_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_app/re_entity_db/src/entity_db.rs:1211 — crates/store_app/re_entity_db/src/entity_db.rs:1211-1219 | crates/store_app/re_entity_db/src/entity_db.rs:1234-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.
  • Duplicated block (9 lines × 2) crates/store_app/re_server/src/rerun_cloud/mod.rs:1417 — crates/store_app/re_server/src/rerun_cloud/mod.rs:1417-1425 | crates/store_app/re_server/src/rerun_cloud/mod.rs:1481-1489 — both copies are in the same file, so extract the block into 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/utils/re_arrow_util/src/format.rs:298 — crates/utils/re_arrow_util/src/format.rs:298-306 | crates/utils/re_arrow_util/src/format.rs:353-361 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) crates/utils/re_auth/src/callback_server.rs:27 — crates/utils/re_auth/src/callback_server.rs:27-35 | crates/utils/re_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.
  • Duplicated block (9 lines × 2) crates/utils/re_video/src/demux/mod.rs:364 — crates/utils/re_video/src/demux/mod.rs:364-372 | crates/utils/re_video/src/demux/mod.rs:387-395 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:1091 — crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:1091-1099 | crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:1105-1113 — both copies are in the same file, so extract the block into 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_support/re_dataframe_ui/src/filters/filter.rs:145 — crates/viewer_support/re_dataframe_ui/src/filters/filter.rs:145-153 | crates/viewer_support/re_dataframe_ui/src/filters/filter.rs:156-164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) crates/viewer_support/re_view/src/clears.rs:43 — crates/viewer_support/re_view/src/clears.rs:43-51 | crates/viewer_support/re_view/src/clears.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.
  • Duplicated block (9 lines × 2) crates/viewer_support/re_viewer_context/src/item.rs:164 — crates/viewer_support/re_viewer_context/src/item.rs:164-172 | crates/viewer_support/re_viewer_context/src/item.rs:205-213 — both copies are in the same file, so extract the block into 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/views/re_view_graph/src/ui/draw.rs:144 — crates/views/re_view_graph/src/ui/draw.rs:144-152 | crates/views/re_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.
  • Duplicated block (9 lines × 2) crates/views/re_view_graph/src/ui/draw.rs:365 — crates/views/re_view_graph/src/ui/draw.rs:365-373 | crates/views/re_view_map/src/map_view.rs:491-499 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (9 lines × 2) crates/views/re_view_time_series/src/line_visualizer_system.rs:287 — crates/views/re_view_time_series/src/line_visualizer_system.rs:287-295 | crates/views/re_view_time_series/src/line_visualizer_system.rs:353-361 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (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.
  • Duplicated block (9 lines × 2) docs/snippets/all/howto/any_batch_value_column_updates.rs:10 — docs/snippets/all/howto/any_batch_value_column_updates.rs:10-18 | docs/snippets/all/howto/any_values_column_updates.rs:12-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.
  • 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.
  • Duplicated block (9 lines × 2) rerun_py/src/trace_context.rs:65 — rerun_py/src/trace_context.rs:65-73 | rerun_py/src/tracing_session.rs:42-50 — 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) rerun_py/src/catalog/segment_url_udf.rs:215 — rerun_py/src/catalog/segment_url_udf.rs:215-223 | rerun_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.
  • Duplicated block (9 lines × 2) crates/viewer_support/re_renderer/src/renderer/rectangles.rs:771 — crates/viewer_support/re_renderer/src/renderer/rectangles.rs:771-779 | crates/viewer_support/re_renderer/src/renderer/rectangles.rs:782-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 (9 lines × 2) crates/data_flow/re_importer/src/importer_parquet.rs:37 — crates/data_flow/re_importer/src/importer_parquet.rs:37-45 | crates/data_flow/re_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.
  • + 13 more in this group — see findings.md.
D35 · Change Coupling · Change coupling · ×35
  • Change coupling: viewport_ui.rs ↔ auto_layout.rs crates/panels/re_viewport/src/viewport_ui.rs:1 — `crates/panels/re_viewport/src/viewport_ui.rs` and `crates/viewer_support/re_viewport_blueprint/src/auto_layout.rs` change together 88% of the time (21 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are `3deb7af3` Move the blueprint saving logic to `re_viewer_blueprint` (#8717) (at that commit the files were still `crates/viewer/re_viewport/src/viewport_ui.rs` and `crates/viewer/re_viewport_blueprint/src/auto_layout.rs`); `cd494cc4` Move SpaceViewBlueprint -> re_space_view (#5047) (at that commit the files were still `crates/re_viewport/src/viewport.rs` and `crates/re_viewport/src/auto_layout.rs`); `4c9753e7` Improve viewport tile behavior (#3295) (at that commit the files were still `crates/re_viewport/src/viewport.rs` and `crates/re_viewport/src/auto_layout.rs`) — run `git show` on any of them.
  • Change coupling: gltf.rs ↔ obj.rs crates/viewer_support/re_renderer/src/importer/gltf.rs:1 — `crates/viewer_support/re_renderer/src/importer/gltf.rs` and `crates/viewer_support/re_renderer/src/importer/obj.rs` change together 88% of the time (14 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 14 shared commits counted here, the most recent 3 are `7df80219` Compute `Asset3D` normals when they are missing; `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`) — run `git show` on any of them.
  • Change coupling: widget.ts ↔ __init__.py rerun_notebook/src/js/widget.ts:1 — `rerun_notebook/src/js/widget.ts` and `rerun_notebook/src/rerun_notebook/__init__.py` change together 84% of the time (16 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 16 shared commits counted here, the most recent 3 are `e5fc7f08` Move the WebViewer time and recording methods onto the Viewer Control…; `45c11358` Fix theme warning for embedded viewers in Python notebooks; `beaee9c6` Expose theme setting on web-viewer notebook — run `git show` on any of them.
  • Change coupling: depth_offsets.rs ↔ transform_tree_context.rs crates/views/re_view_spatial/src/contexts/depth_offsets.rs:1 — `crates/views/re_view_spatial/src/contexts/depth_offsets.rs` and `crates/views/re_view_spatial/src/contexts/transform_tree_context.rs` change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `f622d5ef` Minor blueprint resolved query refactors (at that commit the files were still `crates/viewer/re_view_spatial/src/contexts/depth_offsets.rs` and `crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs`); `624160e0` Move `QueryContext` into `BlueprintResolvedLatestAtResult` (at that commit the files were still `crates/viewer/re_view_spatial/src/contexts/depth_offsets.rs` and `crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs`); `d899007d` Add `VisualizerInstructionId` to `QueryContext` if available (at that commit the files were still `crates/viewer/re_view_spatial/src/contexts/depth_offsets.rs` and `crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs`) — run `git show` on any of them.
  • Change coupling: line_visualizer_system.rs ↔ point_visualizer_system.rs crates/views/re_view_time_series/src/line_visualizer_system.rs:1 — `crates/views/re_view_time_series/src/line_visualizer_system.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` change together 78% of the time (36 of the 46 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 36 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`); `f9ca4953` Fix spamming errors when trying to show static scalars in the time se… (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: history.rs ↔ web.rs crates/top/re_viewer/src/history.rs:1 — `crates/top/re_viewer/src/history.rs` and `crates/top/re_viewer/src/web.rs` change together 77% of the time (10 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `9bac4784` Rename `ViewerOpenUrl` to `ViewerUrl`; `436ea5ca` Show loading screen when opening link (#11270) (at that commit the files were still `crates/viewer/re_viewer/src/history.rs` and `crates/viewer/re_viewer/src/web.rs`); `1470937c` Add share link button to time panel context menu (#11186) (at that commit the files were still `crates/viewer/re_viewer/src/history.rs` and `crates/viewer/re_viewer/src/web.rs`) — run `git show` on any of them.
  • Change coupling: obj.rs ↔ mesh_renderer.rs crates/viewer_support/re_renderer/src/importer/obj.rs:1 — `crates/viewer_support/re_renderer/src/importer/obj.rs` and `crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs` change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 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: defaults_ui.rs ↔ visualizer_ui.rs crates/panels/re_selection_panel/src/defaults_ui.rs:1 — `crates/panels/re_selection_panel/src/defaults_ui.rs` and `crates/panels/re_selection_panel/src/visualizer_ui.rs` change together 71% of the time (15 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 15 shared commits counted here, the most recent 3 are `3e404788` More powerful AppContext (at that commit the files were still `crates/viewer/re_selection_panel/src/defaults_ui.rs` and `crates/viewer/re_selection_panel/src/visualizer_ui.rs`); `0221dcdb` Query fallbacks via descriptor (at that commit the files were still `crates/viewer/re_selection_panel/src/defaults_ui.rs` and `crates/viewer/re_selection_panel/src/visualizer_ui.rs`); `b3fa1fc5` Only allow ui edits of visualizer components where they actually have… (at that commit the files were still `crates/viewer/re_selection_panel/src/defaults_ui.rs` and `crates/viewer/re_selection_panel/src/visualizer_ui.rs`) — run `git show` on any of them.
  • Change coupling: points2d.rs ↔ points3d.rs crates/views/re_view_spatial/src/visualizers/points2d.rs:1 — `crates/views/re_view_spatial/src/visualizers/points2d.rs` and `crates/views/re_view_spatial/src/visualizers/points3d.rs` change together 71% of the time (17 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 17 shared commits counted here, the most recent 3 are `d96b077b` Refactor spatial visualizer bounds into a single `SpatialViewBounds` (at that commit the files were still `crates/viewer/re_view_spatial/src/visualizers/points2d.rs` and `crates/viewer/re_view_spatial/src/visualizers/points3d.rs`); `3e26be7f` Ignore NaN/Inf values for bounding box calculations used in 3d eye ca… (at that commit the files were still `crates/viewer/re_view_spatial/src/visualizers/points2d.rs` and `crates/viewer/re_view_spatial/src/visualizers/points3d.rs`); `9056ec92` Chunkified, deserialization-free Point Cloud visualizers (#7011) (at that commit the files were still `crates/viewer/re_space_view_spatial/src/visualizers/points2d.rs` and `crates/viewer/re_space_view_spatial/src/visualizers/points3d.rs`) — run `git show` on any of them.
  • Change coupling: data.rs ↔ app_state.rs crates/panels/re_recording_panel/src/data.rs:1 — `crates/panels/re_recording_panel/src/data.rs` and `crates/top/re_viewer/src/app_state.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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `0c351910` Loading spinner next to Catalog name for ongoing registrations; `d42d18bb` Hide welcome screen settings toggle when it's forced hidden; `a7f3ace0` Fix viewer route dispatching (at that commit the files were still `crates/viewer/re_recording_panel/src/data.rs` and `crates/viewer/re_viewer/src/app_state.rs`) — run `git show` on any of them.
  • Change coupling: view_class.rs ↔ view_class.rs crates/views/re_view_bar_chart/src/view_class.rs:1 — `crates/views/re_view_bar_chart/src/view_class.rs` and `crates/views/re_view_time_series/src/view_class.rs` change together 70% of the time (30 of the 43 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 30 shared commits counted here, the most recent 3 are `7d6aeef7` Skip empty visualizers (at that commit the files were still `crates/viewer/re_view_bar_chart/src/view_class.rs` and `crates/viewer/re_view_time_series/src/view_class.rs`); `2503bddf` Don't use ahash from egui since it's deprecated (at that commit the files were still `crates/viewer/re_view_bar_chart/src/view_class.rs` and `crates/viewer/re_view_time_series/src/view_class.rs`); `b1a9d828` New tooltip redesign (at that commit the files were still `crates/viewer/re_view_bar_chart/src/view_class.rs` and `crates/viewer/re_view_time_series/src/view_class.rs`) — run `git show` on any of them.
  • Change coupling: __init__.py ↔ mod.rs rerun_py/rerun_sdk/rerun/catalog/__init__.py:1 — `rerun_py/rerun_sdk/rerun/catalog/__init__.py` and `rerun_py/src/catalog/mod.rs` change together 68% of the time (13 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 `12e530e5` Implement initial version of `CatalogClient._write_segment()`; `04390521` Rename `DatasetView` to `DatasetSelection`; `826db1e2` Add `dataset.info()` and related structures — run `git show` on any of them.
  • Change coupling: assets3d.rs ↔ meshes.rs crates/views/re_view_spatial/src/visualizers/assets3d.rs:1 — `crates/views/re_view_spatial/src/visualizers/assets3d.rs` and `crates/views/re_view_spatial/src/visualizers/meshes.rs` 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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `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: grpc_server.rs ↔ web_viewer.rs crates/top/re_sdk/src/grpc_server.rs:1 — `crates/top/re_sdk/src/grpc_server.rs` and `crates/top/re_sdk/src/web_viewer.rs` change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 `e6d4f0f0` Use owned listeners for `re_grpc_server`; `2f5943f0` Revert "Listen on both ipv4+ipv6 rather than ipv4 only by default (#97)"; `9e4cd586` Unify LogMsg and TableMsg handling in re_grpc_server and viewer (#11963) — run `git show` on any of them.
  • Change coupling: widget.ts ↔ notebook.py rerun_notebook/src/js/widget.ts:1 — `rerun_notebook/src/js/widget.ts` and `rerun_py/rerun_sdk/rerun/notebook.py` change together 63% of the time (12 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 12 shared commits counted here, the most recent 3 are `e5fc7f08` Move the WebViewer time and recording methods onto the Viewer Control…; `beaee9c6` Expose theme setting on web-viewer notebook; `99ffdbe8` Auth for Jupyter Notebooks (#11855) — run `git show` on any of them.
  • Change coupling: view_2d.rs ↔ view_3d.rs crates/views/re_view_spatial/src/view_2d.rs:1 — `crates/views/re_view_spatial/src/view_2d.rs` and `crates/views/re_view_spatial/src/view_3d.rs` change together 60% of the time (27 of the 45 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 27 shared commits counted here, the most recent 3 are `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`); `e27bf80e` Fix: don't always pick `/` as the origin when creating new views (#10… (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/top/re_viewer/src/loading.rs:1 — `crates/top/re_viewer/src/loading.rs` and `crates/viewer_support/re_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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 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: navigation.rs ↔ store_hub.rs crates/top/re_viewer/src/navigation.rs:1 — `crates/top/re_viewer/src/navigation.rs` and `crates/viewer_support/re_viewer_context/src/store_hub.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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `e62fda09` Rename `DisplayMode` -> `Route` (at that commit the files were still `crates/viewer/re_viewer/src/navigation.rs` and `crates/viewer/re_viewer_context/src/store_hub.rs`); `b06cc217` Refactor: Remove state from `StoreHub` (at that commit the files were still `crates/viewer/re_viewer/src/navigation.rs` and `crates/viewer/re_viewer_context/src/store_hub.rs`); `293e649b` Show welcome screen when all recordings are closed (#11133) (at that commit the files were still `crates/viewer/re_viewer/src/navigation.rs` and `crates/viewer/re_viewer_context/src/store_hub.rs`) — run `git show` on any of them.
  • Change coupling: image_decode_cache.rs ↔ video_asset_cache.rs crates/viewer_support/re_viewer_context/src/cache/image_decode_cache.rs:1 — `crates/viewer_support/re_viewer_context/src/cache/image_decode_cache.rs` and `crates/viewer_support/re_viewer_context/src/cache/video_asset_cache.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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 `056c5d65` Use `IntMap` for caches keyed by hashes; `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`) — run `git show` on any of them.
  • Change coupling: depth_images.rs ↔ images.rs crates/views/re_view_spatial/src/visualizers/depth_images.rs:1 — `crates/views/re_view_spatial/src/visualizers/depth_images.rs` and `crates/views/re_view_spatial/src/visualizers/images.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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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: navigation.rs ↔ viewer_context.rs crates/top/re_viewer/src/navigation.rs:1 — `crates/top/re_viewer/src/navigation.rs` and `crates/viewer_support/re_viewer_context/src/viewer_context.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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `f30766b1` Failure to load will now stay in loading screen (with error) for all … (at that commit the files were still `crates/viewer/re_viewer/src/navigation.rs` and `crates/viewer/re_viewer_context/src/viewer_context.rs`); `e62fda09` Rename `DisplayMode` -> `Route` (at that commit the files were still `crates/viewer/re_viewer/src/navigation.rs` and `crates/viewer/re_viewer_context/src/viewer_context.rs`); `b06cc217` Refactor: Remove state from `StoreHub` (at that commit the files were still `crates/viewer/re_viewer/src/navigation.rs` and `crates/viewer/re_viewer_context/src/viewer_context.rs`) — run `git show` on any of them.
  • Change coupling: lib.rs ↔ lib.rs crates/utils/re_analytics/src/lib.rs:1 — `crates/utils/re_analytics/src/lib.rs` and `crates/utils/re_build_info/src/lib.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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `553a767f` dont hardcode build mode into `BuildInfo` (#11386) (at that commit the file was still `crates/build/re_build_info/src/lib.rs`); `762fa4cf` Implement gRPC versioning APIs (#10039) (at that commit the file was still `crates/build/re_build_info/src/lib.rs`); `d0b60f9c` Show list of enabled feature with `rerun --version` (#7885) (at that commit the file was still `crates/build/re_build_info/src/lib.rs`) — run `git show` on any of them.
  • Change coupling: selection_history_ui.rs ↔ view_highlights.rs crates/panels/re_selection_panel/src/selection_history_ui.rs:1 — `crates/panels/re_selection_panel/src/selection_history_ui.rs` and `crates/viewer_support/re_view/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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `493bc5ba` Rename some structures and APIs around selection (#5597) (at that commit the files were still `crates/re_viewer/src/ui/selection_history_ui.rs` and `crates/re_viewport/src/space_view_highlights.rs`); `9f04b354` Add an explicit `DataResult` variant to `re_viewport_context::Item` (… (at that commit the files were still `crates/re_viewer/src/ui/selection_history_ui.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_history_ui.rs` and `crates/re_viewport/src/space_view_highlights.rs`) — run `git show` on any of them.
  • Change coupling: selection_panel.rs ↔ view_highlights.rs crates/panels/re_selection_panel/src/selection_panel.rs:1 — `crates/panels/re_selection_panel/src/selection_panel.rs` and `crates/viewer_support/re_view/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, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 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_app/re_datafusion/src/segment_table.rs:1 — `crates/store_app/re_datafusion/src/segment_table.rs` and `crates/store_app/re_datafusion/src/table_entry_provider.rs` change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `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`); `a82a4d87` Improve tracing on the Python SDK's Rust side (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`) — run `git show` on any of them.
  • + 10 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×34
  • Duplicated block (5 lines × 2) crates/data_flow/re_lenses/src/semantic/helpers.rs:36 — crates/data_flow/re_lenses/src/semantic/helpers.rs:36-40 | crates/data_flow/re_lenses/src/semantic/helpers.rs:48-52 — both copies are in the same file, so extract the block into 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/data_flow/re_lerobot/src/parse_v2.rs:200 — crates/data_flow/re_lerobot/src/parse_v2.rs:200-204 | crates/data_flow/re_lerobot/src/parse_v3.rs:961-965 — 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/store/re_chunk/src/chunk.rs:1254 — crates/store/re_chunk/src/chunk.rs:1254-1258 | crates/store/re_chunk/src/chunk.rs:1280-1284 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) crates/store/re_chunk_store/src/query.rs:78 — crates/store/re_chunk_store/src/query.rs:78-82 | crates/store/re_chunk_store/src/query.rs:105-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.
  • Duplicated block (5 lines × 2) crates/store/re_lenses_core/src/combinators/reshape.rs:295 — crates/store/re_lenses_core/src/combinators/reshape.rs:295-299 | crates/store/re_lenses_core/src/combinators/reshape.rs:308-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 (5 lines × 2) crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:46 — crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:46-50 | crates/store/re_sdk_types/src/archetypes/points3d_ext.rs:51-55 — before extracting anything, compare `crates/store/re_sdk_types/src/archetypes/points2d_ext.rs` and `crates/store/re_sdk_types/src/archetypes/points3d_ext.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 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) crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:78 — crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:78-82 | crates/store/re_sdk_types/src/archetypes/points3d_ext.rs:88-92 — before extracting anything, compare `crates/store/re_sdk_types/src/archetypes/points2d_ext.rs` and `crates/store/re_sdk_types/src/archetypes/points3d_ext.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 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) crates/store_app/re_server/src/rerun_cloud/mod.rs:110 — crates/store_app/re_server/src/rerun_cloud/mod.rs:110-114 | crates/store_app/re_server/src/rerun_cloud/mod.rs:134-138 — both copies are in the same file, so extract the block into 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_app/re_server/src/rerun_cloud/mod.rs:1376 — crates/store_app/re_server/src/rerun_cloud/mod.rs:1376-1380 | crates/store_app/re_server/src/rerun_cloud/mod.rs:1406-1410 — both copies are in the same file, so extract the block into 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/top/re_viewer/data/quick_start_guides/quick_start_connect.rs:7 — crates/top/re_viewer/data/quick_start_guides/quick_start_connect.rs:7-11 | docs/snippets/all/quick_start/quick_start_connect.rs:7-12 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (5 lines × 2) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:1099 — crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:1099-1105 | crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:1379-1383 — both copies are in the same file, so extract the block into 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/views/re_view_spatial/src/proc_mesh.rs:325 — crates/views/re_view_spatial/src/proc_mesh.rs:325-329 | crates/views/re_view_spatial/src/proc_mesh.rs:337-341 — both copies are in the same file, so extract the block into 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) 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) rerun_py/src/catalog/dataframe_rendering.rs:140 — rerun_py/src/catalog/dataframe_rendering.rs:140-144 | rerun_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.
  • Duplicated block (5 lines × 2) rerun_py/src/selector.rs:77 — rerun_py/src/selector.rs:77-81 | rerun_py/src/selector.rs:98-102 — both copies are in the same file, so extract the block into 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/re_sdk_types/src/archetypes/points2d_ext.rs:113 — crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:113-117 | crates/store/re_sdk_types/src/archetypes/points3d_ext.rs:125-129 — before extracting anything, compare `crates/store/re_sdk_types/src/archetypes/points2d_ext.rs` and `crates/store/re_sdk_types/src/archetypes/points3d_ext.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 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) crates/viewer_support/re_ui/src/list_item/label_content.rs:107 — crates/viewer_support/re_ui/src/list_item/label_content.rs:107-111 | crates/viewer_support/re_ui/src/list_item/property_content.rs:64-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 (5 lines × 2) crates/views/re_view_spatial/src/visualizers/gaussian_splats3d.rs:172 — crates/views/re_view_spatial/src/visualizers/gaussian_splats3d.rs:172-176 | crates/views/re_view_spatial/src/visualizers/points3d.rs:141-145 — 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/rerun/src/commands/rrd/stats.rs:237 — crates/top/rerun/src/commands/rrd/stats.rs:237-241 | crates/top/rerun/src/commands/rrd/stats.rs:253-260 — both copies are in the same file, so extract the block into 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/utils/re_analytics/src/native/pipeline.rs:72 — crates/utils/re_analytics/src/native/pipeline.rs:72-78 | crates/utils/re_analytics/src/native/pipeline.rs:91-95 — both copies are in the same file, so extract the block into 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) docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:71 — docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:71-77 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:82-86 — both copies are in the same file, so extract the block into 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) docs/snippets/all/howto/any_values_column_updates.rs:19 — docs/snippets/all/howto/any_values_column_updates.rs:19-23 | docs/snippets/all/howto/any_values_column_updates.rs:26-30 — both copies are in the same file, so extract the block into 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) rerun_py/src/catalog/dataset_entry.rs:419 — rerun_py/src/catalog/dataset_entry.rs:419-423 | rerun_py/src/catalog/dataset_entry.rs:443-447 — both copies are in the same file, so extract the block into 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/re_chunk/src/iter.rs:326 — crates/store/re_chunk/src/iter.rs:326-330 | crates/store/re_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/store/re_chunk_index/src/rrd_manifest.rs:522 — crates/store/re_chunk_index/src/rrd_manifest.rs:522-526 | crates/store/re_chunk_index/src/rrd_manifest.rs:535-539 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • + 9 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×32
  • Duplicated block (8 lines × 2) crates/data_flow/re_importer/src/importer_parquet.rs:47 — crates/data_flow/re_importer/src/importer_parquet.rs:47-54 | crates/data_flow/re_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.
  • Duplicated block (8 lines × 2) crates/store/re_log_types/src/example_components.rs:196 — crates/store/re_log_types/src/example_components.rs:196-203 | crates/store/re_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/re_log_types/src/example_components.rs:212 — crates/store/re_log_types/src/example_components.rs:212-219 | crates/store/re_log_types/src/example_components.rs:317-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.
  • Duplicated block (8 lines × 2) crates/store/re_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:90 — crates/store/re_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:90-97 | crates/store/re_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.
  • Duplicated block (8 lines × 2) crates/store_app/re_query/src/latest_all.rs:58 — crates/store_app/re_query/src/latest_all.rs:58-65 | crates/store_app/re_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/top/re_viewer/src/ui/dev_panel/mod.rs:444 — crates/top/re_viewer/src/ui/dev_panel/mod.rs:444-451 | crates/top/re_viewer/src/ui/dev_panel/mod.rs:482-489 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) crates/top/rerun/src/commands/rrd/split.rs:997 — crates/top/rerun/src/commands/rrd/split.rs:997-1004 | crates/top/rerun/src/commands/rrd/split.rs:1005-1012 — both copies are in the same file, so extract the block into 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/utils/re_video/src/demux/mod.rs:257 — crates/utils/re_video/src/demux/mod.rs:257-264 | crates/utils/re_video/src/demux/mp4.rs:75-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.
  • Duplicated block (8 lines × 2) crates/viewer_support/re_data_ui/src/item_ui.rs:486 — crates/viewer_support/re_data_ui/src/item_ui.rs:486-493 | crates/viewer_support/re_data_ui/src/item_ui.rs:502-509 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) crates/viewer_support/re_view/src/query.rs:306 — crates/viewer_support/re_view/src/query.rs:306-313 | crates/viewer_support/re_view/src/query.rs:491-498 — both copies are in the same file, so extract the block into 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_support/re_viewer_context/src/tensor/image_stats.rs:46 — crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs:46-53 | crates/viewer_support/re_viewer_context/src/tensor/tensor_stats.rs:42-49 — before extracting anything, compare `crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs` and `crates/viewer_support/re_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.
  • Duplicated block (8 lines × 2) crates/views/re_view_spatial/src/picking_ui_pixel.rs:446 — crates/views/re_view_spatial/src/picking_ui_pixel.rs:446-453 | crates/views/re_view_spatial/src/picking_ui_pixel.rs:500-507 — both copies are in the same file, so extract the block into 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/views/re_view_time_series/src/series_query.rs:277 — crates/views/re_view_time_series/src/series_query.rs:277-284 | crates/views/re_view_time_series/src/series_query.rs:421-428 — both copies are in the same file, so extract the block into 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) docs/snippets/all/archetypes/arrows3d_column_updates.rs:21 — docs/snippets/all/archetypes/arrows3d_column_updates.rs:21-28 | docs/snippets/all/archetypes/arrows3d_row_updates.rs:20-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.
  • 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.
  • 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.
  • Duplicated block (8 lines × 2) crates/data_flow/re_hdf5/src/config.rs:105 — crates/data_flow/re_hdf5/src/config.rs:105-112 | crates/data_flow/re_parquet/src/config.rs:133-140 — 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_support/re_context_menu/src/actions/add_container.rs:29 — crates/viewer_support/re_context_menu/src/actions/add_container.rs:29-36 | crates/viewer_support/re_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/store/re_uri/src/fragment.rs:135 — crates/store/re_uri/src/fragment.rs:135-144 | crates/viewer_support/re_viewer_context/src/command_sender.rs:353-360 — 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_support/re_renderer/src/gaussian_splat_builder.rs:85 — crates/viewer_support/re_renderer/src/gaussian_splat_builder.rs:85-92 | crates/viewer_support/re_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_support/re_ui/src/command/recording_command.rs:98 — crates/viewer_support/re_ui/src/command/recording_command.rs:98-105 | crates/viewer_support/re_ui/src/command/redap_server_command.rs:48-55 — 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/views/re_view_spatial/src/view_2d.rs:270 — crates/views/re_view_spatial/src/view_2d.rs:270-277 | crates/views/re_view_spatial/src/view_3d.rs:524-531 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) crates/views/re_view_spatial/src/visualizers/gaussian_splats3d.rs:199 — crates/views/re_view_spatial/src/visualizers/gaussian_splats3d.rs:199-209 | crates/views/re_view_spatial/src/visualizers/points3d.rs:163-170 — 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) 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.
  • Duplicated block (8 lines × 2) crates/store_app/re_datafusion/src/dataframe_query_provider/fetch_plan.rs:247 — crates/store_app/re_datafusion/src/dataframe_query_provider/fetch_plan.rs:247-254 | crates/store_app/re_datafusion/src/dataframe_query_provider/fetch_plan.rs:292-299 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • + 7 more in this group — see findings.md.
D2 · Cognitive Complexity · re_types_builder · ×30
  • re_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cognitive 105) crates/build/re_types_builder/src/codegen/rust/serializer.rs:568 — re_types_builder::codegen::rust::serializer::quote_arrow_field_serializer has cognitive complexity 105 (threshold 15). Drivers by points: if/else 53 (93 pts), match/switch 5 (10 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.
  • re_types_builder::codegen::python::code_for_struct (cognitive 75) crates/build/re_types_builder/src/codegen/python/mod.rs:735 — re_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.
  • re_types_builder::codegen::python::check_ext_consistency (cognitive 61) crates/build/re_types_builder/src/codegen/python/mod.rs:309 — re_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.
  • re_types_builder::codegen::python::quote_arrow_serialization (cognitive 60) crates/build/re_types_builder/src/codegen/python/mod.rs:2343 — re_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.
  • re_types_builder::codegen::rust::serializer::quote_arrow_serializer (cognitive 43) crates/build/re_types_builder/src/codegen/rust/serializer.rs:54 — re_types_builder::codegen::rust::serializer::quote_arrow_serializer has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (38 pts), match/switch 2 (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.
  • re_types_builder::codegen::cpp::quote_fill_arrow_array_builder (cognitive 42) crates/build/re_types_builder/src/codegen/cpp/mod.rs:1872 — re_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.
  • re_types_builder::codegen::common::remove_orphaned_files (cognitive 36) crates/build/re_types_builder/src/codegen/common.rs:394 — re_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.
  • re_types_builder::codegen::cpp::quote_append_field_to_builder (cognitive 34) crates/build/re_types_builder/src/codegen/cpp/mod.rs:2081 — re_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.
  • re_types_builder::codegen::rust::deserializer::quote_arrow_deserializer (cognitive 34) crates/build/re_types_builder/src/codegen/rust/deserializer.rs:61 — re_types_builder::codegen::rust::deserializer::quote_arrow_deserializer has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_types_builder::codegen::rust::util::string_from_quoted (cognitive 34) crates/build/re_types_builder/src/codegen/rust/util.rs:62 — re_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.
  • re_types_builder::codegen::rust::api::quote_from_impl_from_obj (cognitive 33) crates/build/re_types_builder/src/codegen/rust/api.rs:1324 — re_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.
  • re_types_builder::codegen::docs::website::write_fields (cognitive 31) crates/build/re_types_builder/src/codegen/docs/website.rs:395 — re_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.
  • re_types_builder::docs::doclink_translation::try_translate_doclink (cognitive 28) crates/build/re_types_builder/src/docs.rs:317 — re_types_builder::docs::doclink_translation::try_translate_doclink has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_types_builder::codegen::docs::snippets_ref::collect_snippets_recursively (cognitive 25) crates/build/re_types_builder/src/codegen/docs/snippets_ref.rs:370 — re_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.
  • re_types_builder::codegen::python::quote_field_converter_from_field (cognitive 25) crates/build/re_types_builder/src/codegen/python/mod.rs:1923 — re_types_builder::codegen::python::quote_field_converter_from_field has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • re_types_builder::codegen::python::quote_arrow_support_from_obj (cognitive 25) crates/build/re_types_builder/src/codegen/python/mod.rs:2171 — re_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.
  • re_types_builder::codegen::rust::deserializer::quote_arrow_field_deserializer (cognitive 24) crates/build/re_types_builder/src/codegen/rust/deserializer.rs:536 — re_types_builder::codegen::rust::deserializer::quote_arrow_field_deserializer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_types_builder::codegen::rust::util::doc_as_lines (cognitive 24) crates/build/re_types_builder/src/codegen/rust/util.rs:306 — re_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.
  • re_types_builder::codegen::cpp::lines_from_docs (cognitive 23) crates/build/re_types_builder/src/codegen/cpp/mod.rs:2668 — re_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.
  • re_types_builder::codegen::rust::reflection::generate_component_reflection (cognitive 23) crates/build/re_types_builder/src/codegen/rust/reflection.rs:130 — re_types_builder::codegen::rust::reflection::generate_component_reflection has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_types_builder::codegen::python::code_for_union (cognitive 20) crates/build/re_types_builder/src/codegen/python/mod.rs:1207 — re_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.
  • re_types_builder::codegen::docs::website::write_archetype_fields (cognitive 19) crates/build/re_types_builder/src/codegen/docs/website.rs:552 — re_types_builder::codegen::docs::website::write_archetype_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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.
  • re_types_builder::codegen::rust::util::replace_doc_attrb_with_doc_comment (cognitive 19) crates/build/re_types_builder/src/codegen/rust/util.rs:188 — re_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.
  • re_types_builder::codegen::common::collect_snippets_for_api_docs (cognitive 18) crates/build/re_types_builder/src/codegen/common.rs:291 — re_types_builder::codegen::common::collect_snippets_for_api_docs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 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.
  • re_types_builder::codegen::docs::website::index_page (cognitive 18) crates/build/re_types_builder/src/codegen/docs/website.rs:145 — re_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.
  • + 5 more in this group — see findings.md.
D3 · God Classes · ClassTooLong · ×30
  • ClassTooLong: RerunCloudHandler crates/store_app/re_server/src/rerun_cloud/mod.rs:280 — ClassTooLong — 1205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 9 methods, 5 blocks, lines 280-2223. The bar is 400 significant lines; this is 805 over it, 3.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: QueryHandle crates/store_app/re_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: RedapClient crates/data_flow/re_redap_client/src/connection_client.rs:344 — ClassTooLong — 1087 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 48 methods, 5 blocks, lines 344-2012. The bar is 400 significant lines; this is 687 over it, 2.72× 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/panels/re_time_panel/src/time_panel.rs:101 — 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 101-2058. 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: RawRrdManifest crates/store/re_chunk_index/src/raw_rrd_manifest.rs:145 — ClassTooLong — 812 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 58 methods, 8 blocks, lines 145-1822. The bar is 400 significant lines; this is 412 over it, 2.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: UiExt crates/viewer_support/re_ui/src/ui_ext.rs:20 — ClassTooLong — 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 67 methods. The bar is 400 significant lines; this is 408 over it, 2.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.
  • ClassTooLong: BlueprintTree crates/panels/re_blueprint_tree/src/blueprint_tree.rs:27 — ClassTooLong — 770 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 27-1237. The bar is 400 significant lines; this is 370 over it, 1.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: AppState crates/top/re_viewer/src/app_state.rs:47 — ClassTooLong — 762 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 17 methods, 4 blocks, lines 47-1319. The bar is 400 significant lines; this is 362 over it, 1.91× 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_support/re_dataframe_ui/src/datafusion_table_widget.rs:370 — ClassTooLong — 741 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 370-1432. The bar is 400 significant lines; this is 341 over it, 1.85× 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_support/re_viewer_context/src/store_hub.rs:119 — ClassTooLong — 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 64 methods, 3 blocks, lines 119-1567. The bar is 400 significant lines; this is 337 over it, 1.84× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: EntityDb crates/store_app/re_entity_db/src/entity_db.rs:127 — ClassTooLong — 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 75 methods, 6 blocks, lines 127-1444. The bar is 400 significant lines; this is 331 over it, 1.83× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: Chunk crates/store/re_chunk/src/chunk.rs:242 — ClassTooLong — 718 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 121 methods, 13 blocks, lines 242-1962. The bar is 400 significant lines; this is 318 over it, 1.80× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: AppCore crates/top/re_viewer/src/app/mod.rs:125 — ClassTooLong — 660 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 135 methods, 3 blocks, lines 125-1722. The bar is 400 significant lines; this is 260 over it, 1.65× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: RecordingStream crates/top/re_sdk/src/recording_stream.rs:783 — ClassTooLong — 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 74 methods, 10 blocks, lines 783-2975. The bar is 400 significant lines; this is 251 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: DesignTokens crates/viewer_support/re_ui/src/design_tokens.rs:251 — ClassTooLong — 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 52 methods, 2 blocks, lines 251-1294. The bar is 400 significant lines; this is 215 over it, 1.54× 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: WebViewer rerun_js/web-viewer/index.ts:1307 — ClassTooLong — 572 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods. The bar is 400 significant lines; this is 172 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ComponentUiRegistry crates/viewer_support/re_viewer_context/src/component_ui_registry.rs:132 — ClassTooLong — 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 23 methods, 2 blocks, lines 132-1043. The bar is 400 significant lines; this is 171 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: TimeSeriesView crates/views/re_view_time_series/src/view_class.rs:125 — ClassTooLong — 558 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 158 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: RedapServers crates/panels/re_redap_browser/src/servers/mod.rs:582 — ClassTooLong — 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 5 blocks, lines 582-1542. The bar is 400 significant lines; this is 120 over it, 1.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: ViewportBlueprint crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:37 — ClassTooLong — 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 39 methods, 2 blocks, lines 37-963. The bar is 400 significant lines; this is 109 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: PyDatasetEntryInternal rerun_py/src/catalog/dataset_entry.rs:38 — ClassTooLong — 500 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, 4 blocks, lines 38-950. The bar is 400 significant lines; this is 100 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/panels/re_chunk_store_ui/src/chunk_store_ui.rs:117 — ClassTooLong — 489 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 117-874. The bar is 400 significant lines; this is 89 over it, 1.22× 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: ViewerUrl crates/viewer_support/re_viewer_context/src/viewer_url.rs:51 — ClassTooLong — 482 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, 6 blocks, lines 51-920. The bar is 400 significant lines; this is 82 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: DataframeQueryTableProvider crates/store_app/re_datafusion/src/dataframe_query_common.rs:128 — ClassTooLong — 471 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 9 methods, 4 blocks, lines 128-1133. The bar is 400 significant lines; this is 71 over it, 1.18× 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/rerun/src/commands/rrd/split.rs:32 — ClassTooLong — 468 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-795. The bar is 400 significant lines; this is 68 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • + 5 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×29
  • Duplicated block (11 lines × 2) crates/data_flow/re_importer/src/importer_rrd.rs:55 — crates/data_flow/re_importer/src/importer_rrd.rs:55-65 | crates/data_flow/re_importer/src/importer_rrd.rs:85-95 — both copies are in the same file, so extract the block into 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/data_flow/re_lerobot/src/parse_v2.rs:245 — crates/data_flow/re_lerobot/src/parse_v2.rs:245-255 | crates/data_flow/re_lerobot/src/parse_v3.rs:996-1006 — 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/panels/re_redap_browser/src/register_asset_modal.rs:136 — crates/panels/re_redap_browser/src/register_asset_modal.rs:136-146 | crates/viewer_support/re_ui/src/filter_widget.rs:241-251 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (11 lines × 2) crates/store/re_chunk_store/src/insert_rrd_manifest.rs:143 — crates/store/re_chunk_store/src/insert_rrd_manifest.rs:143-153 | crates/store/re_chunk_store/src/insert_rrd_manifest.rs:165-175 — both copies are in the same file, so extract the block into 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/top/re_sdk/src/recording_stream.rs:1906 — crates/top/re_sdk/src/recording_stream.rs:1906-1916 | crates/top/re_sdk/src/recording_stream.rs:1929-1939 — both copies are in the same file, so extract the block into 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/utils/re_auth/src/oauth/api.rs:74 — crates/utils/re_auth/src/oauth/api.rs:74-84 | crates/utils/re_auth/src/oauth/api.rs:99-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.
  • Duplicated block (11 lines × 2) crates/viewer_support/re_data_ui/src/video_ui.rs:858 — crates/viewer_support/re_data_ui/src/video_ui.rs:858-868 | crates/viewer_support/re_data_ui/src/video_ui.rs:890-900 — both copies are in the same file, so extract the block into 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/viewer_support/re_renderer/src/allocator/cpu_write_gpu_read_belt.rs:298 — crates/viewer_support/re_renderer/src/allocator/cpu_write_gpu_read_belt.rs:298-308 | crates/viewer_support/re_renderer/src/allocator/cpu_write_gpu_read_belt.rs:341-351 — both copies are in the same file, so extract the block into 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/viewer_support/re_renderer/src/device_caps.rs:409 — crates/viewer_support/re_renderer/src/device_caps.rs:409-419 | crates/viewer_support/re_renderer/src/device_caps.rs:476-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.
  • Duplicated block (11 lines × 2) crates/viewer_support/re_renderer/src/draw_phases/depth_resolve.rs:154 — crates/viewer_support/re_renderer/src/draw_phases/depth_resolve.rs:154-164 | crates/viewer_support/re_renderer/src/draw_phases/picking_layer.rs:583-593 — 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/viewer_support/re_renderer/src/draw_phases/outlines.rs:307 — crates/viewer_support/re_renderer/src/draw_phases/outlines.rs:307-317 | crates/viewer_support/re_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.
  • Duplicated block (11 lines × 2) crates/viewer_support/re_renderer/src/renderer/lines.rs:747 — crates/viewer_support/re_renderer/src/renderer/lines.rs:747-757 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:804-814 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/lines.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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) crates/viewer_support/re_view/src/blueprint_resolved_results.rs:149 — crates/viewer_support/re_view/src/blueprint_resolved_results.rs:149-159 | crates/viewer_support/re_view/src/blueprint_resolved_results.rs:319-329 — both copies are in the same file, so extract the block into 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/viewer_support/re_viewer_context/src/image_info.rs:75 — crates/viewer_support/re_viewer_context/src/image_info.rs:75-85 | crates/viewer_support/re_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.
  • Duplicated block (11 lines × 2) crates/views/re_view_time_series/src/aggregation.rs:47 — crates/views/re_view_time_series/src/aggregation.rs:47-57 | crates/views/re_view_time_series/src/aggregation.rs:132-142 — both copies are in the same file, so extract the block into 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/views/re_view_time_series/src/series_query.rs:263 — crates/views/re_view_time_series/src/series_query.rs:263-273 | crates/views/re_view_time_series/src/series_query.rs:407-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 (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.
  • 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.
  • Duplicated block (11 lines × 2) crates/utils/re_quota_channel/src/async_broadcast_channel.rs:376 — crates/utils/re_quota_channel/src/async_broadcast_channel.rs:376-386 | crates/utils/re_quota_channel/src/sync/mod.rs:321-331 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (11 lines × 2) crates/store_app/re_server/src/rerun_cloud/mod.rs:613 — crates/store_app/re_server/src/rerun_cloud/mod.rs:613-623 | crates/store_app/re_server/src/rerun_cloud/mod.rs:671-681 — both copies are in the same file, so extract the block into 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/data_flow/re_redap_client/src/connection_client.rs:951 — crates/data_flow/re_redap_client/src/connection_client.rs:951-961 | crates/data_flow/re_redap_client/src/connection_client.rs:1114-1124 — both copies are in the same file, so extract the block into 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) 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.
  • Duplicated block (11 lines × 2) crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1297 — crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1297-1307 | crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1328-1338 — both copies are in the same file, so extract the block into 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/viewer_support/re_renderer/src/renderer/lines.rs:679 — crates/viewer_support/re_renderer/src/renderer/lines.rs:679-689 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:705-715 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/lines.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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) crates/viewer_support/re_renderer_examples/outlines.rs:51 — crates/viewer_support/re_renderer_examples/outlines.rs:51-61 | crates/viewer_support/re_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.
  • + 4 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×28
  • Duplicated block (10 lines × 2) crates/data_flow/re_catalog_client/src/staging.rs:109 — crates/data_flow/re_catalog_client/src/staging.rs:109-118 | crates/data_flow/re_redap_client/src/connection_client.rs:157-166 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (10 lines × 2) crates/data_flow/re_data_source/src/data_source.rs:148 — crates/data_flow/re_data_source/src/data_source.rs:148-157 | crates/data_flow/re_data_source/src/data_source.rs:202-211 — both copies are in the same file, so extract the block into 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/panels/re_blueprint_tree/src/data.rs:422 — crates/panels/re_blueprint_tree/src/data.rs:422-431 | crates/panels/re_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.
  • Duplicated block (10 lines × 2) crates/store/re_chunk/src/unit_chunk.rs:77 — crates/store/re_chunk/src/unit_chunk.rs:77-86 | crates/store/re_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.
  • Duplicated block (10 lines × 2) crates/store/re_chunk/src/unit_chunk.rs:131 — crates/store/re_chunk/src/unit_chunk.rs:131-140 | crates/store/re_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.
  • Duplicated block (10 lines × 2) crates/store/re_chunk_index/src/raw_rrd_manifest.rs:461 — crates/store/re_chunk_index/src/raw_rrd_manifest.rs:461-470 | crates/store/re_chunk_index/src/raw_rrd_manifest.rs:908-917 — both copies are in the same file, so extract the block into 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/re_chunk_store/src/events.rs:52 — crates/store/re_chunk_store/src/events.rs:52-61 | crates/store/re_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_app/re_datafusion/src/table_entry_provider.rs:211 — crates/store_app/re_datafusion/src/table_entry_provider.rs:211-220 | crates/store_app/re_datafusion/src/table_entry_provider.rs:258-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) crates/store_app/re_tf/src/transform_resolution_cache/cache.rs:314 — crates/store_app/re_tf/src/transform_resolution_cache/cache.rs:314-323 | crates/store_app/re_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.
  • Duplicated block (10 lines × 2) crates/store_app/re_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:179 — crates/store_app/re_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:179-188 | crates/store_app/re_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.
  • Duplicated block (10 lines × 2) crates/top/re_viewer/src/ui/share_modal.rs:311 — crates/top/re_viewer/src/ui/share_modal.rs:311-320 | crates/top/re_viewer/src/ui/share_modal.rs:342-351 — both copies are in the same file, so extract the block into 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/rerun/src/commands/entrypoint.rs:1688 — crates/top/rerun/src/commands/entrypoint.rs:1688-1697 | crates/top/rerun/src/commands/entrypoint.rs:1703-1712 — both copies are in the same file, so extract the block into 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/rerun/src/demo_util.rs:119 — crates/top/rerun/src/demo_util.rs:119-128 | crates/viewer_support/re_renderer/src/colormap.rs:251-260 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (10 lines × 2) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:719 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:719-728 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:733-742 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 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_support/re_renderer/src/renderer/volume.rs:311 — crates/viewer_support/re_renderer/src/renderer/volume.rs:311-320 | crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs:389-398 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/volume.rs` and `crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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_support/re_view/src/blueprint_resolved_results.rs:132 — crates/viewer_support/re_view/src/blueprint_resolved_results.rs:132-141 | crates/viewer_support/re_view/src/blueprint_resolved_results.rs:302-311 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (10 lines × 2) crates/views/re_view_spatial/src/ui_2d.rs:342 — crates/views/re_view_spatial/src/ui_2d.rs:342-351 | crates/views/re_view_spatial/src/ui_3d.rs:155-164 — 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/views/re_view_time_series/src/line_visualizer_system.rs:121 — crates/views/re_view_time_series/src/line_visualizer_system.rs:121-130 | crates/views/re_view_time_series/src/point_visualizer_system.rs:117-126 — before extracting anything, compare `crates/views/re_view_time_series/src/line_visualizer_system.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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) 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.
  • Duplicated block (10 lines × 2) rerun_py/src/catalog/dataset_entry.rs:199 — rerun_py/src/catalog/dataset_entry.rs:199-208 | rerun_py/src/catalog/dataset_entry.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.
  • Duplicated block (10 lines × 2) rerun_py/src/python_bridge.rs:1584 — rerun_py/src/python_bridge.rs:1584-1593 | rerun_py/src/python_bridge.rs:1615-1624 — both copies are in the same file, so extract the block into 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/viewer_support/re_viewport_blueprint/src/container.rs:364 — crates/viewer_support/re_viewport_blueprint/src/container.rs:364-373 | crates/viewer_support/re_viewport_blueprint/src/view.rs:369-378 — 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_support/re_viewport_blueprint/src/viewport_blueprint.rs:708 — crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:708-719 | crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:726-735 — both copies are in the same file, so extract the block into 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/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:240 — crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:240-249 | crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs:547-556 — before extracting anything, compare `crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs` and `crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 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/utils/re_video/src/decode/av1.rs:266 — crates/utils/re_video/src/decode/av1.rs:266-275 | crates/utils/re_video/src/decode/av1.rs:279-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.
  • + 3 more in this group — see findings.md.
D3 · God Classes · TooManyMethods · ×25
  • TooManyMethods: AppCore crates/top/re_viewer/src/app/mod.rs:125 — TooManyMethods — 135 methods, declared across 12 files: app/mod.rs (39), app/viewer_control.rs (34), app/command_handling.rs (20), app/logic.rs (15), +8 more file(s). The bar is 30 methods; this is 105 over it, 4.50× 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/re_chunk_store/src/store.rs:527 — TooManyMethods — 123 methods, declared across 14 files: src/query.rs (36), src/store.rs (31), src/lineage.rs (12), src/subscribers.rs (11), +10 more file(s). The bar is 30 methods; this is 93 over it, 4.10× 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: Chunk crates/store/re_chunk/src/chunk.rs:242 — TooManyMethods — 121 methods, declared across 13 files: src/chunk.rs (51), src/slice.rs (18), src/iter.rs (10), src/shuffle.rs (10), +9 more file(s). The bar is 30 methods; this is 91 over it, 4.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: EntityDb crates/store_app/re_entity_db/src/entity_db.rs:127 — TooManyMethods — 75 methods. The bar is 30 methods; this is 45 over it, 2.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: RecordingStream crates/top/re_sdk/src/recording_stream.rs:783 — TooManyMethods — 74 methods, declared across 2 files: src/recording_stream.rs (63), src/global.rs (11). The bar is 30 methods; this is 44 over it, 2.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: StoreHub crates/viewer_support/re_viewer_context/src/store_hub.rs:119 — TooManyMethods — 64 methods. The bar is 30 methods; this is 34 over it, 2.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: RawRrdManifest crates/store/re_chunk_index/src/raw_rrd_manifest.rs:145 — TooManyMethods — 58 methods. The bar is 30 methods; this is 28 over it, 1.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: WebViewer rerun_js/web-viewer/index.ts:1307 — TooManyMethods — 58 methods. The bar is 30 methods; this is 28 over it, 1.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: DesignTokens crates/viewer_support/re_ui/src/design_tokens.rs:251 — TooManyMethods — 52 methods. The bar is 30 methods; this is 22 over it, 1.73× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: RedapClient crates/data_flow/re_redap_client/src/connection_client.rs:344 — TooManyMethods — 48 methods, declared across 2 files: src/connection_client.rs (45), connection_client/segment_properties.rs (3). The bar is 30 methods; this is 18 over it, 1.60× 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: CatalogClient crates/data_flow/re_catalog_client/src/lib.rs:27 — TooManyMethods — 46 methods, declared across 8 files: src/segment.rs (13), src/asset.rs (10), src/entry.rs (7), src/table.rs (5), +4 more file(s). The bar is 30 methods; this is 16 over it, 1.53× 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: TimeControl crates/viewer_support/re_viewer_context/src/time_control/mod.rs:183 — TooManyMethods — 46 methods, declared across 2 files: time_control/mod.rs (36), time_control/command.rs (10). The bar is 30 methods; this is 16 over it, 1.53× 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: AgentSession crates/utils/re_agent/src/session.rs:172 — 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: AgentPanel crates/panels/re_agent_ui/src/ui/agent_panel.rs:154 — 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: PyDatasetEntryInternal rerun_py/src/catalog/dataset_entry.rs:38 — 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: ViewportBlueprint crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:37 — TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.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.
  • TooManyMethods: DatasetEntry rerun_py/rerun_sdk/rerun/catalog/_entry.py:218 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ViewerClient rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py:524 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: _ValueFilters rerun_py/rerun_sdk/rerun/blueprint/_table_filters.py:106 — 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: RecordingStream rerun_py/rerun_sdk/rerun/recording_stream.py:153 — 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: ViewerContext crates/viewer_support/re_viewer_context/src/viewer_context.rs:22 — TooManyMethods — 37 methods, declared across 2 files: src/viewer_context.rs (36), src/query_context.rs (1). The bar is 30 methods; this is 7 over it, 1.23× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TimeColumn crates/store/re_chunk/src/chunk.rs:913 — TooManyMethods — 32 methods, declared across 5 files: src/chunk.rs (23), src/slice.rs (5), src/shuffle.rs (2), src/builder.rs (1), +1 more file(s). The bar is 30 methods; this is 2 over it, 1.07× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: RrdManifest crates/store/re_chunk_index/src/rrd_manifest.rs:59 — 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: RrdManifestIndex crates/store_app/re_entity_db/src/rrd_manifest_index.rs:130 — 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: InMemoryStore crates/store_app/re_server/src/store/in_memory_store.rs:43 — 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.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×25
  • Duplicated block (7 lines × 2) crates/store/re_chunk/src/iter.rs:477 — crates/store/re_chunk/src/iter.rs:477-483 | crates/store/re_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_app/re_entity_db/src/rrd_manifest_index/time_range_merger.rs:171 — crates/store_app/re_entity_db/src/rrd_manifest_index/time_range_merger.rs:171-177 | crates/store_app/re_entity_db/src/rrd_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.
  • Duplicated block (7 lines × 2) crates/top/re_sdk/src/grpc_server.rs:46 — crates/top/re_sdk/src/grpc_server.rs:46-52 | crates/top/re_sdk/src/web_viewer.rs:53-59 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) crates/top/re_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:107 — crates/top/re_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:107-113 | crates/top/re_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/viewer_support/re_renderer/src/mesh.rs:115 — crates/viewer_support/re_renderer/src/mesh.rs:115-121 | crates/viewer_support/re_renderer/src/mesh.rs:137-143 — both copies are in the same file, so extract the block into 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/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:513 — crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:513-519 | crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs:360-368 — 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/views/re_view_map/src/map_view.rs:610 — crates/views/re_view_map/src/map_view.rs:610-616 | crates/views/re_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/store/re_sdk_types/src/archetypes/points2d_ext.rs:104 — crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:104-110 | crates/store/re_sdk_types/src/archetypes/points3d_ext.rs:116-122 — before extracting anything, compare `crates/store/re_sdk_types/src/archetypes/points2d_ext.rs` and `crates/store/re_sdk_types/src/archetypes/points3d_ext.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) crates/store/re_sorbet/src/column_descriptor.rs:113 — crates/store/re_sorbet/src/column_descriptor.rs:113-119 | crates/store/re_sorbet/src/column_descriptor_ref.rs:27-33 — 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/re_sorbet/src/column_kind.rs:29 — crates/store/re_sorbet/src/column_kind.rs:29-35 | crates/store/re_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_support/re_viewer_context/src/cache/encoded_depth_image_stats_cache.rs:125 — crates/viewer_support/re_viewer_context/src/cache/encoded_depth_image_stats_cache.rs:125-131 | crates/viewer_support/re_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.
  • Duplicated block (7 lines × 2) crates/store/re_uri/src/endpoints/catalog.rs:24 — crates/store/re_uri/src/endpoints/catalog.rs:24-30 | crates/store/re_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_app/re_query/src/cache.rs:219 — crates/store_app/re_query/src/cache.rs:219-225 | crates/store_app/re_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.
  • Duplicated block (7 lines × 2) rerun_py/src/arrow.rs:27 — rerun_py/src/arrow.rs:27-33 | rerun_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/data_flow/re_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:69 — crates/data_flow/re_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:69-75 | crates/data_flow/re_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.
  • Duplicated block (7 lines × 2) crates/data_flow/re_importer/src/importer_archetype.rs:86 — crates/data_flow/re_importer/src/importer_archetype.rs:86-92 | crates/data_flow/re_importer/src/importer_archetype.rs:93-99 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) crates/panels/re_agent_ui/src/ui/chat_ui.rs:263 — crates/panels/re_agent_ui/src/ui/chat_ui.rs:263-269 | crates/panels/re_agent_ui/src/ui/setup_ui.rs:175-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.
  • Duplicated block (7 lines × 2) rerun_py/src/catalog/dataset_entry.rs:331 — rerun_py/src/catalog/dataset_entry.rs:331-337 | rerun_py/src/catalog/table_entry.rs:113-119 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (7 lines × 2) crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:193 — crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:193-199 | crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs:500-506 — before extracting anything, compare `crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs` and `crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (7 lines × 2) crates/store_app/re_query/src/bin/clamped_zip.rs:198 — crates/store_app/re_query/src/bin/clamped_zip.rs:198-204 | crates/store_app/re_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/rerun/src/demo_util.rs:109 — crates/top/rerun/src/demo_util.rs:109-115 | crates/viewer_support/re_renderer/src/colormap.rs:241-247 — 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/views/re_view_spatial/src/visualizers/mod.rs:82 — crates/views/re_view_spatial/src/visualizers/mod.rs:82-88 | crates/views/re_view_spatial/src/visualizers/mod.rs:112-118 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) scripts/ci/approve_workflow_runs.py:43 — scripts/ci/approve_workflow_runs.py:43-49 | scripts/ci/check_pr_checkboxes.py:24-30 — 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) scripts/ci/compare.py:54 — scripts/ci/compare.py:54-60 | scripts/ci/count_bytes.py:59-65 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. 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 (7 lines × 2) docs/snippets/all/tutorials/custom_data.py:72 — docs/snippets/all/tutorials/custom_data.py:72-80 | examples/python/graph_lattice/graph_lattice.py:65-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.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×21
  • Duplicated block (12 lines × 2) crates/data_flow/re_lenses/src/semantic/foxglove/packed_element_field.rs:183 — crates/data_flow/re_lenses/src/semantic/foxglove/packed_element_field.rs:183-194 | crates/data_flow/re_lenses/src/semantic/foxglove/packed_element_field.rs:334-345 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (12 lines × 2) crates/store/re_chunk_store/src/query.rs:199 — crates/store/re_chunk_store/src/query.rs:199-210 | crates/store/re_chunk_store/src/query.rs:248-259 — both copies are in the same file, so extract the block into 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/store/re_log_types/src/index/time_real.rs:110 — crates/store/re_log_types/src/index/time_real.rs:110-121 | crates/store/re_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.
  • Duplicated block (12 lines × 2) crates/store_app/re_entity_db/src/rrd_manifest_index/time_range_merger.rs:407 — crates/store_app/re_entity_db/src/rrd_manifest_index/time_range_merger.rs:407-418 | crates/store_app/re_entity_db/src/rrd_manifest_index/time_range_merger.rs:429-440 — both copies are in the same file, so extract the block into 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/top/rerun/src/commands/mcap/check.rs:48 — crates/top/rerun/src/commands/mcap/check.rs:48-59 | crates/top/rerun/src/commands/mcap/info.rs:24-35 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (12 lines × 2) crates/viewer_support/re_renderer/src/colormap.rs:114 — crates/viewer_support/re_renderer/src/colormap.rs:114-125 | crates/viewer_support/re_renderer/src/colormap.rs:158-169 — both copies are in the same file, so extract the block into 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/views/re_view_spatial/src/visualizers/arrows2d.rs:83 — crates/views/re_view_spatial/src/visualizers/arrows2d.rs:83-95 | crates/views/re_view_spatial/src/visualizers/arrows3d.rs:83-94 — 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/views/re_view_time_series/src/line_visualizer_system.rs:95 — crates/views/re_view_time_series/src/line_visualizer_system.rs:95-108 | crates/views/re_view_time_series/src/measurements_visualizer_system.rs:97-108 — 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) 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.
  • Duplicated block (12 lines × 2) crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:435 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:435-447 | crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:475-486 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs` and `crates/viewer_support/re_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.
  • Duplicated block (12 lines × 2) crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:393 — crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:393-405 | crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:466-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.
  • Duplicated block (12 lines × 2) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:733 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:733-744 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:747-758 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 2) 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.
  • Duplicated block (12 lines × 2) rerun_py/src/catalog/segment_url_udf.rs:101 — rerun_py/src/catalog/segment_url_udf.rs:101-112 | rerun_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.
  • Duplicated block (12 lines × 2) crates/views/re_view_time_series/src/line_visualizer_system.rs:332 — crates/views/re_view_time_series/src/line_visualizer_system.rs:332-343 | crates/views/re_view_time_series/src/line_visualizer_system.rs:401-412 — both copies are in the same file, so extract the block into 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/data_flow/re_lenses/src/semantic/foxglove/point_cloud.rs:13 — crates/data_flow/re_lenses/src/semantic/foxglove/point_cloud.rs:13-24 | crates/data_flow/re_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/data_flow/re_lenses/src/semantic/foxglove/pose_in_frame.rs:12 — crates/data_flow/re_lenses/src/semantic/foxglove/pose_in_frame.rs:12-23 | crates/data_flow/re_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.
  • Duplicated block (12 lines × 2) rerun_notebook/src/rerun_notebook/asset_server.py:49 — rerun_notebook/src/rerun_notebook/asset_server.py:49-60 | rerun_notebook/src/rerun_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) 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.
  • Duplicated block (12 lines × 2) crates/viewer_support/re_renderer_examples/picking.rs:132 — crates/viewer_support/re_renderer_examples/picking.rs:132-143 | crates/viewer_support/re_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.
  • 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×21
  • Duplicated block (6 lines × 2) crates/store/re_chunk/src/iter.rs:684 — crates/store/re_chunk/src/iter.rs:684-689 | crates/store/re_chunk/src/iter.rs:698-703 — both copies are in the same file, so extract the block into 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/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.queries.rs:902 — crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.queries.rs:902-907 | crates/store_app/re_server/src/rerun_cloud/chunk_selection.rs:289-294 — 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_app/re_server/src/rerun_cloud/chunk_selection.rs:232 — crates/store_app/re_server/src/rerun_cloud/chunk_selection.rs:232-237 | crates/store_app/re_server/src/store/dataset.rs:451-456 — 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_app/re_server/src/store/dataset.rs:310 — crates/store_app/re_server/src/store/dataset.rs:310-315 | crates/store_app/re_server/src/store/dataset.rs:459-464 — both copies are in the same file, so extract the block into 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/viewer_support/re_ui/src/command/redap_server_command.rs:86 — crates/viewer_support/re_ui/src/command/redap_server_command.rs:86-91 | crates/viewer_support/re_ui/src/command/table_command.rs:44-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 both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) crates/views/re_view_spatial/src/ui_2d.rs:369 — crates/views/re_view_spatial/src/ui_2d.rs:369-374 | crates/views/re_view_spatial/src/ui_3d.rs:420-425 — 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/views/re_view_time_series/src/point_visualizer_system.rs:393 — crates/views/re_view_time_series/src/point_visualizer_system.rs:393-400 | crates/views/re_view_time_series/src/series_query.rs:412-417 — 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) 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.
  • Duplicated block (6 lines × 2) rerun_py/src/catalog/dataset_entry.rs:630 — rerun_py/src/catalog/dataset_entry.rs:630-635 | rerun_py/src/catalog/dataset_entry.rs:659-664 — both copies are in the same file, so extract the block into 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/data_flow/re_hdf5/src/config.rs:85 — crates/data_flow/re_hdf5/src/config.rs:85-90 | crates/data_flow/re_parquet/src/config.rs:113-118 — 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/re_sorbet/src/column_descriptor.rs:60 — crates/store/re_sorbet/src/column_descriptor.rs:60-65 | crates/store/re_sorbet/src/column_descriptor_ref.rs:49-54 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (6 lines × 2) crates/top/re_viewer/src/app_state.rs:232 — crates/top/re_viewer/src/app_state.rs:232-237 | crates/viewer_support/re_viewer_context/src/app_context.rs:138-143 — 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/viewer_support/re_viewport_blueprint/src/container.rs:333 — crates/viewer_support/re_viewport_blueprint/src/container.rs:333-338 | crates/viewer_support/re_viewport_blueprint/src/view.rs:135-140 — 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_support/re_component_ui/src/encoding_uis/view_uuid.rs:9 — crates/viewer_support/re_component_ui/src/encoding_uis/view_uuid.rs:9-14 | crates/viewer_support/re_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.
  • Duplicated block (6 lines × 2) crates/viewer_support/re_context_menu/src/actions/lock_unlock.rs:23 — crates/viewer_support/re_context_menu/src/actions/lock_unlock.rs:23-28 | crates/viewer_support/re_context_menu/src/visibility_actions.rs:27-32 — 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/utils/re_agent/src/transcript.rs:432 — crates/utils/re_agent/src/transcript.rs:432-437 | crates/utils/re_agent/src/transcript.rs:531-537 — both copies are in the same file, so extract the block into 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/viewer_support/re_renderer/src/view_builder.rs:782 — crates/viewer_support/re_renderer/src/view_builder.rs:782-787 | crates/viewer_support/re_renderer/src/view_builder.rs:856-861 — both copies are in the same file, so extract the block into 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/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:118 — crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:118-123 | crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:170-175 — both copies are in the same file, so extract the block into 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) docs/snippets/all/archetypes/transform3d_hierarchy.rs:48 — docs/snippets/all/archetypes/transform3d_hierarchy.rs:48-53 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:62-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 (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) scripts/ci/upload_docs.py:293 — scripts/ci/upload_docs.py:293-298 | scripts/ci/upload_docs.py:396-401 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×20
  • Duplicated block (13 lines × 2) crates/panels/re_selection_panel/src/selection_panel.rs:709 — crates/panels/re_selection_panel/src/selection_panel.rs:709-721 | crates/panels/re_selection_panel/src/visualizer_ui.rs:560-572 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13 lines × 2) crates/store/re_chunk/src/earliest_at.rs:124 — crates/store/re_chunk/src/earliest_at.rs:124-136 | crates/store/re_chunk/src/latest_at.rs:150-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 (13 lines × 2) crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1649 — crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1649-1661 | crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1696-1708 — both copies are in the same file, so extract the block into 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/re_chunk_store/src/writes.rs:712 — crates/store/re_chunk_store/src/writes.rs:712-724 | crates/store/re_chunk_store/src/writes.rs:744-756 — both copies are in the same file, so extract the block into 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/re_log_channel/src/receiver_set.rs:126 — crates/store/re_log_channel/src/receiver_set.rs:126-138 | crates/store/re_log_channel/src/receiver_set.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.
  • Duplicated block (13 lines × 2) crates/store/re_sorbet/src/column_kind.rs:48 — crates/store/re_sorbet/src/column_kind.rs:48-60 | crates/store/re_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.
  • Duplicated block (13 lines × 2) crates/store/re_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:112 — crates/store/re_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:112-124 | crates/store/re_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:305-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.
  • Duplicated block (13 lines × 2) crates/store_app/re_dataframe/src/query.rs:1306 — crates/store_app/re_dataframe/src/query.rs:1306-1320 | crates/store_app/re_dataframe/src/query.rs:1773-1785 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) crates/store_app/re_dataframe/src/query.rs:1869 — crates/store_app/re_dataframe/src/query.rs:1869-1881 | crates/store_app/re_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.
  • Duplicated block (13 lines × 2) crates/top/re_sdk/src/grpc_server.rs:54 — crates/top/re_sdk/src/grpc_server.rs:54-66 | crates/top/re_sdk/src/web_viewer.rs:61-73 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13 lines × 2) crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:515 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:515-527 | crates/viewer_support/re_renderer/src/renderer/rectangles.rs:823-835 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13 lines × 2) crates/viewer_support/re_ui/src/command/recording_command.rs:297 — crates/viewer_support/re_ui/src/command/recording_command.rs:297-309 | crates/viewer_support/re_ui/src/command/ui_command.rs:287-299 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13 lines × 2) crates/viewer_support/re_view/src/view_property_ui.rs:109 — crates/viewer_support/re_view/src/view_property_ui.rs:109-121 | crates/viewer_support/re_view/src/view_property_ui.rs:135-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.
  • Duplicated block (13 lines × 2) crates/views/re_view_spatial/src/visualizers/assets3d.rs:76 — crates/views/re_view_spatial/src/visualizers/assets3d.rs:76-88 | crates/views/re_view_spatial/src/visualizers/meshes.rs:78-90 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13 lines × 2) crates/views/re_view_spatial/src/visualizers/cylinders3d.rs:85 — crates/views/re_view_spatial/src/visualizers/cylinders3d.rs:85-97 | crates/views/re_view_spatial/src/visualizers/ellipsoids.rs:57-69 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13 lines × 2) 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.
  • Duplicated block (13 lines × 2) crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:128 — crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:128-140 | crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:208-220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (13 lines × 2) crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:104 — crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:104-116 | crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:156-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.
  • Duplicated block (13 lines × 2) skills/rerun-lerobot/scripts/fetch_lerobot_episodes.py:36 — skills/rerun-lerobot/scripts/fetch_lerobot_episodes.py:36-50 | skills/rerun-lerobot/scripts/find_lerobot_dataset.py:45-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. 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 (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.
D5 · Coupling · Off the main sequence · ×20
  • Off the main sequence: re_build_tools — re_build_tools: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 12 project(s), so it's rigid to change.
  • Off the main sequence: re_dump_puffin — re_dump_puffin: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: re_error — re_error: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 22 project(s), so it's rigid to change.
  • Off the main sequence: re_rvl — re_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: re_span — re_span: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 27 project(s), so it's rigid to change.
  • Off the main sequence: re_tracing — re_tracing: abstractness 0.00, instability 0.01, distance 0.99 — zone of pain — concrete and depended on by 67 project(s), so it's rigid to change.
  • Off the main sequence: re_format — re_format: abstractness 0.00, instability 0.05, distance 0.95 — zone of pain — concrete and depended on by 40 project(s), so it's rigid to change.
  • Off the main sequence: re_build_info — re_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: re_log — re_log: abstractness 0.13, instability 0.00, distance 0.88 — zone of pain — concrete and depended on by 82 project(s), so it's rigid to change.
  • Off the main sequence: re_tuid — re_tuid: abstractness 0.00, instability 0.13, distance 0.88 — zone of pain — concrete and depended on by 14 project(s), so it's rigid to change.
  • Off the main sequence: re_quota_channel — re_quota_channel: abstractness 0.00, instability 0.14, distance 0.86 — zone of pain — concrete and depended on by 19 project(s), so it's rigid to change.
  • Off the main sequence: re_mutex — re_mutex: abstractness 0.00, instability 0.14, distance 0.86 — zone of pain — concrete and depended on by 12 project(s), so it's rigid to change.
  • Off the main sequence: re_web — re_web: 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: re_log_types — re_log_types: abstractness 0.06, instability 0.11, distance 0.83 — zone of pain — concrete and depended on by 66 project(s), so it's rigid to change.
  • Off the main sequence: re_uri — re_uri: abstractness 0.00, instability 0.19, distance 0.81 — zone of pain — concrete and depended on by 22 project(s), so it's rigid to change.
  • Off the main sequence: re_backoff — re_backoff: 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: re_capabilities — re_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: re_string_interner — re_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: re_log_msg — re_log_msg: abstractness 0.00, instability 0.21, distance 0.79 — zone of pain — concrete and depended on by 19 project(s), so it's rigid to change.
  • Off the main sequence: @rerun-io/web-viewer — @rerun-io/web-viewer: abstractness 0.25, instability 0.00, distance 0.75 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
D2 · Cognitive Complexity · AppCore · ×16
  • AppCore::run_system_command (cognitive 123) crates/top/re_viewer/src/app/command_handling.rs:118 — AppCore::run_system_command has cognitive complexity 123 (threshold 15). Drivers by points: if/else 41 (92 pts), match/switch 11 (23 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 65). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • AppCore::run_recording_command (cognitive 51) crates/top/re_viewer/src/app/command_handling.rs:1293 — AppCore::run_recording_command has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 28). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • AppCore::frame_ui (cognitive 46) crates/top/re_viewer/src/app/mod.rs:1323 — AppCore::frame_ui has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26 (37 pts), match/switch 2 (5 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.
  • AppCore::run_ui_command (cognitive 37) crates/top/re_viewer/src/app/command_handling.rs:879 — AppCore::run_ui_command has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 4 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • AppCore::load_data_source (cognitive 35) crates/top/re_viewer/src/app/add_data_source.rs:74 — AppCore::load_data_source has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 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.
  • AppCore::receive_log_msg (cognitive 34) crates/top/re_viewer/src/app/logic.rs:304 — AppCore::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.
  • AppCore::serve_viewer_control (cognitive 27) crates/top/re_viewer/src/app/viewer_control.rs:315 — AppCore::serve_viewer_control has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 6 (12 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.
  • AppCore::receive_fetched_chunks (cognitive 25) crates/top/re_viewer/src/app/logic.rs:615 — AppCore::receive_fetched_chunks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), match/switch 1 (4 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.
  • AppCore::answer_pending_viewer_control_replies (cognitive 23) crates/top/re_viewer/src/app/viewer_control.rs:232 — AppCore::answer_pending_viewer_control_replies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (5 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.
  • AppCore::validate_loaded_events (cognitive 21) crates/top/re_viewer/src/app/logic.rs:779 — AppCore::validate_loaded_events has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • AppCore::receive_messages (cognitive 20) crates/top/re_viewer/src/app/logic.rs:149 — AppCore::receive_messages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • AppCore::on_new_store (cognitive 18) crates/top/re_viewer/src/app/logic.rs:493 — AppCore::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.
  • AppCore::prefetch_chunks (cognitive 17) crates/top/re_viewer/src/app/logic.rs:937 — AppCore::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.
  • AppCore::move_time (cognitive 17) crates/top/re_viewer/src/app/mod.rs:793 — AppCore::move_time has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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.
  • AppCore::ui_impl (cognitive 17) crates/top/re_viewer/src/app/ui.rs:17 — AppCore::ui_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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.
  • AppCore::purge_memory_if_needed (cognitive 16) crates/top/re_viewer/src/app/logic.rs:813 — AppCore::purge_memory_if_needed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 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.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×15
  • Duplicated block (15 lines × 2) crates/data_flow/re_grpc_client/src/lib.rs:50 — crates/data_flow/re_grpc_client/src/lib.rs:50-64 | crates/data_flow/re_grpc_server/src/lib.rs:132-146 — 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 (15 lines × 2) crates/store/re_chunk_store/src/query.rs:125 — crates/store/re_chunk_store/src/query.rs:125-139 | crates/store/re_chunk_store/src/query.rs:145-159 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) crates/store/re_log_channel/src/receiver_set.rs:141 — crates/store/re_log_channel/src/receiver_set.rs:141-155 | crates/store/re_log_channel/src/receiver_set.rs:177-191 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) crates/store/re_log_encoding/src/transport_to_app.rs:274 — crates/store/re_log_encoding/src/transport_to_app.rs:274-288 | crates/store/re_log_encoding/src/transport_to_app.rs:304-318 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) crates/utils/re_perf_telemetry/src/prometheus.rs:216 — crates/utils/re_perf_telemetry/src/prometheus.rs:216-230 | crates/utils/re_perf_telemetry/src/prometheus.rs:391-405 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) crates/viewer_support/re_component_ui/src/line_strip.rs:24 — crates/viewer_support/re_component_ui/src/line_strip.rs:24-38 | crates/viewer_support/re_component_ui/src/line_strip.rs:89-103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) crates/viewer_support/re_component_ui/src/time_range.rs:124 — crates/viewer_support/re_component_ui/src/time_range.rs:124-138 | crates/viewer_support/re_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.
  • Duplicated block (15 lines × 2) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:802 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:802-816 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:831-846 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 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 (15 lines × 2) crates/viewer_support/re_renderer/src/renderer/volume.rs:323 — crates/viewer_support/re_renderer/src/renderer/volume.rs:323-337 | crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs:401-415 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/volume.rs` and `crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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 (15 lines × 2) crates/views/re_view_spatial/src/visualizers/video/encoded_depth_image.rs:72 — crates/views/re_view_spatial/src/visualizers/video/encoded_depth_image.rs:72-86 | crates/views/re_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.
  • Duplicated block (15 lines × 2) crates/views/re_view_time_series/src/line_series_loader.rs:182 — crates/views/re_view_time_series/src/line_series_loader.rs:182-196 | crates/views/re_view_time_series/src/point_visualizer_system.rs:261-275 — before extracting anything, compare `crates/views/re_view_time_series/src/line_series_loader.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 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 (15 lines × 2) crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:225 — crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:225-239 | crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs:532-546 — before extracting anything, compare `crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs` and `crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 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 (15 lines × 2) crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:133 — crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:133-147 | crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs:435-449 — before extracting anything, compare `crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs` and `crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 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 (15 lines × 2) crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:587 — crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:587-601 | crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:619-633 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (15 lines × 2) crates/store/re_chunk/src/chunk.rs:1310 — crates/store/re_chunk/src/chunk.rs:1310-1324 | crates/store/re_chunk/src/chunk.rs:1339-1353 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×13
  • Duplicated block (16 lines × 2) crates/panels/re_blueprint_tree/src/blueprint_tree.rs:821 — crates/panels/re_blueprint_tree/src/blueprint_tree.rs:821-836 | crates/panels/re_time_panel/src/time_panel.rs:1369-1385 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (16 lines × 2) crates/panels/re_selection_panel/src/view_entity_picker.rs:403 — crates/panels/re_selection_panel/src/view_entity_picker.rs:403-418 | crates/panels/re_time_panel/src/streams_tree_data.rs:180-195 — before extracting anything, compare `crates/panels/re_selection_panel/src/view_entity_picker.rs` and `crates/panels/re_time_panel/src/streams_tree_data.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (16 lines × 2) crates/panels/re_viewport/src/viewport_ui.rs:1307 — crates/panels/re_viewport/src/viewport_ui.rs:1307-1322 | crates/panels/re_viewport/src/viewport_ui.rs:1329-1344 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) crates/top/re_viewer/src/app/viewer_control.rs:1385 — crates/top/re_viewer/src/app/viewer_control.rs:1385-1400 | crates/top/re_viewer/src/app/viewer_control.rs:1457-1472 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) crates/top/re_viewer/src/web.rs:359 — crates/top/re_viewer/src/web.rs:359-374 | crates/top/re_viewer/src/web.rs:776-791 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) crates/utils/re_crash_handler/src/lib.rs:258 — crates/utils/re_crash_handler/src/lib.rs:258-273 | crates/utils/re_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.
  • Duplicated block (16 lines × 2) crates/utils/re_video/src/decode/rvl_decoder.rs:39 — crates/utils/re_video/src/decode/rvl_decoder.rs:39-54 | crates/utils/re_video/src/decode/tiff_decoder.rs:25-40 — 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/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:151 — crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:151-166 | crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs:457-472 — before extracting anything, compare `crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs` and `crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 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_support/re_viewer_context/src/component_ui_registry.rs:376 — crates/viewer_support/re_viewer_context/src/component_ui_registry.rs:376-391 | crates/viewer_support/re_viewer_context/src/component_ui_registry.rs:421-436 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (16 lines × 2) crates/views/re_view_spatial/src/visualizers/points2d.rs:224 — crates/views/re_view_spatial/src/visualizers/points2d.rs:224-239 | crates/views/re_view_spatial/src/visualizers/points3d.rs:389-404 — before extracting anything, compare `crates/views/re_view_spatial/src/visualizers/points2d.rs` and `crates/views/re_view_spatial/src/visualizers/points3d.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (16 lines × 2) crates/store/re_sdk_types/src/ply.rs:78 — crates/store/re_sdk_types/src/ply.rs:78-93 | crates/viewer_support/re_renderer/src/importer/ply.rs:55-70 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (16 lines × 2) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:746 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:746-763 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:760-775 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 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/data_flow/re_grpc_server/src/lib.rs:531 — crates/data_flow/re_grpc_server/src/lib.rs:531-546 | crates/data_flow/re_grpc_server/src/lib.rs:628-643 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D2 · Cognitive Complexity · re_view_spatial · ×12
  • re_view_spatial::visualizers::video::execute_video_stream_like (cognitive 49) crates/views/re_view_spatial/src/visualizers/video/mod.rs:166 — re_view_spatial::visualizers::video::execute_video_stream_like has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (44 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (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.
  • re_view_spatial::picking_ui_pixel::format_pixel_value (cognitive 35) crates/views/re_view_spatial/src/picking_ui_pixel.rs:406 — re_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.
  • re_view_spatial::picking_ui::picking (cognitive 33) crates/views/re_view_spatial/src/picking_ui.rs:30 — re_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.
  • re_view_spatial::shared_fallbacks::register_fallbacks (cognitive 29) crates/views/re_view_spatial/src/shared_fallbacks.rs:27 — re_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.
  • re_view_spatial::visualizers::utilities::transform_retrieval::is_valid_space_for_content (cognitive 29) crates/views/re_view_spatial/src/visualizers/utilities/transform_retrieval.rs:251 — re_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.
  • re_view_spatial::proc_mesh::capsule_wireframe_lines (cognitive 25) crates/views/re_view_spatial/src/proc_mesh.rs:384 — re_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.
  • re_view_spatial::visualizers::video::show_video_frame (cognitive 25) crates/views/re_view_spatial/src/visualizers/video/mod.rs:586 — re_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.
  • re_view_spatial::picking::picking_gpu (cognitive 22) crates/views/re_view_spatial/src/picking.rs:189 — re_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.
  • re_view_spatial::ui::create_labels (cognitive 21) crates/views/re_view_spatial/src/ui.rs:200 — re_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.
  • re_view_spatial::visualizers::utilities::transform_retrieval::format_transform_info_result (cognitive 20) crates/views/re_view_spatial/src/visualizers/utilities/transform_retrieval.rs:167 — re_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.
  • re_view_spatial::proc_mesh::generate_wireframe (cognitive 16) crates/views/re_view_spatial/src/proc_mesh.rs:217 — re_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.
  • re_view_spatial::ui::resolve_label_positions (cognitive 16) crates/views/re_view_spatial/src/ui.rs:365 — re_view_spatial::ui::resolve_label_positions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), 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.
D2 · Cognitive Complexity · re_view_time_series · ×12
  • re_view_time_series::series_query::collect_colors (cognitive 36) crates/views/re_view_time_series/src/series_query.rs:196 — re_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.
  • re_view_time_series::series_query::collect_radius_ui (cognitive 25) crates/views/re_view_time_series/src/series_query.rs:370 — re_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.
  • re_view_time_series::fallbacks::register_fallbacks (cognitive 24) crates/views/re_view_time_series/src/fallbacks.rs:13 — re_view_time_series::fallbacks::register_fallbacks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, loops 2, 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.
  • re_view_time_series::line_visualizer_system::build_line_draw_data (cognitive 24) crates/views/re_view_time_series/src/line_visualizer_system.rs:116 — re_view_time_series::line_visualizer_system::build_line_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.
  • re_view_time_series::view_class::update_series_visibility_from_legend (cognitive 23) crates/views/re_view_time_series/src/view_class.rs:1768 — re_view_time_series::view_class::update_series_visibility_from_legend has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 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.
  • re_view_time_series::error_bands::build_band_draw_data (cognitive 22) crates/views/re_view_time_series/src/error_bands.rs:20 — re_view_time_series::error_bands::build_band_draw_data has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (7 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.
  • re_view_time_series::line_visualizer_system::build_nan_island_marker_draw_data (cognitive 21) crates/views/re_view_time_series/src/line_visualizer_system.rs:345 — re_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.
  • re_view_time_series::visualizer_ui::visualizer_ui_element (cognitive 21) crates/views/re_view_time_series/src/visualizer_ui.rs:25 — re_view_time_series::visualizer_ui::visualizer_ui_element has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (18 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.
  • re_view_time_series::view_class::nearest_data_point_tooltip (cognitive 18) crates/views/re_view_time_series/src/view_class.rs:1270 — re_view_time_series::view_class::nearest_data_point_tooltip has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, 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.
  • re_view_time_series::series_query::collect_scalars (cognitive 17) crates/views/re_view_time_series/src/series_query.rs:146 — re_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.
  • re_view_time_series::view_class::all_scalar_mappings (cognitive 17) crates/views/re_view_time_series/src/view_class.rs:1101 — re_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.
  • re_view_time_series::view_class::all_series_tooltip (cognitive 17) crates/views/re_view_time_series/src/view_class.rs:1545 — re_view_time_series::view_class::all_series_tooltip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×12
  • Duplicated block (14 lines × 2) crates/data_flow/re_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs:33 — crates/data_flow/re_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs:33-46 | crates/data_flow/re_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.
  • Duplicated block (14 lines × 2) crates/data_flow/re_redap_client/src/grpc.rs:767 — crates/data_flow/re_redap_client/src/grpc.rs:767-780 | crates/data_flow/re_redap_client/src/grpc.rs:873-886 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (14 lines × 2) crates/store/re_lenses_core/src/selector/parser.rs:529 — crates/store/re_lenses_core/src/selector/parser.rs:529-542 | crates/store/re_lenses_core/src/selector/parser.rs:634-647 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (14 lines × 2) crates/utils/re_perf_telemetry/src/prometheus.rs:273 — crates/utils/re_perf_telemetry/src/prometheus.rs:273-286 | crates/utils/re_perf_telemetry/src/prometheus.rs:448-461 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (14 lines × 2) crates/viewer_support/re_dataframe_ui/src/filters/string.rs:178 — crates/viewer_support/re_dataframe_ui/src/filters/string.rs:178-191 | crates/viewer_support/re_dataframe_ui/src/filters/timestamp.rs:422-435 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (14 lines × 2) crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:286 — crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:286-299 | crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:331-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.
  • Duplicated block (14 lines × 2) crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs:84 — crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs:84-97 | crates/viewer_support/re_viewer_context/src/tensor/tensor_stats.rs:80-93 — before extracting anything, compare `crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs` and `crates/viewer_support/re_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.
  • Duplicated block (14 lines × 2) crates/views/re_view_map/src/map_view.rs:617 — crates/views/re_view_map/src/map_view.rs:617-630 | crates/views/re_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.
  • Duplicated block (14 lines × 2) rerun_py/src/catalog/dataset_entry.rs:425 — rerun_py/src/catalog/dataset_entry.rs:425-438 | rerun_py/src/catalog/dataset_entry.rs:449-462 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (14 lines × 2) crates/store_app/re_server/src/rerun_cloud/mod.rs:209 — crates/store_app/re_server/src/rerun_cloud/mod.rs:209-222 | crates/store_app/re_server/src/store/in_memory_store.rs:255-271 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (14 lines × 2) crates/data_flow/re_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:81 — crates/data_flow/re_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:81-94 | crates/data_flow/re_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.
  • 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.
D30 · Dependency Vulnerabilities · Medium advisory (unsound) · ×11
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×10
  • Animation without a prefers-reduced-motion guard rerun_js/web-viewer/index.ts:1357 — <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 rerun_py/rerun_sdk/rerun/_loading_widget.css:23 — `.rerun-notebook-loading__spinner` moves (`animation: rerun-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 rerun_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 rerun_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 rerun_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 rerun_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 rerun_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 rerun_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 rerun_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 rerun_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.
D2 · Cognitive Complexity · ChunkStore · ×10
  • ChunkStore::insert_chunk_impl (cognitive 106) crates/store/re_chunk_store/src/writes.rs:113 — 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/re_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 36) crates/store/re_chunk_store/src/compaction_election.rs:22 — ChunkStore::find_and_elect_compaction_candidate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (20 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/re_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::gc_find_candidates (cognitive 20) crates/store/re_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/re_chunk_store/src/lineage_dropping.rs:23 — 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::finalize_compaction (cognitive 18) crates/store/re_chunk_store/src/compact.rs:98 — ChunkStore::finalize_compaction has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (5 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ChunkStore::format_lineage (cognitive 17) crates/store/re_chunk_store/src/lineage.rs:311 — 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/re_chunk_store/src/query.rs:555 — 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/re_chunk_store/src/query.rs:608 — 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.
D2 · Cognitive Complexity · rerun · ×10
  • rerun::commands::rrd::route::process_messages (cognitive 45) crates/top/rerun/src/commands/rrd/route.rs:104 — rerun::commands::rrd::route::process_messages has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 6 (11 pts), match/switch 3 (8 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.
  • rerun::commands::entrypoint::assert_receive_into_entity_db (cognitive 32) crates/top/rerun/src/commands/entrypoint.rs:1666 — rerun::commands::entrypoint::assert_receive_into_entity_db has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 5 (18 pts), if/else 6 (13 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.
  • rerun::commands::entrypoint::run_impl (cognitive 22) crates/top/rerun/src/commands/entrypoint.rs:1013 — rerun::commands::entrypoint::run_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6 (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.
  • rerun::commands::rrd::merge_optimize::optimize_dir_mirror (cognitive 20) crates/top/rerun/src/commands/rrd/merge_optimize.rs:312 — rerun::commands::rrd::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.
  • rerun::commands::rrd::split::extract_chunks_for_single_split (cognitive 19) crates/top/rerun/src/commands/rrd/split.rs:873 — rerun::commands::rrd::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.
  • rerun::commands::entrypoint::start_native_viewer (cognitive 18) crates/top/rerun/src/commands/entrypoint.rs:1197 — rerun::commands::entrypoint::start_native_viewer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 3, boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • rerun::commands::rrd::print::print_msg (cognitive 18) crates/top/rerun/src/commands/rrd/print.rs:202 — rerun::commands::rrd::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.
  • rerun::commands::entrypoint::connect_to_existing_server (cognitive 16) crates/top/rerun/src/commands/entrypoint.rs:1459 — rerun::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.
  • rerun::commands::rrd::merge_optimize::merge_and_compact (cognitive 16) crates/top/rerun/src/commands/rrd/merge_optimize.rs:428 — rerun::commands::rrd::merge_optimize::merge_and_compact has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (2 pts), boolean chains 1, 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.
  • rerun::commands::rrd::stats::compute_stats (cognitive 16) crates/top/rerun/src/commands/rrd/stats.rs:618 — rerun::commands::rrd::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.
R4 · Test Coverage · No test reaches this file · ×10
  • No test reaches this file rerun_notebook/src/js/widget.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_js/web-viewer-react/index.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_js/web-viewer/typedoc-used-by.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_js/scripts/common.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_js/scripts/version.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_js/scripts/publish.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_notebook/src/rerun_notebook/error_widget.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_notebook/build.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file rerun_js/scripts/docs.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
D1 · Cyclomatic Complexity · re_types_builder · ×9
  • re_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cyclomatic 42) crates/build/re_types_builder/src/codegen/rust/serializer.rs:568 — re_types_builder::codegen::rust::serializer::quote_arrow_field_serializer has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • re_types_builder::codegen::python::code_for_struct (cyclomatic 40) crates/build/re_types_builder/src/codegen/python/mod.rs:735 — re_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.
  • re_types_builder::codegen::python::quote_arrow_serialization (cyclomatic 29) crates/build/re_types_builder/src/codegen/python/mod.rs:2343 — re_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.
  • re_types_builder::codegen::rust::serializer::quote_arrow_serializer (cyclomatic 22) crates/build/re_types_builder/src/codegen/rust/serializer.rs:54 — re_types_builder::codegen::rust::serializer::quote_arrow_serializer 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.
  • re_types_builder::codegen::python::check_ext_consistency (cyclomatic 21) crates/build/re_types_builder/src/codegen/python/mod.rs:309 — re_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.
  • re_types_builder::codegen::rust::deserializer::quote_arrow_deserializer (cyclomatic 18) crates/build/re_types_builder/src/codegen/rust/deserializer.rs:61 — re_types_builder::codegen::rust::deserializer::quote_arrow_deserializer 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.
  • re_types_builder::codegen::rust::deserializer::quote_arrow_field_deserializer (cyclomatic 18) crates/build/re_types_builder/src/codegen/rust/deserializer.rs:536 — re_types_builder::codegen::rust::deserializer::quote_arrow_field_deserializer 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.
  • re_types_builder::docs::doclink_translation::try_translate_doclink (cyclomatic 17) crates/build/re_types_builder/src/docs.rs:317 — re_types_builder::docs::doclink_translation::try_translate_doclink 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.
  • re_types_builder::codegen::python::code_for_union (cyclomatic 16) crates/build/re_types_builder/src/codegen/python/mod.rs:1207 — re_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: re_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.
D2 · Cognitive Complexity · re_datafusion · ×9
  • re_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread (cognitive 76) crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:305 — re_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.
  • re_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop (cognitive 32) crates/store_app/re_datafusion/src/dataframe_query_provider/io_loop.rs:694 — re_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.
  • re_datafusion::pushdown_expressions::merge_queries_and (cognitive 30) crates/store_app/re_datafusion/src/pushdown_expressions.rs:736 — re_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.
  • re_datafusion::dataframe_query_provider::fetch_plan::create_request_batches_with_segment_limit (cognitive 28) crates/store_app/re_datafusion/src/dataframe_query_provider/fetch_plan.rs:214 — re_datafusion::dataframe_query_provider::fetch_plan::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.
  • re_datafusion::pipeline::plan::build_fetch_plan (cognitive 26) crates/store_app/re_datafusion/src/pipeline/plan.rs:207 — re_datafusion::pipeline::plan::build_fetch_plan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (4 pts), boolean chains 3, 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.
  • re_datafusion::pipeline::driver::advance_head (cognitive 22) crates/store_app/re_datafusion/src/pipeline/driver.rs:309 — re_datafusion::pipeline::driver::advance_head has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (20 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.
  • re_datafusion::pushdown_expressions::apply_filter_expr_to_queries (cognitive 22) crates/store_app/re_datafusion/src/pushdown_expressions.rs:465 — re_datafusion::pushdown_expressions::apply_filter_expr_to_queries has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • re_datafusion::chunk_fetcher::fetch_batch_via_direct_urls (cognitive 21) crates/store_app/re_datafusion/src/chunk_fetcher.rs:703 — re_datafusion::chunk_fetcher::fetch_batch_via_direct_urls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), loops 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.
  • re_datafusion::pushdown_expressions::known_filter_column (cognitive 16) crates/store_app/re_datafusion/src/pushdown_expressions.rs:677 — re_datafusion::pushdown_expressions::known_filter_column has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (6 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.
D2 · Cognitive Complexity · re_viewer_context · ×9
  • re_viewer_context::view::visualizer_entity_subscriber::process_entity_components (cognitive 50) crates/viewer_support/re_viewer_context/src/view/visualizer_entity_subscriber.rs:183 — re_viewer_context::view::visualizer_entity_subscriber::process_entity_components has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 3 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk (cognitive 31) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:2028 — re_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.
  • re_viewer_context::cache::video_stream_cache::handle_deletion (cognitive 29) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:513 — re_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.
  • re_viewer_context::cache::video_stream_cache::update_sample_durations (cognitive 23) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:1248 — re_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.
  • re_viewer_context::cache::video_stream_cache::find_affected_sample_range (cognitive 23) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:1914 — re_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.
  • re_viewer_context::gpu_bridge::image_to_gpu::color_image_to_gpu (cognitive 21) crates/viewer_support/re_viewer_context/src/gpu_bridge/image_to_gpu.rs:72 — re_viewer_context::gpu_bridge::image_to_gpu::color_image_to_gpu has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • re_viewer_context::cache::video_stream_cache::handle_compacted_chunk_addition (cognitive 20) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:679 — re_viewer_context::cache::video_stream_cache::handle_compacted_chunk_addition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 5 (7 pts), boolean chains 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.
  • re_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image (cognitive 19) crates/viewer_support/re_viewer_context/src/gpu_bridge/image_to_gpu.rs:253 — re_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.
  • re_viewer_context::cache::video_stream_cache::load_known_chunk_ranges (cognitive 16) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:1805 — re_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.
D1 · Cyclomatic Complexity · AppCore · ×8
  • AppCore::run_system_command (cyclomatic 97) crates/top/re_viewer/src/app/command_handling.rs:118 — AppCore::run_system_command has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • AppCore::run_ui_command (cyclomatic 61) crates/top/re_viewer/src/app/command_handling.rs:879 — AppCore::run_ui_command has cyclomatic complexity 61 (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.
  • AppCore::frame_ui (cyclomatic 36) crates/top/re_viewer/src/app/mod.rs:1323 — AppCore::frame_ui has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • AppCore::run_recording_command (cyclomatic 35) crates/top/re_viewer/src/app/command_handling.rs:1293 — AppCore::run_recording_command has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • AppCore::serve_viewer_control (cyclomatic 34) crates/top/re_viewer/src/app/viewer_control.rs:315 — AppCore::serve_viewer_control 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.
  • AppCore::load_data_source (cyclomatic 22) crates/top/re_viewer/src/app/add_data_source.rs:74 — AppCore::load_data_source 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.
  • AppCore::is_back_destination_open (cyclomatic 20) crates/top/re_viewer/src/app/command_handling.rs:1672 — AppCore::is_back_destination_open 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.
  • AppCore::receive_messages (cyclomatic 16) crates/top/re_viewer/src/app/logic.rs:149 — AppCore::receive_messages 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.
D2 · Cognitive Complexity · re_selection_panel · ×7
  • re_selection_panel::view_entity_picker::add_entities_line_ui (cognitive 40) crates/panels/re_selection_panel/src/view_entity_picker.rs:177 — re_selection_panel::view_entity_picker::add_entities_line_ui has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (39 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.
  • re_selection_panel::visualizer_ui::visualizer_components (cognitive 36) crates/panels/re_selection_panel/src/visualizer_ui.rs:216 — re_selection_panel::visualizer_ui::visualizer_components has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_selection_panel::selection_history_ui::history_button_ui (cognitive 31) crates/panels/re_selection_panel/src/selection_history_ui.rs:53 — re_selection_panel::selection_history_ui::history_button_ui has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 6, boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_selection_panel::item_heading_with_breadcrumbs::item_bread_crumbs_ui (cognitive 21) crates/panels/re_selection_panel/src/item_heading_with_breadcrumbs.rs:39 — re_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.
  • re_selection_panel::visible_time_range_ui::resolved_visible_history_boundary_ui (cognitive 20) crates/panels/re_selection_panel/src/visible_time_range_ui.rs:347 — re_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.
  • re_selection_panel::visible_time_range_ui::query_range_ui (cognitive 19) crates/panels/re_selection_panel/src/visible_time_range_ui.rs:164 — re_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.
  • re_selection_panel::visualizer_ui::visualizer_ui_impl (cognitive 18) crates/panels/re_selection_panel/src/visualizer_ui.rs:104 — re_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.
D2 · Cognitive Complexity · re_data_ui · ×7
  • re_data_ui::entity_db_ui::grid_content_ui (cognitive 35) crates/viewer_support/re_data_ui/src/entity_db_ui.rs:102 — re_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.
  • re_data_ui::video_ui::video_data_ui (cognitive 35) crates/viewer_support/re_data_ui/src/video_ui.rs:93 — re_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.
  • re_data_ui::video_ui::decoded_frame_ui (cognitive 33) crates/viewer_support/re_data_ui/src/video_ui.rs:390 — re_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.
  • re_data_ui::item_ui::entity_db_button_ui (cognitive 26) crates/viewer_support/re_data_ui/src/item_ui.rs:534 — re_data_ui::item_ui::entity_db_button_ui has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (19 pts), match/switch 2 (4 pts), boolean chains 3 (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.
  • re_data_ui::item_ui::entity_tree_stats_ui (cognitive 22) crates/viewer_support/re_data_ui/src/item_ui.rs:234 — re_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.
  • re_data_ui::instance_path_ui::component_list_ui (cognitive 21) crates/viewer_support/re_data_ui/src/instance_path_ui.rs:271 — re_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.
  • re_data_ui::video_ui::frame_info_ui (cognitive 20) crates/viewer_support/re_data_ui/src/video_ui.rs:535 — re_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.
D30 · Dependency Vulnerabilities · Medium vulnerability · ×7
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×7
  • Duplicated block (17 lines × 2) crates/store/re_chunk_store/src/writes.rs:529 — crates/store/re_chunk_store/src/writes.rs:529-545 | crates/store/re_chunk_store/src/writes.rs:564-580 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (17 lines × 2) crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.asset_properties.rs:152 — crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.asset_properties.rs:152-168 | crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.asset_properties.rs:179-195 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (17 lines × 2) crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:141 — crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:141-157 | crates/store/re_sdk_types/src/archetypes/points3d_ext.rs:146-162 — before extracting anything, compare `crates/store/re_sdk_types/src/archetypes/points2d_ext.rs` and `crates/store/re_sdk_types/src/archetypes/points3d_ext.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 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 (17 lines × 2) crates/store_app/re_datafusion/src/dataframe_query_provider.rs:915 — crates/store_app/re_datafusion/src/dataframe_query_provider.rs:915-931 | crates/store_app/re_datafusion/src/dataframe_query_provider_wasm.rs:527-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.
  • Duplicated block (17 lines × 2) crates/store_app/re_server/src/store/in_memory_store.rs:217 — crates/store_app/re_server/src/store/in_memory_store.rs:217-233 | crates/store_app/re_server/src/store/in_memory_store.rs:293-309 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (17 lines × 2) crates/viewer_support/re_component_ui/src/encoding_uis/float_drag.rs:72 — crates/viewer_support/re_component_ui/src/encoding_uis/float_drag.rs:72-88 | crates/viewer_support/re_component_ui/src/encoding_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.
  • Duplicated block (17 lines × 2) rerun_py/src/chunk_stream/stream.rs:195 — rerun_py/src/chunk_stream/stream.rs:195-211 | rerun_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.
D6 · Cohesion (LCOM4) · Low cohesion · ×7
  • Low cohesion: TilesDelegate (LCOM4 5) crates/panels/re_viewport/src/viewport_ui.rs:396 — TilesDelegate's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: McapImporter (LCOM4 4) crates/data_flow/re_importer/src/importer_mcap/importer.rs:33 — 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: Chunk (LCOM4 4) crates/store/re_chunk/src/chunk.rs:242 — 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: ViewCoordinates (LCOM4 4) crates/store/re_sdk_types/src/components/view_coordinates.rs:39 — ViewCoordinates'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: RerunCloudHandler (LCOM4 4) crates/store_app/re_server/src/rerun_cloud/mod.rs:280 — RerunCloudHandler'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/top/re_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: Notification (LCOM4 4) crates/viewer_support/re_ui/src/notifications.rs:129 — 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×7
  • Swallowed exception (empty catch) scripts/highlight_issues.py:47 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) scripts/ci/check_large_files.py:97 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) scripts/ci/python_check_signatures.py:218 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py:1538 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `__del__()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch.
  • Swallowed exception (empty catch) rerun_py/rerun_sdk/rerun/archetypes/boxes3d_ext.py:110 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) rerun_py/rerun_sdk/rerun/archetypes/boxes3d_ext.py:119 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) rerun_js/web-viewer-react/index.js:150 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
D1 · Cyclomatic Complexity · re_viewer · ×6
  • re_viewer::viewer_analytics::event::open_recording (cyclomatic 23) crates/top/re_viewer/src/viewer_analytics/event.rs:64 — re_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.
  • re_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents (cyclomatic 20) crates/top/re_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:211 — re_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.
  • re_viewer::prefetch_chunks::prefetch_chunks_for_recordings (cyclomatic 18) crates/top/re_viewer/src/prefetch_chunks.rs:30 — re_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.
  • re_viewer::web::create_app (cyclomatic 18) crates/top/re_viewer/src/web.rs:627 — re_viewer::web::create_app 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.
  • re_viewer::ui::top_panel::top_bar_ui (cyclomatic 17) crates/top/re_viewer/src/ui/top_panel.rs:118 — re_viewer::ui::top_panel::top_bar_ui 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.
  • re_viewer::ui::top_panel::panel_buttons_r2l (cyclomatic 17) crates/top/re_viewer/src/ui/top_panel.rs:661 — re_viewer::ui::top_panel::panel_buttons_r2l 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.
D17 · Explicit Debt · HackComment · ×6
  • 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_support/re_ui/src/ui_ext.rs:1139 — // 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_support/re_component_ui/src/lib.rs:170 — // 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/top/re_viewer/src/app/command_handling.rs:829 — // 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/top/re_viewer/src/app/logic.rs:349 — // 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/store/re_uri/src/redap_uri.rs:93 — // 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.
D2 · Cognitive Complexity · TimeControl · ×6
  • TimeControl::handle_time_command (cognitive 105) crates/viewer_support/re_viewer_context/src/time_control/command.rs:214 — 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_support/re_viewer_context/src/time_control/mod.rs:451 — 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_support/re_viewer_context/src/time_control/mod.rs:357 — 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_support/re_viewer_context/src/time_control/command.rs:561 — 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_support/re_viewer_context/src/time_control/command.rs:598 — 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_support/re_viewer_context/src/time_control/mod.rs:663 — 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.
D2 · Cognitive Complexity · QueryHandle · ×6
  • QueryHandle::_next_n_rows (cognitive 101) crates/store_app/re_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_app/re_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_app/re_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_app/re_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_app/re_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_app/re_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.
D2 · Cognitive Complexity · Chunk · ×6
  • Chunk::earliest_at (cognitive 57) crates/store/re_chunk/src/earliest_at.rs:84 — Chunk::earliest_at has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (39 pts), match/switch 2 (9 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • Chunk::latest_at (cognitive 50) crates/store/re_chunk/src/latest_at.rs:109 — Chunk::latest_at has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 2 (7 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • Chunk::sanity_check (cognitive 26) crates/store/re_chunk/src/chunk.rs:1822 — Chunk::sanity_check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 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.
  • Chunk::row_id_range_per_component (cognitive 24) crates/store/re_chunk/src/chunk.rs:859 — 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::range (cognitive 19) crates/store/re_chunk/src/range.rs:211 — 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::static_row_index (cognitive 16) crates/store/re_chunk/src/latest_at.rs:208 — Chunk::static_row_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · re_viewer · ×6
  • re_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents (cognitive 32) crates/top/re_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:211 — re_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.
  • re_viewer::ui::top_panel::top_bar_ui (cognitive 30) crates/top/re_viewer/src/ui/top_panel.rs:118 — re_viewer::ui::top_panel::top_bar_ui has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 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.
  • re_viewer::web::create_app (cognitive 25) crates/top/re_viewer/src/web.rs:627 — re_viewer::web::create_app has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 5 (10 pts), loops 1 (2 pts) (nesting depth added 8). 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.
  • re_viewer::ui::top_panel::panel_buttons_r2l (cognitive 24) crates/top/re_viewer/src/ui/top_panel.rs:661 — re_viewer::ui::top_panel::panel_buttons_r2l has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 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.
  • re_viewer::prefetch_chunks::prefetch_chunks_for_recordings (cognitive 23) crates/top/re_viewer/src/prefetch_chunks.rs:30 — re_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.
  • re_viewer::agent_analytics::redactor::redaction_thread (cognitive 19) crates/top/re_viewer/src/agent_analytics/redactor.rs:215 — re_viewer::agent_analytics::redactor::redaction_thread has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (6 pts), boolean chains 3, 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.
D4 · Code Duplication · Duplicated block (8–9 lines × 2) · ×6
  • Duplicated block (8–9 lines × 2) crates/data_flow/re_importer/src/importer_urdf/joint_transform.rs:110 — crates/data_flow/re_importer/src/importer_urdf/joint_transform.rs:110-117 | crates/data_flow/re_importer/src/importer_urdf/joint_transform.rs:137-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 (8–9 lines × 2) crates/data_flow/re_importer/src/importer_urdf/mod.rs:536 — crates/data_flow/re_importer/src/importer_urdf/mod.rs:536-543 | crates/data_flow/re_importer/src/importer_urdf/mod.rs:736-744 — both copies are in the same file, so extract the block into 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–9 lines × 2) crates/top/re_viewer/src/app/mod.rs:1016 — crates/top/re_viewer/src/app/mod.rs:1016-1024 | crates/top/re_viewer/src/app/mod.rs:1035-1042 — both copies are in the same file, so extract the block into 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–9 lines × 2) crates/viewer_support/re_viewer_context/src/component_ui_registry.rs:228 — crates/viewer_support/re_viewer_context/src/component_ui_registry.rs:228-236 | crates/viewer_support/re_viewer_context/src/component_ui_registry.rs:365-372 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8–9 lines × 2) crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs:108 — crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs:108-116 | crates/viewer_support/re_viewer_context/src/tensor/tensor_stats.rs:104-111 — before extracting anything, compare `crates/viewer_support/re_viewer_context/src/tensor/image_stats.rs` and `crates/viewer_support/re_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.
  • Duplicated block (8–9 lines × 2) crates/views/re_view_time_series/src/line_visualizer_system.rs:51 — crates/views/re_view_time_series/src/line_visualizer_system.rs:51-59 | crates/views/re_view_time_series/src/point_visualizer_system.rs:48-55 — before extracting anything, compare `crates/views/re_view_time_series/src/line_visualizer_system.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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.
D2 · Cognitive Complexity · re_dataframe_ui · ×5
  • re_dataframe_ui::preview_renderer::preview_timeline (cognitive 52) crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs:733 — re_dataframe_ui::preview_renderer::preview_timeline has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (40 pts), boolean chains 7, loops 1 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • re_dataframe_ui::filters::column_filter_ui::column_picker_ui (cognitive 40) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs:91 — re_dataframe_ui::filters::column_filter_ui::column_picker_ui has cognitive complexity 40 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 9, 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.
  • re_dataframe_ui::cards_view::card_content_ui (cognitive 31) crates/viewer_support/re_dataframe_ui/src/cards_view.rs:145 — re_dataframe_ui::cards_view::card_content_ui has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_dataframe_ui::preview_renderer::preview_playback_ui (cognitive 25) crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs:535 — re_dataframe_ui::preview_renderer::preview_playback_ui has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
  • re_dataframe_ui::datafusion_table_widget::toolbar_controls_ui (cognitive 16) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:1568 — re_dataframe_ui::datafusion_table_widget::toolbar_controls_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TimePanel · ×5
  • TimePanel::show_entity_contents (cognitive 47) crates/panels/re_time_panel/src/time_panel.rs:965 — 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/panels/re_time_panel/src/time_panel.rs:1197 — 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/panels/re_time_panel/src/time_panel.rs:362 — 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/panels/re_time_panel/src/time_panel.rs:465 — 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/panels/re_time_panel/src/time_panel.rs:1586 — 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.
D2 · Cognitive Complexity · re_video · ×5
  • re_video::decode::av1::create_frame (cognitive 37) crates/utils/re_video/src/decode/av1.rs:197 — re_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.
  • re_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output (cognitive 29) crates/utils/re_video/src/decode/ffmpeg_cli/ffmpeg.rs:691 — re_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.
  • re_video::player::request_keyframe_before (cognitive 21) crates/utils/re_video/src/player/mod.rs:353 — re_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.
  • re_video::av1::detect_av1_keyframe_start (cognitive 19) crates/utils/re_video/src/av1.rs:25 — re_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.
  • re_video::demux::mp4::codec_details_from_stds (cognitive 18) crates/utils/re_video/src/demux/mp4.rs:233 — re_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.
D3 · God Classes · TooManyFields · ×5
  • TooManyFields: DesignTokens crates/viewer_support/re_ui/src/design_tokens.rs:251 — TooManyFields — 159 stored fields beside 52 methods. The bar is 30 stored fields; this is 129 over it, 5.30× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: QuerySnapshot crates/store_app/re_datafusion/src/metrics_capture.rs:240 — TooManyFields — 39 stored fields. The bar is 30 stored fields; this is 9 over it, 1.30× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: QueryMetrics crates/store_app/re_datafusion/src/metrics_capture.rs:102 — TooManyFields — 36 stored fields beside 1 method. The bar is 30 stored fields; this is 6 over it, 1.20× 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: AppCore crates/top/re_viewer/src/app/mod.rs:125 — TooManyFields — 32 stored fields beside 135 methods. The bar is 30 stored fields; this is 2 over it, 1.07× 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: Args crates/top/rerun/src/commands/entrypoint.rs:136 — 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.
D30 · Dependency Vulnerabilities · Medium advisory (unmaintained) · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×5
  • Members sharing a duplicated core (4 members, 50+ identical tokens) crates/store/re_chunk/src/iter.rs:476 — crates/store/re_chunk/src/iter.rs:476-501 | crates/store/re_chunk/src/iter.rs:553-590 | crates/store/re_chunk/src/iter.rs:637-668 | crates/store/re_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/re_chunk/src/unit_chunk.rs:98 — crates/store/re_chunk/src/unit_chunk.rs:98-110 | crates/store/re_chunk/src/unit_chunk.rs:151-163 | crates/store/re_chunk/src/unit_chunk.rs:388-400 | crates/store/re_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/views/re_view_spatial/src/visualizers/arrows2d.rs:181 — crates/views/re_view_spatial/src/visualizers/arrows2d.rs:181-257 | crates/views/re_view_spatial/src/visualizers/arrows3d.rs:185-261 | crates/views/re_view_spatial/src/visualizers/lines2d.rs:176-251 | crates/views/re_view_spatial/src/visualizers/lines3d.rs:187-262 — 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/views/re_view_spatial/src/visualizers/boxes3d.rs:125 — crates/views/re_view_spatial/src/visualizers/boxes3d.rs:125-232 | crates/views/re_view_spatial/src/visualizers/capsules3d.rs:165-257 | crates/views/re_view_spatial/src/visualizers/cylinders3d.rs:160-253 | crates/views/re_view_spatial/src/visualizers/ellipsoids.rs:133-239 — 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 · Duplicated block (21 lines × 2) · ×5
  • Duplicated block (21 lines × 2) crates/store/re_chunk/src/iter.rs:559 — crates/store/re_chunk/src/iter.rs:559-579 | crates/store/re_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.
  • Duplicated block (21 lines × 2) crates/store_app/re_datafusion/src/dataframe_query_provider/segment_store.rs:99 — crates/store_app/re_datafusion/src/dataframe_query_provider/segment_store.rs:99-119 | crates/store_app/re_datafusion/src/dataframe_query_provider_wasm.rs:381-401 — 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 (21 lines × 2) crates/top/re_viewer/src/app/command_handling.rs:643 — crates/top/re_viewer/src/app/command_handling.rs:643-663 | crates/top/re_viewer/src/app/command_handling.rs:675-695 — both copies are in the same file, so extract the block into 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/views/re_view_spatial/src/visualizers/boxes2d.rs:249 — crates/views/re_view_spatial/src/visualizers/boxes2d.rs:249-269 | crates/views/re_view_spatial/src/visualizers/ellipses2d.rs:255-275 — before extracting anything, compare `crates/views/re_view_spatial/src/visualizers/boxes2d.rs` and `crates/views/re_view_spatial/src/visualizers/ellipses2d.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (21 lines × 2) crates/views/re_view_spatial/src/visualizers/points2d.rs:309 — crates/views/re_view_spatial/src/visualizers/points2d.rs:309-329 | crates/views/re_view_spatial/src/visualizers/points3d.rs:489-509 — before extracting anything, compare `crates/views/re_view_spatial/src/visualizers/points2d.rs` and `crates/views/re_view_spatial/src/visualizers/points3d.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.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×5
  • Duplicated block (10 lines × 3) crates/utils/re_perf_telemetry/src/prometheus.rs:295 — crates/utils/re_perf_telemetry/src/prometheus.rs:295-304 | crates/utils/re_perf_telemetry/src/prometheus.rs:326-335 | crates/utils/re_perf_telemetry/src/prometheus.rs:357-366 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (10 lines × 3) crates/viewer_support/re_viewer_context/src/cache/image_decode_cache.rs:224 — crates/viewer_support/re_viewer_context/src/cache/image_decode_cache.rs:224-233 | crates/views/re_view_spatial/src/caches/mesh_cache.rs:141-150 | crates/views/re_view_spatial/src/proc_mesh.rs:510-519 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
  • Duplicated block (10 lines × 3) crates/views/re_view_spatial/src/visualizers/arrows2d.rs:62 — crates/views/re_view_spatial/src/visualizers/arrows2d.rs:62-71 | crates/views/re_view_spatial/src/visualizers/boxes2d.rs:62-71 | crates/views/re_view_spatial/src/visualizers/ellipses2d.rs:71-80 — before extracting anything, compare `crates/views/re_view_spatial/src/visualizers/boxes2d.rs` and `crates/views/re_view_spatial/src/visualizers/ellipses2d.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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 × 3) crates/views/re_view_spatial/src/visualizers/arrows2d.rs:58 — crates/views/re_view_spatial/src/visualizers/arrows2d.rs:58-67 | crates/views/re_view_spatial/src/visualizers/lines2d.rs:57-66 | crates/views/re_view_spatial/src/visualizers/lines3d.rs:58-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 all 3 call sites, so a change lands once.
  • Duplicated block (10 lines × 3) crates/data_flow/re_lenses/src/semantic/foxglove/compressed_image.rs:12 — crates/data_flow/re_lenses/src/semantic/foxglove/compressed_image.rs:12-21 | crates/data_flow/re_lenses/src/semantic/foxglove/compressed_video.rs:12-21 | crates/data_flow/re_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.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×5
  • Duplicated block (8 lines × 3) crates/store/re_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:177 — crates/store/re_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:177-184 | crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:90-100 | crates/store/re_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.
  • 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.
  • 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.
  • Duplicated block (8 lines × 3) crates/viewer_support/re_renderer/src/draw_phases/depth_resolve.rs:69 — crates/viewer_support/re_renderer/src/draw_phases/depth_resolve.rs:69-76 | crates/viewer_support/re_renderer/src/draw_phases/outlines.rs:445-453 | crates/viewer_support/re_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 all 3 call sites, so a change lands once.
  • Duplicated block (8 lines × 3) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:408 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:408-415 | crates/viewer_support/re_renderer/src/renderer/lines.rs:455-462 | crates/viewer_support/re_renderer/src/renderer/lines.rs:469-476 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/lines.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.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×5
  • Duplicated block (7 lines × 3) crates/store/re_sorbet/src/migrations/make_list_arrays.rs:28 — crates/store/re_sorbet/src/migrations/make_list_arrays.rs:28-34 | crates/store/re_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:91-97 | crates/store/re_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:216-222 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
  • Duplicated block (7 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.
  • Duplicated block (7 lines × 3) crates/store/re_uri/src/endpoints/dataset.rs:198 — crates/store/re_uri/src/endpoints/dataset.rs:198-204 | crates/store/re_uri/src/endpoints/entry.rs:30-36 | crates/store/re_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_support/re_component_ui/src/color.rs:11 — crates/viewer_support/re_component_ui/src/color.rs:11-17 | crates/viewer_support/re_component_ui/src/encoding_uis/range1d.rs:10-16 | crates/viewer_support/re_component_ui/src/encoding_uis/singleline_string.rs:46-52 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
  • Duplicated block (7 lines × 3) crates/viewer_support/re_renderer/src/renderer/lines.rs:681 — crates/viewer_support/re_renderer/src/renderer/lines.rs:681-689 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:707-715 | crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs:317-323 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/lines.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
AC3 · Page structure · Page without a main landmark · ×4
  • 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.
  • Page without a main landmark REDACTED:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark scripts/screenshot_compare/assets/templates/example.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark scripts/screenshot_compare/assets/templates/index.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
D1 · Cyclomatic Complexity · QueryHandle · ×4
  • QueryHandle::try_bulk_emit_run (cyclomatic 38) crates/store_app/re_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_app/re_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_app/re_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_app/re_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.
D1 · Cyclomatic Complexity · re_datafusion · ×4
  • re_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread (cyclomatic 32) crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:305 — re_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.
  • re_datafusion::pushdown_expressions::known_filter_column (cyclomatic 18) crates/store_app/re_datafusion/src/pushdown_expressions.rs:677 — re_datafusion::pushdown_expressions::known_filter_column 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.
  • re_datafusion::pushdown_expressions::apply_filter_expr_to_queries (cyclomatic 16) crates/store_app/re_datafusion/src/pushdown_expressions.rs:465 — re_datafusion::pushdown_expressions::apply_filter_expr_to_queries 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.
  • re_datafusion::pushdown_expressions::merge_queries_and (cyclomatic 16) crates/store_app/re_datafusion/src/pushdown_expressions.rs:736 — re_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.
D1 · Cyclomatic Complexity · re_dataframe_ui · ×4
  • re_dataframe_ui::filters::column_filter_ui::column_picker_ui (cyclomatic 31) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs:91 — re_dataframe_ui::filters::column_filter_ui::column_picker_ui has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • re_dataframe_ui::cards_view::card_content_ui (cyclomatic 20) crates/viewer_support/re_dataframe_ui/src/cards_view.rs:145 — re_dataframe_ui::cards_view::card_content_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.
  • re_dataframe_ui::preview_renderer::preview_timeline (cyclomatic 20) crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs:733 — re_dataframe_ui::preview_renderer::preview_timeline 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.
  • re_dataframe_ui::preview_renderer::preview_playback_ui (cyclomatic 19) crates/viewer_support/re_dataframe_ui/src/preview_renderer.rs:535 — re_dataframe_ui::preview_renderer::preview_playback_ui 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.
D1 · Cyclomatic Complexity · re_view_spatial · ×4
  • re_view_spatial::shared_fallbacks::register_fallbacks (cyclomatic 24) crates/views/re_view_spatial/src/shared_fallbacks.rs:27 — re_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.
  • re_view_spatial::visualizers::video::execute_video_stream_like (cyclomatic 20) crates/views/re_view_spatial/src/visualizers/video/mod.rs:166 — re_view_spatial::visualizers::video::execute_video_stream_like 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.
  • re_view_spatial::visualizers::video::show_video_frame (cyclomatic 20) crates/views/re_view_spatial/src/visualizers/video/mod.rs:586 — re_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.
  • re_view_spatial::picking_ui::picking (cyclomatic 17) crates/views/re_view_spatial/src/picking_ui.rs:30 — re_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.
D1 · Cyclomatic Complexity · re_data_ui · ×4
  • re_data_ui::entity_db_ui::grid_content_ui (cyclomatic 22) crates/viewer_support/re_data_ui/src/entity_db_ui.rs:102 — re_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.
  • re_data_ui::video_ui::video_data_ui (cyclomatic 21) crates/viewer_support/re_data_ui/src/video_ui.rs:93 — re_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.
  • re_data_ui::item_ui::entity_db_button_ui (cyclomatic 19) crates/viewer_support/re_data_ui/src/item_ui.rs:534 — re_data_ui::item_ui::entity_db_button_ui 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.
  • re_data_ui::video_ui::decoded_frame_ui (cyclomatic 16) crates/viewer_support/re_data_ui/src/video_ui.rs:390 — re_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.
D1 · Cyclomatic Complexity · rerun · ×4
  • rerun::commands::rrd::route::process_messages (cyclomatic 20) crates/top/rerun/src/commands/rrd/route.rs:104 — rerun::commands::rrd::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.
  • rerun::commands::entrypoint::run (cyclomatic 19) crates/top/rerun/src/commands/entrypoint.rs:720 — rerun::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: rerun::commands::entrypoint::record_cli_command_analytics (cyclomatic 20) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
  • rerun::commands::entrypoint::run_impl (cyclomatic 18) crates/top/rerun/src/commands/entrypoint.rs:1013 — rerun::commands::entrypoint::run_impl 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. This is NOT this file's highest cyclomatic complexity: rerun::commands::entrypoint::record_cli_command_analytics (cyclomatic 20) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
  • rerun::commands::entrypoint::assert_receive_into_entity_db (cyclomatic 17) crates/top/rerun/src/commands/entrypoint.rs:1666 — rerun::commands::entrypoint::assert_receive_into_entity_db has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: rerun::commands::entrypoint::record_cli_command_analytics (cyclomatic 20) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
D2 · Cognitive Complexity · re_agent_ui · ×4
  • re_agent_ui::ui::elicitation_ui::field_ui (cognitive 44) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs:194 — re_agent_ui::ui::elicitation_ui::field_ui has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 2 (6 pts), match/switch 2, 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.
  • re_agent_ui::ui::chat_ui::permissions_ui (cognitive 24) crates/panels/re_agent_ui/src/ui/chat_ui.rs:680 — re_agent_ui::ui::chat_ui::permissions_ui has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_agent_ui::ui::chat_ui::model_picker_ui (cognitive 20) crates/panels/re_agent_ui/src/ui/chat_ui.rs:338 — re_agent_ui::ui::chat_ui::model_picker_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_agent_ui::ui::chat_ui::auth_ui (cognitive 18) crates/panels/re_agent_ui/src/ui/chat_ui.rs:625 — re_agent_ui::ui::chat_ui::auth_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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.
D2 · Cognitive Complexity · re_lenses_core · ×4
  • re_lenses_core::execute::execute (cognitive 43) crates/store/re_lenses_core/src/execute.rs:333 — re_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.
  • re_lenses_core::plan::plan (cognitive 24) crates/store/re_lenses_core/src/plan.rs:95 — re_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.
  • re_lenses_core::execute::apply_one_to_many (cognitive 18) crates/store/re_lenses_core/src/execute.rs:229 — re_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.
  • re_lenses_core::selector::eval::eval_pack (cognitive 18) crates/store/re_lenses_core/src/selector/eval.rs:249 — re_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.
D2 · Cognitive Complexity · re_ui · ×4
  • re_ui::drag_and_drop::find_drop_target (cognitive 40) crates/viewer_support/re_ui/src/drag_and_drop.rs:178 — re_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.
  • re_ui::notifications::show_notification (cognitive 32) crates/viewer_support/re_ui/src/notifications.rs:660 — re_ui::notifications::show_notification has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 5, boolean chains 2, loops 1 (2 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • re_ui::text_edit::autocomplete_text_edit (cognitive 28) crates/viewer_support/re_ui/src/text_edit.rs:196 — re_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.
  • re_ui::relative_time_range::edit_boundary_ui (cognitive 23) crates/viewer_support/re_ui/src/relative_time_range.rs:41 — re_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.
D2 · Cognitive Complexity · re_renderer · ×4
  • re_renderer::importer::gltf::import_mesh (cognitive 33) crates/viewer_support/re_renderer/src/importer/gltf.rs:173 — re_renderer::importer::gltf::import_mesh has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (29 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.
  • re_renderer::importer::ply::parse_ply_mesh (cognitive 33) crates/viewer_support/re_renderer/src/importer/ply.rs:427 — re_renderer::importer::ply::parse_ply_mesh has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (12 pts), match/switch 2 (5 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.
  • re_renderer::importer::gltf::load_gltf_from_buffer (cognitive 17) crates/viewer_support/re_renderer/src/importer/gltf.rs:43 — re_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.
  • re_renderer::renderer::plane_clustering::overlapping_clusters (cognitive 16) crates/viewer_support/re_renderer/src/renderer/plane_clustering.rs:112 — re_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.
D2 · Cognitive Complexity · re_importer · ×4
  • re_importer::importer_rrd::decode_and_stream (cognitive 32) crates/data_flow/re_importer/src/importer_rrd.rs:164 — re_importer::importer_rrd::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.
  • re_importer::import_file::import (cognitive 18) crates/data_flow/re_importer/src/import_file.rs:136 — re_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.
  • re_importer::importer_lerobot::load_and_stream (cognitive 18) crates/data_flow/re_importer/src/importer_lerobot.rs:135 — re_importer::importer_lerobot::load_and_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 2 (6 pts), 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.
  • re_importer::importer_mcap::robot_description::extract_urdf_from_robot_descriptions (cognitive 17) crates/data_flow/re_importer/src/importer_mcap/robot_description.rs:17 — re_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.
D2 · Cognitive Complexity · re_tf · ×4
  • re_tf::transform_forest::transforms_at (cognitive 23) crates/store_app/re_tf/src/transform_forest.rs:719 — re_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.
  • re_tf::transform_queries::query_and_resolve_instance_poses_at_entity (cognitive 17) crates/store_app/re_tf/src/transform_queries.rs:333 — re_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.
  • re_tf::transform_queries::query_and_resolve_tree_transform_at_entity (cognitive 16) crates/store_app/re_tf/src/transform_queries.rs:190 — re_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.
  • re_tf::transform_resolution_cache::transform_cache_snapshot::latest_at (cognitive 16) crates/store_app/re_tf/src/transform_resolution_cache/transform_cache_snapshot.rs:139 — re_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.
D2 · Cognitive Complexity · re_mcap · ×4
  • re_mcap::decoders::protobuf::append_message_fields (cognitive 21) crates/data_flow/re_mcap/src/decoders/protobuf.rs:114 — re_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.
  • re_mcap::recover::build_chunk_index (cognitive 21) crates/data_flow/re_mcap/src/recover.rs:72 — re_mcap::recover::build_chunk_index has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 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.
  • re_mcap::parsers::ros2msg::sensor_msgs::point_cloud_2::add_field_value (cognitive 20) crates/data_flow/re_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs:213 — re_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.
  • re_mcap::recover::reconstruct_summary (cognitive 20) crates/data_flow/re_mcap/src/recover.rs:210 — re_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.
D2 · Cognitive Complexity · re_view · ×4
  • re_view::query::component_not_found_error (cognitive 21) crates/viewer_support/re_view/src/query.rs:183 — re_view::query::component_not_found_error has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_view::view_property_ui::view_property_ui_impl (cognitive 20) crates/viewer_support/re_view/src/view_property_ui.rs:81 — re_view::view_property_ui::view_property_ui_impl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_view::query::range_with_blueprint_resolved_data_polymorphic (cognitive 17) crates/viewer_support/re_view/src/query.rs:291 — re_view::query::range_with_blueprint_resolved_data_polymorphic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 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.
  • re_view::query::latest_at_with_blueprint_resolved_data_polymorphic (cognitive 16) crates/viewer_support/re_view/src/query.rs:475 — re_view::query::latest_at_with_blueprint_resolved_data_polymorphic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · re_chunk_optimizer · ×4
  • re_chunk_optimizer::executor::cut::cut_to_fit (cognitive 20) crates/store/re_chunk_optimizer/src/executor/cut.rs:30 — re_chunk_optimizer::executor::cut::cut_to_fit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • re_chunk_optimizer::executor::gop::decide_codec (cognitive 19) crates/store/re_chunk_optimizer/src/executor/gop.rs:38 — re_chunk_optimizer::executor::gop::decide_codec has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (9 pts), match/switch 3 (8 pts), if/else 1 (2 pts) (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.
  • re_chunk_optimizer::plan::plan (cognitive 19) crates/store/re_chunk_optimizer/src/plan.rs:225 — re_chunk_optimizer::plan::plan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 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.
  • re_chunk_optimizer::executor::accumulator::merge_and_emit (cognitive 17) crates/store/re_chunk_optimizer/src/executor/accumulator.rs:212 — re_chunk_optimizer::executor::accumulator::merge_and_emit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×4
  • Members sharing a duplicated core (5 members, 50+ identical tokens) crates/top/re_viewer/data/quick_start_guides/quick_start_connect.rs:5 — crates/top/re_viewer/data/quick_start_guides/quick_start_connect.rs:5-24 | crates/top/re_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/viewer_support/re_renderer/src/renderer/debug_overlay.rs:247 — crates/viewer_support/re_renderer/src/renderer/debug_overlay.rs:247-257 | crates/viewer_support/re_renderer/src/renderer/generic_skybox.rs:174-186 | crates/viewer_support/re_renderer/src/renderer/world_grid.rs:200-210 | crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:272-283 | crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs:579-590 — 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_support/re_renderer/src/renderer/depth_cloud.rs:379 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:379-500 | crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:654-818 | crates/viewer_support/re_renderer/src/renderer/lines.rs:627-798 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:653-849 | crates/viewer_support/re_renderer/src/renderer/volume.rs:199-337 — 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_support/re_renderer/src/renderer/depth_cloud.rs:379 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:379-500 | crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:654-818 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:653-849 | crates/viewer_support/re_renderer/src/renderer/volume.rs:199-337 | crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs:314-415 — 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 · Duplicated block (13–15 lines × 2) · ×4
  • Duplicated block (13–15 lines × 2) crates/viewer_support/re_view/src/view_highlights.rs:48 — crates/viewer_support/re_view/src/view_highlights.rs:48-60 | crates/viewer_support/re_view/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.
  • Duplicated block (13–15 lines × 2) crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:76 — crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:76-88 | crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:128-142 — both copies are in the same file, so extract the block into 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–15 lines × 2) docs/snippets/all/howto/any_batch_value_column_updates.rs:29 — docs/snippets/all/howto/any_batch_value_column_updates.rs:29-43 | docs/snippets/all/howto/any_values_column_updates.rs:31-43 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (13–15 lines × 2) docs/snippets/compare_snippet_output.py:98 — docs/snippets/compare_snippet_output.py:98-112 | scripts/run_all.py:353-365 — 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/compare_snippet_output.py:98` 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.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×4
  • Duplicated block (12 lines × 3) crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:406 — crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:406-417 | crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:478-489 | crates/store_app/re_datafusion/src/dataframe_query_provider/cpu_worker.rs:565-576 — 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/views/re_view_time_series/src/line_visualizer_system.rs:74 — crates/views/re_view_time_series/src/line_visualizer_system.rs:74-85 | crates/views/re_view_time_series/src/measurements_visualizer_system.rs:66-77 | crates/views/re_view_time_series/src/point_visualizer_system.rs:70-81 — before extracting anything, compare `crates/views/re_view_time_series/src/line_visualizer_system.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 3) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:756 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:756-769 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:770-781 | crates/viewer_support/re_renderer/src/renderer/volume.rs:275-286 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (12 lines × 3) crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:436 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:436-448 | crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:476-487 | crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs:333-345 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs` and `crates/viewer_support/re_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.
D4 · Code Duplication · Duplicated block (10–12 lines × 2) · ×4
  • Duplicated block (10–12 lines × 2) crates/data_flow/re_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:39 — crates/data_flow/re_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:39-50 | crates/data_flow/re_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.
  • Duplicated block (10–12 lines × 2) crates/viewer_support/re_viewer_context/src/app_context.rs:473 — crates/viewer_support/re_viewer_context/src/app_context.rs:473-484 | crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:182-191 — 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–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.
  • Duplicated block (10–12 lines × 2) examples/python/dataloader/prepare_dataset.py:109 — examples/python/dataloader/prepare_dataset.py:109-118 | 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.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×4
  • Duplicated block (9 lines × 3) crates/panels/re_selection_panel/src/selection_panel.rs:706 — crates/panels/re_selection_panel/src/selection_panel.rs:706-715 | crates/panels/re_selection_panel/src/visualizer_ui.rs:558-566 | crates/viewer_support/re_view/src/component_drop.rs:277-285 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
  • Duplicated block (9 lines × 3) crates/viewer_support/re_renderer/src/importer/ply.rs:477 — crates/viewer_support/re_renderer/src/importer/ply.rs:477-485 | crates/viewer_support/re_renderer/src/importer/ply.rs:501-509 | crates/viewer_support/re_renderer/src/importer/ply.rs:514-522 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (9 lines × 3) crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:380 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:380-388 | crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:444-452 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:654-662 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs` and `crates/viewer_support/re_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.
  • Duplicated block (9 lines × 3) rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py:116 — rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py:116-124 | rerun_py/rerun_sdk/rerun/archetypes/image_ext.py:208-216 | rerun_py/rerun_sdk/rerun/archetypes/segmentation_image_ext.py:49-57 — before extracting anything, compare `rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py` and `rerun_py/rerun_sdk/rerun/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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×4
  • Swallowed exception (caught, then discarded) rerun_py/rerun_sdk/rerun/_tracing_session.py:155 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rerun_py/rerun_sdk/rerun/_tracing_session.py:160 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rerun_py/rerun_sdk/rerun/_tracing_session.py:180 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) rerun_py/rerun_sdk/rerun/_tracing_session.py:190 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D1 · Cyclomatic Complexity · TimeControl · ×3
  • TimeControl::handle_time_command (cyclomatic 60) crates/viewer_support/re_viewer_context/src/time_control/command.rs:214 — TimeControl::handle_time_command has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • TimeControl::update (cyclomatic 25) crates/viewer_support/re_viewer_context/src/time_control/mod.rs:451 — 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_support/re_viewer_context/src/time_control/mod.rs:357 — 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.
D1 · Cyclomatic Complexity · ChunkStore · ×3
  • ChunkStore::insert_chunk_impl (cyclomatic 43) crates/store/re_chunk_store/src/writes.rs:113 — 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 19) crates/store/re_chunk_store/src/compaction_election.rs:22 — ChunkStore::find_and_elect_compaction_candidate 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.
  • ChunkStore::remove_chunk_from_virtual_indices (cyclomatic 17) crates/store/re_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.
D1 · Cyclomatic Complexity · re_video · ×3
  • re_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output (cyclomatic 26) crates/utils/re_video/src/decode/ffmpeg_cli/ffmpeg.rs:691 — re_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.
  • re_video::decode::av1::create_frame (cyclomatic 21) crates/utils/re_video/src/decode/av1.rs:197 — re_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.
  • re_video::demux::mp4::subsampling_mode (cyclomatic 16) crates/utils/re_video/src/demux/mp4.rs:302 — re_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.
D1 · Cyclomatic Complexity · re_viewer_context · ×3
  • re_viewer_context::view::visualizer_entity_subscriber::process_entity_components (cyclomatic 24) crates/viewer_support/re_viewer_context/src/view/visualizer_entity_subscriber.rs:183 — re_viewer_context::view::visualizer_entity_subscriber::process_entity_components 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.
  • re_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk (cyclomatic 20) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:2028 — re_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.
  • re_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image (cyclomatic 20) crates/viewer_support/re_viewer_context/src/gpu_bridge/image_to_gpu.rs:253 — re_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image 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. This is NOT this file's highest cyclomatic complexity: re_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.
D1 · Cyclomatic Complexity · re_selection_panel · ×3
  • re_selection_panel::selection_history_ui::history_button_ui (cyclomatic 22) crates/panels/re_selection_panel/src/selection_history_ui.rs:53 — re_selection_panel::selection_history_ui::history_button_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.
  • re_selection_panel::view_entity_picker::add_entities_line_ui (cyclomatic 20) crates/panels/re_selection_panel/src/view_entity_picker.rs:177 — re_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.
  • re_selection_panel::visualizer_ui::visualizer_components (cyclomatic 17) crates/panels/re_selection_panel/src/visualizer_ui.rs:216 — re_selection_panel::visualizer_ui::visualizer_components 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.
D1 · Cyclomatic Complexity · ViewerUrl · ×3
  • ViewerUrl::open (cyclomatic 21) crates/viewer_support/re_viewer_context/src/viewer_url.rs:708 — ViewerUrl::open has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • ViewerUrl::parse_with_options (cyclomatic 19) crates/viewer_support/re_viewer_context/src/viewer_url.rs:190 — ViewerUrl::parse_with_options 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.
  • ViewerUrl::sharable_url (cyclomatic 19) crates/viewer_support/re_viewer_context/src/viewer_url.rs:527 — ViewerUrl::sharable_url 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.
D1 · Cyclomatic Complexity · re_ui · ×3
  • re_ui::drag_and_drop::find_drop_target (cyclomatic 20) crates/viewer_support/re_ui/src/drag_and_drop.rs:178 — re_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.
  • re_ui::notifications::show_notification (cyclomatic 20) crates/viewer_support/re_ui/src/notifications.rs:660 — re_ui::notifications::show_notification 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.
  • re_ui::text_edit::autocomplete_text_edit (cyclomatic 19) crates/viewer_support/re_ui/src/text_edit.rs:196 — re_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.
D1 · Cyclomatic Complexity · Chunk · ×3
  • Chunk::sanity_check (cyclomatic 17) crates/store/re_chunk/src/chunk.rs:1822 — Chunk::sanity_check 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.
  • Chunk::earliest_at (cyclomatic 17) crates/store/re_chunk/src/earliest_at.rs:84 — Chunk::earliest_at 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.
  • Chunk::latest_at (cyclomatic 16) crates/store/re_chunk/src/latest_at.rs:109 — Chunk::latest_at 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.
D2 · Cognitive Complexity · re_redap_browser · ×3
  • re_redap_browser::servers::error_ui (cognitive 54) crates/panels/re_redap_browser/src/servers/mod.rs:391 — re_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.
  • re_redap_browser::server_modal::auth_ui (cognitive 19) crates/panels/re_redap_browser/src/server_modal.rs:419 — re_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.
  • re_redap_browser::folder_card_ui::collect_cards (cognitive 17) crates/panels/re_redap_browser/src/folder_card_ui.rs:122 — re_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.
D2 · Cognitive Complexity · re_time_panel · ×3
  • re_time_panel::time_selection_ui::loop_selection_ui (cognitive 52) crates/panels/re_time_panel/src/time_selection_ui.rs:55 — re_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.
  • re_time_panel::data_density_graph::paint_loaded_indicator_bar (cognitive 26) crates/panels/re_time_panel/src/data_density_graph.rs:422 — re_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.
  • re_time_panel::data_density_graph::build_density_graph (cognitive 17) crates/panels/re_time_panel/src/data_density_graph.rs:585 — re_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.
D2 · Cognitive Complexity · re_component_ui · ×3
  • re_component_ui::variant_uis::redap_uri_button::redap_uri_button (cognitive 45) crates/viewer_support/re_component_ui/src/variant_uis/redap_uri_button.rs:18 — re_component_ui::variant_uis::redap_uri_button::redap_uri_button has cognitive complexity 45 (threshold 15). Drivers by points: if/else 31 (41 pts), boolean chains 2, match/switch 2 (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.
  • re_component_ui::variant_uis::flag::flag_button (cognitive 19) crates/viewer_support/re_component_ui/src/variant_uis/flag.rs:37 — re_component_ui::variant_uis::flag::flag_button has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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.
  • re_component_ui::encoding_uis::enum_ui::edit_view_enum_impl (cognitive 18) crates/viewer_support/re_component_ui/src/encoding_uis/enum_ui.rs:65 — re_component_ui::encoding_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.
D2 · Cognitive Complexity · ChunkFetcher · ×3
  • ChunkFetcher::fetch_inner (cognitive 44) crates/store_app/re_entity_db/src/rrd_manifest_index/chunk_prioritizer.rs:1196 — 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 34) crates/store_app/re_entity_db/src/rrd_manifest_index/chunk_prioritizer.rs:885 — ChunkFetcher::next_chunk has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • ChunkFetcher::high_prio_chunk_stage (cognitive 21) crates/store_app/re_entity_db/src/rrd_manifest_index/chunk_prioritizer.rs:1002 — 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.
D2 · Cognitive Complexity · re_grpc_server · ×3
  • re_grpc_server::spawn_from_rx_set (cognitive 27) crates/data_flow/re_grpc_server/src/lib.rs:568 — re_grpc_server::spawn_from_rx_set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 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.
  • re_grpc_server::serve_from_channel (cognitive 21) crates/data_flow/re_grpc_server/src/lib.rs:486 — re_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.
  • re_grpc_server::spawn_with_recv_and_services (cognitive 19) crates/data_flow/re_grpc_server/src/lib.rs:671 — re_grpc_server::spawn_with_recv_and_services has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · re_view_tensor · ×3
  • re_view_tensor::dimension_mapping::find_width_height_dim_indices (cognitive 24) crates/views/re_view_tensor/src/dimension_mapping.rs:210 — re_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.
  • re_view_tensor::view_class::paint_axis_names (cognitive 24) crates/views/re_view_tensor/src/view_class.rs:495 — re_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.
  • re_view_tensor::tensor_dimension_mapper::dimension_mapping_ui (cognitive 17) crates/views/re_view_tensor/src/tensor_dimension_mapper.rs:171 — re_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.
D2 · Cognitive Complexity · ViewportBlueprint · ×3
  • ViewportBlueprint::save_tree_as_containers (cognitive 22) crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:826 — 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_support/re_viewport_blueprint/src/viewport_blueprint.rs:700 — 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_support/re_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 · Duplicated block (22 lines × 2) · ×3
  • Duplicated block (22 lines × 2) crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:160 — crates/store/re_sdk_types/src/archetypes/points2d_ext.rs:160-181 | crates/store/re_sdk_types/src/archetypes/points3d_ext.rs:165-186 — before extracting anything, compare `crates/store/re_sdk_types/src/archetypes/points2d_ext.rs` and `crates/store/re_sdk_types/src/archetypes/points3d_ext.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 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 (22 lines × 2) crates/viewer_support/re_dataframe_ui/src/filters/numerical.rs:155 — crates/viewer_support/re_dataframe_ui/src/filters/numerical.rs:155-176 | crates/viewer_support/re_dataframe_ui/src/filters/numerical.rs:263-284 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (22 lines × 2) crates/viewer_support/re_ui/src/command/command_kind.rs:220 — crates/viewer_support/re_ui/src/command/command_kind.rs:220-241 | crates/viewer_support/re_ui/src/command/command_kind.rs:325-346 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×3
  • Duplicated block (20 lines × 2) crates/store_app/re_query/src/bin/range_zip.rs:129 — crates/store_app/re_query/src/bin/range_zip.rs:129-148 | crates/store_app/re_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_support/re_renderer_examples/outlines.rs:122 — crates/viewer_support/re_renderer_examples/outlines.rs:122-141 | crates/viewer_support/re_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.
  • 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.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×3
  • Duplicated block (19 lines × 2) crates/viewer_support/re_ui/src/command/command_kind.rs:173 — crates/viewer_support/re_ui/src/command/command_kind.rs:173-191 | crates/viewer_support/re_ui/src/command/command_kind.rs:281-299 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:306 — crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:306-324 | crates/viewer_support/re_viewer_context/src/blueprint_helpers.rs:351-369 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) scripts/append_web_viewer.py:65 — scripts/append_web_viewer.py:65-83 | scripts/create_web_viewer_zip.py:60-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.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×3
  • Duplicated block (18 lines × 2) crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:135 — crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:135-152 | crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:180-197 — both copies are in the same file, so extract the block into 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_app/re_datafusion/src/dataframe_query_provider.rs:893 — crates/store_app/re_datafusion/src/dataframe_query_provider.rs:893-910 | crates/store_app/re_datafusion/src/dataframe_query_provider_wasm.rs:454-471 — 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/views/re_view_spatial/src/visualizers/points2d.rs:108 — crates/views/re_view_spatial/src/visualizers/points2d.rs:108-125 | crates/views/re_view_spatial/src/visualizers/points3d.rs:290-307 — before extracting anything, compare `crates/views/re_view_spatial/src/visualizers/points2d.rs` and `crates/views/re_view_spatial/src/visualizers/points3d.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.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×3
  • Duplicated block (5 lines × 3) crates/views/re_view_time_series/src/point_visualizer_system.rs:333 — crates/views/re_view_time_series/src/point_visualizer_system.rs:333-340 | crates/views/re_view_time_series/src/series_query.rs:216-220 | crates/views/re_view_time_series/src/series_query.rs:383-387 — 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 (5 lines × 3) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:670 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:670-696 | crates/viewer_support/re_renderer/src/renderer/lines.rs:632-636 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:658-662 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/lines.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.
  • Duplicated block (5 lines × 3) crates/viewer_support/re_renderer/src/colormap.rs:320 — crates/viewer_support/re_renderer/src/colormap.rs:320-324 | crates/viewer_support/re_renderer/src/colormap.rs:338-342 | crates/viewer_support/re_renderer/src/colormap.rs:382-386 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×3
  • Duplicated block (6 lines × 3) crates/viewer_support/re_component_ui/src/geo_line_string.rs:10 — crates/viewer_support/re_component_ui/src/geo_line_string.rs:10-15 | crates/viewer_support/re_component_ui/src/line_strip.rs:12-17 | crates/viewer_support/re_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.
  • 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.
  • Duplicated block (6 lines × 3) docs/snippets/all/archetypes/asset3d_simple.rs:6 — docs/snippets/all/archetypes/asset3d_simple.rs:6-11 | docs/snippets/all/archetypes/asset_audio_simple.rs:6-12 | 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 all 3 call sites, so a change lands once.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×3
  • Recursive walk over a caller-supplied document has no depth cap skills/investigate-puffin/compare_traces.py:43 — `walk` is public and takes `node: dict[str, Any]` from its caller, and it calls itself at line 43 (`walk`) with a piece of `node` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. 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. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` 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 skills/investigate-puffin/find_scopes.py:37 — `walk` is public and takes `node: dict[str, Any]` from its caller, and it calls itself at line 37 (`walk`) with a piece of `node` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. 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. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` 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 scripts/render_d2.py:135 — `extract_segments` is public and takes `node: ET.Element` from its caller, and it calls itself at line 135 (`extract_segments`) with a piece of `node` — and nowhere in `extract_segments` is there a depth parameter, a descent counter, or any other cap. 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. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `extract_segments` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
X2 · Cancellation propagation · Async function without AbortSignal · ×3
  • Async function without AbortSignal: url_exists rerun_notebook/src/rerun_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 rerun_js/web-viewer/index.ts:865 — `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 rerun_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 })`.
D1 · Cyclomatic Complexity · QueryCache · ×2
  • QueryCache::on_events (cyclomatic 37) crates/store_app/re_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_app/re_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.
D1 · Cyclomatic Complexity · Expr · ×2
  • Expr::eval (cyclomatic 26) crates/store/re_lenses_core/src/selector/eval.rs:420 — Expr::eval has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • Expr::fmt (cyclomatic 17) crates/store/re_lenses_core/src/selector/parser.rs:188 — Expr::fmt has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · re_agent_ui · ×2
  • re_agent_ui::ui::elicitation_ui::field_ui (cyclomatic 22) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs:194 — re_agent_ui::ui::elicitation_ui::field_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.
  • re_agent_ui::ui::chat_ui::permissions_ui (cyclomatic 17) crates/panels/re_agent_ui/src/ui/chat_ui.rs:680 — re_agent_ui::ui::chat_ui::permissions_ui has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · ChunkFetcher · ×2
  • ChunkFetcher::next_chunk (cyclomatic 22) crates/store_app/re_entity_db/src/rrd_manifest_index/chunk_prioritizer.rs:885 — 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_app/re_entity_db/src/rrd_manifest_index/chunk_prioritizer.rs:1196 — 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.
D1 · Cyclomatic Complexity · re_lenses_core · ×2
  • re_lenses_core::execute::execute (cyclomatic 20) crates/store/re_lenses_core/src/execute.rs:333 — re_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.
  • re_lenses_core::plan::plan (cyclomatic 16) crates/store/re_lenses_core/src/plan.rs:95 — re_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.
D1 · Cyclomatic Complexity · re_sdk · ×2
  • re_sdk::spawn::spawn (cyclomatic 20) crates/top/re_sdk/src/spawn.rs:205 — re_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.
  • re_sdk::recording_stream::forwarding_thread (cyclomatic 16) crates/top/re_sdk/src/recording_stream.rs:1644 — re_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.
D1 · Cyclomatic Complexity · SegmentUrlUdf · ×2
  • SegmentUrlUdf::return_type (cyclomatic 19) rerun_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) rerun_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.
D1 · Cyclomatic Complexity · re_sorbet · ×2
  • re_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components (cyclomatic 18) crates/store/re_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:29 — re_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.
  • re_sorbet::dataframe_to_chunks::stamp_dataframe_metadata (cyclomatic 16) crates/store/re_sorbet/src/dataframe_to_chunks.rs:407 — re_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.
D1 · Cyclomatic Complexity · VideoPlayer · ×2
  • VideoPlayer::frame_at (cyclomatic 18) crates/utils/re_video/src/player/mod.rs:496 — VideoPlayer::frame_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.
  • VideoPlayer::enqueue_samples (cyclomatic 18) crates/utils/re_video/src/player/mod.rs:638 — VideoPlayer::enqueue_samples 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.
D1 · Cyclomatic Complexity · ImageInfo · ×2
  • ImageInfo::to_dynamic_image (cyclomatic 18) crates/viewer_support/re_viewer_context/src/image_info.rs:361 — 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.
  • ImageInfo::get_xyc (cyclomatic 17) crates/viewer_support/re_viewer_context/src/image_info.rs:270 — ImageInfo::get_xyc 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.
D1 · Cyclomatic Complexity · re_renderer · ×2
  • re_renderer::importer::gltf::import_mesh (cyclomatic 16) crates/viewer_support/re_renderer/src/importer/gltf.rs:173 — re_renderer::importer::gltf::import_mesh 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.
  • re_renderer::importer::ply::parse_ply_mesh (cyclomatic 16) crates/viewer_support/re_renderer/src/importer/ply.rs:427 — re_renderer::importer::ply::parse_ply_mesh 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.
D2 · Cognitive Complexity · QueryCache · ×2
  • QueryCache::on_events (cognitive 99) crates/store_app/re_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_app/re_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.
D2 · Cognitive Complexity · CommandPalette · ×2
  • CommandPalette::alternatives_ui (cognitive 49) crates/viewer_support/re_ui/src/command_palette.rs:433 — CommandPalette::alternatives_ui has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (38 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.
  • CommandPalette::window_content_ui (cognitive 20) crates/viewer_support/re_ui/src/command_palette.rs:297 — CommandPalette::window_content_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · SplitCommand · ×2
  • SplitCommand::run (cognitive 48) crates/top/rerun/src/commands/rrd/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/rerun/src/commands/rrd/split.rs:537 — 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.
D2 · Cognitive Complexity · SeriesPointsSystem · ×2
  • SeriesPointsSystem::load_series (cognitive 43) crates/views/re_view_time_series/src/point_visualizer_system.rs:189 — 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/views/re_view_time_series/src/point_visualizer_system.rs:112 — 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.
D2 · Cognitive Complexity · re_arrow_util · ×2
  • re_arrow_util::format::format_dataframe_without_metadata (cognitive 38) crates/utils/re_arrow_util/src/format.rs:335 — re_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.
  • re_arrow_util::compare::ensure_buffers_equal (cognitive 19) crates/utils/re_arrow_util/src/compare.rs:61 — re_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.
D2 · Cognitive Complexity · SpatialView3D · ×2
  • SpatialView3D::view_3d (cognitive 38) crates/views/re_view_spatial/src/ui_3d.rs:126 — 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 18) crates/views/re_view_spatial/src/view_3d.rs:66 — SpatialView3D::on_register has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · DataFusionTableWidget · ×2
  • DataFusionTableWidget::table_ui (cognitive 37) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:914 — DataFusionTableWidget::table_ui has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (27 pts), match/switch 6 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • DataFusionTableWidget::show (cognitive 19) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:641 — DataFusionTableWidget::show has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (3 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.
D2 · Cognitive Complexity · RawRrdManifest · ×2
  • RawRrdManifest::check_index_columns_are_correct (cognitive 35) crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1104 — RawRrdManifest::check_index_columns_are_correct has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 3 (10 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • RawRrdManifest::check_manifest_schema_matches_sorbet_schema (cognitive 31) crates/store/re_chunk_index/src/raw_rrd_manifest.rs:1237 — RawRrdManifest::check_manifest_schema_matches_sorbet_schema has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 5 (10 pts), 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.
D2 · Cognitive Complexity · re_sdk · ×2
  • re_sdk::spawn::spawn (cognitive 35) crates/top/re_sdk/src/spawn.rs:205 — re_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.
  • re_sdk::recording_stream::forwarding_thread (cognitive 18) crates/top/re_sdk/src/recording_stream.rs:1644 — re_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.
D2 · Cognitive Complexity · SegmentUrlUdf · ×2
  • SegmentUrlUdf::invoke_with_args (cognitive 34) rerun_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) rerun_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.
D2 · Cognitive Complexity · Transcript · ×2
  • Transcript::to_markdown (cognitive 32) crates/utils/re_agent/src/transcript.rs:458 — Transcript::to_markdown has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (10 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Transcript::to_plain_text (cognitive 26) crates/utils/re_agent/src/transcript.rs:393 — Transcript::to_plain_text has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), match/switch 2 (6 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.
D2 · Cognitive Complexity · re_sorbet · ×2
  • re_sorbet::dataframe_to_chunks::stamp_dataframe_metadata (cognitive 31) crates/store/re_sorbet/src/dataframe_to_chunks.rs:407 — re_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.
  • re_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components (cognitive 21) crates/store/re_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:29 — re_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.
D2 · Cognitive Complexity · QuotedObject · ×2
  • QuotedObject::from_union (cognitive 30) crates/build/re_types_builder/src/codegen/cpp/mod.rs:990 — 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.
  • QuotedObject::from_archetype (cognitive 16) crates/build/re_types_builder/src/codegen/cpp/mod.rs:450 — QuotedObject::from_archetype has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · SelectionPanel · ×2
  • SelectionPanel::item_ui (cognitive 29) crates/panels/re_selection_panel/src/selection_panel.rs:189 — SelectionPanel::item_ui has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 2, match/switch 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.
  • SelectionPanel::view_selection_ui (cognitive 18) crates/panels/re_selection_panel/src/selection_panel.rs:372 — SelectionPanel::view_selection_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TilesDelegate · ×2
  • TilesDelegate::reports_button (cognitive 28) crates/panels/re_viewport/src/viewport_ui.rs:831 — 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/panels/re_viewport/src/viewport_ui.rs:620 — 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.
D2 · Cognitive Complexity · Expr · ×2
  • Expr::eval (cognitive 28) crates/store/re_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/re_lenses_core/src/selector/parser.rs:188 — 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.
D2 · Cognitive Complexity · re_log_encoding · ×2
  • re_log_encoding::rrd::stream_from_http::stream_from_http (cognitive 28) crates/store/re_log_encoding/src/rrd/stream_from_http.rs:45 — re_log_encoding::rrd::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.
  • re_log_encoding::rrd::stream_from_http::web_decode::decode_rrd_async (cognitive 16) crates/store/re_log_encoding/src/rrd/stream_from_http.rs:166 — re_log_encoding::rrd::stream_from_http::web_decode::decode_rrd_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.
D2 · Cognitive Complexity · VideoPlayer · ×2
  • VideoPlayer::frame_at (cognitive 28) crates/utils/re_video/src/player/mod.rs:496 — VideoPlayer::frame_at has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • VideoPlayer::enqueue_samples (cognitive 27) crates/utils/re_video/src/player/mod.rs:638 — VideoPlayer::enqueue_samples has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, 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.
D2 · Cognitive Complexity · ResolvedEntityPathFilter · ×2
  • ResolvedEntityPathFilter::is_superset_of (cognitive 27) crates/store/re_log_types/src/path/entity_path_filter.rs:709 — 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/re_log_types/src/path/entity_path_filter.rs:778 — 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.
D2 · Cognitive Complexity · EntityPathPart · ×2
  • EntityPathPart::parse_forgiving_with_warning (cognitive 27) crates/store/re_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/re_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.
D2 · Cognitive Complexity · re_view_state_timeline · ×2
  • re_view_state_timeline::view_class::compute_render_items (cognitive 26) crates/views/re_view_state_timeline/src/view_class.rs:619 — re_view_state_timeline::view_class::compute_render_items has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 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.
  • re_view_state_timeline::view_class::show_group (cognitive 25) crates/views/re_view_state_timeline/src/view_class.rs:951 — re_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.
D2 · Cognitive Complexity · CachedTransformsForTimeline · ×2
  • CachedTransformsForTimeline::remove_chunk (cognitive 24) crates/store_app/re_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_app/re_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.
D2 · Cognitive Complexity · VideoStreamCache · ×2
  • VideoStreamCache::handle_store_event (cognitive 24) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:313 — 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_support/re_viewer_context/src/cache/video_stream_cache.rs:1508 — 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.
D2 · Cognitive Complexity · re_log_types · ×2
  • re_log_types::path::entity_path_filter::split_whitespace_smart (cognitive 23) crates/store/re_log_types/src/path/entity_path_filter.rs:210 — re_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.
  • re_log_types::path::parse_path::entity_path_parts_from_tokens_strict (cognitive 17) crates/store/re_log_types/src/path/parse_path.rs:269 — re_log_types::path::parse_path::entity_path_parts_from_tokens_strict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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.
D2 · Cognitive Complexity · FilterState · ×2
  • FilterState::filter_bar_ui (cognitive 23) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs:428 — FilterState::filter_bar_ui has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, loops 2, 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.
  • FilterState::section_title_ui_impl (cognitive 16) crates/viewer_support/re_ui/src/filter_widget.rs:128 — FilterState::section_title_ui_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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.
D2 · Cognitive Complexity · re_memory_view · ×2
  • re_memory_view::flamegraph::render_flamegraph_node (cognitive 22) crates/panels/re_memory_view/src/flamegraph.rs:266 — re_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.
  • re_memory_view::flamegraph::flamegraph_ui (cognitive 18) crates/panels/re_memory_view/src/flamegraph.rs:156 — re_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.
D2 · Cognitive Complexity · re_lenses · ×2
  • re_lenses::semantic::foxglove::packed_element_field::extract_voxel_indices (cognitive 21) crates/data_flow/re_lenses/src/semantic/foxglove/packed_element_field.rs:232 — re_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.
  • re_lenses::semantic::ros2msg::ros_map_helpers::ros_map_buffer_to_image_buffer (cognitive 16) crates/data_flow/re_lenses/src/semantic/ros2msg/ros_map_helpers.rs:80 — re_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.
D2 · Cognitive Complexity · re_redap_client · ×2
  • re_redap_client::grpc::stream_blueprint_and_segment_from_server (cognitive 19) crates/data_flow/re_redap_client/src/grpc.rs:815 — re_redap_client::grpc::stream_blueprint_and_segment_from_server has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 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.
  • re_redap_client::grpc::stream_segment_from_server (cognitive 16) crates/data_flow/re_redap_client/src/grpc.rs:946 — re_redap_client::grpc::stream_segment_from_server has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 4 (5 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.
D2 · Cognitive Complexity · ViewBuilder · ×2
  • ViewBuilder::new (cognitive 19) crates/viewer_support/re_renderer/src/view_builder.rs:445 — ViewBuilder::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 4 (5 pts), boolean chains 1, 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.
  • ViewBuilder::draw (cognitive 19) crates/viewer_support/re_renderer/src/view_builder.rs:751 — ViewBuilder::draw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · Medium IaC · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (32 lines × 2) · ×2
  • Duplicated block (32 lines × 2) crates/panels/re_redap_browser/src/entries.rs:441 — crates/panels/re_redap_browser/src/entries.rs:441-472 | crates/panels/re_redap_browser/src/entries.rs:539-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.
  • Duplicated block (32 lines × 2) rerun_py/rerun_sdk/rerun/chunk/_chunk_store.py:95 — rerun_py/rerun_sdk/rerun/chunk/_chunk_store.py:95-126 | rerun_py/rerun_sdk/rerun/chunk/_lazy_store.py:85-116 — 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.
D4 · Code Duplication · Duplicated block (31 lines × 2) · ×2
  • Duplicated block (31 lines × 2) crates/viewer_support/re_ui/src/command/recording_command.rs:394 — crates/viewer_support/re_ui/src/command/recording_command.rs:394-424 | crates/viewer_support/re_ui/src/command/ui_command.rs:501-531 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (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.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×2
  • Duplicated block (25 lines × 2) crates/store_app/re_query/src/bin/clamped_zip.rs:316 — crates/store_app/re_query/src/bin/clamped_zip.rs:316-340 | crates/store_app/re_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.
  • Duplicated block (25 lines × 2) crates/views/re_view_time_series/src/line_visualizer_system.rs:78 — crates/views/re_view_time_series/src/line_visualizer_system.rs:78-102 | crates/views/re_view_time_series/src/point_visualizer_system.rs:74-98 — before extracting anything, compare `crates/views/re_view_time_series/src/line_visualizer_system.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×2
  • Duplicated block (24 lines × 2) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:226 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:226-249 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:221-244 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 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) 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.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×2
  • Duplicated block (23 lines × 2) crates/panels/re_selection_panel/src/view_entity_picker.rs:333 — crates/panels/re_selection_panel/src/view_entity_picker.rs:333-355 | crates/panels/re_time_panel/src/streams_tree_data.rs:110-132 — before extracting anything, compare `crates/panels/re_selection_panel/src/view_entity_picker.rs` and `crates/panels/re_time_panel/src/streams_tree_data.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. 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 (23 lines × 2) crates/store/re_chunk_store/src/gc.rs:532 — crates/store/re_chunk_store/src/gc.rs:532-554 | crates/store/re_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.
D4 · Code Duplication · Duplicated block (15 lines × 4) · ×2
  • Duplicated block (15 lines × 4) crates/top/re_viewer/src/app_state.rs:748 — crates/top/re_viewer/src/app_state.rs:748-762 | crates/top/re_viewer/src/app_state.rs:789-803 | crates/top/re_viewer/src/app_state.rs:854-868 | crates/top/re_viewer/src/app_state.rs:887-901 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (15 lines × 4) crates/views/re_view_spatial/src/visualizers/boxes3d.rs:218 — crates/views/re_view_spatial/src/visualizers/boxes3d.rs:218-232 | crates/views/re_view_spatial/src/visualizers/capsules3d.rs:243-257 | crates/views/re_view_spatial/src/visualizers/cylinders3d.rs:239-253 | crates/views/re_view_spatial/src/visualizers/ellipsoids.rs:225-239 — 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.
D4 · Code Duplication · Duplicated block (12–14 lines × 2) · ×2
  • Duplicated block (12–14 lines × 2) crates/panels/re_time_panel/src/time_panel.rs:916 — crates/panels/re_time_panel/src/time_panel.rs:916-929 | crates/panels/re_time_panel/src/time_panel.rs:1110-1121 — both copies are in the same file, so extract the block into 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–14 lines × 2) crates/views/re_view_spatial/src/view_3d.rs:573 — crates/views/re_view_spatial/src/view_3d.rs:573-584 | crates/views/re_view_text_log/src/view_class.rs:491-504 — 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.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×2
  • Duplicated block (13–14 lines × 2) crates/store_app/re_query/src/latest_at.rs:106 — crates/store_app/re_query/src/latest_at.rs:106-119 | crates/store_app/re_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) examples/python/droid_semantic_search/ingest.py:53 — examples/python/droid_semantic_search/ingest.py:53-66 | 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:53` 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.
D4 · Code Duplication · Duplicated block (12–13 lines × 2) · ×2
  • Duplicated block (12–13 lines × 2) crates/store/re_log_types/src/index/time_point.rs:210 — crates/store/re_log_types/src/index/time_point.rs:210-221 | crates/store/re_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.
  • Duplicated block (12–13 lines × 2) rerun_py/src/trace_context.rs:97 — rerun_py/src/trace_context.rs:97-109 | rerun_py/src/tracing_session.rs:72-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.
D4 · Code Duplication · Duplicated block (10–11 lines × 3) · ×2
  • Duplicated block (10–11 lines × 3) crates/data_flow/re_grpc_client/src/lib.rs:57 — crates/data_flow/re_grpc_client/src/lib.rs:57-67 | crates/data_flow/re_grpc_server/src/lib.rs:139-149 | crates/data_flow/re_redap_client/src/lib.rs:166-175 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
  • Duplicated block (10–11 lines × 3) rerun_py/src/catalog/layer.rs:48 — rerun_py/src/catalog/layer.rs:48-57 | rerun_py/src/catalog/segment.rs:93-103 | rerun_py/src/catalog/segment.rs:117-127 — 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.
D4 · Code Duplication · Duplicated block (9–11 lines × 2) · ×2
  • Duplicated block (9–11 lines × 2) crates/data_flow/re_grpc_server/src/lib.rs:495 — crates/data_flow/re_grpc_server/src/lib.rs:495-503 | crates/data_flow/re_grpc_server/src/lib.rs:583-593 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9–11 lines × 2) 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.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×2
  • Duplicated block (10 lines × 4) crates/store/re_chunk/src/unit_chunk.rs:101 — crates/store/re_chunk/src/unit_chunk.rs:101-110 | crates/store/re_chunk/src/unit_chunk.rs:154-163 | crates/store/re_chunk/src/unit_chunk.rs:391-400 | crates/store/re_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.
  • Duplicated block (10 lines × 4) crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:474 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:474-483 | crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:790-799 | crates/viewer_support/re_renderer/src/renderer/lines.rs:762-771 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:819-828 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×2
  • Duplicated block (26 lines × 2) rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py:118 — rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py:118-143 | rerun_py/rerun_sdk/rerun/archetypes/segmentation_image_ext.py:51-76 — before extracting anything, compare `rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py` and `rerun_py/rerun_sdk/rerun/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 `rerun_py/rerun_sdk/rerun/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 (26 lines × 2) crates/viewer_support/re_renderer_examples/depth_cloud.rs:122 — crates/viewer_support/re_renderer_examples/depth_cloud.rs:122-147 | crates/viewer_support/re_renderer_examples/depth_cloud.rs:204-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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.1 · ×1
  • Low contrast colour pair in CSS (4.1:1) rerun_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 !important on background-color: #1982d2 — 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1
  • Accessibility enforcement below the top rung — No accessibility enforcement found — your oxlint config does not list the `jsx-a11y` plugin (its a11y rules are off until it does) and there's no axe/pa11y/Lighthouse in tests or CI. Start by enabling that plugin to catch issues at author time. What was searched, so you can tell an absence from a miss: the 16 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
D1 · Cyclomatic Complexity · lint.lint_line (cyclomatic 93) · ×1
  • lint.lint_line (cyclomatic 93) scripts/lint.py:194 — lint.lint_line has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · re_types_core · ×1
  • re_types_core::reflection::generic_placeholder_for_datatype (cyclomatic 49) crates/store/re_types_core/src/reflection.rs:92 — re_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.
D1 · Cyclomatic Complexity · AppState · ×1
  • AppState::show (cyclomatic 41) crates/top/re_viewer/src/app_state.rs:303 — AppState::show 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.
D1 · Cyclomatic Complexity · TimeSeriesView · ×1
  • TimeSeriesView::ui (cyclomatic 41) crates/views/re_view_time_series/src/view_class.rs:397 — TimeSeriesView::ui 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.
D1 · Cyclomatic Complexity · compare_snippet_output.main (cyclomatic 41) · ×1
  • 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.
D1 · Cyclomatic Complexity · generate_changelog.main (cyclomatic 40) · ×1
  • generate_changelog.main (cyclomatic 40) scripts/generate_changelog.py:413 — generate_changelog.main 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.
D1 · Cyclomatic Complexity · lint.lint_file (cyclomatic 39) · ×1
  • lint.lint_file (cyclomatic 39) scripts/lint.py:1722 — lint.lint_file 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.
D1 · Cyclomatic Complexity · DurationFormatOptions · ×1
  • DurationFormatOptions::format_nanos (cyclomatic 38) crates/utils/re_format/src/duration.rs:113 — DurationFormatOptions::format_nanos 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.
D1 · Cyclomatic Complexity · re_protos · ×1
  • re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy (cyclomatic 34) crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.legacy_adapter.rs:53 — re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy 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.
D1 · Cyclomatic Complexity · ListItem · ×1
  • ListItem::ui (cyclomatic 34) crates/viewer_support/re_ui/src/list_item/list_item.rs:510 — ListItem::ui has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · BarChartView · ×1
  • BarChartView::ui (cyclomatic 34) crates/views/re_view_bar_chart/src/view_class.rs:139 — 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.
D1 · Cyclomatic Complexity · RedapServers · ×1
  • RedapServers::handle_command (cyclomatic 33) crates/panels/re_redap_browser/src/servers/mod.rs:1083 — RedapServers::handle_command has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ServerModal · ×1
  • ServerModal::ui (cyclomatic 31) crates/panels/re_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.
D1 · Cyclomatic Complexity · ViewportUi · ×1
  • ViewportUi::viewport_ui (cyclomatic 31) crates/panels/re_viewport/src/viewport_ui.rs:58 — 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.
D1 · Cyclomatic Complexity · StateTimelineView · ×1
  • StateTimelineView::ui (cyclomatic 30) crates/views/re_view_state_timeline/src/view_class.rs:254 — StateTimelineView::ui has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · VideoFrameDecoder._decode_run (cyclomatic 30) · ×1
  • VideoFrameDecoder._decode_run (cyclomatic 30) rerun_py/rerun_sdk/rerun/experimental/dataloader/decoders/_video.py:385 — VideoFrameDecoder._decode_run has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ImageExt.__init__ (cyclomatic 29) · ×1
  • ImageExt.__init__ (cyclomatic 29) rerun_py/rerun_sdk/rerun/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.
D1 · Cyclomatic Complexity · DataFusionTableWidget · ×1
  • DataFusionTableWidget::table_ui (cyclomatic 28) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:914 — DataFusionTableWidget::table_ui 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.
D1 · Cyclomatic Complexity · ItemCollection · ×1
  • ItemCollection::copy_to_clipboard (cyclomatic 28) crates/viewer_support/re_viewer_context/src/item_collection.rs:188 — 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.
D1 · Cyclomatic Complexity · SpatialView3D · ×1
  • SpatialView3D::view_3d (cyclomatic 28) crates/views/re_view_spatial/src/ui_3d.rs:126 — 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.
D1 · Cyclomatic Complexity · re_time_panel · ×1
  • re_time_panel::time_selection_ui::loop_selection_ui (cyclomatic 27) crates/panels/re_time_panel/src/time_selection_ui.rs:55 — re_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.
D1 · Cyclomatic Complexity · AgentSession · ×1
  • AgentSession::handle_event (cyclomatic 27) crates/utils/re_agent/src/session.rs:780 — AgentSession::handle_event has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Telemetry · ×1
  • Telemetry::init (cyclomatic 27) crates/utils/re_perf_telemetry/src/telemetry.rs:512 — Telemetry::init has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · re_view_audio · ×1
  • re_view_audio::waveform::waveform_ui (cyclomatic 27) crates/views/re_view_audio/src/waveform.rs:80 — re_view_audio::waveform::waveform_ui has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Objects · ×1
  • Objects::validate (cyclomatic 26) crates/build/re_types_builder/src/objects/mod.rs:31 — Objects::validate 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.
D1 · Cyclomatic Complexity · App · ×1
  • App::with_commands (cyclomatic 26) crates/top/re_viewer/src/app/mod.rs:228 — App::with_commands has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · StatsCommand · ×1
  • StatsCommand::run (cyclomatic 26) crates/top/rerun/src/commands/rrd/stats.rs:36 — StatsCommand::run has cyclomatic complexity 26 (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.
D1 · Cyclomatic Complexity · re_viewport_blueprint · ×1
  • re_viewport_blueprint::viewport_blueprint::apply_viewport_command (cyclomatic 26) crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:977 — re_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.
D1 · Cyclomatic Complexity · sync_release_assets.fetch_binary_assets (cyclomatic 26) · ×1
  • sync_release_assets.fetch_binary_assets (cyclomatic 26) scripts/ci/sync_release_assets.py:38 — sync_release_assets.fetch_binary_assets 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.
D1 · Cyclomatic Complexity · CrateVersion · ×1
  • CrateVersion::try_parse (cyclomatic 25) crates/utils/re_build_info/src/crate_version.rs:363 — 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.
D1 · Cyclomatic Complexity · re_component_ui · ×1
  • re_component_ui::variant_uis::redap_uri_button::redap_uri_button (cyclomatic 25) crates/viewer_support/re_component_ui/src/variant_uis/redap_uri_button.rs:18 — re_component_ui::variant_uis::redap_uri_button::redap_uri_button has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CommandPalette · ×1
  • CommandPalette::alternatives_ui (cyclomatic 25) crates/viewer_support/re_ui/src/command_palette.rs:433 — CommandPalette::alternatives_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.
D1 · Cyclomatic Complexity · SplitCommand · ×1
  • SplitCommand::run (cyclomatic 24) crates/top/rerun/src/commands/rrd/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.
D1 · Cyclomatic Complexity · DataQueryPropertyResolver · ×1
  • DataQueryPropertyResolver::update_overrides_recursive (cyclomatic 24) crates/viewer_support/re_viewport_blueprint/src/view_contents.rs:449 — 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.
D1 · Cyclomatic Complexity · PythonCodeGenerator · ×1
  • PythonCodeGenerator::generate_folder (cyclomatic 23) crates/build/re_types_builder/src/codegen/python/mod.rs:433 — 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.
D1 · Cyclomatic Complexity · LogDataSource · ×1
  • LogDataSource::from_uri (cyclomatic 23) crates/data_flow/re_data_source/src/data_source.rs:86 — LogDataSource::from_uri has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body's own statements and 4 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.
D1 · Cyclomatic Complexity · SelectionPanel · ×1
  • SelectionPanel::item_ui (cyclomatic 23) crates/panels/re_selection_panel/src/selection_panel.rs:189 — SelectionPanel::item_ui 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.
D1 · Cyclomatic Complexity · Decoder · ×1
  • Decoder::try_read_impl (cyclomatic 23) crates/store/re_log_encoding/src/rrd/decoder/state_machine.rs:174 — Decoder::try_read_impl 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.
D1 · Cyclomatic Complexity · VideoDataDescription · ×1
  • VideoDataDescription::load_mp4_from_reader (cyclomatic 23) crates/utils/re_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.
D1 · Cyclomatic Complexity · MeshRenderer · ×1
  • MeshRenderer::draw (cyclomatic 23) crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:651 — 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.
D1 · Cyclomatic Complexity · ImageStats · ×1
  • ImageStats::from_image (cyclomatic 23) crates/viewer_support/re_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.
D1 · Cyclomatic Complexity · MaxImageDimensionsStoreSubscriber · ×1
  • MaxImageDimensionsStoreSubscriber::on_events (cyclomatic 23) crates/views/re_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.
D1 · Cyclomatic Complexity · PinholeExt.__init__ (cyclomatic 23) · ×1
  • PinholeExt.__init__ (cyclomatic 23) rerun_py/rerun_sdk/rerun/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.
D1 · Cyclomatic Complexity · thumbnails.check (cyclomatic 23) · ×1
  • thumbnails.check (cyclomatic 23) scripts/ci/thumbnails.py:109 — thumbnails.check 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.
D1 · Cyclomatic Complexity · MessageDecoderRunner · ×1
  • MessageDecoderRunner::process (cyclomatic 22) crates/data_flow/re_mcap/src/decoders/mod.rs:387 — MessageDecoderRunner::process has cyclomatic complexity 22 (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.
D1 · Cyclomatic Complexity · FieldInput · ×1
  • FieldInput::value (cyclomatic 22) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs:55 — FieldInput::value 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.
D1 · Cyclomatic Complexity · DataframeQueryTableProvider · ×1
  • DataframeQueryTableProvider::scan (cyclomatic 22) crates/store_app/re_datafusion/src/dataframe_query_common.rs:739 — DataframeQueryTableProvider::scan 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.
D1 · Cyclomatic Complexity · AppContext · ×1
  • AppContext::handle_select_hover_drag_interactions (cyclomatic 22) crates/viewer_support/re_viewer_context/src/app_context.rs:285 — 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.
D1 · Cyclomatic Complexity · TensorStats · ×1
  • TensorStats::from_tensor (cyclomatic 22) crates/viewer_support/re_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.
D1 · Cyclomatic Complexity · Query · ×1
  • Query::column_visibility_ui_impl (cyclomatic 22) crates/views/re_view_dataframe/src/view_query/ui.rs:352 — 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.
D1 · Cyclomatic Complexity · lint.lint_markdown (cyclomatic 22) · ×1
  • lint.lint_markdown (cyclomatic 22) scripts/lint.py:1509 — lint.lint_markdown 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.
D1 · Cyclomatic Complexity · re_redap_browser · ×1
  • re_redap_browser::servers::error_ui (cyclomatic 21) crates/panels/re_redap_browser/src/servers/mod.rs:391 — re_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.
D1 · Cyclomatic Complexity · CommandPaletteProviderImpl · ×1
  • CommandPaletteProviderImpl::all_matching (cyclomatic 21) crates/top/re_viewer/src/command_palette.rs:141 — CommandPaletteProviderImpl::all_matching 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.
D1 · Cyclomatic Complexity · ParsedMeshVertex · ×1
  • ParsedMeshVertex::set_property (cyclomatic 21) crates/viewer_support/re_renderer/src/importer/ply.rs:213 — ParsedMeshVertex::set_property 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.
D1 · Cyclomatic Complexity · Parser · ×1
  • Parser::parse_named_type (cyclomatic 20) crates/build/re_types_builder/src/objects/from_rust.rs:680 — 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.
D1 · Cyclomatic Complexity · RegisterAssetModal · ×1
  • RegisterAssetModal::ui (cyclomatic 20) crates/panels/re_redap_browser/src/register_asset_modal.rs:369 — RegisterAssetModal::ui 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.
D1 · Cyclomatic Complexity · TimestampFilter · ×1
  • TimestampFilter::popup_ui (cyclomatic 20) crates/viewer_support/re_dataframe_ui/src/filters/timestamp.rs:403 — 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.
D1 · Cyclomatic Complexity · CompletionPopup · ×1
  • CompletionPopup::show (cyclomatic 20) crates/viewer_support/re_ui/src/egui_ext/completion.rs:255 — CompletionPopup::show has cyclomatic complexity 20 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · Boxes2DExt.__init__ (cyclomatic 20) · ×1
  • Boxes2DExt.__init__ (cyclomatic 20) rerun_py/rerun_sdk/rerun/archetypes/boxes2d_ext.py:40 — Boxes2DExt.__init__ 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.
D1 · Cyclomatic Complexity · pr_link_checker.get_added_lines_with_links (cyclomatic 20) · ×1
  • pr_link_checker.get_added_lines_with_links (cyclomatic 20) scripts/ci/pr_link_checker.py:95 — pr_link_checker.get_added_lines_with_links 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.
D1 · Cyclomatic Complexity · SnippetsRefCodeGenerator · ×1
  • SnippetsRefCodeGenerator::generate_fallible (cyclomatic 19) crates/build/re_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.
D1 · Cyclomatic Complexity · re_viewer_mcp · ×1
  • re_viewer_mcp::proto_tools::message_schema (cyclomatic 19) crates/top/re_viewer_mcp/src/proto_tools.rs:228 — re_viewer_mcp::proto_tools::message_schema 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.
D1 · Cyclomatic Complexity · Args · ×1
  • Args::generate_markdown_manual (cyclomatic 19) crates/top/rerun/src/commands/entrypoint.rs:417 — 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: rerun::commands::entrypoint::record_cli_command_analytics (cyclomatic 20) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · FilterState · ×1
  • FilterState::filter_bar_ui (cyclomatic 19) crates/viewer_support/re_dataframe_ui/src/filters/column_filter_ui.rs:428 — FilterState::filter_bar_ui 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.
D1 · Cyclomatic Complexity · VideoStreamCache · ×1
  • VideoStreamCache::handle_store_event (cyclomatic 19) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache.rs:313 — 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.
D1 · Cyclomatic Complexity · SeriesPointsSystem · ×1
  • SeriesPointsSystem::load_series (cyclomatic 19) crates/views/re_view_time_series/src/point_visualizer_system.rs:189 — 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.
D1 · Cyclomatic Complexity · url_generation.segment_url (cyclomatic 19) · ×1
  • url_generation.segment_url (cyclomatic 19) rerun_py/rerun_sdk/rerun/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.
D1 · Cyclomatic Complexity · check_crate_layers.main (cyclomatic 19) · ×1
  • check_crate_layers.main (cyclomatic 19) scripts/check_crate_layers.py:87 — check_crate_layers.main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · lint.fix_header_casing (cyclomatic 19) · ×1
  • lint.fix_header_casing (cyclomatic 19) scripts/lint.py:1426 — lint.fix_header_casing 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.
D1 · Cyclomatic Complexity · re_lerobot · ×1
  • re_lerobot::emits::build_emits (cyclomatic 18) crates/data_flow/re_lerobot/src/emits.rs:104 — re_lerobot::emits::build_emits 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.
D1 · Cyclomatic Complexity · re_mcap · ×1
  • re_mcap::decoders::protobuf::append_value (cyclomatic 18) crates/data_flow/re_mcap/src/decoders/protobuf.rs:278 — re_mcap::decoders::protobuf::append_value 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.
D1 · Cyclomatic Complexity · re_chunk_store · ×1
  • re_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops (cyclomatic 18) crates/store/re_chunk_store/src/rebatch_videos.rs:46 — re_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.
D1 · Cyclomatic Complexity · CardLayout · ×1
  • CardLayout::show (cyclomatic 18) crates/viewer_support/re_ui/src/egui_ext/card_layout.rs:118 — CardLayout::show 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.
D1 · Cyclomatic Complexity · ListItemNavigation · ×1
  • ListItemNavigation::end_if_root (cyclomatic 18) crates/viewer_support/re_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.
D1 · Cyclomatic Complexity · UiExt · ×1
  • UiExt::native_window_buttons_ui (cyclomatic 18) crates/viewer_support/re_ui/src/ui_ext.rs:989 — 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.
D1 · Cyclomatic Complexity · Transform3DExt.__init__ (cyclomatic 18) · ×1
  • Transform3DExt.__init__ (cyclomatic 18) rerun_py/rerun_sdk/rerun/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.
D1 · Cyclomatic Complexity · TensorDataExt.__init__ (cyclomatic 18) · ×1
  • TensorDataExt.__init__ (cyclomatic 18) rerun_py/rerun_sdk/rerun/encodings/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.
D1 · Cyclomatic Complexity · python_check_signatures.compare_signatures (cyclomatic 18) · ×1
  • python_check_signatures.compare_signatures (cyclomatic 18) scripts/ci/python_check_signatures.py:238 — python_check_signatures.compare_signatures 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.
D1 · Cyclomatic Complexity · CoverageEditor · ×1
  • CoverageEditor::show_mode (cyclomatic 17) crates/panels/re_redap_browser/src/asset_coverage_modal.rs:464 — CoverageEditor::show_mode 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.
D1 · Cyclomatic Complexity · AssetCoverageModal · ×1
  • AssetCoverageModal::ui (cyclomatic 17) crates/panels/re_redap_browser/src/asset_coverage_modal.rs:718 — AssetCoverageModal::ui 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.
D1 · Cyclomatic Complexity · Flatten · ×1
  • Flatten::transform (cyclomatic 17) crates/store/re_lenses_core/src/combinators/reshape.rs:114 — 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.
D1 · Cyclomatic Complexity · PipelineBudget · ×1
  • PipelineBudget::reserve_with_priority (cyclomatic 17) crates/store_app/re_datafusion/src/pipeline_budget.rs:1470 — 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.
D1 · Cyclomatic Complexity · re_audio · ×1
  • re_audio::decoding::decode (cyclomatic 17) crates/utils/re_audio/src/decoding.rs:55 — re_audio::decoding::decode 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.
D1 · Cyclomatic Complexity · ArrowNode · ×1
  • ArrowNode::show (cyclomatic 17) crates/viewer_support/re_arrow_ui/src/arrow_node.rs:59 — ArrowNode::show 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.
D1 · Cyclomatic Complexity · UiTableConfig · ×1
  • UiTableConfig::ui (cyclomatic 17) crates/viewer_support/re_dataframe_ui/src/re_table_utils.rs:178 — UiTableConfig::ui 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.
D1 · Cyclomatic Complexity · GaussianSplatBatchBuilder · ×1
  • GaussianSplatBatchBuilder::add_gaussians (cyclomatic 17) crates/viewer_support/re_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.
D1 · Cyclomatic Complexity · MinMaxAggregator · ×1
  • MinMaxAggregator::aggregate (cyclomatic 17) crates/views/re_view_time_series/src/aggregation.rs:122 — MinMaxAggregator::aggregate 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.
D1 · Cyclomatic Complexity · VideoFrameDecoder._feed_run (cyclomatic 17) · ×1
  • VideoFrameDecoder._feed_run (cyclomatic 17) rerun_py/rerun_sdk/rerun/experimental/dataloader/decoders/_video.py:631 — VideoFrameDecoder._feed_run 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.
D1 · Cyclomatic Complexity · fetch_patch_candidates.cherry_pick_candidates (cyclomatic 17) · ×1
  • fetch_patch_candidates.cherry_pick_candidates (cyclomatic 17) scripts/fetch_patch_candidates.py:86 — fetch_patch_candidates.cherry_pick_candidates 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.
D1 · Cyclomatic Complexity · fetch_patch_candidates.main (cyclomatic 17) · ×1
  • fetch_patch_candidates.main (cyclomatic 17) scripts/fetch_patch_candidates.py:370 — fetch_patch_candidates.main 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.
D1 · Cyclomatic Complexity · collect_targets (cyclomatic 17) · ×1
  • collect_targets (cyclomatic 17) rerun_js/web-viewer/typedoc-used-by.mjs:97 — collect_targets has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · ExternalImporter · ×1
  • ExternalImporter::import_from_path (cyclomatic 16) crates/data_flow/re_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.
D1 · Cyclomatic Complexity · Transcript · ×1
  • Transcript::to_markdown (cyclomatic 16) crates/utils/re_agent/src/transcript.rs:458 — Transcript::to_markdown 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.
D1 · Cyclomatic Complexity · UniformBuffer · ×1
  • UniformBuffer::from_textured_rect_with_outline_mask (cyclomatic 16) crates/viewer_support/re_renderer/src/renderer/rectangles.rs:347 — 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.
D1 · Cyclomatic Complexity · ComboItem · ×1
  • ComboItem::ui (cyclomatic 16) crates/viewer_support/re_ui/src/combo_item.rs:82 — ComboItem::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.
D1 · Cyclomatic Complexity · DataframeTableDelegate · ×1
  • DataframeTableDelegate::header_cell_ui (cyclomatic 16) crates/views/re_view_dataframe/src/dataframe_ui.rs:258 — 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.
D1 · Cyclomatic Complexity · TextLogTableDelegate · ×1
  • TextLogTableDelegate::cell_ui (cyclomatic 16) crates/views/re_view_text_log/src/view_class.rs:394 — TextLogTableDelegate::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.
D1 · Cyclomatic Complexity · re_view_time_series · ×1
  • re_view_time_series::line_visualizer_system::build_line_draw_data (cyclomatic 16) crates/views/re_view_time_series/src/line_visualizer_system.rs:116 — re_view_time_series::line_visualizer_system::build_line_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.
D1 · Cyclomatic Complexity · crates.main (cyclomatic 16) · ×1
  • crates.main (cyclomatic 16) scripts/ci/crates.py:892 — crates.main 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.
D1 · Cyclomatic Complexity · mdlint.check_upcoming_asset_links (cyclomatic 16) · ×1
  • mdlint.check_upcoming_asset_links (cyclomatic 16) scripts/ci/mdlint.py:506 — mdlint.check_upcoming_asset_links 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.
D1 · Cyclomatic Complexity · upload_docs.collect_files (cyclomatic 16) · ×1
  • upload_docs.collect_files (cyclomatic 16) scripts/ci/upload_docs.py:81 — upload_docs.collect_files 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.
D1 · Cyclomatic Complexity · lint.lint_pymethods_requirements (cyclomatic 16) · ×1
  • lint.lint_pymethods_requirements (cyclomatic 16) scripts/lint.py:1045 — lint.lint_pymethods_requirements 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.
D1 · Cyclomatic Complexity · compare_traces.main (cyclomatic 16) · ×1
  • compare_traces.main (cyclomatic 16) skills/investigate-puffin/compare_traces.py:95 — compare_traces.main 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.
D15 · Churn × Complexity Hotspots · Repeated repair · ×1
  • Repeated repair: crates/utils/re_video/src/decode/mod.rs crates/utils/re_video/src/decode/mod.rs:618 — crates/utils/re_video/src/decode/mod.rs changed 5 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 8 (its worst body is PixelFormat::bits_per_pixel at line 618), 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 H.264 views stuck on a loading spinner on machines with many cores”; “Nightly failure fix: av1 slow-decode always enabled in tests, link exception”; “Fix video playing when there's many samples at the same timestamp”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 23:17:15 +00:00' --until='2026-10-26 23:17:15 +00:00' --full-history --no-merges -- crates/utils/re_video/src/decode/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.
D2 · Cognitive Complexity · lint.lint_line (cognitive 121) · ×1
  • lint.lint_line (cognitive 121) scripts/lint.py:194 — lint.lint_line has cognitive complexity 121 (threshold 15). Drivers by points: if/else 71 (99 pts), boolean chains 21, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compare_snippet_output.main (cognitive 77) · ×1
  • 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.
D2 · Cognitive Complexity · lint.lint_file (cognitive 72) · ×1
  • lint.lint_file (cognitive 72) scripts/lint.py:1722 — lint.lint_file has cognitive complexity 72 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 9 (19 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TimeSeriesView · ×1
  • TimeSeriesView::ui (cognitive 70) crates/views/re_view_time_series/src/view_class.rs:397 — TimeSeriesView::ui has cognitive complexity 70 (threshold 15). Drivers by points: if/else 27 (48 pts), boolean chains 10, match/switch 4 (7 pts), loops 4 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generate_changelog.main (cognitive 70) · ×1
  • generate_changelog.main (cognitive 70) scripts/generate_changelog.py:413 — generate_changelog.main has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (59 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (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.
D2 · Cognitive Complexity · MaxImageDimensionsStoreSubscriber · ×1
  • MaxImageDimensionsStoreSubscriber::on_events (cognitive 67) crates/views/re_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.
D2 · Cognitive Complexity · AppState · ×1
  • AppState::show (cognitive 62) crates/top/re_viewer/src/app_state.rs:303 — AppState::show has cognitive complexity 62 (threshold 15). Drivers by points: if/else 35 (54 pts), boolean chains 4, loops 2 (3 pts), 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.
D2 · Cognitive Complexity · Objects · ×1
  • Objects::validate (cognitive 61) crates/build/re_types_builder/src/objects/mod.rs:31 — Objects::validate has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (44 pts), boolean chains 7, loops 4 (6 pts), match/switch 1 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StatsCommand · ×1
  • StatsCommand::run (cognitive 61) crates/top/rerun/src/commands/rrd/stats.rs:36 — StatsCommand::run has cognitive complexity 61 (threshold 15). Drivers by points: loops 9 (28 pts), if/else 14 (25 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 34). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DurationFormatOptions · ×1
  • DurationFormatOptions::format_nanos (cognitive 61) crates/utils/re_format/src/duration.rs:113 — DurationFormatOptions::format_nanos has cognitive complexity 61 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 14, match/switch 5 (7 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.
D2 · Cognitive Complexity · python_check_signatures.compare_signatures (cognitive 57) · ×1
  • python_check_signatures.compare_signatures (cognitive 57) scripts/ci/python_check_signatures.py:238 — python_check_signatures.compare_signatures has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CommandPaletteProviderImpl · ×1
  • CommandPaletteProviderImpl::all_matching (cognitive 55) crates/top/re_viewer/src/command_palette.rs:141 — CommandPaletteProviderImpl::all_matching has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 4 (12 pts), boolean chains 2 (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.
D2 · Cognitive Complexity · ViewportUi · ×1
  • ViewportUi::viewport_ui (cognitive 53) crates/panels/re_viewport/src/viewport_ui.rs:58 — 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.
D2 · Cognitive Complexity · DataQueryPropertyResolver · ×1
  • DataQueryPropertyResolver::update_overrides_recursive (cognitive 51) crates/viewer_support/re_viewport_blueprint/src/view_contents.rs:449 — 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.
D2 · Cognitive Complexity · Decoder · ×1
  • Decoder::try_read_impl (cognitive 49) crates/store/re_log_encoding/src/rrd/decoder/state_machine.rs:174 — Decoder::try_read_impl has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 8 (20 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.
D2 · Cognitive Complexity · AppContext · ×1
  • AppContext::handle_select_hover_drag_interactions (cognitive 49) crates/viewer_support/re_viewer_context/src/app_context.rs:285 — 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.
D2 · Cognitive Complexity · PythonCodeGenerator · ×1
  • PythonCodeGenerator::generate_folder (cognitive 48) crates/build/re_types_builder/src/codegen/python/mod.rs:433 — 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.
D2 · Cognitive Complexity · VideoFrameDecoder._decode_run (cognitive 46) · ×1
  • VideoFrameDecoder._decode_run (cognitive 46) rerun_py/rerun_sdk/rerun/experimental/dataloader/decoders/_video.py:385 — VideoFrameDecoder._decode_run has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 6 (9 pts), boolean chains 6, ternaries 2 (4 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.
D2 · Cognitive Complexity · sync_release_assets.fetch_binary_assets (cognitive 46) · ×1
  • sync_release_assets.fetch_binary_assets (cognitive 46) scripts/ci/sync_release_assets.py:38 — sync_release_assets.fetch_binary_assets has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (34 pts), loops 5 (10 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.
D2 · Cognitive Complexity · ImageExt.__init__ (cognitive 45) · ×1
  • ImageExt.__init__ (cognitive 45) rerun_py/rerun_sdk/rerun/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.
D2 · Cognitive Complexity · ListItem · ×1
  • ListItem::ui (cognitive 44) crates/viewer_support/re_ui/src/list_item/list_item.rs:510 — ListItem::ui has cognitive complexity 44 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 9, match/switch 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · re_viewport_blueprint · ×1
  • re_viewport_blueprint::viewport_blueprint::apply_viewport_command (cognitive 44) crates/viewer_support/re_viewport_blueprint/src/viewport_blueprint.rs:977 — re_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.
D2 · Cognitive Complexity · lint.lint_markdown (cognitive 44) · ×1
  • lint.lint_markdown (cognitive 44) scripts/lint.py:1509 — lint.lint_markdown has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (38 pts), boolean chains 5, loops 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · ServerModal · ×1
  • ServerModal::ui (cognitive 43) crates/panels/re_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.
D2 · Cognitive Complexity · re_protos · ×1
  • re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy (cognitive 43) crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.legacy_adapter.rs:53 — re_protos::v1alpha1::rerun::cloud::v1alpha1::ext::legacy_adapter::adapt_legacy has cognitive complexity 43 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 5, loops 1 (2 pts), match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · MessageDecoderRunner · ×1
  • MessageDecoderRunner::process (cognitive 42) crates/data_flow/re_mcap/src/decoders/mod.rs:387 — MessageDecoderRunner::process has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 7 (14 pts), match/switch 4 (7 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.
D2 · Cognitive Complexity · Query · ×1
  • Query::column_visibility_ui_impl (cognitive 42) crates/views/re_view_dataframe/src/view_query/ui.rs:352 — 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.
D2 · Cognitive Complexity · CardLayout · ×1
  • CardLayout::show (cognitive 41) crates/viewer_support/re_ui/src/egui_ext/card_layout.rs:118 — CardLayout::show has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (34 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PinholeExt.__init__ (cognitive 41) · ×1
  • PinholeExt.__init__ (cognitive 41) rerun_py/rerun_sdk/rerun/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.
D2 · Cognitive Complexity · ForceLayoutProvider · ×1
  • ForceLayoutProvider::layout (cognitive 40) crates/views/re_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.
D2 · Cognitive Complexity · Telemetry · ×1
  • Telemetry::init (cognitive 39) crates/utils/re_perf_telemetry/src/telemetry.rs:512 — Telemetry::init has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29 (34 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.
D2 · Cognitive Complexity · SourceFile._update_content (cognitive 39) · ×1
  • SourceFile._update_content (cognitive 39) scripts/lint.py:1624 — SourceFile._update_content has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · RedapServers · ×1
  • RedapServers::handle_command (cognitive 37) crates/panels/re_redap_browser/src/servers/mod.rs:1083 — RedapServers::handle_command has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 2 (3 pts) (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · lint.lint_pyclass_requirements (cognitive 37) · ×1
  • lint.lint_pyclass_requirements (cognitive 37) scripts/lint.py:967 — lint.lint_pyclass_requirements has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 23). 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.
D2 · Cognitive Complexity · CrateVersion · ×1
  • CrateVersion::try_parse (cognitive 36) crates/utils/re_build_info/src/crate_version.rs:363 — 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.
D2 · Cognitive Complexity · MeshRenderer · ×1
  • MeshRenderer::draw (cognitive 36) crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:651 — 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.
D2 · Cognitive Complexity · thumbnails.check (cognitive 36) · ×1
  • thumbnails.check (cognitive 36) scripts/ci/thumbnails.py:109 — thumbnails.check has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 7 (13 pts), boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · lint.lint_pymethods_requirements (cognitive 36) · ×1
  • lint.lint_pymethods_requirements (cognitive 36) scripts/lint.py:1045 — lint.lint_pymethods_requirements has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DataframeQueryTableProvider · ×1
  • DataframeQueryTableProvider::scan (cognitive 35) crates/store_app/re_datafusion/src/dataframe_query_common.rs:739 — DataframeQueryTableProvider::scan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 5 (7 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StateTimelineView · ×1
  • StateTimelineView::ui (cognitive 35) crates/views/re_view_state_timeline/src/view_class.rs:254 — StateTimelineView::ui has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 9, loops 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.
D2 · Cognitive Complexity · mdlint.check_upcoming_asset_links (cognitive 35) · ×1
  • mdlint.check_upcoming_asset_links (cognitive 35) scripts/ci/mdlint.py:506 — mdlint.check_upcoming_asset_links has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (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.
D2 · Cognitive Complexity · Flatten · ×1
  • Flatten::transform (cognitive 34) crates/store/re_lenses_core/src/combinators/reshape.rs:114 — Flatten::transform has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 4 (6 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.
D2 · Cognitive Complexity · RrdManifestIndex · ×1
  • RrdManifestIndex::mark_roots_as (cognitive 34) crates/store_app/re_entity_db/src/rrd_manifest_index.rs:449 — RrdManifestIndex::mark_roots_as has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 2 (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.
D2 · Cognitive Complexity · FloatFormatOptions · ×1
  • FloatFormatOptions::format_f64 (cognitive 34) crates/utils/re_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.
D2 · Cognitive Complexity · Sender · ×1
  • Sender::send_impl (cognitive 34) crates/utils/re_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.
D2 · Cognitive Complexity · EyeState · ×1
  • EyeState::handle_tracking_entity (cognitive 34) crates/views/re_view_spatial/src/eye.rs:962 — 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.
D2 · Cognitive Complexity · Boxes2DExt.__init__ (cognitive 34) · ×1
  • Boxes2DExt.__init__ (cognitive 34) rerun_py/rerun_sdk/rerun/archetypes/boxes2d_ext.py:40 — Boxes2DExt.__init__ has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (34 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.
D2 · Cognitive Complexity · pr_link_checker.get_added_lines_with_links (cognitive 34) · ×1
  • pr_link_checker.get_added_lines_with_links (cognitive 34) scripts/ci/pr_link_checker.py:95 — pr_link_checker.get_added_lines_with_links has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 5, error handling 2, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · PipelineBudget · ×1
  • PipelineBudget::reserve_with_priority (cognitive 33) crates/store_app/re_datafusion/src/pipeline_budget.rs:1470 — 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.
D2 · Cognitive Complexity · App · ×1
  • App::with_commands (cognitive 33) crates/top/re_viewer/src/app/mod.rs:228 — App::with_commands has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 5, 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.
D2 · Cognitive Complexity · TransformAxes3DVisualizer · ×1
  • TransformAxes3DVisualizer::execute (cognitive 33) crates/views/re_view_spatial/src/visualizers/transform_axes_3d.rs:59 — 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.
D2 · Cognitive Complexity · CompareCommand · ×1
  • CompareCommand::run (cognitive 32) crates/top/rerun/src/commands/rrd/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.
D2 · Cognitive Complexity · VerifyCommand · ×1
  • VerifyCommand::run (cognitive 32) crates/top/rerun/src/commands/rrd/verify.rs:28 — 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.
D2 · Cognitive Complexity · ProcMeshDrawableBuilder · ×1
  • ProcMeshDrawableBuilder::add_batch (cognitive 32) crates/views/re_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs:159 — 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.
D2 · Cognitive Complexity · Rgba32Ext.native_to_pa_array_override (cognitive 32) · ×1
  • Rgba32Ext.native_to_pa_array_override (cognitive 32) rerun_py/rerun_sdk/rerun/encodings/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.
D2 · Cognitive Complexity · check_crate_layers.main (cognitive 32) · ×1
  • check_crate_layers.main (cognitive 32) scripts/check_crate_layers.py:87 — check_crate_layers.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 7 (11 pts), ternaries 1 (3 pts), boolean chains 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.
D2 · Cognitive Complexity · re_parquet · ×1
  • re_parquet::grouping::compute_column_groups (cognitive 31) crates/data_flow/re_parquet/src/grouping.rs:38 — re_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.
D2 · Cognitive Complexity · VideoDataDescription · ×1
  • VideoDataDescription::load_mp4_from_reader (cognitive 31) crates/utils/re_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.
D2 · Cognitive Complexity · ParsedMeshVertex · ×1
  • ParsedMeshVertex::set_property (cognitive 31) crates/viewer_support/re_renderer/src/importer/ply.rs:213 — ParsedMeshVertex::set_property has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (30 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.
D2 · Cognitive Complexity · LogDataSource · ×1
  • LogDataSource::from_uri (cognitive 30) crates/data_flow/re_data_source/src/data_source.rs:86 — LogDataSource::from_uri has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 7 (nesting depth added 5). Of this number, 26 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ExternalImporter · ×1
  • ExternalImporter::import_from_path (cognitive 30) crates/data_flow/re_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.
D2 · Cognitive Complexity · LatestAllInstanceResult · ×1
  • LatestAllInstanceResult::data_ui (cognitive 30) crates/viewer_support/re_data_ui/src/latest_all_instance_ui.rs:31 — LatestAllInstanceResult::data_ui has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GaussianSplatBatchBuilder · ×1
  • GaussianSplatBatchBuilder::add_gaussians (cognitive 30) crates/viewer_support/re_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.
D2 · Cognitive Complexity · re_view_audio · ×1
  • re_view_audio::waveform::waveform_ui (cognitive 30) crates/views/re_view_audio/src/waveform.rs:80 — re_view_audio::waveform::waveform_ui has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 8 (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.
D2 · Cognitive Complexity · DataResultData · ×1
  • DataResultData::from_data_result_and_filter (cognitive 29) crates/panels/re_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.
D2 · Cognitive Complexity · re_sdk_types · ×1
  • re_sdk_types::archetypes::gaussian_splats3d_ext::read_ply (cognitive 29) crates/store/re_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:301 — re_sdk_types::archetypes::gaussian_splats3d_ext::read_ply has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (6 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.
D2 · Cognitive Complexity · FilterCommand · ×1
  • FilterCommand::run (cognitive 29) crates/top/rerun/src/commands/rrd/filter.rs:40 — FilterCommand::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (5 pts), loops 2, 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.
D2 · Cognitive Complexity · BarChartView · ×1
  • BarChartView::ui (cognitive 29) crates/views/re_view_bar_chart/src/view_class.rs:139 — 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.
D2 · Cognitive Complexity · python_check_signatures.load_stub_signatures (cognitive 29) · ×1
  • python_check_signatures.load_stub_signatures (cognitive 29) scripts/ci/python_check_signatures.py:143 — python_check_signatures.load_stub_signatures has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (14 pts), error handling 2 (7 pts), loops 3 (7 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.
D2 · Cognitive Complexity · run_all.collect_examples (cognitive 29) · ×1
  • run_all.collect_examples (cognitive 29) scripts/run_all.py:109 — run_all.collect_examples has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 5, 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.
D2 · Cognitive Complexity · find_scopes.main (cognitive 29) · ×1
  • find_scopes.main (cognitive 29) skills/investigate-puffin/find_scopes.py:54 — find_scopes.main has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (12 pts), boolean chains 2 (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.
D2 · Cognitive Complexity · PendingRow · ×1
  • PendingRow::many_into_chunks (cognitive 28) crates/store/re_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.
D2 · Cognitive Complexity · EntityDb · ×1
  • EntityDb::app_ui (cognitive 28) crates/viewer_support/re_data_ui/src/entity_db_ui.rs:16 — 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.
D2 · Cognitive Complexity · Transform3DExt.__init__ (cognitive 28) · ×1
  • Transform3DExt.__init__ (cognitive 28) rerun_py/rerun_sdk/rerun/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.
D2 · Cognitive Complexity · _manifest_build._resolve_rows (cognitive 28) · ×1
  • _manifest_build._resolve_rows (cognitive 28) rerun_py/rerun_sdk/rerun/experimental/dataloader/manifest/_manifest_build.py:276 — _manifest_build._resolve_rows has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 pts), ternaries 4 (7 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.
D2 · Cognitive Complexity · Client · ×1
  • Client::flush_blocking (cognitive 27) crates/data_flow/re_grpc_client/src/write.rs:235 — 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.
D2 · Cognitive Complexity · re_grpc_client · ×1
  • re_grpc_client::write::message_proxy_client (cognitive 27) crates/data_flow/re_grpc_client/src/write.rs:347 — re_grpc_client::write::message_proxy_client has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 5 (10 pts), loops 2 (nesting depth added 13). 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.
D2 · Cognitive Complexity · DecoderRegistry · ×1
  • DecoderRegistry::plan (cognitive 27) crates/data_flow/re_mcap/src/decoders/mod.rs:793 — 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.
D2 · Cognitive Complexity · FieldInput · ×1
  • FieldInput::value (cognitive 27) crates/panels/re_agent_ui/src/ui/elicitation_ui.rs:55 — FieldInput::value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, 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.
D2 · Cognitive Complexity · DataMetaPerTimeline · ×1
  • DataMetaPerTimeline::handle_event_for_row_count (cognitive 27) crates/store_app/re_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.
D2 · Cognitive Complexity · AgentSession · ×1
  • AgentSession::handle_event (cognitive 27) crates/utils/re_agent/src/session.rs:780 — AgentSession::handle_event has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, match/switch 2 (3 pts) (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.
D2 · Cognitive Complexity · re_log · ×1
  • re_log::add_builtin_log_filter (cognitive 27) crates/utils/re_log/src/lib.rs:212 — re_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.
D2 · Cognitive Complexity · UiTableConfig · ×1
  • UiTableConfig::ui (cognitive 27) crates/viewer_support/re_dataframe_ui/src/re_table_utils.rs:178 — UiTableConfig::ui has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (3 pts), boolean chains 2, 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.
D2 · Cognitive Complexity · Boxes3DExt.__init__ (cognitive 27) · ×1
  • Boxes3DExt.__init__ (cognitive 27) rerun_py/rerun_sdk/rerun/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.
D2 · Cognitive Complexity · DataframeTableDelegate · ×1
  • DataframeTableDelegate::header_cell_ui (cognitive 26) crates/views/re_view_dataframe/src/dataframe_ui.rs:258 — 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.
D2 · Cognitive Complexity · MinMaxAggregator · ×1
  • MinMaxAggregator::aggregate (cognitive 26) crates/views/re_view_time_series/src/aggregation.rs:122 — MinMaxAggregator::aggregate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (6 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.
D2 · Cognitive Complexity · zombie_todos.main (cognitive 26) · ×1
  • zombie_todos.main (cognitive 26) scripts/zombie_todos.py:416 — zombie_todos.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (4 pts), error handling 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.
D2 · Cognitive Complexity · re_arrow_json · ×1
  • re_arrow_json::to_json::json_from_store (cognitive 25) crates/store/re_arrow_json/src/to_json.rs:39 — re_arrow_json::to_json::json_from_store has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Args · ×1
  • Args::generate_markdown_manual (cognitive 25) crates/top/rerun/src/commands/entrypoint.rs:417 — 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.
D2 · Cognitive Complexity · CpuMesh · ×1
  • CpuMesh::compute_flat_normals_except (cognitive 25) crates/viewer_support/re_renderer/src/mesh.rs:91 — CpuMesh::compute_flat_normals_except has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 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.
D2 · Cognitive Complexity · MeshDrawData · ×1
  • MeshDrawData::new (cognitive 25) crates/viewer_support/re_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.
D2 · Cognitive Complexity · TensorDataExt.__init__ (cognitive 25) · ×1
  • TensorDataExt.__init__ (cognitive 25) rerun_py/rerun_sdk/rerun/encodings/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.
D2 · Cognitive Complexity · url_generation.segment_url (cognitive 25) · ×1
  • url_generation.segment_url (cognitive 25) rerun_py/rerun_sdk/rerun/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.
D2 · Cognitive Complexity · compare.compare (cognitive 25) · ×1
  • compare.compare (cognitive 25) scripts/ci/compare.py:76 — compare.compare has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3, 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.
D2 · Cognitive Complexity · upload_docs.collect_files (cognitive 25) · ×1
  • upload_docs.collect_files (cognitive 25) scripts/ci/upload_docs.py:81 — upload_docs.collect_files has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 7 (9 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.
D2 · Cognitive Complexity · lint.fix_header_casing (cognitive 25) · ×1
  • lint.fix_header_casing (cognitive 25) scripts/lint.py:1426 — lint.fix_header_casing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 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.
D2 · Cognitive Complexity · lint.main (cognitive 25) · ×1
  • lint.main (cognitive 25) scripts/lint.py:1927 — lint.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SnippetsRefCodeGenerator · ×1
  • SnippetsRefCodeGenerator::generate_fallible (cognitive 24) crates/build/re_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.
D2 · Cognitive Complexity · FrameIdRegistry · ×1
  • FrameIdRegistry::register_all_frames_in_chunk (cognitive 24) crates/store_app/re_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.
D2 · Cognitive Complexity · re_agent · ×1
  • re_agent::connection::drive (cognitive 24) crates/utils/re_agent/src/connection.rs:302 — re_agent::connection::drive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 4 (11 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.
D2 · Cognitive Complexity · ArrowNode · ×1
  • ArrowNode::show (cognitive 24) crates/viewer_support/re_arrow_ui/src/arrow_node.rs:59 — ArrowNode::show has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (3 pts), match/switch 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.
D2 · Cognitive Complexity · CompletionPopup · ×1
  • CompletionPopup::show (cognitive 24) crates/viewer_support/re_ui/src/egui_ext/completion.rs:255 — CompletionPopup::show has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 4). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · VideoFrameReferenceVisualizer · ×1
  • VideoFrameReferenceVisualizer::process_video_frame (cognitive 24) crates/views/re_view_spatial/src/visualizers/video/video_frame_reference.rs:144 — VideoFrameReferenceVisualizer::process_video_frame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 4 (8 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.
D2 · Cognitive Complexity · TextLogSpanIndex · ×1
  • TextLogSpanIndex::reconcile (cognitive 24) crates/views/re_view_text_log/src/text_log_span_index.rs:65 — TextLogSpanIndex::reconcile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (10 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.
D2 · Cognitive Complexity · CompileContext · ×1
  • CompileContext::take_split_receiver (cognitive 24) rerun_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.
D2 · Cognitive Complexity · Server.__init__ (cognitive 24) · ×1
  • Server.__init__ (cognitive 24) rerun_py/rerun_sdk/rerun/server.py:48 — Server.__init__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (6 pts), boolean chains 2, ternaries 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.
D2 · Cognitive Complexity · remove_patch_labels.main (cognitive 24) · ×1
  • remove_patch_labels.main (cognitive 24) scripts/ci/remove_patch_labels.py:121 — remove_patch_labels.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (10 pts), ternaries 3 (6 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · repack_wheel.collect_added_files (cognitive 24) · ×1
  • repack_wheel.collect_added_files (cognitive 24) scripts/ci/repack_wheel.py:77 — repack_wheel.collect_added_files has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 pts), ternaries 1 (6 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.
D2 · Cognitive Complexity · fetch_patch_candidates.cherry_pick_candidates (cognitive 24) · ×1
  • fetch_patch_candidates.cherry_pick_candidates (cognitive 24) scripts/fetch_patch_candidates.py:86 — fetch_patch_candidates.cherry_pick_candidates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 6 (8 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LeRobotEpisodeV3MetaData · ×1
  • LeRobotEpisodeV3MetaData::parse_feature_metadata (cognitive 23) crates/data_flow/re_lerobot/src/parse_v3.rs:846 — LeRobotEpisodeV3MetaData::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.
D2 · Cognitive Complexity · re_chunk_store · ×1
  • re_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops (cognitive 23) crates/store/re_chunk_store/src/rebatch_videos.rs:46 — re_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.
D2 · Cognitive Complexity · Fragment · ×1
  • Fragment::from_str (cognitive 23) crates/store/re_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.
D2 · Cognitive Complexity · NativeMenu · ×1
  • NativeMenu::new (cognitive 23) crates/top/re_viewer/src/native_menu.rs:115 — NativeMenu::new has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (8 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ComboItem · ×1
  • ComboItem::ui (cognitive 23) crates/viewer_support/re_ui/src/combo_item.rs:82 — ComboItem::ui has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, match/switch 2 (3 pts), 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.
D2 · Cognitive Complexity · StoreHub · ×1
  • StoreHub::purge_fraction_of_ram (cognitive 23) crates/viewer_support/re_viewer_context/src/store_hub.rs:1025 — 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.
D2 · Cognitive Complexity · TextLogTableDelegate · ×1
  • TextLogTableDelegate::cell_ui (cognitive 23) crates/views/re_view_text_log/src/view_class.rs:394 — TextLogTableDelegate::cell_ui has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 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.
D2 · Cognitive Complexity · PooledBatchCollator._collate (cognitive 23) · ×1
  • PooledBatchCollator._collate (cognitive 23) rerun_py/rerun_sdk/rerun/experimental/dataloader/_pooled_batches.py:392 — PooledBatchCollator._collate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 2, error handling 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.
D2 · Cognitive Complexity · python_check_signatures.parse_function_signature (cognitive 23) · ×1
  • python_check_signatures.parse_function_signature (cognitive 23) scripts/ci/python_check_signatures.py:90 — python_check_signatures.parse_function_signature has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TabWidget · ×1
  • TabWidget::new (cognitive 22) crates/panels/re_viewport/src/viewport_ui.rs:1024 — TabWidget::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 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.
D2 · Cognitive Complexity · SortedTemporalChunks · ×1
  • SortedTemporalChunks::update (cognitive 22) crates/store_app/re_entity_db/src/rrd_manifest_index/sorted_temporal_chunks.rs:90 — SortedTemporalChunks::update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (10 pts) (nesting depth added 10). Of this number, 21 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.
D2 · Cognitive Complexity · ReceiversFromUrlParams · ×1
  • ReceiversFromUrlParams::new (cognitive 22) crates/top/rerun/src/commands/entrypoint.rs:1981 — 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.
D2 · Cognitive Complexity · TimestampFilter · ×1
  • TimestampFilter::popup_ui (cognitive 22) crates/viewer_support/re_dataframe_ui/src/filters/timestamp.rs:403 — 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.
D2 · Cognitive Complexity · TableSelectionState · ×1
  • TableSelectionState::handle_row_click (cognitive 22) crates/viewer_support/re_dataframe_ui/src/table_selection.rs:45 — 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.
D2 · Cognitive Complexity · re_view_bar_chart · ×1
  • re_view_bar_chart::view_class::find_nearest_bar (cognitive 22) crates/views/re_view_bar_chart/src/view_class.rs:429 — re_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.
D2 · Cognitive Complexity · Blueprint.__init__ (cognitive 22) · ×1
  • Blueprint.__init__ (cognitive 22) rerun_py/rerun_sdk/rerun/blueprint/api.py:601 — 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.
D2 · Cognitive Complexity · ServerEntriesData · ×1
  • ServerEntriesData::new (cognitive 21) crates/panels/re_recording_panel/src/data.rs:372 — ServerEntriesData::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (2 pts) (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.
D2 · Cognitive Complexity · RrdManifest · ×1
  • RrdManifest::merge (cognitive 21) crates/store/re_chunk_index/src/rrd_manifest.rs:463 — RrdManifest::merge has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (21 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · QueryResults · ×1
  • QueryResults::from_chunk_ids (cognitive 21) crates/store/re_chunk_store/src/query.rs:734 — 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.
D2 · Cognitive Complexity · LocalChunkStoreExec · ×1
  • LocalChunkStoreExec::execute (cognitive 21) crates/store_app/re_datafusion/src/local_chunk_store_provider.rs:248 — 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.
D2 · Cognitive Complexity · re_server · ×1
  • re_server::rerun_cloud::chunk_selection::select_chunks (cognitive 21) crates/store_app/re_server/src/rerun_cloud/chunk_selection.rs:116 — re_server::rerun_cloud::chunk_selection::select_chunks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LensesSink · ×1
  • LensesSink::send (cognitive 21) crates/top/re_sdk/src/lenses/sink.rs:51 — 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.
D2 · Cognitive Complexity · re_analytics · ×1
  • re_analytics::native::pipeline::flush_pending_events (cognitive 21) crates/utils/re_analytics/src/native/pipeline.rs:161 — re_analytics::native::pipeline::flush_pending_events has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (6 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.
D2 · Cognitive Complexity · re_audio · ×1
  • re_audio::decoding::decode (cognitive 21) crates/utils/re_audio/src/decoding.rs:55 — re_audio::decoding::decode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (6 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.
D2 · Cognitive Complexity · re_perf_telemetry · ×1
  • re_perf_telemetry::prometheus::convert_to_prometheus (cognitive 21) crates/utils/re_perf_telemetry/src/prometheus.rs:65 — re_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.
D2 · Cognitive Complexity · re_arrow_ui · ×1
  • re_arrow_ui::arrow_ui::arrow_ui (cognitive 21) crates/viewer_support/re_arrow_ui/src/arrow_ui.rs:10 — re_arrow_ui::arrow_ui::arrow_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (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.
D2 · Cognitive Complexity · DataFusionQuery · ×1
  • DataFusionQuery::execute_streaming (cognitive 21) crates/viewer_support/re_dataframe_ui/src/datafusion_adapter.rs:409 — DataFusionQuery::execute_streaming has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (7 pts), loops 1 (2 pts), boolean chains 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.
D2 · Cognitive Complexity · GaussianSplatDrawData · ×1
  • GaussianSplatDrawData::new (cognitive 21) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:337 — 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.
D2 · Cognitive Complexity · ListItemNavigation · ×1
  • ListItemNavigation::end_if_root (cognitive 21) crates/viewer_support/re_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.
D2 · Cognitive Complexity · re_component_fallbacks · ×1
  • re_component_fallbacks::component_fallbacks::archetype_field_fallbacks (cognitive 21) crates/viewer_support/re_component_fallbacks/src/component_fallbacks.rs:30 — re_component_fallbacks::component_fallbacks::archetype_field_fallbacks 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.
D2 · Cognitive Complexity · fetch_patch_candidates.main (cognitive 21) · ×1
  • fetch_patch_candidates.main (cognitive 21) scripts/fetch_patch_candidates.py:370 — fetch_patch_candidates.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ConnectionRegistryHandle · ×1
  • ConnectionRegistryHandle::connect_and_validate_client_stack (cognitive 20) crates/data_flow/re_redap_client/src/connection_registry.rs:560 — 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.
D2 · Cognitive Complexity · BlueprintTree · ×1
  • BlueprintTree::data_result_ui (cognitive 20) crates/panels/re_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.
D2 · Cognitive Complexity · DatastoreUi · ×1
  • DatastoreUi::ui (cognitive 20) crates/panels/re_chunk_store_ui/src/chunk_store_ui.rs:191 — 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.
D2 · Cognitive Complexity · RecordingPanelData · ×1
  • RecordingPanelData::new (cognitive 20) crates/panels/re_recording_panel/src/data.rs:51 — RecordingPanelData::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (4 pts), loops 2, 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.
D2 · Cognitive Complexity · RegisterAssetModal · ×1
  • RegisterAssetModal::ui (cognitive 20) crates/panels/re_redap_browser/src/register_asset_modal.rs:369 — RegisterAssetModal::ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 5, loops 1, 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.
D2 · Cognitive Complexity · Server · ×1
  • Server::asset_ui (cognitive 20) crates/panels/re_redap_browser/src/servers/dataset.rs:612 — Server::asset_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 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.
D2 · Cognitive Complexity · MergeSplitRunState · ×1
  • MergeSplitRunState::step (cognitive 20) crates/store/re_chunk_optimizer/src/executor/merge_split.rs:88 — MergeSplitRunState::step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ChunkIndexView · ×1
  • ChunkIndexView::try_from_raw (cognitive 20) crates/store/re_chunk_optimizer/src/view.rs:155 — ChunkIndexView::try_from_raw has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · PartitionDriver · ×1
  • PartitionDriver::run_inner (cognitive 20) crates/store_app/re_datafusion/src/pipeline/driver.rs:146 — PartitionDriver::run_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Source · ×1
  • Source::index_ranges (cognitive 20) crates/store_app/re_server/src/store/source.rs:231 — 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.
D2 · Cognitive Complexity · TransformResolutionCache · ×1
  • TransformResolutionCache::add_static_chunk (cognitive 20) crates/store_app/re_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.
D2 · Cognitive Complexity · _utils._resolve_decode_requests (cognitive 20) · ×1
  • _utils._resolve_decode_requests (cognitive 20) rerun_py/rerun_sdk/rerun/experimental/dataloader/_utils.py:620 — _utils._resolve_decode_requests has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 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.
D2 · Cognitive Complexity · VideoFrameDecoder._feed_run (cognitive 20) · ×1
  • VideoFrameDecoder._feed_run (cognitive 20) rerun_py/rerun_sdk/rerun/experimental/dataloader/decoders/_video.py:631 — VideoFrameDecoder._feed_run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, loops 4 (6 pts), boolean chains 5 (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.
D2 · Cognitive Complexity · crates.main (cognitive 20) · ×1
  • crates.main (cognitive 20) scripts/ci/crates.py:892 — crates.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3 (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.
D2 · Cognitive Complexity · collect_targets (cognitive 20) · ×1
  • collect_targets (cognitive 20) rerun_js/web-viewer/typedoc-used-by.mjs:97 — collect_targets has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (8 pts), other 7, if/else 3, boolean chains 2 (nesting depth added 4). 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.
D2 · Cognitive Complexity · ParquetChunkIterator · ×1
  • ParquetChunkIterator::next (cognitive 19) crates/data_flow/re_parquet/src/streaming.rs:228 — 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.
D2 · Cognitive Complexity · CoverageEditor · ×1
  • CoverageEditor::show_mode (cognitive 19) crates/panels/re_redap_browser/src/asset_coverage_modal.rs:464 — CoverageEditor::show_mode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · AssetCoverageModal · ×1
  • AssetCoverageModal::ui (cognitive 19) crates/panels/re_redap_browser/src/asset_coverage_modal.rs:718 — AssetCoverageModal::ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 4, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · re_types_core · ×1
  • re_types_core::reflection::generic_placeholder_for_datatype (cognitive 19) crates/store/re_types_core/src/reflection.rs:92 — re_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.
D2 · Cognitive Complexity · Origin · ×1
  • Origin::replace_and_parse (cognitive 19) crates/store/re_uri/src/origin.rs:95 — 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.
D2 · Cognitive Complexity · re_byte_size_derive · ×1
  • re_byte_size_derive::enum_body (cognitive 19) crates/utils/re_byte_size_derive/src/lib.rs:202 — re_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.
D2 · Cognitive Complexity · re_ros_msg · ×1
  • re_ros_msg::deserialize::decode_value (cognitive 19) crates/utils/re_ros_msg/src/deserialize/mod.rs:142 — re_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.
D2 · Cognitive Complexity · ReTable · ×1
  • ReTable::header_cell_ui (cognitive 19) crates/viewer_support/re_dataframe_ui/src/re_table.rs:178 — ReTable::header_cell_ui 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.
D2 · Cognitive Complexity · PointCloudDrawData · ×1
  • PointCloudDrawData::new (cognitive 19) crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:336 — 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.
D2 · Cognitive Complexity · RectangleDrawData · ×1
  • RectangleDrawData::new (cognitive 19) crates/viewer_support/re_renderer/src/renderer/rectangles.rs:505 — 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.
D2 · Cognitive Complexity · VisualizerEntityMapping · ×1
  • VisualizerEntityMapping::add_visualizability_reason (cognitive 19) crates/viewer_support/re_viewer_context/src/view/visualizer_entity_subscriber.rs:93 — 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.
D2 · Cognitive Complexity · Points3DVisualizer · ×1
  • Points3DVisualizer::process_data (cognitive 19) crates/views/re_view_spatial/src/visualizers/points3d.rs:222 — Points3DVisualizer::process_data has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 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.
D2 · Cognitive Complexity · re_view_text_log · ×1
  • re_view_text_log::view_class::view_property_ui_rows (cognitive 19) crates/views/re_view_text_log/src/view_class.rs:488 — re_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.
D2 · Cognitive Complexity · AnyBatchValue.__init__ (cognitive 19) · ×1
  • AnyBatchValue.__init__ (cognitive 19) rerun_py/rerun_sdk/rerun/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.
D2 · Cognitive Complexity · _entry._python_objects_to_record_batch (cognitive 19) · ×1
  • _entry._python_objects_to_record_batch (cognitive 19) rerun_py/rerun_sdk/rerun/catalog/_entry.py:2016 — _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.
D2 · Cognitive Complexity · ViewerClient.quit (cognitive 19) · ×1
  • ViewerClient.quit (cognitive 19) rerun_py/rerun_sdk/rerun/experimental/_viewer_client.py:1427 — ViewerClient.quit has cognitive complexity 19 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 7 (8 pts), loops 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.
D2 · Cognitive Complexity · _LeaseTracker._collect_released (cognitive 19) · ×1
  • _LeaseTracker._collect_released (cognitive 19) rerun_py/rerun_sdk/rerun/experimental/dataloader/_pooled_batches.py:121 — _LeaseTracker._collect_released has cognitive complexity 19 (threshold 15). Drivers by points: error handling 3 (9 pts), if/else 2 (5 pts), loops 3 (5 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.
D2 · Cognitive Complexity · python_check_signatures.load_runtime_signatures (cognitive 19) · ×1
  • python_check_signatures.load_runtime_signatures (cognitive 19) scripts/ci/python_check_signatures.py:191 — python_check_signatures.load_runtime_signatures has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (6 pts), error handling 1 (4 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.
D2 · Cognitive Complexity · generate_crate_graph.character_glyphs (cognitive 19) · ×1
  • generate_crate_graph.character_glyphs (cognitive 19) scripts/generate_crate_graph.py:316 — generate_crate_graph.character_glyphs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · highlight_issues.main (cognitive 19) · ×1
  • highlight_issues.main (cognitive 19) scripts/highlight_issues.py:66 — highlight_issues.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (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.
D2 · Cognitive Complexity · compare_traces.main (cognitive 19) · ×1
  • compare_traces.main (cognitive 19) skills/investigate-puffin/compare_traces.py:95 — compare_traces.main has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (7 pts), boolean chains 2, 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.
D2 · Cognitive Complexity · re_recording_panel · ×1
  • re_recording_panel::recording_panel_ui::dataset_entry_ui (cognitive 18) crates/panels/re_recording_panel/src/recording_panel_ui.rs:497 — re_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.
D2 · Cognitive Complexity · GopRunState · ×1
  • GopRunState::step (cognitive 18) crates/store/re_chunk_optimizer/src/executor/gop.rs:269 — GopRunState::step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FetchExecutor · ×1
  • FetchExecutor::issue (cognitive 18) crates/store_app/re_datafusion/src/pipeline/executor.rs:90 — FetchExecutor::issue has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (5 pts), loops 2 (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.
D2 · Cognitive Complexity · re_viewer_mcp · ×1
  • re_viewer_mcp::proto_tools::message_schema (cognitive 18) crates/top/re_viewer_mcp/src/proto_tools.rs:228 — re_viewer_mcp::proto_tools::message_schema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, match/switch 2 (3 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.
D2 · Cognitive Complexity · ImageStats · ×1
  • ImageStats::from_image (cognitive 18) crates/viewer_support/re_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.
D2 · Cognitive Complexity · View._log_to_stream (cognitive 18) · ×1
  • View._log_to_stream (cognitive 18) rerun_py/rerun_sdk/rerun/blueprint/api.py:162 — 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.
D2 · Cognitive Complexity · PooledBatchCollator._acquire (cognitive 18) · ×1
  • PooledBatchCollator._acquire (cognitive 18) rerun_py/rerun_sdk/rerun/experimental/dataloader/_pooled_batches.py:344 — PooledBatchCollator._acquire has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pixi_install_wheel.run_pixi_install (cognitive 18) · ×1
  • pixi_install_wheel.run_pixi_install (cognitive 18) scripts/ci/pixi_install_wheel.py:31 — pixi_install_wheel.run_pixi_install has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 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.
D2 · Cognitive Complexity · uv_install_wheel.run_uv_install (cognitive 18) · ×1
  • uv_install_wheel.run_uv_install (cognitive 18) scripts/ci/uv_install_wheel.py:30 — uv_install_wheel.run_uv_install has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 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.
D2 · Cognitive Complexity · fetch_patch_candidates.find_commit_via_github (cognitive 18) · ×1
  • fetch_patch_candidates.find_commit_via_github (cognitive 18) scripts/fetch_patch_candidates.py:312 — fetch_patch_candidates.find_commit_via_github has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 2 (5 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ExampleInfo · ×1
  • ExampleInfo::parse (cognitive 17) crates/build/re_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.
D2 · Cognitive Complexity · ExtensionClass · ×1
  • ExtensionClass::new (cognitive 17) crates/build/re_types_builder/src/codegen/python/mod.rs:201 — 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.
D2 · Cognitive Complexity · DirectoryImporter · ×1
  • DirectoryImporter::import_from_path (cognitive 17) crates/data_flow/re_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.
D2 · Cognitive Complexity · McapImporter · ×1
  • McapImporter::emit_chunks (cognitive 17) crates/data_flow/re_importer/src/importer_mcap/importer.rs:141 — 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.
D2 · Cognitive Complexity · EntityPath · ×1
  • EntityPath::short_names_with_disambiguation (cognitive 17) crates/store/re_log_types/src/path/entity_path.rs:349 — 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.
D2 · Cognitive Complexity · RecordBatchGrpcOutputStream · ×1
  • RecordBatchGrpcOutputStream::poll_next (cognitive 17) crates/store_app/re_datafusion/src/table_entry_provider.rs:551 — 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.
D2 · Cognitive Complexity · RerunCloudHandler · ×1
  • RerunCloudHandler::find_entries (cognitive 17) crates/store_app/re_server/src/rerun_cloud/mod.rs:838 — RerunCloudHandler::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.
D2 · Cognitive Complexity · InMemoryStore · ×1
  • InMemoryStore::load_directory_as_dataset (cognitive 17) crates/store_app/re_server/src/store/in_memory_store.rs:210 — 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.
D2 · Cognitive Complexity · PrintCommand · ×1
  • PrintCommand::run (cognitive 17) crates/top/rerun/src/commands/rrd/print.rs:69 — PrintCommand::run has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 4 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rerun_c · ×1
  • rerun_c::rr_recording_stream_flush_blocking (cognitive 17) crates/top/rerun_c/src/lib.rs:733 — rerun_c::rr_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.
D2 · Cognitive Complexity · DataFusionTableDelegate · ×1
  • DataFusionTableDelegate::header_cell_ui (cognitive 17) crates/viewer_support/re_dataframe_ui/src/datafusion_table_widget.rs:1999 — DataFusionTableDelegate::header_cell_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DisplayComponentColumn · ×1
  • DisplayComponentColumn::data_ui (cognitive 17) crates/viewer_support/re_dataframe_ui/src/display_record_batch.rs:224 — 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.
D2 · Cognitive Complexity · BlueprintResolvedLatestAtResults · ×1
  • BlueprintResolvedLatestAtResults::resolve_annotation_context (cognitive 17) crates/viewer_support/re_view/src/annotation_context_resolver.rs:285 — BlueprintResolvedLatestAtResults::resolve_annotation_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ViewerUrl · ×1
  • ViewerUrl::parse_with_options (cognitive 17) crates/viewer_support/re_viewer_context/src/viewer_url.rs:190 — ViewerUrl::parse_with_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 2 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · VoxelGridMapVisualizer · ×1
  • VoxelGridMapVisualizer::process_voxel_grid_map (cognitive 17) crates/views/re_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.
D2 · Cognitive Complexity · VideoFrameDecoder._try_emit_view_windows (cognitive 17) · ×1
  • VideoFrameDecoder._try_emit_view_windows (cognitive 17) rerun_py/rerun_sdk/rerun/experimental/dataloader/decoders/_video.py:566 — VideoFrameDecoder._try_emit_view_windows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rust_checks.main (cognitive 17) · ×1
  • rust_checks.main (cognitive 17) scripts/ci/rust_checks.py:133 — rust_checks.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (5 pts), 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.
D2 · Cognitive Complexity · verify_release.check_website (cognitive 17) · ×1
  • verify_release.check_website (cognitive 17) scripts/ci/verify_release.py:180 — verify_release.check_website has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 4 (6 pts), boolean chains 4, 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.
D2 · Cognitive Complexity · LintJob.run_cmd (cognitive 17) · ×1
  • LintJob.run_cmd (cognitive 17) scripts/fast_lint.py:55 — LintJob.run_cmd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generate_crate_graph.collect_graph (cognitive 17) · ×1
  • generate_crate_graph.collect_graph (cognitive 17) scripts/generate_crate_graph.py:188 — generate_crate_graph.collect_graph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 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.
D2 · Cognitive Complexity · lint.is_missing_blank_line_between (cognitive 17) · ×1
  • lint.is_missing_blank_line_between (cognitive 17) scripts/lint.py:799 — lint.is_missing_blank_line_between has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · render_d2.replace_foreign_objects (cognitive 17) · ×1
  • render_d2.replace_foreign_objects (cognitive 17) scripts/render_d2.py:157 — render_d2.replace_foreign_objects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 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.
D2 · Cognitive Complexity · run_all.run_native (cognitive 17) · ×1
  • run_all.run_native (cognitive 17) scripts/run_all.py:318 — run_all.run_native has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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.
D2 · Cognitive Complexity · re_build_tools · ×1
  • re_build_tools::export_build_info_vars_for_crate (cognitive 16) crates/build/re_build_tools/src/lib.rs:127 — re_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.
D2 · Cognitive Complexity · Visitor · ×1
  • Visitor::visit_children (cognitive 16) crates/build/re_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.
D2 · Cognitive Complexity · ArchetypeImporter · ×1
  • ArchetypeImporter::import_from_file_contents (cognitive 16) crates/data_flow/re_importer/src/importer_archetype.rs:55 — ArchetypeImporter::import_from_file_contents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · UrdfTree · ×1
  • UrdfTree::compute_joint_transform_batches (cognitive 16) crates/data_flow/re_importer/src/importer_urdf/urdf_tree.rs:247 — 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.
D2 · Cognitive Complexity · re_lerobot · ×1
  • re_lerobot::emits::build_emits (cognitive 16) crates/data_flow/re_lerobot/src/emits.rs:104 — re_lerobot::emits::build_emits has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · AgentPanel · ×1
  • AgentPanel::ui (cognitive 16) crates/panels/re_agent_ui/src/ui/agent_panel.rs:482 — AgentPanel::ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 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.
D2 · Cognitive Complexity · TimeColumn · ×1
  • TimeColumn::sanity_check (cognitive 16) crates/store/re_chunk/src/chunk.rs:1969 — 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.
D2 · Cognitive Complexity · RrdManifestBuilder · ×1
  • RrdManifestBuilder::append (cognitive 16) crates/store/re_chunk_index/src/rrd_manifest_builder.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.
D2 · Cognitive Complexity · Parser · ×1
  • Parser::term (cognitive 16) crates/store/re_lenses_core/src/selector/parser.rs:305 — Parser::term has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Timestamp · ×1
  • Timestamp::format_opt (cognitive 16) crates/store/re_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.
D2 · Cognitive Complexity · ChunkPrioritizer · ×1
  • ChunkPrioritizer::find_chunks_with_archetypes (cognitive 16) crates/store_app/re_entity_db/src/rrd_manifest_index/chunk_prioritizer.rs:471 — ChunkPrioritizer::find_chunks_with_archetypes 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.
D2 · Cognitive Complexity · DownloadCommand · ×1
  • DownloadCommand::run (cognitive 16) crates/top/rerun/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.
D2 · Cognitive Complexity · Verifier · ×1
  • Verifier::verify_component_column (cognitive 16) crates/top/rerun/src/commands/rrd/verify.rs:149 — Verifier::verify_component_column has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · Vp9KeyframeHeader · ×1
  • Vp9KeyframeHeader::parse (cognitive 16) crates/utils/re_video/src/vp9.rs:41 — 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.
D2 · Cognitive Complexity · LatestAtInstanceResult · ×1
  • LatestAtInstanceResult::data_ui (cognitive 16) crates/viewer_support/re_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.
D2 · Cognitive Complexity · LegendWidget · ×1
  • LegendWidget::show_entries (cognitive 16) crates/viewer_support/re_plot/src/legend.rs:76 — 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.
D2 · Cognitive Complexity · re_time_ruler · ×1
  • re_time_ruler::paint_ticks::paint_ticks (cognitive 16) crates/viewer_support/re_time_ruler/src/paint_ticks.rs:103 — re_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.
D2 · Cognitive Complexity · UiExt · ×1
  • UiExt::native_window_buttons_ui::window_button (cognitive 16) crates/viewer_support/re_ui/src/ui_ext.rs:1004 — 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.
D2 · Cognitive Complexity · re_view_dataframe · ×1
  • re_view_dataframe::dataframe_ui::line_ui (cognitive 16) crates/views/re_view_dataframe/src/dataframe_ui.rs:571 — re_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.
D2 · Cognitive Complexity · TimeColumn.__init__ (cognitive 16) · ×1
  • TimeColumn.__init__ (cognitive 16) rerun_py/rerun_sdk/rerun/_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.
D2 · Cognitive Complexity · Mesh3DExt.__init__ (cognitive 16) · ×1
  • Mesh3DExt.__init__ (cognitive 16) rerun_py/rerun_sdk/rerun/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.
D2 · Cognitive Complexity · DatasetEntry._set_asset_applies_to (cognitive 16) · ×1
  • DatasetEntry._set_asset_applies_to (cognitive 16) rerun_py/rerun_sdk/rerun/catalog/_entry.py:489 — DatasetEntry._set_asset_applies_to has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · crates.publish_unpublished_crates_in_parallel (cognitive 16) · ×1
  • crates.publish_unpublished_crates_in_parallel (cognitive 16) scripts/ci/crates.py:569 — crates.publish_unpublished_crates_in_parallel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · run_all.run_web (cognitive 16) · ×1
  • run_all.run_web (cognitive 16) scripts/run_all.py:243 — run_all.run_web has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 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.
D2 · Cognitive Complexity · update_docs_url_rewrite.update_url_map_rewrite_rules (cognitive 16) · ×1
  • update_docs_url_rewrite.update_url_map_rewrite_rules (cognitive 16) scripts/update_docs_url_rewrite.py:55 — update_docs_url_rewrite.update_url_map_rewrite_rules has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), 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.
D2 · Cognitive Complexity · check_joint_mapping.main (cognitive 16) · ×1
  • check_joint_mapping.main (cognitive 16) skills/rerun-urdf/scripts/check_joint_mapping.py:108 — check_joint_mapping.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), ternaries 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Medium CVE · ×1
  • REDACTED
D35 · Change Coupling · Change-coupling hub · ×1
  • Change-coupling hub: view_class.rs → view_class.rs, view_class.rs, view_class.rs crates/views/re_view_text_document/src/view_class.rs — `crates/views/re_view_text_document/src/view_class.rs` changes together with 3 other files — `crates/views/re_view_bar_chart/src/view_class.rs`, `crates/views/re_view_tensor/src/view_class.rs`, `crates/views/re_view_text_log/src/view_class.rs` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (57 shared lines) · ×1
  • Near-duplicate member pair (57 shared lines) crates/panels/re_selection_panel/src/view_entity_picker.rs:332 — crates/panels/re_selection_panel/src/view_entity_picker.rs:332-436 | crates/panels/re_time_panel/src/streams_tree_data.rs:109-214 — 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.
D4 · Code Duplication · Near-duplicate member pair (48 shared lines) · ×1
  • 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 · Near-duplicate member pair (37 shared lines) · ×1
  • Near-duplicate member pair (37 shared lines) crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:103 — crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:103-152 | crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:155-197 — These two members are variants of one another: 37 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 · Near-duplicate member pair (35 shared lines) · ×1
  • Near-duplicate member pair (35 shared lines) crates/views/re_view_time_series/src/line_visualizer_system.rs:278 — crates/views/re_view_time_series/src/line_visualizer_system.rs:278-343 | crates/views/re_view_time_series/src/line_visualizer_system.rs:352-412 — These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (24 shared lines) · ×1
  • Near-duplicate member pair (24 shared lines) crates/views/re_view_time_series/src/series_query.rs:202 — crates/views/re_view_time_series/src/series_query.rs:202-291 | crates/views/re_view_time_series/src/series_query.rs:377-436 — 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 (50 corresponding lines) · ×1
  • Edited copy of a member (50 corresponding lines) crates/panels/re_blueprint_tree/src/blueprint_tree.rs:743 — crates/panels/re_blueprint_tree/src/blueprint_tree.rs:743-792 | crates/panels/re_time_panel/src/time_panel.rs:1288-1338 — These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×1
  • 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.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×1
  • 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.
D4 · Code Duplication · Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
  • 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:448-459 | examples/python/open_photogrammetry_format/open_photogrammetry_format.py:59-70 | scripts/upload_image.py:362-373 — 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) · ×1
  • Members sharing a duplicated core (6 members, 50+ identical tokens) crates/utils/re_perf_telemetry/src/prometheus.rs:208 — crates/utils/re_perf_telemetry/src/prometheus.rs:208-230 | crates/utils/re_perf_telemetry/src/prometheus.rs:238-257 | crates/utils/re_perf_telemetry/src/prometheus.rs:265-286 | crates/utils/re_perf_telemetry/src/prometheus.rs:383-405 | crates/utils/re_perf_telemetry/src/prometheus.rs:413-432 | crates/utils/re_perf_telemetry/src/prometheus.rs:440-461 — 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 · Duplicated block (41–42 lines × 2) · ×1
  • Duplicated block (41–42 lines × 2) crates/viewer_support/re_view/src/query.rs:333 — crates/viewer_support/re_view/src/query.rs:333-374 | crates/viewer_support/re_view/src/query.rs:525-565 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (39 lines × 2) · ×1
  • Duplicated block (39 lines × 2) crates/panels/re_blueprint_tree/src/blueprint_tree.rs:754 — crates/panels/re_blueprint_tree/src/blueprint_tree.rs:754-792 | crates/panels/re_time_panel/src/time_panel.rs:1300-1338 — 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.
D4 · Code Duplication · Duplicated block (30 lines × 2) · ×1
  • Duplicated block (30 lines × 2) crates/data_flow/re_importer/src/importer_urdf/mod.rs:78 — crates/data_flow/re_importer/src/importer_urdf/mod.rs:78-107 | crates/data_flow/re_importer/src/importer_urdf/mod.rs:123-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.
D4 · Code Duplication · Duplicated block (25–27 lines × 2) · ×1
  • Duplicated block (25–27 lines × 2) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:845 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:845-871 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:884-908 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 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.
D4 · Code Duplication · Duplicated block (26–27 lines × 2) · ×1
  • Duplicated block (26–27 lines × 2) crates/views/re_view_spatial/src/visualizers/boxes2d.rs:84 — crates/views/re_view_spatial/src/visualizers/boxes2d.rs:84-110 | crates/views/re_view_spatial/src/visualizers/ellipses2d.rs:103-128 — before extracting anything, compare `crates/views/re_view_spatial/src/visualizers/boxes2d.rs` and `crates/views/re_view_spatial/src/visualizers/ellipses2d.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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.
D4 · Code Duplication · Duplicated block (24–26 lines × 2) · ×1
  • Duplicated block (24–26 lines × 2) crates/viewer_support/re_view/src/blueprint_resolved_results.rs:162 — crates/viewer_support/re_view/src/blueprint_resolved_results.rs:162-185 | crates/viewer_support/re_view/src/blueprint_resolved_results.rs:337-362 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (19–24 lines × 3) · ×1
  • Duplicated block (19–24 lines × 3) crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:454 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:454-472 | crates/viewer_support/re_renderer/src/renderer/lines.rs:722-743 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:777-800 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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.
D4 · Code Duplication · Duplicated block (20–22 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (13–21 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (18–20 lines × 2) · ×1
  • Duplicated block (18–20 lines × 2) crates/panels/re_selection_panel/src/view_entity_picker.rs:359 — crates/panels/re_selection_panel/src/view_entity_picker.rs:359-376 | crates/panels/re_time_panel/src/streams_tree_data.rs:137-156 — before extracting anything, compare `crates/panels/re_selection_panel/src/view_entity_picker.rs` and `crates/panels/re_time_panel/src/streams_tree_data.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. 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.
D4 · Code Duplication · Duplicated block (19–20 lines × 2) · ×1
  • Duplicated block (19–20 lines × 2) crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:80 — crates/store/re_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:80-99 | crates/store/re_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.
D4 · Code Duplication · Duplicated block (16–20 lines × 2) · ×1
  • Duplicated block (16–20 lines × 2) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:204 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:204-219 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:195-214 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 203 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.
D4 · Code Duplication · Duplicated block (18–19 lines × 2) · ×1
  • Duplicated block (18–19 lines × 2) crates/views/re_view_time_series/src/line_series_loader.rs:112 — crates/views/re_view_time_series/src/line_series_loader.rs:112-130 | crates/views/re_view_time_series/src/point_visualizer_system.rs:197-214 — before extracting anything, compare `crates/views/re_view_time_series/src/line_series_loader.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 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.
D4 · Code Duplication · Duplicated block (18 lines × 3) · ×1
  • Duplicated block (18 lines × 3) crates/utils/re_perf_telemetry/src/prometheus.rs:658 — crates/utils/re_perf_telemetry/src/prometheus.rs:658-675 | crates/utils/re_perf_telemetry/src/prometheus.rs:695-712 | crates/utils/re_perf_telemetry/src/prometheus.rs:732-749 — 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.
D4 · Code Duplication · Duplicated block (14–17 lines × 3) · ×1
  • Duplicated block (14–17 lines × 3) crates/views/re_view_time_series/src/line_visualizer_system.rs:317 — crates/views/re_view_time_series/src/line_visualizer_system.rs:317-330 | crates/views/re_view_time_series/src/line_visualizer_system.rs:386-399 | crates/views/re_view_time_series/src/point_visualizer_system.rs:158-174 — before extracting anything, compare `crates/views/re_view_time_series/src/line_visualizer_system.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 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.
D4 · Code Duplication · Duplicated block (16–17 lines × 2) · ×1
  • Duplicated block (16–17 lines × 2) crates/utils/re_video/src/decode/mod.rs:286 — crates/utils/re_video/src/decode/mod.rs:286-302 | crates/utils/re_video/src/decode/mod.rs:352-367 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (13–17 lines × 2) · ×1
  • Duplicated block (13–17 lines × 2) crates/viewer_support/re_view/src/annotation_context_resolver.rs:303 — crates/viewer_support/re_view/src/annotation_context_resolver.rs:303-319 | crates/viewer_support/re_view/src/annotation_context_resolver.rs:370-382 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×1
  • Duplicated block (15–16 lines × 2) crates/store/re_log_types/src/path/entity_path_part.rs:60 — crates/store/re_log_types/src/path/entity_path_part.rs:60-75 | crates/store/re_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.
D4 · Code Duplication · Duplicated block (12–16 lines × 2) · ×1
  • Duplicated block (12–16 lines × 2) crates/store_app/re_datafusion/src/pipeline_budget.rs:1486 — crates/store_app/re_datafusion/src/pipeline_budget.rs:1486-1501 | crates/store_app/re_datafusion/src/pipeline_budget.rs:1517-1528 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (10–16 lines × 2) · ×1
  • Duplicated block (10–16 lines × 2) crates/views/re_view_time_series/src/line_series_loader.rs:349 — crates/views/re_view_time_series/src/line_series_loader.rs:349-364 | crates/views/re_view_time_series/src/point_visualizer_system.rs:446-455 — before extracting anything, compare `crates/views/re_view_time_series/src/line_series_loader.rs` and `crates/views/re_view_time_series/src/point_visualizer_system.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 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.
D4 · Code Duplication · Duplicated block (13–15 lines × 5) · ×1
  • Duplicated block (13–15 lines × 5) crates/top/re_viewer/data/quick_start_guides/quick_start_connect.rs:12 — crates/top/re_viewer/data/quick_start_guides/quick_start_connect.rs:12-24 | crates/top/re_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 — 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.
D4 · Code Duplication · Duplicated block (14–15 lines × 4) · ×1
  • Duplicated block (14–15 lines × 4) crates/store/re_chunk/src/iter.rs:479 — crates/store/re_chunk/src/iter.rs:479-492 | crates/store/re_chunk/src/iter.rs:567-581 | crates/store/re_chunk/src/iter.rs:640-653 | crates/store/re_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.
D4 · Code Duplication · Duplicated block (14–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) crates/views/re_view_graph/src/layout/provider.rs:130 — crates/views/re_view_graph/src/layout/provider.rs:130-144 | crates/views/re_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.
D4 · Code Duplication · Duplicated block (13–14 lines × 5) · ×1
  • Duplicated block (13–14 lines × 5) crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:485 — crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs:485-498 | crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:801-813 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:830-843 | crates/viewer_support/re_renderer/src/renderer/volume.rs:322-334 | crates/viewer_support/re_renderer/src/renderer/voxel_grid.rs:400-412 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/depth_cloud.rs` and `crates/viewer_support/re_renderer/src/renderer/point_cloud.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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.
D4 · Code Duplication · Duplicated block (14 lines × 4) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (10–14 lines × 2) · ×1
  • Duplicated block (10–14 lines × 2) crates/store_app/re_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:438 — crates/store_app/re_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:438-447 | crates/store_app/re_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.
D4 · Code Duplication · Duplicated block (13 lines × 4) · ×1
  • Duplicated block (13 lines × 4) crates/views/re_view_spatial/src/visualizers/arrows2d.rs:245 — crates/views/re_view_spatial/src/visualizers/arrows2d.rs:245-257 | crates/views/re_view_spatial/src/visualizers/arrows3d.rs:249-261 | crates/views/re_view_spatial/src/visualizers/lines2d.rs:239-251 | crates/views/re_view_spatial/src/visualizers/lines3d.rs:250-262 — 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.
D4 · Code Duplication · Duplicated block (11–13 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (10–12 lines × 6) · ×1
  • Duplicated block (10–12 lines × 6) crates/utils/re_perf_telemetry/src/prometheus.rs:209 — crates/utils/re_perf_telemetry/src/prometheus.rs:209-220 | crates/utils/re_perf_telemetry/src/prometheus.rs:239-248 | crates/utils/re_perf_telemetry/src/prometheus.rs:266-276 | crates/utils/re_perf_telemetry/src/prometheus.rs:384-395 | crates/utils/re_perf_telemetry/src/prometheus.rs:414-423 | crates/utils/re_perf_telemetry/src/prometheus.rs:441-451 — 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.
D4 · Code Duplication · Duplicated block (8–12 lines × 2) · ×1
  • Duplicated block (8–12 lines × 2) crates/utils/re_perf_telemetry/src/prometheus.rs:297 — crates/utils/re_perf_telemetry/src/prometheus.rs:297-308 | crates/utils/re_perf_telemetry/src/prometheus.rs:359-366 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (4–12 lines × 3) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (10–11 lines × 5) · ×1
  • Duplicated block (10–11 lines × 5) crates/viewer_support/re_renderer/src/renderer/debug_overlay.rs:248 — crates/viewer_support/re_renderer/src/renderer/debug_overlay.rs:248-257 | crates/viewer_support/re_renderer/src/renderer/generic_skybox.rs:177-186 | crates/viewer_support/re_renderer/src/renderer/world_grid.rs:201-210 | crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs:273-283 | crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs:580-590 — before extracting anything, compare `crates/viewer_support/re_renderer/src/resource_managers/bayer_converter.rs` and `crates/viewer_support/re_renderer/src/resource_managers/yuv_converter.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 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.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1
  • Duplicated block (11 lines × 3) crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:701 — crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs:701-711 | crates/viewer_support/re_renderer/src/renderer/lines.rs:690-700 | crates/viewer_support/re_renderer/src/renderer/point_cloud.rs:716-726 — before extracting anything, compare `crates/viewer_support/re_renderer/src/renderer/gaussian_splat.rs` and `crates/viewer_support/re_renderer/src/renderer/lines.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.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1
  • Duplicated block (10–11 lines × 2) crates/viewer_support/re_viewer_context/src/image_info.rs:405 — crates/viewer_support/re_viewer_context/src/image_info.rs:405-414 | crates/viewer_support/re_viewer_context/src/image_info.rs:420-430 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (5–10 lines × 3) · ×1
  • Duplicated block (5–10 lines × 3) crates/utils/re_format/src/duration.rs:143 — crates/utils/re_format/src/duration.rs:143-147 | crates/utils/re_format/src/duration.rs:149-158 | crates/utils/re_format/src/duration.rs:161-171 — 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.
D4 · Code Duplication · Duplicated block (5–8 lines × 2) · ×1
  • Duplicated block (5–8 lines × 2) crates/utils/re_crash_handler/src/lib.rs:290 — crates/utils/re_crash_handler/src/lib.rs:290-297 | crates/utils/re_memory/src/backtrace_native.rs:100-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.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) crates/viewer_support/re_viewer_context/src/viewer_url.rs:963 — crates/viewer_support/re_viewer_context/src/viewer_url.rs:963-968 | crates/viewer_support/re_viewer_context/src/viewer_url.rs:1016-1022 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (5 lines × 5) · ×1
  • Duplicated block (5 lines × 5) crates/store/re_uri/src/endpoints/catalog.rs:47 — crates/store/re_uri/src/endpoints/catalog.rs:47-51 | crates/store/re_uri/src/endpoints/dataset.rs:223-227 | crates/store/re_uri/src/endpoints/folder.rs:66-70 | crates/store/re_uri/src/endpoints/proxy.rs:46-50 | crates/store/re_uri/src/redap_uri.rs:166-170 — 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.
D4 · Code Duplication · Duplicated block (7 lines × 7) · ×1
  • Duplicated block (7 lines × 7) rerun_py/src/chunk_stream/engine.rs:666 — rerun_py/src/chunk_stream/engine.rs:666-672 | rerun_py/src/chunk_stream/hdf5_reader.rs:276-282 | rerun_py/src/chunk_stream/lerobot_reader.rs:203-209 | rerun_py/src/chunk_stream/mcap_reader.rs:528-534 | rerun_py/src/chunk_stream/mp4_reader.rs:239-245 | rerun_py/src/chunk_stream/parquet_reader.rs:239-245 | rerun_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 7 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:522 — crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:522-534 | crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:581-593 | crates/viewer_support/re_renderer/src/renderer/mesh_renderer.rs:613-625 — 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.
D4 · Code Duplication · Duplicated block (55 lines × 2) · ×1
  • Duplicated block (55 lines × 2) rerun_py/rerun_sdk/rerun/archetypes/capsules3d_ext.py:29 — rerun_py/rerun_sdk/rerun/archetypes/capsules3d_ext.py:29-83 | rerun_py/rerun_sdk/rerun/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.
D4 · Code Duplication · Duplicated block (49–55 lines × 2) · ×1
  • Duplicated block (49–55 lines × 2) rerun_py/rerun_sdk/rerun/sinks.py:181 — rerun_py/rerun_sdk/rerun/sinks.py:181-235 | rerun_py/rerun_sdk/rerun/sinks.py:251-299 — both copies are in the same file, so extract the 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.
D4 · Code Duplication · Duplicated block (52–53 lines × 2) · ×1
  • Duplicated block (52–53 lines × 2) rerun_py/rerun_sdk/rerun/archetypes/points2d_ext.py:26 — rerun_py/rerun_sdk/rerun/archetypes/points2d_ext.py:26-78 | rerun_py/rerun_sdk/rerun/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.
D4 · Code Duplication · Duplicated block (37–43 lines × 3) · ×1
  • Duplicated block (37–43 lines × 3) rerun_py/rerun_sdk/rerun/archetypes/asset3d_ext.py:23 — rerun_py/rerun_sdk/rerun/archetypes/asset3d_ext.py:23-65 | rerun_py/rerun_sdk/rerun/archetypes/asset_audio_ext.py:22-60 | rerun_py/rerun_sdk/rerun/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 all 3 call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (27–30 lines × 2) · ×1
  • Duplicated block (27–30 lines × 2) rerun_py/rerun_sdk/rerun/blueprint/api.py:785 — rerun_py/rerun_sdk/rerun/blueprint/api.py:785-814 | rerun_py/rerun_sdk/rerun/blueprint/table.py:281-307 — 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.
D4 · Code Duplication · Duplicated block (27 lines × 2) · ×1
  • Duplicated block (27 lines × 2) scripts/upload_image.py:326 — scripts/upload_image.py:326-352 | scripts/upload_rrd.py:62-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. 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.
D4 · Code Duplication · Duplicated block (19–22 lines × 2) · ×1
  • Duplicated block (19–22 lines × 2) rerun_py/rerun_sdk/rerun/experimental/dataloader/_iterable_dataset.py:354 — rerun_py/rerun_sdk/rerun/experimental/dataloader/_iterable_dataset.py:354-375 | rerun_py/rerun_sdk/rerun/experimental/dataloader/_map_dataset.py:187-205 — 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 `rerun_py/rerun_sdk/rerun/experimental/dataloader/_iterable_dataset.py:354` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11–14 lines × 3) · ×1
  • Duplicated block (11–14 lines × 3) docs/snippets/compare_snippet_output.py:100 — docs/snippets/compare_snippet_output.py:100-113 | scripts/ci/sync_release_assets.py:263-273 | scripts/run_all.py:355-365 — 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 `docs/snippets/compare_snippet_output.py:100` 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.
D4 · Code Duplication · Duplicated block (6–10 lines × 3) · ×1
  • Duplicated block (6–10 lines × 3) docs/snippets/all/tutorials/dna.py:50 — docs/snippets/all/tutorials/dna.py:50-56 | docs/snippets/all/tutorials/dna.py:66-75 | examples/python/dna/dna.py:45-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:66` 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, `docs/snippets/all/tutorials/dna.py:76` calls `bounce_lerp` and `docs/snippets/all/tutorials/dna.py:56` 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.
D4 · Code Duplication · Duplicated block (9 lines × 7) · ×1
  • 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:451-459 | examples/python/open_photogrammetry_format/open_photogrammetry_format.py:62-70 | scripts/upload_image.py:365-373 — 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.
D4 · Code Duplication · Duplicated block (43 lines × 2) · ×1
  • Duplicated block (43 lines × 2) rerun_py/rerun_sdk/rerun/archetypes/arrows2d_ext.py:26 — rerun_py/rerun_sdk/rerun/archetypes/arrows2d_ext.py:26-73 | rerun_py/rerun_sdk/rerun/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.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×1
  • Duplicated block (8 lines × 4) rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py:43 — rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py:43-50 | rerun_py/rerun_sdk/rerun/archetypes/mesh3d_ext.py:34-41 | rerun_py/rerun_sdk/rerun/archetypes/segmentation_image_ext.py:29-36 | rerun_py/rerun_sdk/rerun/encodings/tensor_data_ext.py:36-43 — before extracting anything, compare `rerun_py/rerun_sdk/rerun/archetypes/depth_image_ext.py` and `rerun_py/rerun_sdk/rerun/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.
D4 · Code Duplication · Duplicated block (29–30 lines × 2) · ×1
  • Duplicated block (29–30 lines × 2) crates/viewer_support/re_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:57 — crates/viewer_support/re_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:57-86 | crates/viewer_support/re_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.
D4 · Code Duplication · Duplicated block (17–18 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (11–14 lines × 2) · ×1
  • 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.
D5 · Coupling · Unstable project re_agent_ui · ×1
  • Unstable project re_agent_ui — re_agent_ui has instability 0.86 with 1 dependents.
D5 · Coupling · Unstable project re_arrow_json · ×1
  • Unstable project re_arrow_json — re_arrow_json has instability 0.88 with 1 dependents.
D5 · Coupling · Unstable project re_blueprint_tree · ×1
  • Unstable project re_blueprint_tree — re_blueprint_tree has instability 0.91 with 1 dependents.
D5 · Coupling · Unstable project re_catalog_client · ×1
  • Unstable project re_catalog_client — re_catalog_client has instability 0.82 with 3 dependents.
D5 · Coupling · Unstable project re_chunk_optimizer · ×1
  • Unstable project re_chunk_optimizer — re_chunk_optimizer has instability 0.83 with 2 dependents.
D5 · Coupling · Unstable project re_chunk_store_ui · ×1
  • Unstable project re_chunk_store_ui — re_chunk_store_ui has instability 0.91 with 1 dependents.
D5 · Coupling · Unstable project re_dataframe_ui · ×1
  • Unstable project re_dataframe_ui — re_dataframe_ui has instability 0.87 with 4 dependents.
D5 · Coupling · Unstable project re_datafusion · ×1
  • Unstable project re_datafusion — re_datafusion has instability 0.87 with 3 dependents.
D5 · Coupling · Unstable project re_grpc_client · ×1
  • Unstable project re_grpc_client — re_grpc_client has instability 0.81 with 3 dependents.
D5 · Coupling · Unstable project re_hdf5 · ×1
  • Unstable project re_hdf5 — re_hdf5 has instability 0.83 with 1 dependents.
D5 · Coupling · Unstable project re_importer · ×1
  • Unstable project re_importer — re_importer has instability 0.82 with 4 dependents.
D5 · Coupling · Unstable project re_lerobot · ×1
  • Unstable project re_lerobot — re_lerobot has instability 0.83 with 2 dependents.
D5 · Coupling · Unstable project re_recording_panel · ×1
  • Unstable project re_recording_panel — re_recording_panel has instability 0.92 with 1 dependents.
D5 · Coupling · Unstable project re_redap_browser · ×1
  • Unstable project re_redap_browser — re_redap_browser has instability 0.90 with 2 dependents.
D5 · Coupling · Unstable project re_sdk · ×1
  • Unstable project re_sdk — re_sdk has instability 0.84 with 4 dependents.
D5 · Coupling · Unstable project re_selection_panel · ×1
  • Unstable project re_selection_panel — re_selection_panel has instability 0.94 with 1 dependents.
D5 · Coupling · Unstable project re_server · ×1
  • Unstable project re_server — re_server has instability 0.83 with 4 dependents.
D5 · Coupling · Unstable project re_test_context · ×1
  • Unstable project re_test_context — re_test_context has instability 0.95 with 1 dependents.
D5 · Coupling · Unstable project re_tf · ×1
  • Unstable project re_tf — re_tf has instability 0.83 with 2 dependents.
D5 · Coupling · Unstable project re_time_panel · ×1
  • Unstable project re_time_panel — re_time_panel has instability 0.94 with 1 dependents.
D5 · Coupling · Unstable project re_view_audio · ×1
  • Unstable project re_view_audio — re_view_audio has instability 0.93 with 1 dependents.
D5 · Coupling · Unstable project re_view_bar_chart · ×1
  • Unstable project re_view_bar_chart — re_view_bar_chart has instability 0.91 with 1 dependents.
D5 · Coupling · Unstable project re_view_dataframe · ×1
  • Unstable project re_view_dataframe — re_view_dataframe has instability 0.94 with 1 dependents.
D5 · Coupling · Unstable project re_view_graph · ×1
  • Unstable project re_view_graph — re_view_graph has instability 0.93 with 1 dependents.
D5 · Coupling · Unstable project re_view_map · ×1
  • Unstable project re_view_map — re_view_map has instability 0.93 with 1 dependents.
D5 · Coupling · Unstable project re_view_spatial · ×1
  • Unstable project re_view_spatial — re_view_spatial has instability 0.96 with 1 dependents.
D5 · Coupling · Unstable project re_view_state_timeline · ×1
  • Unstable project re_view_state_timeline — re_view_state_timeline has instability 0.91 with 1 dependents.
D5 · Coupling · Unstable project re_view_tensor · ×1
  • Unstable project re_view_tensor — re_view_tensor has instability 0.92 with 1 dependents.
D5 · Coupling · Unstable project re_view_text_document · ×1
  • Unstable project re_view_text_document — re_view_text_document has instability 0.89 with 1 dependents.
D5 · Coupling · Unstable project re_view_text_log · ×1
  • Unstable project re_view_text_log — re_view_text_log has instability 0.93 with 1 dependents.
D5 · Coupling · Unstable project re_view_time_series · ×1
  • Unstable project re_view_time_series — re_view_time_series has instability 0.94 with 1 dependents.
D5 · Coupling · Unstable project re_viewer · ×1
  • Unstable project re_viewer — re_viewer has instability 0.99 with 1 dependents.
D5 · Coupling · Unstable project re_viewport · ×1
  • Unstable project re_viewport — re_viewport has instability 0.91 with 1 dependents.
D5 · Coupling · Unstable project rerun · ×1
  • Unstable project rerun — rerun has instability 0.96 with 2 dependents.
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — the node:test suite in rerun_js/web-viewer/ ran and not one test passed (throw new ERR_UNKNOWN_FILE_EXTENSION(ext, filepath);), so the coverage report describes the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×1
  • Sync-over-async blocking crates/utils/re_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.
R10 · Code Duplication · Duplicated block (13 lines × 2 locations) · ×1
  • Duplicated block (13 lines × 2 locations) rerun_js/web-viewer/index.ts:1744 — rerun_js/web-viewer/index.ts:1744 · rerun_js/web-viewer/index.ts:1759 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (9 lines × 2 locations) · ×1
  • Duplicated block (9 lines × 2 locations) rerun_js/web-viewer/index.ts:1526 — rerun_js/web-viewer/index.ts:1526 · rerun_js/web-viewer/index.ts:1548 — 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.
R2 · Cyclomatic Complexity · Complex function collect_targets (cyclomatic 17, cognitive 20) · ×1
  • Complex function collect_targets (cyclomatic 17, cognitive 20) rerun_js/web-viewer/typedoc-used-by.mjs:97 — collect_targets has cyclomatic complexity 17 and cognitive complexity 20; 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.
R2 · Cyclomatic Complexity · Complex function start (cyclomatic 14, cognitive 13) · ×1
  • Complex function start (cyclomatic 14, cognitive 13) rerun_js/web-viewer/index.ts:1330 — 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.
R2 · Cyclomatic Complexity · Complex function close_target_of (cyclomatic 13, cognitive 9) · ×1
  • Complex function close_target_of (cyclomatic 13, cognitive 9) rerun_js/web-viewer/index.ts:663 — close_target_of has cyclomatic complexity 13 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.
R2 · Cyclomatic Complexity · Complex function (top-level) (cyclomatic 11, cognitive 21) · ×1
  • Complex function (top-level) (cyclomatic 11, cognitive 21) rerun_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 · rerun_js/web-viewer/index.ts · ×1
  • rerun_js/web-viewer/index.ts: 2318 lines of code rerun_js/web-viewer/index.ts:1 — rerun_js/web-viewer/index.ts has 2318 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R7 · Dead Code · Dead file (~140 LoC) · ×1
  • Dead file (~140 LoC) rerun_js/web-viewer/typedoc-used-by.mjs — no import path from any entry point (11 application, 5 tooling, 13 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R8 · Dependency Hygiene · Unused dependency '@bufbuild/protoc-gen-es' · ×1
  • Unused dependency '@bufbuild/protoc-gen-es' — Declared in rerun_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.
R8 · Dependency Hygiene · Unused dependency 'dts-buddy' · ×1
  • Unused dependency 'dts-buddy' — Declared in rerun_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.
R8 · Dependency Hygiene · Unused dependency 'typedoc-github-theme' · ×1
  • Unused dependency 'typedoc-github-theme' — Declared in rerun_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.
S1 · Web-Security Posture · Third-party script without Subresource Integrity · ×1
  • 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.
X1 · Async correctness · Blocking `thread · ×1
  • Blocking `thread::sleep` inside an `async` body crates/utils/re_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`.
X24 · Document value interpolated into markup unescaped · Untrusted text written into markup unescaped · ×1
  • Untrusted text written into markup unescaped rerun_notebook/src/js/widget.ts:243 — `String(e)` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Minor — 116 finding(s)
X4 · Structured logging · Interpolated log message defeats structured logging · ×40
  • Interpolated log message defeats structured logging scripts/fast_lint.py:24 — `error` at line 24 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.error("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.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:64 — `info` at line 64 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:67 — `info` at line 67 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:75 — `info` at line 75 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:92 — `info` at line 92 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:93 — `debug` at line 93 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.debug("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.debug("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:95 — `info` at line 95 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:160 — `debug` at line 160 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.debug("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.debug("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:189 — `error` at line 189 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.error("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.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:198 — `info` at line 198 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/fast_lint.py:201 — `info` at line 201 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/nbstripout.py:46 — `debug` at line 46 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.debug("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.debug("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/render_d2.py:328 — `info` at line 328 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/update_docs_url_rewrite.py:74 — `info` at line 74 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/update_docs_url_rewrite.py:142 — `info` at line 142 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/update_docs_url_rewrite.py:185 — `info` at line 185 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/update_docs_url_rewrite.py:222 — `error` at line 222 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.error("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.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/upload_image.py:83 — `info` at line 83 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/upload_image.py:281 — `info` at line 281 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/upload_image.py:314 — `info` at line 314 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/upload_image.py:342 — `info` at line 342 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/upload_image.py:348 — `warning` at line 348 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 scripts/upload_rrd.py:78 — `info` at line 78 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging scripts/upload_rrd.py:84 — `warning` at line 84 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 scripts/ci/bundle_and_upload_rerun_cpp.py:53 — `info` at line 53 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.info("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.info("order moved", order_id=order_id, status=status)` with structlog.
  • + 15 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned file · ×28
  • Orphaned file crates/store/re_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 rerun_py/rerun_sdk/rerun/encodings/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/viewer_support/re_viewer_context/src/blueprint_id.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 rerun_py/rerun_sdk/rerun/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 rerun_py/rerun_sdk/rerun/encodings/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 crates/top/re_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 crates/store/re_log_encoding/src/rrd/log_msg.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/re_sdk_types/src/encodings/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 rerun_pixi_env/src/rerun_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_support/re_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 crates/store/re_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/rerun/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/re_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/store/re_log_encoding/src/rrd/decoder/mod.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file crates/store_app/re_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.
  • Orphaned file scripts/ci/uv_install_wheel.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 rerun_py/rerun_sdk/rerun/archetypes/ellipsoids3d_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/re_sdk_types/src/encodings/vec3d_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 run_wasm/src/main.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/re_sdk_types/src/encodings/vec4d_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 rerun_py/rerun_sdk/rerun/archetypes/capsules3d_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 rerun_py/rerun_sdk/rerun/archetypes/points2d_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 rerun_py/rerun_sdk/rerun/archetypes/points3d_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_app/re_query/src/range_zip/mod.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file crates/store/re_sdk_types/src/encodings/vec2d_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.
  • + 3 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×17
  • Duplicated predicate skills/rerun-lerobot/scripts/fetch_lerobot_episodes.py:60 — `HfApi().dataset_info(repo_id, files_metadata=True).siblings or []` appears character-identically in 2 files — skills/rerun-lerobot/scripts/fetch_lerobot_episodes.py, skills/rerun-lerobot/scripts/find_lerobot_dataset.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 rerun_py/rerun_sdk/rerun/archetypes/points2d_ext.py:64 — `class_ids is None and keypoint_ids is not None` appears character-identically in 2 files — rerun_py/rerun_sdk/rerun/archetypes/points2d_ext.py, rerun_py/rerun_sdk/rerun/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 rerun_py/rerun_sdk/rerun/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 — rerun_py/rerun_sdk/rerun/components/geo_line_string_ext.py, rerun_py/rerun_sdk/rerun/components/line_strip2d_ext.py, rerun_py/rerun_sdk/rerun/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 rerun_py/rerun_sdk/rerun/components/geo_line_string_ext.py:64 — `isinstance(data[0], np.ndarray) and data[0].shape == (2,)` appears character-identically in 2 files — rerun_py/rerun_sdk/rerun/components/geo_line_string_ext.py, rerun_py/rerun_sdk/rerun/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 skills/investigate-puffin/compare_traces.py:92 — `name.startswith(prefix) or data.startswith(prefix)` appears character-identically in 2 files — skills/investigate-puffin/compare_traces.py, skills/investigate-puffin/find_scopes.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/panels/re_selection_panel/src/view_entity_picker.rs:418 — `!node_info.is_leaf && !entity_tree.path.is_root()` appears character-identically in 2 files — crates/panels/re_selection_panel/src/view_entity_picker.rs, crates/panels/re_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/views/re_view_time_series/src/line_visualizer_system.rs:186 — `!series.visible || series.points.is_empty()` appears character-identically in 2 files — crates/views/re_view_time_series/src/line_visualizer_system.rs, crates/views/re_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/views/re_view_spatial/src/visualizers/volume_3d.rs:224 — `!voxel_size.is_finite() || !voxel_size.cmpgt(glam::Vec3::ZERO).all()` appears character-identically in 2 files — crates/views/re_view_spatial/src/visualizers/volume_3d.rs, crates/views/re_view_spatial/src/visualizers/voxel_grid_map.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/re_quota_channel/src/async_broadcast_channel.rs:229 — `!warned && BLOCKED_WARNING_THRESHOLD < start.elapsed()` appears character-identically in 2 files — crates/utils/re_quota_channel/src/async_broadcast_channel.rs, crates/utils/re_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/views/re_view_time_series/src/line_series_loader.rs:188 — `all_scalar_chunks.chunks.first() && chunk.is_static()` appears character-identically in 2 files — crates/views/re_view_time_series/src/line_series_loader.rs, crates/views/re_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_support/re_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_support/re_data_ui/src/component_path_ui.rs, crates/viewer_support/re_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/rerun/src/commands/entrypoint.rs:736 — `cfg!(feature = "perf_telemetry") && re_log::env_var_is_truthy("TELEMETRY_ENABLED")` appears character-identically in 2 files — crates/top/rerun/src/commands/entrypoint.rs, rerun_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/re_video/src/h264.rs:198 — `chunk.is_sync && !state.previous_frame_was_idr` appears character-identically in 2 files — crates/utils/re_video/src/h264.rs, crates/utils/re_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/data_flow/re_lerobot/src/emits.rs:185 — `key.as_str() == "task_index" || key.as_str() == "subtask_index"` appears character-identically in 2 files — crates/data_flow/re_lerobot/src/emits.rs, crates/data_flow/re_lerobot/src/parse_v3.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_support/re_viewer_context/src/gpu_bridge/mod.rs:129 — `resolution_in_pixel[0] == 0 || resolution_in_pixel[1] == 0` appears character-identically in 3 files — crates/viewer_support/re_viewer_context/src/gpu_bridge/mod.rs, crates/views/re_view_spatial/src/ui_3d.rs, crates/views/re_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/store/re_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/re_sdk_types/src/components/draw_order_ext.rs, crates/viewer_support/re_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/views/re_view_spatial/src/visualizers/capsules3d.rs:261 — `suspicious_length.is_finite() && suspicious_length > 0.0` appears character-identically in 2 files — crates/views/re_view_spatial/src/visualizers/capsules3d.rs, crates/views/re_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.
D16 · Bus Factor · Off-boarding risk · ×8
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 21 significant file(s) lose their only recent owner: scripts/generate_crate_graph.py, crates/top/re_viewer_mcp/src/lib.rs, crates/utils/re_quota_channel/src/async_broadcast_channel.rs, crates/utils/re_quota_channel/src/sync/mod.rs, crates/views/re_view_spatial/src/visualizers/gaussian_splats3d.rs, crates/utils/re_audio/src/mixer.rs, crates/store/re_log_channel/src/viewer_control.rs, crates/store/re_types_core/src/layer_name.rs (+13 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 8 significant file(s) lose their only recent owner: crates/store/re_chunk_optimizer/src/plan.rs, crates/data_flow/re_hdf5/src/walk.rs, crates/store/re_chunk_optimizer/src/settings.rs, crates/store/re_chunk_optimizer/src/executor/merge_split.rs, crates/store/re_chunk_optimizer/src/executor/cut.rs, crates/data_flow/re_hdf5/src/load.rs, crates/store/re_log_msg/src/log_msg.rs, crates/data_flow/re_hdf5/src/config.rs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 6 significant file(s) lose their only recent owner: crates/data_flow/re_lerobot/src/lenses.rs, crates/data_flow/re_parquet/src/read.rs, crates/data_flow/re_lerobot/src/features.rs, crates/data_flow/re_lerobot/src/diagnostics.rs, crates/data_flow/re_lerobot/src/error.rs, crates/data_flow/re_parquet/src/error.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/re_web/src/fs.rs, crates/store/re_lenses_core/src/combinators/index.rs, crates/data_flow/re_catalog_client/src/staging.rs, crates/top/re_viewer/src/background_tasks.rs, crates/store/re_lenses_core/src/selector/runtime.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: crates/data_flow/re_importer/src/importer_puffin.rs, crates/store/re_protos/src/v1alpha1/rerun.cloud.v1alpha1.ext.asset_properties.rs, crates/store/re_chunk_store/src/lineage_dropping.rs, crates/store/re_chunk_store/src/entity_tree.rs. 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/viewer_support/re_view/src/annotation_context_resolver.rs, crates/viewer_support/re_view/src/component_mapping_query_plan.rs, crates/store/re_sdk_types/src/transform_frame_id_hash.rs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #7 — If anonymized user #7 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/top/re_viewer/src/ui/dev_panel/transform_cache_ui/mod.rs, crates/top/re_viewer/src/ui/dev_panel/transform_cache_ui/model.rs, crates/top/re_viewer/src/ui/dev_panel/transform_cache_ui/layout.rs. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #8 — If anonymized user #8 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/store/re_chunk/src/earliest_at.rs, crates/data_flow/re_mp4_reader/src/asset.rs, scripts/ci/check_skills.py. Pair on, review, or document these before any departure.
X7 · Silent fallback defaults · Silent fallback default on Err · ×8
  • Silent fallback default on Err crates/panels/re_agent_ui/src/ui/transcript_ui.rs:318 — `format_timestamp` turns every `Err` into `"unknown time".to_owned()` — 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/re_tuid/src/lib.rs:345 — `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/re_video/src/decode/ffmpeg_cli/ffmpeg.rs:850 — `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_support/re_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/views/re_view_graph/src/view.rs:70 — `on_register` turns every `Err` into `re_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/views/re_view_spatial/src/view_2d.rs:64 — `on_register` turns every `Err` into `re_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/views/re_view_spatial/src/view_3d.rs:130 — `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/views/re_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.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 7 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 (62 single-owned of 1366 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; 1366 of the 1968 production source files in this repository met that bar). They are anonymized user #9 (2 file(s)), anonymized user #10 (2 file(s)), anonymized user #11 (1 file(s)), anonymized user #12 (1 file(s)), anonymized user #13 (1 file(s)), anonymized user #14 (1 file(s)) (+1 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/store_app/re_datafusion/src/dataframe_query_provider/segment_store.rs, crates/store_app/re_datafusion/src/pipeline/window.rs, skills/investigate-puffin/compare_traces.py, skills/investigate-puffin/find_scopes.py, crates/viewer_support/re_viewer_context/src/app_options.rs, scripts/update_docs_url_rewrite.py, rerun_pixi_env/src/rerun_pixi_env/__init__.py, crates/viewer_support/re_component_ui/src/color_swatch.rs (+1 more).
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 11 of 122 project(s) overshoot their size bounds, lowering Project Cohesion to 8.2/10. The most over is `rerun_py` (41059 LoC, 1053 module-visible types across 29 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 28 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/re_log_types/src/vec_deque_ext.rs, rerun_py/rerun_sdk/rerun/encodings/tensor_data_ext.py, crates/viewer_support/re_viewer_context/src/blueprint_id.rs, rerun_py/rerun_sdk/rerun/blueprint/containers.py, rerun_py/rerun_sdk/rerun/encodings/class_description_ext.py, crates/top/re_sdk/src/blueprint/panel.rs, crates/store/re_log_encoding/src/rrd/log_msg.rs, crates/store/re_sdk_types/src/encodings/image_format_ext.rs (and 20 more) (29 orphaned of 1369 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; 1369 of the 1968 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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • 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.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 65/70 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/build/re_dev_tools`, `crates/store_app/re_query`, `crates/top/rerun-cli`, `rerun_pixi_env`, `run_wasm`.
R7 · Dead Code · Unused private method '_on_raw_event' · ×1
  • Unused private method '_on_raw_event' rerun_js/web-viewer/index.ts:1485 — 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.
X2 · Cancellation propagation · Not all async functions that make a request accept an AbortSignal · ×1
  • Not all async functions that make a request accept an AbortSignal — Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X5 · Nullable reference types · Null assertions (`!`) reduce the strict null checking score · ×1
  • Null assertions (`!`) reduce the strict null checking score — ~1.3 `!` null assertions per 1k TypeScript source lines — 4 assertion(s) across the 3019 source line(s) of the 4 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: rerun_js/web-viewer/index.ts (4). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
X9 · Subsumed condition operand · Subsumed condition operand · ×1
  • Subsumed condition operand crates/store_app/re_datafusion/src/chunk_fetcher.rs:372 — `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.
Minor — 90 finding(s)
D12 · Dependency Hygiene · Outdated · ×90
  • Outdated: accesskit — `accesskit` is locked at 0.25.1 but 0.25.2 is the current stable release on crates.io, and it already satisfies the `"0.25"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p accesskit` and commit the updated REDACTED.
  • Outdated: aho-corasick — `aho-corasick` is locked at 1.1.4 but 1.1.5 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p aho-corasick` and commit the updated REDACTED.
  • 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/data_flow/re_redap_client/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: axum-core — `axum-core` is locked at 0.5.5 but 0.5.6 is the current stable release on crates.io, and it already satisfies the `"0.5"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p axum-core` 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/data_flow/re_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/re_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: cc — `cc` is locked at 1.4.0 but 1.10.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p cc` and commit the updated REDACTED.
  • Outdated: clap — `clap` is locked at 4.6.1 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.6"` requirement declared in crates/store_app/re_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: clap_builder — `clap_builder` is locked at 4.6.0 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap_builder` and commit the updated REDACTED.
  • Outdated: console — `console` is locked at 0.16.4 but 0.16.6 is the current stable release on crates.io, and it already satisfies the `"0.16"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p console` 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/re_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 rerun_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: crossbeam-channel — `crossbeam-channel` is locked at 0.5.15 but 0.5.17 is the current stable release on crates.io, and it already satisfies the `"0.5"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam-channel` and commit the updated REDACTED.
  • Outdated: crossbeam-deque — `crossbeam-deque` is locked at 0.8.7 but 0.8.8 is the current stable release on crates.io, and it already satisfies the `"0.8"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam-deque` and commit the updated REDACTED.
  • Outdated: crossbeam-epoch — `crossbeam-epoch` is locked at 0.9.20 but 0.9.21 is the current stable release on crates.io, and it already satisfies the `"0.9"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam-epoch` and commit the updated REDACTED.
  • Outdated: crossbeam-queue — `crossbeam-queue` is locked at 0.3.12 but 0.3.14 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam-queue` and commit the updated REDACTED.
  • Outdated: crossbeam-utils — `crossbeam-utils` is locked at 0.8.22 but 0.8.23 is the current stable release on crates.io, and it already satisfies the `"0.8"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p crossbeam-utils` and commit the updated REDACTED.
  • Outdated: either — `either` is locked at 1.17.0 but 1.19.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p either` 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_support/re_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: fastrand — `fastrand` is locked at 2.3.0 but 2.5.0 is the current stable release on crates.io, and it already satisfies the `"2"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p fastrand` 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/re_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: flate2 — `flate2` is locked at 1.1.9 but 1.1.10 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p flate2` and commit the updated REDACTED.
  • Outdated: font-types — `font-types` is locked at 0.12.5 but 0.12.7 is the current stable release on crates.io, and it already satisfies the `"0.12"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p font-types` 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_support/re_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: hyper-rustls — `hyper-rustls` is locked at 0.27.9 but 0.27.10 is the current stable release on crates.io, and it already satisfies the `"0.27"` requirement declared in crates/utils/re_workspace_hack/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p hyper-rustls` and commit the updated REDACTED.
  • + 65 more in this group — see findings.md.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-10a800d6c1064bfa93564a799128e1f6/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-10a800d6c1064bfa93564a799128e1f6/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude crates/store/re_protos/src/v1alpha1/snapshots --exclude crates/store/re_sdk_types/src/blueprint/archetypes --exclude crates/store/re_sdk_types/src/blueprint/views --exclude crates/store/re_sdk_types/src/reflection --exclude crates/store/re_sdk_types/src/testing/archetypes --exclude crates/store/re_sdk_types/src/testing/components --exclude crates/store/re_sdk_types/src/testing/encodings --exclude docs/content/reference/types --exclude rerun_cpp/docs/doxygen-awesome --exclude rerun_cpp/src/rerun/blueprint --exclude rerun_cpp/tests/generated --exclude rerun_js/web-viewer/proto --exclude rerun_py/rerun_sdk/rerun/blueprint/archetypes --exclude rerun_py/rerun_sdk/rerun/blueprint/components --exclude rerun_py/rerun_sdk/rerun/blueprint/views --exclude rerun_py/rerun_sdk/rerun/components --exclude rerun_py/tests/test_types/archetypes --exclude rerun_py/tests/test_types/blueprint --exclude rerun_py/tests/test_types/components --exclude rerun_py/tests/test_types/encodings .136artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update25artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .5artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—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) — `rerun_py/rerun_sdk/rerun/catalog/_entry.py` — so the PII/GDPR sweep did not cover them at all.0—
D40 · Network Egress Confinementruntime-hardening—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.0—
D41 · Kernel & Syscall Confinementruntime-hardening—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.0—
D42 · Runtime Threat Enforcementruntime-hardening—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.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0artifacts/raw/trivy-fs.json

Run 01a17b83-eb38-7d88-b5dd-5cdcb6d439a1 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

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.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md