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

microsoft/windows-rs

Measured 14 November 2026, 16:44 UTC, at code version 520097a

Code coverage is not measured: Suite not runnable in-image.

CAI score 56out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Up 3 since the last survey

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

A very large codebase: 2,012,371 lines of product code in 51 projects, tests not counted · Estimated rebuild effort: about 12.4 person-years · Weakest lens: Production Readiness, 41

Findings by how serious they are

43 critical 4074 serious 118 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 16:44 UTC

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

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

38of 38 dimensions measured by tools.
4220of 4235 findings point to an exact file and line, so you can open each one in the code. The other 15 concern the repository as a whole, such as missing documentation.
38dimensions across 5 lenses, read from 2,012,371 lines of product code in 51 projects.
Chapters

Executive summary

microsoft/windows-rs falls short of our standard for a preview release because 40 passwords or keys sit in the current code and we found no logging, tracing or health checks in the code. It scores 56 out of 100 and is rated Adequate, and all 43 of its critical findings are security problems.

Production Readiness, at 41, is the weakest lens and counts most in the score. The best first step is replacing the 40 exposed passwords or keys and switching the old ones off, worth about 14 points. Adding a diagnostic log comes next, worth about 8 points. Raising Production Readiness to 62 would lift the score to about 66.

Forty passwords or keys are open to anyone who can read the repository. One automatic update takes new releases before a bad one can be spotted. Replacing each exposed password or key and setting a waiting period for automatic updates would close both risks. Passing outside input through environment variables would fix the pipeline step that puts outside input straight into a shell command, and the pipeline step that runs a download without checking it needs each download checked against a known checksum first.

The product code is 2,012,371 lines, about €1,800,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.
Production Readiness 41 · counts for 47%Security and Compliance 61 · counts for 26%Maturity 66 · counts for 14%Code Health 85 · counts for 8%Architecture 95 · counts for 4%

If Production Readiness rose from 41 to 62, the lowest score rated Strong, the score would rise from 56 to about 66.

Code composition: what the lines of code are
Supporting code 0%Tests 100%
New since the last survey: 445 findings

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

  • Cyclomatic Complexity · windows_clang::sal::shape (cyclomatic 63) crates/libs/clang/src/sal/mod.rs
  • Cyclomatic Complexity · windows_clang::capture::read (cyclomatic 62) crates/libs/clang/src/capture/mod.rs
  • Cyclomatic Complexity · windows_clang::projection::annotations::buffer (cyclomatic 59) crates/libs/clang/src/projection/annotations.rs
  • Cyclomatic Complexity · Capture::ty (cyclomatic 55) crates/libs/clang/src/capture/mod.rs
  • Cyclomatic Complexity · References::bind (cyclomatic 53) crates/libs/clang/src/projection/references.rs
  • Cyclomatic Complexity · Capture::observation (cyclomatic 50) crates/libs/clang/src/capture/mod.rs
  • Cyclomatic Complexity · tool_win32::run (cyclomatic 44) crates/tools/win32/src/main.rs
  • Cyclomatic Complexity · windows_clang::partial::prune (cyclomatic 42) crates/libs/clang/src/partial.rs
  • Cyclomatic Complexity · RetainedGraph::matches_declaration_inner (cyclomatic 38) crates/libs/reactor/src/reconcile/graph.rs
  • Cyclomatic Complexity · File::Type (cyclomatic 36) crates/libs/metadata/src/writer/file/mod.rs
  • Cyclomatic Complexity · Type::combine_definition_closure (cyclomatic 35) crates/libs/bindgen/src/type_closure.rs
  • Cyclomatic Complexity · Projector::record (cyclomatic 35) crates/libs/clang/src/projection/records.rs
  • Cyclomatic Complexity · Projector::ty (cyclomatic 34) crates/libs/clang/src/projection/mod.rs
  • Cyclomatic Complexity · Plan::new (cyclomatic 34) crates/libs/clang/src/projection/plan.rs
  • Cyclomatic Complexity · windows_clang::partial::compact (cyclomatic 34) crates/libs/clang/src/partial.rs
  • Cyclomatic Complexity · WinUiAdapter::apply_mutation (cyclomatic 34) crates/libs/reactor/src/native/winui/adapter.rs
  • Cyclomatic Complexity · CppConst::write_with_enclosing (cyclomatic 33) crates/libs/bindgen/src/types/cpp_const.rs
  • Cyclomatic Complexity · Projector::validate_references (cyclomatic 33) crates/libs/clang/src/projection/references.rs
  • Cyclomatic Complexity · windows_clang::projection::publication::values (cyclomatic 31) crates/libs/clang/src/projection/publication.rs
  • Cyclomatic Complexity · Projector::interface (cyclomatic 30) crates/libs/clang/src/projection/values.rs
  • Cyclomatic Complexity · Encoder::encode_record (cyclomatic 30) crates/libs/rdl/src/reader/struct.rs
  • Cyclomatic Complexity · windows_clang::projection::reference_values::expand_type (cyclomatic 29) crates/libs/clang/src/projection/reference_values.rs
  • Cyclomatic Complexity · Projector::written_ty (cyclomatic 26) crates/libs/clang/src/projection/mod.rs
  • Cyclomatic Complexity · Projector::validate_value_references (cyclomatic 26) crates/libs/clang/src/projection/reference_values.rs
  • Cyclomatic Complexity · windows_clang::projection::annotations::success_condition (cyclomatic 26) crates/libs/clang/src/projection/annotations.rs
  • Cyclomatic Complexity · windows_clang::sal::returned_buffer_shape (cyclomatic 26) crates/libs/clang/src/sal/mod.rs
  • Cyclomatic Complexity · WinUiAdapter::set_flyout (cyclomatic 26) crates/libs/reactor/src/native/winui/attachments.rs
  • Cyclomatic Complexity · NativeWindow::apply_visuals (cyclomatic 26) crates/libs/reactor/src/native/winui/window/mod.rs
  • Cyclomatic Complexity · Capture::attribute (cyclomatic 25) crates/libs/clang/src/capture/mod.rs
  • Cyclomatic Complexity · RetainedGraph::apply_observation (cyclomatic 25) crates/libs/reactor/src/reconcile/feedback.rs
  • Cyclomatic Complexity · Planner::reconcile_object (cyclomatic 25) crates/libs/reactor/src/reconcile/plan.rs
  • Cyclomatic Complexity · BitfieldBacking::write_typed_accessor (cyclomatic 24) crates/libs/bindgen/src/types/cpp_struct.rs
  • Cyclomatic Complexity · Projector::validate_reference_record (cyclomatic 24) crates/libs/clang/src/projection/reference_values.rs
  • Cyclomatic Complexity · Expression::parse_inner (cyclomatic 24) crates/libs/clang/src/sal/expression.rs
  • Cyclomatic Complexity · Capture::parameter_comments (cyclomatic 23) crates/libs/clang/src/capture/comments.rs
  • Cyclomatic Complexity · windows_clang::capture::annotations::association (cyclomatic 23) crates/libs/clang/src/capture/annotations.rs
  • Cyclomatic Complexity · windows_clang::resolve::records::groups (cyclomatic 23) crates/libs/clang/src/resolve/records.rs
  • Cyclomatic Complexity · ComponentHost::drain_step (cyclomatic 23) crates/libs/reactor/src/component/mod.rs
  • Cyclomatic Complexity · Plan::primary_names (cyclomatic 22) crates/libs/clang/src/projection/plan.rs
  • Cyclomatic Complexity · windows_bindgen::types::layout::native_layout (cyclomatic 21) crates/libs/bindgen/src/types/layout.rs
  • Cyclomatic Complexity · windows_clang::resolve::enums::resolve (cyclomatic 21) crates/libs/clang/src/resolve/enums.rs
  • Cyclomatic Complexity · windows_clang::sal::common_direction (cyclomatic 21) crates/libs/clang/src/sal/mod.rs
  • Cyclomatic Complexity · Snapshot::statistics (cyclomatic 20) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · Capture::declaration_attributes (cyclomatic 19) crates/libs/clang/src/capture/mod.rs
  • Cyclomatic Complexity · Projector::check_value_abi (cyclomatic 19) crates/libs/clang/src/projection/mod.rs
  • Cyclomatic Complexity · windows_clang::capture::annotations::group (cyclomatic 19) crates/libs/clang/src/capture/annotations.rs
  • Cyclomatic Complexity · windows_clang::projection::publication::aliases (cyclomatic 19) crates/libs/clang/src/projection/publication.rs
  • Cyclomatic Complexity · windows_rdl::writer::struct::write_record (cyclomatic 19) crates/libs/rdl/src/writer/struct.rs
  • Cyclomatic Complexity · Runtime::plan_realize_virtual (cyclomatic 19) crates/libs/reactor/src/reconcile/virtualization.rs
  • Cyclomatic Complexity · Planner::reconcile_keyed_many (cyclomatic 19) crates/libs/reactor/src/reconcile/relations.rs
  • Cyclomatic Complexity · windows_clang::capture::annotations::read (cyclomatic 18) crates/libs/clang/src/capture/annotations.rs
  • Cyclomatic Complexity · windows_clang::resolve::records::definitions (cyclomatic 18) crates/libs/clang/src/resolve/records.rs
  • Cyclomatic Complexity · windows_clang::runtime::macros::discover (cyclomatic 17) crates/libs/clang/src/runtime/macros.rs
  • Cyclomatic Complexity · UseTree2::parse (cyclomatic 17) crates/libs/implement/src/lib.rs
  • Cyclomatic Complexity · Encoder::validate_associated_enum_storage (cyclomatic 17) crates/libs/rdl/src/reader/attribute_ref.rs
  • Cyclomatic Complexity · windows_rdl::writer::write_custom_attributes_with_names (cyclomatic 17) crates/libs/rdl/src/writer/mod.rs
  • Cyclomatic Complexity · ComponentHost::expand_declaration (cyclomatic 17) crates/libs/reactor/src/component/expand.rs
  • Cyclomatic Complexity · WinUiAdapter::apply_handle_property (cyclomatic 17) crates/libs/reactor/src/native/winui/objects.rs
  • Cyclomatic Complexity · Capture::constant_observation (cyclomatic 16) crates/libs/clang/src/capture/values.rs
  • Cyclomatic Complexity · Projector::type_callback_abis (cyclomatic 16) crates/libs/clang/src/projection/callbacks.rs
  • Cyclomatic Complexity · Plan::validate (cyclomatic 16) crates/libs/clang/src/projection/plan.rs
  • Cyclomatic Complexity · References::bind_alias_pointee (cyclomatic 16) crates/libs/clang/src/projection/references.rs
  • Cyclomatic Complexity · windows_clang::projection::annotations::field (cyclomatic 16) crates/libs/clang/src/projection/annotations.rs
  • Cyclomatic Complexity · windows_rdl::writer::write_enum_value (cyclomatic 16) crates/libs/rdl/src/writer/mod.rs
  • Cyclomatic Complexity · ComponentHost::resolve_window_publication (cyclomatic 16) crates/libs/reactor/src/component/window.rs
  • Cyclomatic Complexity · WinUiAdapter::set_content_dialog (cyclomatic 16) crates/libs/reactor/src/native/winui/content_dialog.rs
  • Cyclomatic Complexity · Planner::reconcile_virtual_items (cyclomatic 16) crates/libs/reactor/src/reconcile/virtualization.rs
  • Cyclomatic Complexity · tool_win32::add_target_imports (cyclomatic 16) crates/tools/win32/src/main.rs
  • Cognitive Complexity · windows_clang::capture::read (cognitive 134) crates/libs/clang/src/capture/mod.rs
  • Cognitive Complexity · Capture::observation (cognitive 123) crates/libs/clang/src/capture/mod.rs
  • Cognitive Complexity · windows_clang::partial::prune (cognitive 107) crates/libs/clang/src/partial.rs
  • Cognitive Complexity · References::bind (cognitive 98) crates/libs/clang/src/projection/references.rs
  • Cognitive Complexity · windows_clang::projection::annotations::buffer (cognitive 88) crates/libs/clang/src/projection/annotations.rs
  • Cognitive Complexity · CppConst::write_with_enclosing (cognitive 85) crates/libs/bindgen/src/types/cpp_const.rs
  • Cognitive Complexity · windows_clang::projection::publication::values (cognitive 80) crates/libs/clang/src/projection/publication.rs
  • Cognitive Complexity · Projector::validate_references (cognitive 72) crates/libs/clang/src/projection/references.rs
  • Cognitive Complexity · Type::combine_definition_closure (cognitive 63) crates/libs/bindgen/src/type_closure.rs
  • Cognitive Complexity · Plan::new (cognitive 63) crates/libs/clang/src/projection/plan.rs
  • Cognitive Complexity · Projector::record (cognitive 62) crates/libs/clang/src/projection/records.rs
  • Cognitive Complexity · tool_win32::run (cognitive 61) crates/tools/win32/src/main.rs
  • Cognitive Complexity · Projector::interface (cognitive 60) crates/libs/clang/src/projection/values.rs
  • Cognitive Complexity · Projector::validate_value_references (cognitive 55) crates/libs/clang/src/projection/reference_values.rs
  • Cognitive Complexity · windows_clang::resolve::records::groups (cognitive 55) crates/libs/clang/src/resolve/records.rs
  • Cognitive Complexity · Encoder::validate_associated_enum_storage (cognitive 52) crates/libs/rdl/src/reader/attribute_ref.rs
  • Cognitive Complexity · windows_clang::resolve::enums::resolve (cognitive 48) crates/libs/clang/src/resolve/enums.rs
  • Cognitive Complexity · windows_clang::partial::compact (cognitive 46) crates/libs/clang/src/partial.rs
  • Cognitive Complexity · Projector::written_ty (cognitive 44) crates/libs/clang/src/projection/mod.rs
  • Cognitive Complexity · ComponentHost::drain_step (cognitive 42) crates/libs/reactor/src/component/mod.rs
  • Cognitive Complexity · RetainedGraph::matches_declaration_inner (cognitive 41) crates/libs/reactor/src/reconcile/graph.rs
  • Cognitive Complexity · BitfieldBacking::write_typed_accessor (cognitive 40) crates/libs/bindgen/src/types/cpp_struct.rs
  • Cognitive Complexity · Projector::validate_reference_record (cognitive 39) crates/libs/clang/src/projection/reference_values.rs
  • Cognitive Complexity · windows_clang::capture::annotations::group (cognitive 39) crates/libs/clang/src/capture/annotations.rs
  • Cognitive Complexity · Plan::primary_names (cognitive 37) crates/libs/clang/src/projection/plan.rs
  • Cognitive Complexity · windows_clang::resolve::alias_groups (cognitive 37) crates/libs/clang/src/resolve/mod.rs
  • Cognitive Complexity · windows_clang::projection::reference_values::expand_type (cognitive 35) crates/libs/clang/src/projection/reference_values.rs
  • Cognitive Complexity · Capture::ty (cognitive 34) crates/libs/clang/src/capture/mod.rs
  • Cognitive Complexity · windows_clang::capture::annotations::association (cognitive 34) crates/libs/clang/src/capture/annotations.rs
  • Cognitive Complexity · windows_clang::projection::publication::records (cognitive 33) crates/libs/clang/src/projection/publication.rs
  • Cognitive Complexity · windows_clang::resolve::records::definitions (cognitive 33) crates/libs/clang/src/resolve/records.rs
  • Cognitive Complexity · Capture::parameter_comments (cognitive 32) crates/libs/clang/src/capture/comments.rs

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

Fixed since the last survey: 5540 findings

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

  • Cyclomatic Complexity · Snapshot::plan (cyclomatic 194) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · windows_clang::choose_type_root_cached (cyclomatic 46) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · IDebugControl6_Vtbl::new (cyclomatic 46) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugControl7_Vtbl::new (cyclomatic 46) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugControl5_Vtbl::new (cyclomatic 45) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugControl4_Vtbl::new (cyclomatic 44) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::extract_child (cyclomatic 43) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · RetainedGraph::matches_declaration_inner (cyclomatic 38) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · IDebugControl3_Vtbl::new (cyclomatic 37) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · WinUiAdapter::apply_mutations (cyclomatic 36) crates/libs/reactor/src/native/winui/adapter.rs
  • Cyclomatic Complexity · CppConst::write (cyclomatic 33) crates/libs/bindgen/src/types/cpp_const.rs
  • Cyclomatic Complexity · windows_clang::extract::type_ref (cyclomatic 33) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::recover_midl_artifacts (cyclomatic 32) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · IDirect3DDevice9_Vtbl::new (cyclomatic 32) crates/libs/windows/src/Windows/Win32/d3d9/mod.rs
  • Cyclomatic Complexity · IDebugSystemObjects3_Vtbl::new (cyclomatic 32) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugSystemObjects4_Vtbl::new (cyclomatic 32) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugControl2_Vtbl::new (cyclomatic 31) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::fact_data (cyclomatic 30) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · Snapshot::emit_items (cyclomatic 27) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · Planner::reconcile_keyed_many (cyclomatic 27) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · IDebugControl_Vtbl::new (cyclomatic 27) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugSystemObjects2_Vtbl::new (cyclomatic 27) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · WinUiAdapter::set_flyout (cyclomatic 26) crates/libs/reactor/src/native/winui/hosting.rs
  • Cyclomatic Complexity · Planner::reconcile_object (cyclomatic 25) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · IDebugSymbols5_Vtbl::new (cyclomatic 25) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IVssComponent_Vtbl::new (cyclomatic 25) crates/libs/windows/src/Windows/Win32/vswriter/mod.rs
  • Cyclomatic Complexity · windows_clang::record_layout (cyclomatic 24) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · IDebugSymbols3_Vtbl::new (cyclomatic 24) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugSymbols4_Vtbl::new (cyclomatic 24) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugSystemObjects_Vtbl::new (cyclomatic 24) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::evaluate_constants (cyclomatic 23) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::interface_fact (cyclomatic 23) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · IUri_Vtbl::new (cyclomatic 23) crates/libs/windows/src/Windows/Win32/urlmon/mod.rs
  • Cyclomatic Complexity · CppMethod::write_params (cyclomatic 22) crates/libs/bindgen/src/types/cpp_method.rs
  • Cyclomatic Complexity · windows_clang::choose_type_root_cached::resolved_type_shape::write (cyclomatic 22) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · NativeWindow::apply_visuals (cyclomatic 22) crates/libs/reactor/src/native/winui/mod.rs
  • Cyclomatic Complexity · IDebugClient5_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugClient6_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugClient7_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugClient8_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDebugClient9_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cyclomatic Complexity · IDvdControl2_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/strmif/mod.rs
  • Cyclomatic Complexity · TypeProjection::project (cyclomatic 21) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · ComponentHost::drain (cyclomatic 21) crates/libs/reactor/src/component.rs
  • Cyclomatic Complexity · Planner::replace_object (cyclomatic 21) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · ParameterAnnotations::project_attributes (cyclomatic 20) crates/libs/clang/src/extract/annotations/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::decode_c_string (cyclomatic 20) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::decode_c_bytes (cyclomatic 20) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · RetainedGraph::apply_observation (cyclomatic 20) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · RetainedGraph::validate_event_dispatch (cyclomatic 20) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · Planner::reconcile_virtual_items (cyclomatic 19) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · IXpsOMCoreProperties_Vtbl::new (cyclomatic 19) crates/libs/windows/src/Windows/Win32/xps/mod.rs
  • Cyclomatic Complexity · windows_clang::param_attributes (cyclomatic 18) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · windows_clang::extract::inline_record (cyclomatic 18) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · WinUiAdapter::set_properties (cyclomatic 18) crates/libs/reactor/src/native/winui/objects.rs
  • Cyclomatic Complexity · Runtime::realize_virtual (cyclomatic 18) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · IDvdInfo2_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Win32/strmif/mod.rs
  • Cyclomatic Complexity · ITextRange2_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Win32/tom/mod.rs
  • Cyclomatic Complexity · IXpsOMGlyphs_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Win32/xps/mod.rs
  • Cyclomatic Complexity · windows_clang::extract::evaluate_parsed_probe (cyclomatic 17) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · IVssBackupComponents_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/vsbackup/mod.rs
  • Cyclomatic Complexity · windows_clang::validate_complete_layout (cyclomatic 16) crates/libs/clang/src/lib.rs
  • Cyclomatic Complexity · windows_clang::extract::project_params (cyclomatic 16) crates/libs/clang/src/extract/mod.rs
  • Cyclomatic Complexity · ComponentHost::resolve_window_publication (cyclomatic 16) crates/libs/reactor/src/component.rs
  • Cyclomatic Complexity · WinUiAdapter::set_content_dialog (cyclomatic 16) crates/libs/reactor/src/native/winui/hosting.rs
  • Cyclomatic Complexity · Planner::reconcile_positional_many (cyclomatic 16) crates/libs/reactor/src/reconcile.rs
  • Cyclomatic Complexity · ID2D1DeviceContext_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/d2d/mod.rs
  • Cyclomatic Complexity · IPortableDeviceValues_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/portabledevicetypes/mod.rs
  • Cyclomatic Complexity · IPropertyDescription_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/propsys/mod.rs
  • Cognitive Complexity · Snapshot::plan (cognitive 316) crates/libs/clang/src/lib.rs
  • Cognitive Complexity · CppConst::write (cognitive 85) crates/libs/bindgen/src/types/cpp_const.rs
  • Cognitive Complexity · windows_clang::extract::extract_child (cognitive 79) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · windows_clang::choose_type_root_cached (cognitive 56) crates/libs/clang/src/lib.rs
  • Cognitive Complexity · windows_clang::extract::type_ref (cognitive 51) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · windows_clang::record_layout (cognitive 49) crates/libs/clang/src/lib.rs
  • Cognitive Complexity · windows_clang::extract::fact_data (cognitive 47) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · windows_clang::extract::recover_midl_artifacts (cognitive 46) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · IDebugControl6_Vtbl::new (cognitive 45) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · IDebugControl7_Vtbl::new (cognitive 45) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · IDebugControl5_Vtbl::new (cognitive 44) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · windows_clang::extract::inline_record (cognitive 43) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · IDebugControl4_Vtbl::new (cognitive 43) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · RetainedGraph::matches_declaration_inner (cognitive 41) crates/libs/reactor/src/reconcile.rs
  • Cognitive Complexity · ComponentHost::drain (cognitive 39) crates/libs/reactor/src/component.rs
  • Cognitive Complexity · Planner::reconcile_keyed_many (cognitive 39) crates/libs/reactor/src/reconcile.rs
  • Cognitive Complexity · CppMethod::write_params (cognitive 38) crates/libs/bindgen/src/types/cpp_method.rs
  • Cognitive Complexity · windows_clang::extract::evaluate_parsed_probe (cognitive 36) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · IDebugControl3_Vtbl::new (cognitive 36) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · Snapshot::emit_items (cognitive 33) crates/libs/clang/src/lib.rs
  • Cognitive Complexity · WinUiAdapter::apply_property (cognitive 32) crates/libs/reactor/src/native/winui/objects.rs
  • Cognitive Complexity · windows_clang::extract::evaluate_constants (cognitive 31) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · IDirect3DDevice9_Vtbl::new (cognitive 31) crates/libs/windows/src/Windows/Win32/d3d9/mod.rs
  • Cognitive Complexity · IDebugSystemObjects3_Vtbl::new (cognitive 31) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · IDebugSystemObjects4_Vtbl::new (cognitive 31) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · Planner::reconcile_positional_many (cognitive 30) crates/libs/reactor/src/reconcile.rs
  • Cognitive Complexity · IDebugControl2_Vtbl::new (cognitive 30) crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs
  • Cognitive Complexity · windows_clang::write_record_fields (cognitive 29) crates/libs/clang/src/lib.rs
  • Cognitive Complexity · windows_clang::extract::interface_fact (cognitive 28) crates/libs/clang/src/extract/mod.rs
  • Cognitive Complexity · Planner::reconcile_object (cognitive 28) crates/libs/reactor/src/reconcile.rs
  • Cognitive Complexity · windows_clang::extract::project_params (cognitive 27) crates/libs/clang/src/extract/mod.rs
Rebuild cost: about €1,800,000 · Estimate
Cost to rebuild€600,000 to €3,000,000, for 10,026 to 31,806 hours of work, about 12.4 person-years for 7 to 24 engineers
Difficulty of the problemLow, 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 56. 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: 2,012,371 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: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.

Top priorities

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

1
Resolve the 40 Leaked secret finding(s) in Secret Scanning — start with REDACTED (40).
Raises the score by about 14 points · Medium effort · Secret Scanning
2
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 8 points · Medium effort · Observability
3
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.
Raises the score by about 3 points · Medium effort · Architecture documentation

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 €1,800,000 to build again, about 12.4 person-years of work. Its weakest lens is Production Readiness, at 41 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 40 Leaked secret finding(s) in Secret Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 14 points for medium effort, because it clears the 40 Secret Scanning findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.2 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 7% to 16% on every change.
How this is estimated: It rests on an assumption of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Cohesion (LCOM4)
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch helpers helpers windows-link windows-link helpers->windows-link tool-clang-sys tool-clang-sys tool-clang-sys->helpers windows-bindgen windows-bindgen tool-clang-sys->windows-bindgen windows-clang windows-clang tool-clang-sys->windows-clang windows-rdl windows-rdl tool-clang-sys->windows-rdl tool-package tool-package tool-package->windows-bindgen windows-metadata windows-metadata tool-package->windows-metadata tool-package->windows-rdl tool-reactor-metadata tool-reactor-metadata tool-reactor-metadata->helpers tool-reactor-metadata->windows-metadata tool-reactor-metadata->windows-rdl tool-webview tool-webview tool-webview->helpers tool-webview->windows-bindgen tool-webview->windows-clang tool-webview->windows-metadata tool-webview->windows-rdl tool-win32 tool-win32 tool-win32->helpers tool-win32->windows-clang tool-win32->windows-metadata tool-win32->windows-rdl windows windows windows-core windows-core windows->windows-core windows-future windows-future windows->windows-future windows-numerics windows-numerics windows->windows-numerics windows-time windows-time windows->windows-time windows-bindgen->windows-metadata windows-canvas windows-canvas windows-composition windows-composition windows-canvas->windows-composition windows-canvas->windows-core windows-canvas->windows-numerics windows-reactor windows-reactor windows-canvas->windows-reactor windows-window windows-window windows-canvas->windows-window windows-clang->windows-metadata windows-clang->windows-rdl windows-composition->windows-core windows-composition->windows-numerics windows-composition->windows-time windows-composition->windows-window windows-core->windows-link windows-future->windows-core windows-future->windows-link windows-numerics->windows-core windows-rdl->windows-metadata windows-reactor->windows-core windows-reactor->windows-future windows-reactor->windows-time windows-reactor->windows-window windows-time->windows-core windows-window->windows-core __more__ +31 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.

1602 modules, with 5691 dependencies between them. 13 loops run through 77 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 1562 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 windows.Windows.Win32.minwindef2 windows.Windows.Win32.windef3 windows_core.imp.can_into4 windows_core.out_ref5 windows_core.runtime_name6 windows_core.type7 windows_metadata.ty8 windows_result.bool9 windows_result.hresult10 windows_strings.bstr11 windows_strings.hstring12 windows_strings.pcstr13 windows_strings.pstr14 windows_sys.Windows.Win32.minwindef15 windows_sys.Windows.Win32.windef16 windows_sys.core17 windows_bindgen.winmd.reader18 windows_core.interface19 windows_core.runtime_type20 windows_metadata.reader.tables21 windows_reactor.reconcile22 windows_strings.pcwstr23 windows_strings.pwstr24 windows_sys.Windows.Win32.winnt25 windows_bindgen.types26 windows_core.guid27 windows_core.unknown28 windows_numerics.bindings29 windows_rdl.reader30 windows_time.bindings31 windows.Windows.Win32.oaidl32 windows.Windows.Win32.winnt33 windows_bindgen.type_map34 windows_clang35 windows_core.inspectable36 windows.Windows.Foundation37 windows.Windows.UI38 windows_bindgen.config39 windows_reactor.native.bindings40 windows_reactor.declaration
1 windows.Windows.Win32.minwindef
2 windows.Windows.Win32.windef
3 windows_core.imp.can_into
4 windows_core.out_ref
5 windows_core.runtime_name
6 windows_core.type
7 windows_metadata.ty
8 windows_result.bool
9 windows_result.hresult
10 windows_strings.bstr
11 windows_strings.hstring
12 windows_strings.pcstr
13 windows_strings.pstr
14 windows_sys.Windows.Win32.minwindef
15 windows_sys.Windows.Win32.windef
16 windows_sys.core
17 windows_bindgen.winmd.reader2
18 windows_core.interface1
19 windows_core.runtime_type1
20 windows_metadata.reader.tables8
21 windows_reactor.reconcile32
22 windows_strings.pcwstr1
23 windows_strings.pwstr1
24 windows_sys.Windows.Win32.winnt24
25 windows_bindgen.types2123
26 windows_core.guid11
27 windows_core.unknown121
28 windows_numerics.bindings55
29 windows_rdl.reader11
30 windows_time.bindings22
31 windows.Windows.Win32.oaidl712212536
32 windows.Windows.Win32.winnt5724
33 windows_bindgen.type_map321
34 windows_clang1
35 windows_core.inspectable11112
36 windows.Windows.Foundation574347111015219
37 windows.Windows.UI4424647
38 windows_bindgen.config1211
39 windows_reactor.native.bindings2262261442282924250415
40 windows_reactor.declaration23
Uses a module listed above itPart of a loopThe module itself
1 windows.Windows.Win32.minwindef2 windows.Windows.Win32.windef3 windows_core.imp.can_into4 windows_core.out_ref5 windows_core.runtime_name6 windows_core.type7 windows_metadata.ty8 windows_result.bool9 windows_result.hresult10 windows_strings.bstr11 windows_strings.hstring12 windows_strings.pcstr13 windows_strings.pstr14 windows_sys.Windows.Win32.minwindef15 windows_sys.Windows.Win32.windef16 windows_sys.core17 windows_bindgen.winmd.reader18 windows_core.interface19 windows_core.runtime_type20 windows_metadata.reader.tables21 windows_reactor.reconcile22 windows_strings.pcwstr23 windows_strings.pwstr24 windows_sys.Windows.Win32.winnt25 windows_bindgen.types26 windows_core.guid27 windows_core.unknown28 windows_numerics.bindings29 windows_rdl.reader30 windows_time.bindings31 windows.Windows.Win32.oaidl32 windows.Windows.Win32.winnt33 windows_bindgen.type_map34 windows_clang35 windows_core.inspectable36 windows.Windows.Foundation37 windows.Windows.UI38 windows_bindgen.config39 windows_reactor.native.bindings40 windows_reactor.declarationwindows.Windows.Win32.minwindef1windows.Windows.Win32.windef2windows_core.imp.can_into3windows_core.out_ref4windows_core.runtime_name5windows_core.type6windows_metadata.ty7windows_result.bool8windows_result.hresult9windows_strings.bstr10windows_strings.hstring11windows_strings.pcstr12windows_strings.pstr13windows_sys.Windows.Win32.minwindef14windows_sys.Windows.Win32.windef15windows_sys.core16windows_bindgen.winmd.reader17windows_core.interface18windows_core.runtime_type19windows_metadata.reader.tables20windows_reactor.reconcile21windows_strings.pcwstr22windows_strings.pwstr23windows_sys.Windows.Win32.winnt24windows_bindgen.types25windows_core.guid26windows_core.unknown27windows_numerics.bindings28windows_rdl.reader29windows_time.bindings30windows.Windows.Win32.oaidl31windows.Windows.Win32.winnt32windows_bindgen.type_map33windows_clang34windows_core.inspectable35windows.Windows.Foundation36windows.Windows.UI37windows_bindgen.config38windows_reactor.native.bindings39windows_reactor.declaration402118321124212311121551122712212536572432111111257434711101521944246471211226226144228292425041523+1562 more modules (most-connected shown)

At a glance — Code Health · 85% · Strong ·

At a glance — Architecture · 95% · Exemplary ·

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

At a glance — Readiness · 41% · Weak · gated by D13, P2 ·

At a glance — Security · 61% · Adequate · gated by D36 ·

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
A07:2025 — Authentication Failures40High / Critical
A03:2025 — Software Supply Chain Failures7Medium
A05:2025 — Injection3High / Critical

Roadmap

Top priorities: Resolve the 40 Leaked secret finding(s) in Secret Scanning — start with REDACTED (40); Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce; 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.

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

Do thisHelpsEffortDimension
Resolve the 40 Leaked secret finding(s) in Secret Scanning — start with REDACTED (40).+14.0 ptsMediumSecret Scanning
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+7.8 ptsMediumObservability
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.+3.1 ptsMediumArchitecture documentation
Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).+2.7 ptsMediumDR & Backup
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED.+1.2 ptsLowSupply-chain Provenance & Signing
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+1.2 ptsLowStatic Analysis (SAST)
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+1.2 ptsLowStatic Analysis (SAST)
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+1.2 ptsLowStatic Analysis (SAST)

File quality

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

FileScoreBandWorst signal
REDACTED3.0SlopSecret Scanning: Leaked secret: REDACTED
REDACTED3.0SlopSecret Scanning: Leaked secret: REDACTED
REDACTED3.2MixedSecret Scanning: Leaked secret: REDACTED
REDACTED3.3MixedSecret Scanning: Leaked secret: REDACTED
REDACTED3.3MixedSecret Scanning: Leaked secret: REDACTED
crates/libs/windows/src/Windows/Data/Xml/Dom/mod.rs4.0MixedCyclomatic Complexity: IXmlNode_Vtbl::new (cyclomatic 21)
crates/libs/windows/src/Windows/Win32/d3d11/mod.rs4.0MixedGod Classes: FileTooLong: d3d11/mod.rs
crates/libs/windows/src/Windows/Devices/PointOfService/mod.rs4.0MixedGod Classes: FileTooLong: PointOfService/mod.rs
crates/libs/windows/src/Windows/Media/Capture/mod.rs4.0MixedGod Classes: FileTooLong: Capture/mod.rs
crates/libs/windows/src/Windows/UI/Core/mod.rs4.0MixedCyclomatic Complexity: ICoreWindow_Vtbl::new (cyclomatic 29)
crates/libs/windows/src/Windows/Win32/d3d10/mod.rs4.0MixedGod Classes: FileTooLong: d3d10/mod.rs
crates/libs/windows/src/Windows/Media/Core/mod.rs4.0MixedGod Classes: FileTooLong: Core/mod.rs
crates/libs/windows/src/Windows/Storage/mod.rs4.0MixedGod Classes: FileTooLong: Storage/mod.rs
crates/libs/windows/src/Windows/Media/Playback/mod.rs4.0MixedGod Classes: FileTooLong: Playback/mod.rs
crates/libs/windows/src/Windows/Management/Deployment/mod.rs4.1MixedGod Classes: FileTooLong: Deployment/mod.rs
crates/libs/windows/src/Windows/Globalization/NumberFormatting/mod.rs4.1MixedGod Classes: FileTooLong: NumberFormatting/mod.rs
crates/libs/windows/src/Windows/Media/Audio/mod.rs4.1MixedGod Classes: FileTooLong: Audio/mod.rs
crates/libs/windows/src/Windows/ApplicationModel/Email/mod.rs4.1MixedGod Classes: FileTooLong: Email/mod.rs
crates/libs/windows/src/Windows/Web/Syndication/mod.rs4.1MixedGod Classes: FileTooLong: Syndication/mod.rs
crates/libs/windows/src/Windows/Media/mod.rs4.1MixedGod Classes: FileTooLong: Media/mod.rs

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

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

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

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

Could not be resolved — 7

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

Methodology & how to trust this report

This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 38 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.

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

What we checked — 38 dimensions across the health lenses
D1D2D3D5D6D12D13D14D15D17D19D21D26D29D34D35D36D43D44AX10AX3AX4AX5AX8AX9GD1M1M2M3M4P1P10P2P3P4P5P6X5

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, 4220 of 4235 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 or a scanner, 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
Canine Code Analyzer 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 · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1daf2-34b8-7717-bbf7-4ce675e9e4b6.

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.

  • D4 Code Duplication — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Code Duplication couldn't be assessed within its 45-minute budget on a solution this large — not included in this run.
  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the test suite could not be built/run in-image (commonly external-service dependencies — a database, a broker — we won't provision). To have it measured, make the suite runnable without them. For context only, test code is ≈ 5% of production LoC (100,461 test / 2,010,789 production) — a rough proxy, NOT a coverage measurement, so it is excluded from the score. You can widen what we reach: optional: make the suite runnable without a database, broker or other service we do not provision, and real coverage is measured on the next scan.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 405 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Cargo manifest, but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Cargo dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D16 Bus Factor — 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. Single-maintainer repository — bus factor is not applicable (87 contributor(s) across 2775 commit(s) sampled, automation and bot accounts excluded). One of them holds 82% of the history; the other 86 hold 0.2% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 0 deducted marker(s) and the 0.0/KLoC density on this row were taken over this repository's .NET projects ALONE: .rs (2,009,643 lines, 100% of production source) went unread, because every marker collector on this path is reached through a C# workspace. A read-only sweep of that source finds at least 2 task marker(s) (TODO/FIXME/HACK/XXX) across 2 file(s) that this score does not count — a floor, since only line comments are read there and D17's other eight marker kinds (suppressions, NoWarn, editorconfig severities, empty catches, commented-out code, Obsolete, dead code, preprocessor branches) need a compiler we do not have for that language. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22'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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • D28 Secrets (history) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `gitleaks` TIMED OUT after 235.6s against a 235.6s budget, so we killed its process tree. The budget is ours; the work may simply be larger than it allows. Nothing about this repository is asserted by the absence of a result; the budget is ours to raise, and raising it is our backlog item, not an action for this repository's owner.
  • AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 1 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • 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.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • 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.
  • 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").
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
  • 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

187 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Method::write at 98. A further 25 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 Type::write_name at 51 — they are counted neither in the figure above nor in this dimension's score. 9 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/libs/webview/src/download.rs (DownloadInterruptReason::from_raw at 31), crates/libs/rdl/src/reader/guid.rs (windows_rdl::reader::guid::type_to_string at 28), crates/libs/reactor/src/native/winui/dependency.rs (windows_reactor::native::winui::dependency::box_property_value at 22), crates/libs/metadata/src/type_name.rs (TypeName::primitive at 20), crates/libs/metadata/src/ty.rs (Type::type_name at 19), and 4 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.

windows_clang::sal::shape (cyclomatic 63) · ×19crates/libs/clang/src/sal/mod.rs:787
Projector::record (cyclomatic 35) · ×9crates/libs/clang/src/projection/records.rs:90
WinUiAdapter::apply_imperative (cyclomatic 40) · ×7crates/libs/reactor/src/native/winui/adapter.rs:381
Capture::ty (cyclomatic 55) · ×6crates/libs/clang/src/capture/mod.rs:1286
Encoder::encode_path (cyclomatic 55) · ×6crates/libs/rdl/src/reader/mod.rs:1143

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

What to do

  1. Bring the 5 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with Method::write (cyclomatic 98), IUIAutomationElement_Vtbl::new (cyclomatic 80), tool_reactor::generate_declarations (cyclomatic 75). — 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 5 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.

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

262 method(s) exceeded the cognitive complexity threshold of 15; the worst was Method::write at 181.

windows_clang::capture::read (cognitive 134) · ×33crates/libs/clang/src/capture/mod.rs:43
Projector::validate_references (cognitive 72) · ×14crates/libs/clang/src/projection/references.rs:448
windows_bindgen::filter_parser::parse_tree (cognitive 34) · ×13crates/libs/bindgen/src/filter_parser.rs:37
Encoder::encode_interface (cognitive 131) · ×11crates/libs/rdl/src/reader/interface.rs:111
windows_rdl::formatter::format_seq (cognitive 65) · ×10crates/libs/rdl/src/formatter/mod.rs:13

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

What to do

  1. Bring the 6 bodies over 120 down to 120 or less in Cognitive Complexity — start with Method::write (cognitive 181), tool_reactor::generate_declarations (cognitive 146), windows_clang::capture::read (cognitive 134). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 6 together lifts Cognitive Complexity from 5.4 to about 5.8/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.

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

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

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

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

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

1700 god class(es) detected.

FileTooLong: native/bindings.rs · ×573crates/libs/reactor/src/native/bindings.rs
TooManyFields: IDebugSymbols5_Vtbl · ×445crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:25867
MethodTooLong: IUIAutomationElement_Vtbl.new · ×428crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:3919
TooManyMethods: CurrencyIdentifiers · ×148crates/libs/windows/src/Windows/Globalization/mod.rs:826
ClassTooLong: IDebugSymbols5_Vtbl · ×65crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:25867

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

What to do

  1. Resolve the 573 FileTooLong finding(s) in God Classes — start with REDACTED (542), bindings.rs (9), main.rs (2). — One of this dimension's main actionable groups (573 warning-level).
  2. Resolve the 445 TooManyFields finding(s) in God Classes — start with REDACTED (412), bindings.rs (32), bindings_lifted.rs. — One of this dimension's main actionable groups (445 warning-level).
  3. Resolve the 428 MethodTooLong finding(s) in God Classes — start with REDACTED (385), bindings.rs (6), lib.rs (3). — One of this dimension's main actionable groups (428 warning-level).

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

D5 · Coupling8.9 / 10Strong✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

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

51 production modules (Cargo+CMake), 0 dependency cycle(s), 1 unstable depended-on module(s). Read from the build's own module declarations; 6 module(s) off the main sequence, with abstractness counted on 34 of the 51 (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: windows-metadata · ×6
Unstable project windows-composition

What to do

  1. Resolve the 6 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (6 warning-level).
  2. Resolve the 1 Unstable project windows-composition finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).

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

D6 · Cohesion (LCOM4)4.0 / 10Weak✓ 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 4.0 / 10 · rule-coverage 100% · ceiling Verified

1825 of 3672 classes have LCOM4 above 3.

Low cohesion: LoggingFields (LCOM4 115) · ×1825crates/libs/windows/src/Windows/Foundation/Diagnostics/mod.rs:1834

What to do

  1. Resolve the 1825 Low cohesion finding(s) in Cohesion (LCOM4) — start with REDACTED (1822), options.rs, config.rs. — One of this dimension's main actionable groups (1825 warning-level).

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

D12 · Dependency Hygiene10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

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

0 outdated, 0 yanked direct Cargo dependencies. 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 Cargo.lock there.

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md.

D13 · Secret Scanning0.0 / 10Critical✓ Tool-verified

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 0.0 / 10 · rule-coverage 100% · ceiling Prevented

15 secret(s) detected. 54 detection(s) were excluded as holding no minted credential in material that runs: a name, reference or comparison rather than a value, a readable phrase or pattern, a value that declares itself fake, or development, test, example, mock or demo material.

REDACTED

What to do

  1. Resolve the 40 Leaked secret finding(s) in Secret Scanning — start with REDACTED (40). — One of this dimension's main actionable groups (40 issue-level).

Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.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 1 packages use a banned license. ★ DEPTH: every package graded here is one this repository's MSBuild projects declare as a direct `PackageReference` (1 declared), and nothing beyond them was reached — this is the DECLARATION-SITE set, NOT the transitive closure. .NET has no lockfile a checkout is guaranteed to carry and this pass grades an unrestored tree, so a banned licence that only a direct dependency's OWN dependencies pull in is outside this verdict, exactly as the JVM arm's declaration-site verdict is. ★ COVERAGE OF THIS VERDICT: it grades this repository's NuGet package dependencies and nothing else. The repository also declares a Cargo manifest, and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.9 / 10Stronggated by 85 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.9 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: crates/tools/reactor/src/main.rs (40×75=3000); crates/libs/reactor/src/test_support/adapter.rs (13×115=1495); crates/libs/bindgen/src/types/method.rs (11×98=1078)

Hotspot: crates/tools/reactor/src/main.rs · ×85crates/tools/reactor/src/main.rs:1517

What to do

  1. Resolve the 85 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED (41), main.rs (5), lib.rs (3). — One of this dimension's main actionable groups (85 warning-level).

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

D17 · Explicit Debt10.0 / 10Exemplary○ Nothing flagged

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 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 deducted debt markers + 0 dead symbols across 8 LoC in the .NET projects (0.0/KLoC) → score 10.0. Measured on the .NET source only: .rs (100% of production source) was not read, and carries at least 2 uncounted task marker(s) in 2 file(s).

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.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. 41 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D21 · Naming Consistency8.5 / 10Strong✓ Tool-verified

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.

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

95 naming inconsistencies among 6439 declarations measured against a convention their peers follow.

`GetMonitorRECT` spells `RECT` where 445 names in the project spell it `Rect` · ×3crates/libs/windows/src/Windows/Win32/shobjidl_core/mod.rs:4348
`dwEmbeddedEAPTypeId` spells `EAP` where 26 names in the project spell it `Eap` · ×2crates/libs/sys/src/Windows/Win32/mprapi/mod.rs:301
`GetClientSessionAndResourceUUIDFn` spells `UUID` where 26 names in the project spell it `Uuid` · ×2crates/libs/sys/src/Windows/Win32/rpc/mod.rs:790
`InternalHcErrorCount` spells `Hc` where 28 names in the project spell it `HC` · ×2crates/libs/sys/src/Windows/Win32/usbioctl/mod.rs:57
`ShouldEnableManagingUi` spells `Ui` where 469 names in the project spell it `UI` · ×2crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:458

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

What to do

  1. Resolve the 3 `GetMonitorRECT` spells `RECT` where 445 names in the project spell it… finding(s) in Naming Consistency — start with REDACTED (3). — One of this dimension's main actionable groups (3 recommendation-level).
  2. Resolve the 2 `dwEmbeddedEAPTypeId` spells `EAP` where 26 names in the project spell… finding(s) in Naming Consistency — start with REDACTED (2). — One of this dimension's main actionable groups (2 recommendation-level).
  3. Resolve the 2 `GetClientSessionAndResourceUUIDFn` spells `UUID` where 26 names in the… finding(s) in Naming Consistency — start with REDACTED (2). — One of this dimension's main actionable groups (2 recommendation-level).

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

D26 · Project Cohesion10.0 / 10Exemplary✓ 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.

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

0 of 2 projects flagged as possibly oversized/incoherent.

✓ On the Gold path — maintain.

Detailed fixes: d26_recommendation.md.

D29 · Static Analysis (SAST)6.0 / 10Adequate✓ 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 6.0 / 10 · rule-coverage 100% · ceiling Documented

3 finding(s): 0 critical, 3 high, 0 medium, 0 low. semgrep hit a parse error in 10 file(s) — `crates/libs/clang/src/capture/annotations.rs` (line 383), `crates/libs/clang/src/capture/mod.rs` (line 31, line 388, line 391, …), `crates/libs/clang/src/runtime/macros.rs` (line 18, line 174, line 179), `crates/libs/windows/src/Windows/Storage/mod.rs` (line 1686, line 1702, line 1750, …), `crates/libs/windows/src/Windows/Win32/msxml/mod.rs` (line 649, line 655, line 673, …), … (+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 6 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

What to do

  1. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

D34 · Knowledge Freshness10.0 / 10Exemplary✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

Every significant source file has living knowledge — recently and meaningfully worked. Counted over 1559 of the 1965 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

D35 · Change Coupling10.0 / 10Stronggated by 3 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: lib.rs↔lib.rs 79%; REDACTED↔main.rs 67%; interface.rs↔interface.rs 56%

Change coupling: lib.rs ↔ lib.rs · ×3crates/libs/sys/src/lib.rs:1

What to do

  1. Resolve the 3 Change coupling finding(s) in Change Coupling — start with lib.rs, REDACTED, interface.rs. — One of this dimension's main actionable groups (3 warning-level).

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

D36 · Supply-chain Provenance & Signing2.5 / 10Weak✓ 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 2.5 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — 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 recommendation-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.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. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

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

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 2 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition10.0 / 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.

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.

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.

AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.

Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.

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.

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

M1 · Documentation (README)6.7 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

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

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
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 repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

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

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

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

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 & versioning9.7 / 10Exemplary✓ Tool-verified

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

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

  • 5 public types in `windows_clang_sys.bindings` are marked as implementation by their own namespace, folder or name: `CXCursorSetImpl` (crates/libs/clang-sys/src/bindings.rs:584, name ends in `Impl`), `CXModuleMapDescriptorImpl` (crates/libs/clang-sys/src/bindings.rs:1213, name ends in `Impl`), `CXTargetInfoImpl` (crates/libs/clang-sys/src/bindings.rs:1389, name ends in `Impl`), `CXTranslationUnitImpl` (crates/libs/clang-sys/src/bindings.rs:1421, name ends in `Impl`), `CXVirtualFileOverlayImpl` (crates/libs/clang-sys/src/bindings.rs:1627, name ends in `Impl`). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers. — crates/libs/clang-sys/src/bindings.rs:584
  • 11 public types in `windows_collections.bindings` are marked as implementation by their own namespace, folder or name: `IIterable_Impl` (crates/libs/collections/src/bindings.rs:39, name ends in `Impl`), `IIterator_Impl` (crates/libs/collections/src/bindings.rs:163, name ends in `Impl`), `IKeyValuePair_Impl` (crates/libs/collections/src/bindings.rs:359, name ends in `Impl`), `IMap_Impl` (crates/libs/collections/src/bindings.rs:577, name ends in `Impl`), `IMapChangedEventArgs_Impl` (crates/libs/collections/src/bindings.rs:838, name ends in `Impl`), `IMapView_Impl` (crates/libs/collections/src/bindings.rs:1025, name ends in `Impl`), `IObservableMap_Impl` (crates/libs/collections/src/bindings.rs:1345, name ends in `Impl`), `IObservableVector_Impl` (crates/libs/collections/src/bindings.rs:1650, name ends in `Impl`), and 3 more. While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers. — crates/libs/collections/src/bindings.rs:39
  • 1 public type in `windows_core.as_impl` is marked as implementation by its own namespace, folder or name: `AsImpl` (crates/libs/core/src/as_impl.rs:4, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers. — crates/libs/core/src/as_impl.rs:4
  • 1 public type in `windows_core.unknown` is marked as implementation by its own namespace, folder or name: `IUnknownImpl` (crates/libs/core/src/unknown.rs:67, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers. — crates/libs/core/src/unknown.rs:67
  • 5 public types in `windows_future.bindings` are marked as implementation by their own namespace, folder or name: `IAsyncAction_Impl` (crates/libs/future/src/bindings.rs:849, name ends in `Impl`), `IAsyncActionWithProgress_Impl` (crates/libs/future/src/bindings.rs:1046, name ends in `Impl`), `IAsyncInfo_Impl` (crates/libs/future/src/bindings.rs:1254, name ends in `Impl`), `IAsyncOperation_Impl` (crates/libs/future/src/bindings.rs:1462, name ends in `Impl`), `IAsyncOperationWithProgress_Impl` (crates/libs/future/src/bindings.rs:1703, name ends in `Impl`). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers. — crates/libs/future/src/bindings.rs:849
  • 1 public type in `windows_metadata.reader.tables` is marked as implementation by its own namespace, folder or name: `InterfaceImpl` (crates/libs/metadata/src/reader/tables/mod.rs:56, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers. — crates/libs/metadata/src/reader/tables/mod.rs:56
  • 1 public type in `windows_metadata.writer.id` is marked as implementation by its own namespace, folder or name: `InterfaceImpl` (crates/libs/metadata/src/writer/id.rs:17, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers. — crates/libs/metadata/src/writer/id.rs:17

What to do

  • Hide `windows_clang_sys.bindings` (`CXCursorSetImpl`, `CXModuleMapDescriptorImpl`, `CXTargetInfoImpl`, `CXTranslationUnitImpl`, `CXVirtualFileOverlayImpl`) (Rust: `pub(crate)`, or keep the module private): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
  • Hide `windows_collections.bindings` (`IIterable_Impl`, `IIterator_Impl`, `IKeyValuePair_Impl`, `IMap_Impl`, `IMapChangedEventArgs_Impl`, `IMapView_Impl`, `IObservableMap_Impl`, `IObservableVector_Impl`, and 3 more) (Rust: `pub(crate)`, or keep the module private): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
  • Hide `windows_core.as_impl` (`AsImpl`) (Rust: `pub(crate)`, or keep the module private): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
  • Hide `windows_core.unknown` (`IUnknownImpl`) (Rust: `pub(crate)`, or keep the module private): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
  • Hide `windows_future.bindings` (`IAsyncAction_Impl`, `IAsyncActionWithProgress_Impl`, `IAsyncInfo_Impl`, `IAsyncOperation_Impl`, `IAsyncOperationWithProgress_Impl`) (Rust: `pub(crate)`, or keep the module private): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
  • Hide `windows_metadata.reader.tables` (`InterfaceImpl`) (Rust: `pub(crate)`, or keep the module private): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
  • Hide `windows_metadata.writer.id` (`InterfaceImpl`) (Rust: `pub(crate)`, or keep the module private): its own namespace, folder or name already says it is implementation, and hidden it can change without breaking a consumer.
P2 · Observability0.0 / 10Critical✓ 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.

  • No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.

What to do

  • Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
P3 · Security & performance tooling7.0 / 10Strong✓ 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.

  • `REDACTED` schedules updates, but no `package-ecosystem` entry covers `nuget`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the `updates:` list. — REDACTED:2

What to do

  • Dependabot is configured but does not watch `nuget` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ 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.

What to do

  • Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
P5 · DR & Backup4.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.

Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.

What to do

  • Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
P6 · Release Hygiene5.0 / 10Adequate✓ 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.

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
X5 · Nullable reference types10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.

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

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 Health85%StrongSolid.
Architecture95%ExemplaryStrongest area.
Maturity66%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness41%Weak — gated by D13, P2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security61%Adequate — gated by D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 4 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.

  • SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X10 Duplicated predicate — 7 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X9 Subsumed condition operand — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not included — 74 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.

  • AC1 Text alternatives — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC2 Forms & labels — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC3 Page structure — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC4 Keyboard semantics — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC5 ARIA correctness — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AC6 Visual & motion safety — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
  • AX1 Captive dependencies — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX6 Interface segregation — no public interfaces
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
  • D10 Test Quality — ~100461 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • D18 Solution Shape — D18 scores the shape of a .NET solution, but this repository's production source is mostly .cpp, .rs — the .NET project files present are an immaterial minority — so the dimension does not apply.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
  • D23 Boundary Type-Coupling — single shared-core project — no cross-context coupling to assess
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .rs source were not judged.
  • 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.
  • D28 Secrets (history) — gitleaks killed before it finished — this repository's git history not scanned
  • D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D4 Code Duplication — Code Duplication not included (time budget)
  • 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 dependency cycles — architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (4919 value object(s))
  • ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • IC1 Incompleteness & stubs — reported, not scored — this repository's C# declares no analysable method bodies (a constants, record or DTO assembly), and this score is a density of unfinished work per method, which has no denominator here. The file-level signals below were still collected and are shown in full
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
  • P8 Schema migrations — no EF Core usage detected
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • PF3 Async & latency hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
  • S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X12 Unreachable branch — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no async method does work a token could cancel
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge

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 — 43 finding(s)
D13 · Secret Scanning · Leaked secret · ×40
  • 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
  • + 15 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 4074 finding(s)
D6 · Cohesion (LCOM4) · Low cohesion · ×1825
  • Low cohesion: LoggingFields (LCOM4 115) crates/libs/windows/src/Windows/Foundation/Diagnostics/mod.rs:1834 — LoggingFields's methods fall into 115 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 115 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: Calendar (LCOM4 102) crates/libs/windows/src/Windows/Globalization/mod.rs:58 — Calendar's methods fall into 102 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 102 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: DeviceAccountConfiguration (LCOM4 88) crates/libs/windows/src/Windows/ApplicationModel/UserDataAccounts/SystemAccess/mod.rs:18 — DeviceAccountConfiguration's methods fall into 88 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 88 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: MediaPlayer (LCOM4 79) crates/libs/windows/src/Windows/Media/Playback/mod.rs:3557 — MediaPlayer's methods fall into 79 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 79 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: PackageManager (LCOM4 67) crates/libs/windows/src/Windows/Management/Deployment/mod.rs:1488 — PackageManager's methods fall into 67 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 67 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: GestureRecognizer (LCOM4 65) crates/libs/windows/src/Windows/UI/Input/mod.rs:321 — GestureRecognizer's methods fall into 65 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 65 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: EmailMessage (LCOM4 60) crates/libs/windows/src/Windows/ApplicationModel/Email/mod.rs:2378 — EmailMessage's methods fall into 60 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 60 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: MediaCapture (LCOM4 60) crates/libs/windows/src/Windows/Media/Capture/mod.rs:5778 — MediaCapture's methods fall into 60 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 60 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: EmailMailbox (LCOM4 59) crates/libs/windows/src/Windows/ApplicationModel/Email/mod.rs:840 — EmailMailbox's methods fall into 59 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 59 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: Contact (LCOM4 58) crates/libs/windows/src/Windows/ApplicationModel/Contacts/mod.rs:71 — Contact's methods fall into 58 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 58 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: ContactListSyncConstraints (LCOM4 56) crates/libs/windows/src/Windows/ApplicationModel/Contacts/mod.rs:2182 — ContactListSyncConstraints's methods fall into 56 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 56 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: FolderInformation (LCOM4 56) crates/libs/windows/src/Windows/Storage/BulkAccess/mod.rs:512 — FolderInformation's methods fall into 56 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 56 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: RichEditTextRange (LCOM4 54) crates/libs/windows/src/Windows/UI/Text/mod.rs:4795 — RichEditTextRange's methods fall into 54 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 54 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: WebViewControl (LCOM4 54) crates/libs/windows/src/Windows/Web/UI/Interop/mod.rs:91 — WebViewControl's methods fall into 54 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 54 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: AppointmentCalendar (LCOM4 52) crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:320 — AppointmentCalendar's methods fall into 52 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 52 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: WalletItem (LCOM4 52) crates/libs/windows/src/Windows/ApplicationModel/Wallet/mod.rs:391 — WalletItem's methods fall into 52 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 52 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: XmlDocument (LCOM4 52) crates/libs/windows/src/Windows/Data/Xml/Dom/mod.rs:3128 — XmlDocument's methods fall into 52 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 52 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: AppCaptureSettings (LCOM4 52) crates/libs/windows/src/Windows/Media/Capture/mod.rs:2760 — AppCaptureSettings's methods fall into 52 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 52 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: StorageFolder (LCOM4 52) crates/libs/windows/src/Windows/Storage/mod.rs:4547 — StorageFolder's methods fall into 52 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 52 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: VideoDeviceController (LCOM4 51) crates/libs/windows/src/Windows/Media/Devices/mod.rs:3741 — VideoDeviceController's methods fall into 51 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 51 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: Appointment (LCOM4 50) crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:7 — Appointment's methods fall into 50 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 50 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: ImageScannerFeederConfiguration (LCOM4 50) crates/libs/windows/src/Windows/Devices/Scanners/mod.rs:1038 — ImageScannerFeederConfiguration's methods fall into 50 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 50 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: ChatMessage (LCOM4 49) crates/libs/windows/src/Windows/ApplicationModel/Chat/mod.rs:355 — ChatMessage's methods fall into 49 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 49 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: ReverbEffectDefinition (LCOM4 48) crates/libs/windows/src/Windows/Media/Audio/mod.rs:4561 — ReverbEffectDefinition's methods fall into 48 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 48 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: CoreWindow (LCOM4 46) crates/libs/windows/src/Windows/UI/Core/mod.rs:1311 — CoreWindow's methods fall into 46 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 46 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.
  • + 1800 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×573
  • FileTooLong: native/bindings.rs crates/libs/reactor/src/native/bindings.rs — FileTooLong — 24425 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 23925 over it, 48.85× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: dbgeng/mod.rs crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs — FileTooLong — 24196 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 23696 over it, 48.39× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: d3d12/mod.rs crates/libs/windows/src/Windows/Win32/d3d12/mod.rs — FileTooLong — 18707 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 18207 over it, 37.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: ntddk/mod.rs crates/libs/windows/src/Windows/Win32/ntddk/mod.rs — FileTooLong — 16977 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 90 free functions. The bar is 500 significant lines; this is 16477 over it, 33.95× 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: shobjidl_core/mod.rs crates/libs/windows/src/Windows/Win32/shobjidl_core/mod.rs — FileTooLong — 15828 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 15328 over it, 31.66× 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: wdm/mod.rs crates/libs/windows/src/Windows/Win32/wdm/mod.rs — FileTooLong — 15172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 192 free functions. The bar is 500 significant lines; this is 14672 over it, 30.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: certenroll/mod.rs crates/libs/windows/src/Windows/Win32/certenroll/mod.rs — FileTooLong — 14774 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 14274 over it, 29.55× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: winnt/mod.rs crates/libs/windows/src/Windows/Win32/winnt/mod.rs — FileTooLong — 14738 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 53 free functions. The bar is 500 significant lines; this is 14238 over it, 29.48× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: d3d11/mod.rs crates/libs/windows/src/Windows/Win32/d3d11/mod.rs — FileTooLong — 13684 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 13184 over it, 27.37× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: winnt/mod.rs crates/libs/sys/src/Windows/Win32/winnt/mod.rs — FileTooLong — 13283 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 12783 over it, 26.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: sapi/mod.rs crates/libs/windows/src/Windows/Win32/sapi/mod.rs — FileTooLong — 13153 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 12653 over it, 26.31× 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: strmif/mod.rs crates/libs/windows/src/Windows/Win32/strmif/mod.rs — FileTooLong — 12313 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 11813 over it, 24.63× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: wdm/mod.rs crates/libs/sys/src/Windows/Win32/wdm/mod.rs — FileTooLong — 12138 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 11638 over it, 24.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: msxml/mod.rs crates/libs/windows/src/Windows/Win32/msxml/mod.rs — FileTooLong — 11747 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 11247 over it, 23.49× 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: ntddk/mod.rs crates/libs/sys/src/Windows/Win32/ntddk/mod.rs — FileTooLong — 11094 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 10594 over it, 22.19× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: iads/mod.rs crates/libs/windows/src/Windows/Win32/iads/mod.rs — FileTooLong — 11040 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 10540 over it, 22.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: mfidl/mod.rs crates/libs/windows/src/Windows/Win32/mfidl/mod.rs — FileTooLong — 10531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 77 free functions. The bar is 500 significant lines; this is 10031 over it, 21.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: uiautomationclient/mod.rs crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs — FileTooLong — 10272 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 9772 over it, 20.54× 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: dwrite/mod.rs crates/libs/windows/src/Windows/Win32/dwrite/mod.rs — FileTooLong — 10098 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 9598 over it, 20.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: d2d/mod.rs crates/libs/windows/src/Windows/Win32/d2d/mod.rs — FileTooLong — 9890 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 9390 over it, 19.78× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: nvme/mod.rs crates/libs/windows/src/Windows/Win32/nvme/mod.rs — FileTooLong — 9638 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 9138 over it, 19.28× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: winuser/mod.rs crates/libs/windows/src/Windows/Win32/winuser/mod.rs — FileTooLong — 9243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 739 free functions. The bar is 500 significant lines; this is 8743 over it, 18.49× 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: winioctl/mod.rs crates/libs/windows/src/Windows/Win32/winioctl/mod.rs — FileTooLong — 9081 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 8581 over it, 18.16× 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: d3d12/mod.rs crates/libs/sys/src/Windows/Win32/d3d12/mod.rs — FileTooLong — 8932 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 8432 over it, 17.86× 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: winioctl/mod.rs crates/libs/sys/src/Windows/Win32/winioctl/mod.rs — FileTooLong — 8801 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 8301 over it, 17.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.
  • + 548 more in this group — see findings.md.
D3 · God Classes · TooManyFields · ×445
  • TooManyFields: IDebugSymbols5_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:25867 — TooManyFields — 247 stored fields beside 2 methods. The bar is 30 stored fields; this is 217 over it, 8.23× 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: IDebugSymbols4_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:23661 — TooManyFields — 243 stored fields beside 2 methods. The bar is 30 stored fields; this is 213 over it, 8.10× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: IDebugSymbols3_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:21547 — TooManyFields — 229 stored fields beside 2 methods. The bar is 30 stored fields; this is 199 over it, 7.63× 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: IUIElement_Vtbl crates/libs/reactor/src/native/bindings.rs:19178 — TooManyFields — 222 stored fields. The bar is 30 stored fields; this is 192 over it, 7.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: IDirect3DDevice9_Vtbl crates/libs/windows/src/Windows/Win32/d3d9/mod.rs:4526 — TooManyFields — 203 stored fields beside 2 methods. The bar is 30 stored fields; this is 173 over it, 6.77× 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: ID3D11DeviceContext_Vtbl crates/libs/windows/src/Windows/Win32/d3d11/mod.rs:8043 — TooManyFields — 201 stored fields beside 2 methods. The bar is 30 stored fields; this is 171 over it, 6.70× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: ID3D10Device_Vtbl crates/libs/windows/src/Windows/Win32/d3d10/mod.rs:3517 — TooManyFields — 172 stored fields beside 2 methods. The bar is 30 stored fields; this is 142 over it, 5.73× 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: IDebugClient9_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:13383 — TooManyFields — 166 stored fields beside 2 methods. The bar is 30 stored fields; this is 136 over it, 5.53× 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: KDDEBUGGER_DATA64 crates/libs/windows/src/Windows/Win32/wdbgexts/mod.rs:640 — TooManyFields — 164 stored fields beside 6 methods. The bar is 30 stored fields; this is 134 over it, 5.47× 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: KDDEBUGGER_DATA64 crates/libs/sys/src/Windows/Win32/wdbgexts/mod.rs:592 — TooManyFields — 164 stored fields. The bar is 30 stored fields; this is 134 over it, 5.47× 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: IDebugClient8_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:11789 — TooManyFields — 162 stored fields beside 2 methods. The bar is 30 stored fields; this is 132 over it, 5.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: IDebugClient7_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:10221 — TooManyFields — 160 stored fields beside 2 methods. The bar is 30 stored fields; this is 130 over it, 5.33× 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: IDebugClient6_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:8672 — TooManyFields — 158 stored fields beside 2 methods. The bar is 30 stored fields; this is 128 over it, 5.27× 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: ICurrencyIdentifiersStatics_Vtbl crates/libs/windows/src/Windows/Globalization/mod.rs:2121 — TooManyFields — 158 stored fields. The bar is 30 stored fields; this is 128 over it, 5.27× 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: IDebugClient5_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:7136 — TooManyFields — 157 stored fields beside 2 methods. The bar is 30 stored fields; this is 127 over it, 5.23× 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: ICalendarView_Vtbl crates/libs/reactor/src/native/bindings.rs:7228 — TooManyFields — 153 stored fields. The bar is 30 stored fields; this is 123 over it, 5.10× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: IColorsStatics_Vtbl crates/libs/windows/src/Windows/UI/mod.rs:979 — TooManyFields — 142 stored fields. The bar is 30 stored fields; this is 112 over it, 4.73× 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: IADsUser_Vtbl crates/libs/windows/src/Windows/Win32/iads/mod.rs:12543 — TooManyFields — 134 stored fields beside 2 methods. The bar is 30 stored fields; this is 104 over it, 4.47× 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: ILoggingFields_Vtbl crates/libs/windows/src/Windows/Foundation/Diagnostics/mod.rs:813 — TooManyFields — 116 stored fields. The bar is 30 stored fields; this is 86 over it, 3.87× 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: ID3D11VideoContext_Vtbl crates/libs/windows/src/Windows/Win32/d3d11/mod.rs:14369 — TooManyFields — 110 stored fields beside 2 methods. The bar is 30 stored fields; this is 80 over it, 3.67× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: ID3D11DeviceContext_Vtbl crates/libs/canvas/src/bindings.rs:1950 — TooManyFields — 109 stored fields. The bar is 30 stored fields; this is 79 over it, 3.63× 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: IDebugClient4_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:5927 — TooManyFields — 108 stored fields beside 2 methods. The bar is 30 stored fields; this is 78 over it, 3.60× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: IDebugSymbols2_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:20226 — TooManyFields — 106 stored fields beside 2 methods. The bar is 30 stored fields; this is 76 over it, 3.53× 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: IBrowserService2_Vtbl crates/libs/windows/src/Windows/Win32/shdeprecated/mod.rs:910 — TooManyFields — 102 stored fields beside 2 methods. The bar is 30 stored fields; this is 72 over it, 3.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
  • TooManyFields: IUIAutomationElement_Vtbl crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:3699 — TooManyFields — 99 stored fields beside 2 methods. The bar is 30 stored fields; this is 69 over it, 3.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.
  • + 420 more in this group — see findings.md.
D3 · God Classes · MethodTooLong · ×428
  • MethodTooLong: IUIAutomationElement_Vtbl.new crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:3919 — MethodTooLong — new runs 887 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 787 over it, 8.87× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IADsUser_Vtbl.new crates/libs/windows/src/Windows/Win32/iads/mod.rs:12859 — MethodTooLong — new runs 746 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 646 over it, 7.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IDebugSymbols5_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:26481 — MethodTooLong — new runs 675 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 575 over it, 6.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IDebugSymbols4_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:24265 — MethodTooLong — new runs 665 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 565 over it, 6.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: IPropertyValue_Vtbl.new crates/libs/reference/src/bindings.rs:73 — MethodTooLong — new runs 655 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 555 over it, 6.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IDebugSymbols3_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:22116 — MethodTooLong — new runs 630 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 530 over it, 6.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IDirect3DDevice9_Vtbl.new crates/libs/windows/src/Windows/Win32/d3d9/mod.rs:5024 — MethodTooLong — new runs 583 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 483 over it, 5.83× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ID3D11DeviceContext_Vtbl.new crates/libs/windows/src/Windows/Win32/d3d11/mod.rs:8543 — MethodTooLong — new runs 543 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 443 over it, 5.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IUIAutomation_Vtbl.new crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:648 — MethodTooLong — new runs 536 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 436 over it, 5.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.
  • MethodTooLong: Method.write crates/libs/bindgen/src/types/method.rs:354 — MethodTooLong — write runs 513 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 413 over it, 5.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IDataCollectorSet_Vtbl.new crates/libs/windows/src/Windows/Win32/pla/mod.rs:2321 — MethodTooLong — new runs 507 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 407 over it, 5.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: IDebugClient9_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:13789 — MethodTooLong — new runs 488 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 388 over it, 4.88× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IUpdate_Vtbl.new crates/libs/windows/src/Windows/Win32/wuapi/mod.rs:4107 — MethodTooLong — new runs 480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 380 over it, 4.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ID3D10Device_Vtbl.new crates/libs/windows/src/Windows/Win32/d3d10/mod.rs:3943 — MethodTooLong — new runs 478 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 378 over it, 4.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: IDebugClient8_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:12185 — MethodTooLong — new runs 478 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 378 over it, 4.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: IDebugClient7_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:10612 — MethodTooLong — new runs 473 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 373 over it, 4.73× 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: IInkPicture_Vtbl.new crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:5337 — MethodTooLong — new runs 472 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 372 over it, 4.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: IWebViewControl_Vtbl.new crates/libs/windows/src/Windows/Web/UI/mod.rs:443 — MethodTooLong — new runs 470 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 370 over it, 4.70× 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: IDebugClient6_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:9058 — MethodTooLong — new runs 468 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 368 over it, 4.68× 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: IDebugClient5_Vtbl.new crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:7520 — MethodTooLong — new runs 463 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 363 over it, 4.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.
  • MethodTooLong: IX509PrivateKey_Vtbl.new crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:16543 — MethodTooLong — new runs 461 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 361 over it, 4.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ITextRange_Vtbl.new crates/libs/windows/src/Windows/Win32/tom/mod.rs:5269 — MethodTooLong — new runs 456 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 356 over it, 4.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: ITextFont_Vtbl.new crates/libs/windows/src/Windows/Win32/tom/mod.rs:2090 — MethodTooLong — new runs 446 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 346 over it, 4.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: IFileSystemImage_Vtbl.new crates/libs/windows/src/Windows/Win32/imapi2fs/mod.rs:1029 — MethodTooLong — new runs 445 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 345 over it, 4.45× 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: ICoreWindow_Vtbl.new crates/libs/windows/src/Windows/UI/Core/mod.rs:3717 — MethodTooLong — new runs 435 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 335 over it, 4.35× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • + 403 more in this group — see findings.md.
D3 · God Classes · TooManyMethods · ×148
  • TooManyMethods: CurrencyIdentifiers crates/libs/windows/src/Windows/Globalization/mod.rs:826 — TooManyMethods — 165 methods. The bar is 30 methods; this is 135 over it, 5.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: Colors crates/libs/windows/src/Windows/UI/mod.rs:83 — TooManyMethods — 142 methods. The bar is 30 methods; this is 112 over it, 4.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: WHV_ARM64_PROCESSOR_FEATURES_0 crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:529 — TooManyMethods — 128 methods. The bar is 30 methods; this is 98 over it, 4.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: WHV_X64_PROCESSOR_FEATURES1_0 crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:6495 — TooManyMethods — 128 methods. The bar is 30 methods; this is 98 over it, 4.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: WHV_X64_PROCESSOR_FEATURES_0 crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:6091 — TooManyMethods — 126 methods. The bar is 30 methods; this is 96 over it, 4.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: WHV_ARM64_PROCESSOR_FEATURES1_0 crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:939 — TooManyMethods — 122 methods. The bar is 30 methods; this is 92 over it, 4.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: LoggingFields crates/libs/windows/src/Windows/Foundation/Diagnostics/mod.rs:1834 — TooManyMethods — 117 methods. The bar is 30 methods; this is 87 over it, 3.90× 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: WHV_SYNTHETIC_PROCESSOR_FEATURES_0 crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:3679 — TooManyMethods — 114 methods. The bar is 30 methods; this is 84 over it, 3.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.
  • TooManyMethods: Calendar crates/libs/windows/src/Windows/Globalization/mod.rs:58 — TooManyMethods — 109 methods. The bar is 30 methods; this is 79 over it, 3.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: BarcodeSymbologies crates/libs/windows/src/Windows/Devices/PointOfService/mod.rs:385 — TooManyMethods — 97 methods. The bar is 30 methods; this is 67 over it, 3.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: WinUiAdapter crates/libs/reactor/src/native/winui/mod.rs:513 — TooManyMethods — 90 methods, declared across 11 files: winui/relations.rs (29), winui/events.rs (14), winui/objects.rs (10), window/mod.rs (9), +7 more file(s). The bar is 30 methods; this is 60 over it, 3.00× 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: DeviceAccountConfiguration crates/libs/windows/src/Windows/ApplicationModel/UserDataAccounts/SystemAccess/mod.rs:18 — TooManyMethods — 90 methods. The bar is 30 methods; this is 60 over it, 3.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Encoder crates/libs/rdl/src/reader/mod.rs:546 — TooManyMethods — 84 methods, declared across 14 files: reader/mod.rs (29), reader/attribute_ref.rs (27), reader/param.rs (8), reader/const.rs (5), +10 more file(s). The bar is 30 methods; this is 54 over it, 2.80× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: GattCharacteristicUuids crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:260 — TooManyMethods — 83 methods. The bar is 30 methods; this is 53 over it, 2.77× 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: MediaPlayer crates/libs/windows/src/Windows/Media/Playback/mod.rs:3557 — TooManyMethods — 81 methods. The bar is 30 methods; this is 51 over it, 2.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: WHV_PROCESSOR_XSAVE_FEATURES_0 crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:3042 — TooManyMethods — 78 methods. The bar is 30 methods; this is 48 over it, 2.60× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ComponentHost crates/libs/reactor/src/component/mod.rs:195 — TooManyMethods — 75 methods, declared across 9 files: test_support/component.rs (20), component/mod.rs (17), component/scope.rs (12), component/expand.rs (10), +5 more file(s). The bar is 30 methods; this is 45 over it, 2.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: PackageManager crates/libs/windows/src/Windows/Management/Deployment/mod.rs:1488 — TooManyMethods — 69 methods. The bar is 30 methods; this is 39 over it, 2.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: MediaCapture crates/libs/windows/src/Windows/Media/Capture/mod.rs:5778 — TooManyMethods — 67 methods. The bar is 30 methods; this is 37 over it, 2.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: GestureRecognizer crates/libs/windows/src/Windows/UI/Input/mod.rs:321 — TooManyMethods — 67 methods. The bar is 30 methods; this is 37 over it, 2.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: D3DDDI_RESOURCEFLAGS_0_0 crates/libs/windows/src/Windows/Win32/d3dukmdt/mod.rs:1934 — 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: EmailMessage crates/libs/windows/src/Windows/ApplicationModel/Email/mod.rs:2378 — TooManyMethods — 62 methods. The bar is 30 methods; this is 32 over it, 2.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: D3DKMT_PRESENTFLAGS_0_0 crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:6041 — TooManyMethods — 62 methods. The bar is 30 methods; this is 32 over it, 2.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: Contact crates/libs/windows/src/Windows/ApplicationModel/Contacts/mod.rs:71 — TooManyMethods — 60 methods. The bar is 30 methods; this is 30 over it, 2.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: MediaEncodingSubtypes crates/libs/windows/src/Windows/Media/MediaProperties/mod.rs:1461 — TooManyMethods — 60 methods. The bar is 30 methods; this is 30 over it, 2.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • + 123 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Hotspot · ×85
  • Hotspot: crates/tools/reactor/src/main.rs crates/tools/reactor/src/main.rs:1517 — crates/tools/reactor/src/main.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in tool_reactor::generate_declarations at line 1517. 3 of those changes were fix/bug commits, and the other 37 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/tools/reactor/src/main.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: crates/libs/reactor/src/test_support/adapter.rs crates/libs/reactor/src/test_support/adapter.rs:363 — crates/libs/reactor/src/test_support/adapter.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in RecordingAdapter::apply_batch at line 363. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/reactor/src/test_support/adapter.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/libs/bindgen/src/types/method.rs crates/libs/bindgen/src/types/method.rs:354 — crates/libs/bindgen/src/types/method.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in Method::write at line 354. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/bindgen/src/types/method.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/libs/reactor/src/native/winui/adapter.rs crates/libs/reactor/src/native/winui/adapter.rs:381 — crates/libs/reactor/src/native/winui/adapter.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in WinUiAdapter::apply_imperative at line 381. 2 of those changes were fix/bug commits, and the other 21 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/reactor/src/native/winui/adapter.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/tools/win32/src/main.rs crates/tools/win32/src/main.rs:40 — crates/tools/win32/src/main.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in tool_win32::run at line 40. 1 of those changes was a fix/bug commit, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/tools/win32/src/main.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:3919 — crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in IUIAutomationElement_Vtbl::new at line 3919. 1 of those changes was a fix/bug commit, and the other 9 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/windows/src/Windows/Win32/uiautomationclient/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/libs/clang/src/projection/annotations.rs crates/libs/clang/src/projection/annotations.rs:555 — crates/libs/clang/src/projection/annotations.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in windows_clang::projection::annotations::buffer at line 555. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/clang/src/projection/annotations.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/tools/reactor/src/native.rs crates/tools/reactor/src/native.rs:245 — crates/tools/reactor/src/native.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in tool_reactor::native::emit_event at line 245. 1 of those changes was a fix/bug commit, and the other 10 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/tools/reactor/src/native.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/tools/reactor-metadata/src/lib.rs crates/tools/reactor-metadata/src/lib.rs:87 — crates/tools/reactor-metadata/src/lib.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in MetadataResolver::load at line 87. 1 of those changes was a fix/bug commit, and the other 17 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/tools/reactor-metadata/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: crates/libs/rdl/src/reader/interface.rs crates/libs/rdl/src/reader/interface.rs:111 — crates/libs/rdl/src/reader/interface.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in Encoder::encode_interface at line 111. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/rdl/src/reader/interface.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/libs/clang/src/lib.rs crates/libs/clang/src/lib.rs:717 — crates/libs/clang/src/lib.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Snapshot::statistics at line 717. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/clang/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: crates/libs/reactor/src/native/winui/objects.rs crates/libs/reactor/src/native/winui/objects.rs:271 — crates/libs/reactor/src/native/winui/objects.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in WinUiAdapter::apply_handle_property at line 271. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/reactor/src/native/winui/objects.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/libs/bindgen/src/types/cpp_method.rs crates/libs/bindgen/src/types/cpp_method.rs:34 — crates/libs/bindgen/src/types/cpp_method.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in CppMethod::new at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/bindgen/src/types/cpp_method.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/libs/windows/src/Windows/Win32/iads/mod.rs crates/libs/windows/src/Windows/Win32/iads/mod.rs:12859 — crates/libs/windows/src/Windows/Win32/iads/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in IADsUser_Vtbl::new at line 12859. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/windows/src/Windows/Win32/iads/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/libs/rdl/src/reader/mod.rs crates/libs/rdl/src/reader/mod.rs:1143 — crates/libs/rdl/src/reader/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Encoder::encode_path at line 1143. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/rdl/src/reader/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/libs/bindgen/src/type_closure.rs crates/libs/bindgen/src/type_closure.rs:18 — crates/libs/bindgen/src/type_closure.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in TypeClosure::build at line 18. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/bindgen/src/type_closure.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/libs/windows/src/Windows/Win32/xps/mod.rs crates/libs/windows/src/Windows/Win32/xps/mod.rs:5854 — crates/libs/windows/src/Windows/Win32/xps/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in IXpsOMObjectFactory_Vtbl::new at line 5854. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/windows/src/Windows/Win32/xps/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/libs/reactor/src/ir.rs crates/libs/reactor/src/ir.rs:260 — crates/libs/reactor/src/ir.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in windows_reactor::ir::validate_object at line 260. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/reactor/src/ir.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/libs/clang/src/capture/mod.rs crates/libs/clang/src/capture/mod.rs:43 — crates/libs/clang/src/capture/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in windows_clang::capture::read at line 43. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/clang/src/capture/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/libs/reactor/src/native/app/mod.rs crates/libs/reactor/src/native/app/mod.rs:941 — crates/libs/reactor/src/native/app/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in windows_reactor::native::app::drain_window_requests at line 941. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/reactor/src/native/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: crates/libs/clang/src/projection/values.rs crates/libs/clang/src/projection/values.rs:676 — crates/libs/clang/src/projection/values.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Projector::interface at line 676. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/clang/src/projection/values.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/libs/bindgen/src/types/interface.rs crates/libs/bindgen/src/types/interface.rs:210 — crates/libs/bindgen/src/types/interface.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Interface::write at line 210. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/bindgen/src/types/interface.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/libs/windows/src/Windows/Win32/pla/mod.rs crates/libs/windows/src/Windows/Win32/pla/mod.rs:2321 — crates/libs/windows/src/Windows/Win32/pla/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in IDataCollectorSet_Vtbl::new at line 2321. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/windows/src/Windows/Win32/pla/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/libs/windows/src/Windows/Win32/wincodec/mod.rs crates/libs/windows/src/Windows/Win32/wincodec/mod.rs:4021 — crates/libs/windows/src/Windows/Win32/wincodec/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in IWICImagingFactory_Vtbl::new at line 4021. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/windows/src/Windows/Win32/wincodec/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/libs/rdl/src/emit.rs crates/libs/rdl/src/emit.rs:88 — crates/libs/rdl/src/emit.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in windows_rdl::emit::write_type at line 88. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 12:41:26 -06:00' --until='2026-11-13 12:41:26 -06:00' --full-history --no-merges -- crates/libs/rdl/src/emit.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.
  • + 60 more in this group — see findings.md.
D3 · God Classes · ClassTooLong · ×65
  • ClassTooLong: IDebugSymbols5_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:25867 — ClassTooLong — 1154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 25867-27426. The bar is 400 significant lines; this is 754 over it, 2.89× 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: IDebugSymbols4_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:23661 — ClassTooLong — 1136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 23661-25196. The bar is 400 significant lines; this is 736 over it, 2.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: IDebugSymbols3_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:21547 — ClassTooLong — 1073 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 21547-22998. The bar is 400 significant lines; this is 673 over it, 2.68× 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: IUIAutomationElement_Vtbl crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:3699 — ClassTooLong — 1022 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 3699-5212. The bar is 400 significant lines; this is 622 over it, 2.56× 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: Type crates/libs/bindgen/src/types/mod.rs:40 — ClassTooLong — 983 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 53 methods, 5 blocks, lines 40-1437. The bar is 400 significant lines; this is 583 over it, 2.46× 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: IADsUser_Vtbl crates/libs/windows/src/Windows/Win32/iads/mod.rs:12543 — ClassTooLong — 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 12543-13936. The bar is 400 significant lines; this is 568 over it, 2.42× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: IDirect3DDevice9_Vtbl crates/libs/windows/src/Windows/Win32/d3d9/mod.rs:4526 — ClassTooLong — 962 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 4526-5844. The bar is 400 significant lines; this is 562 over it, 2.41× 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: ID3D11DeviceContext_Vtbl crates/libs/windows/src/Windows/Win32/d3d11/mod.rs:8043 — ClassTooLong — 932 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 8043-9307. The bar is 400 significant lines; this is 532 over it, 2.33× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ID3D10Device_Vtbl crates/libs/windows/src/Windows/Win32/d3d10/mod.rs:3517 — ClassTooLong — 806 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 3517-4616. The bar is 400 significant lines; this is 406 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: IPropertyValue_Vtbl crates/libs/reference/src/bindings.rs:911 — ClassTooLong — 805 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 72-1058. The bar is 400 significant lines; this is 405 over it, 2.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: IDebugClient9_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:13383 — ClassTooLong — 794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 13383-14476. The bar is 400 significant lines; this is 394 over it, 1.99× 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: Capture crates/libs/clang/src/capture/mod.rs:502 — ClassTooLong — 783 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 25 methods, 2 blocks, lines 502-1512. The bar is 400 significant lines; this is 383 over it, 1.96× 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: IDebugClient8_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:11789 — ClassTooLong — 776 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 11789-12858. The bar is 400 significant lines; this is 376 over it, 1.94× 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: IDebugClient7_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:10221 — ClassTooLong — 767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 10221-11278. The bar is 400 significant lines; this is 367 over it, 1.92× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: IDebugClient6_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:8672 — ClassTooLong — 758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 8672-9717. The bar is 400 significant lines; this is 358 over it, 1.90× 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: IDebugClient5_Vtbl crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:7136 — ClassTooLong — 752 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 7136-8172. The bar is 400 significant lines; this is 352 over it, 1.88× 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: Method crates/libs/bindgen/src/types/method.rs:5 — ClassTooLong — 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 10 methods, 2 blocks, lines 5-1095. The bar is 400 significant lines; this is 350 over it, 1.88× 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: IUIAutomation_Vtbl crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:461 — ClassTooLong — 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 461-1428. The bar is 400 significant lines; this is 265 over it, 1.66× 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: CurrencyIdentifiers crates/libs/windows/src/Windows/Globalization/mod.rs:826 — 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), 165 methods, 2 blocks, lines 827-1815. 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: CppStruct crates/libs/bindgen/src/types/cpp_struct.rs:4 — ClassTooLong — 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 28 methods, 8 blocks, lines 4-1265. The bar is 400 significant lines; this is 228 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: IInkPicture_Vtbl crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:5124 — ClassTooLong — 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 5124-6019. The bar is 400 significant lines; this is 223 over it, 1.56× 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: IDataCollectorSet_Vtbl crates/libs/windows/src/Windows/Win32/pla/mod.rs:2157 — ClassTooLong — 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 2157-3055. The bar is 400 significant lines; this is 208 over it, 1.52× 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: Encoder crates/libs/rdl/src/reader/mod.rs:546 — ClassTooLong — 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 84 methods, 2 blocks, lines 546-1417. The bar is 400 significant lines; this is 198 over it, 1.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: Projector crates/libs/clang/src/projection/mod.rs:483 — ClassTooLong — 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 59 methods, 2 blocks, lines 483-1690. The bar is 400 significant lines; this is 197 over it, 1.49× 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: IUpdate_Vtbl crates/libs/windows/src/Windows/Win32/wuapi/mod.rs:3949 — ClassTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 2 methods, 2 blocks, lines 3949-4808. The bar is 400 significant lines; this is 190 over it, 1.48× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • + 40 more in this group — see findings.md.
D2 · Cognitive Complexity · windows_clang · ×33
  • windows_clang::capture::read (cognitive 134) crates/libs/clang/src/capture/mod.rs:43 — windows_clang::capture::read has cognitive complexity 134 (threshold 15). Drivers by points: if/else 44 (98 pts), loops 9 (17 pts), boolean chains 14, match/switch 1 (5 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_clang::partial::prune (cognitive 107) crates/libs/clang/src/partial.rs:78 — windows_clang::partial::prune has cognitive complexity 107 (threshold 15). Drivers by points: loops 29 (69 pts), if/else 11 (37 pts), boolean chains 1 (nesting depth added 66). 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.
  • windows_clang::projection::annotations::buffer (cognitive 88) crates/libs/clang/src/projection/annotations.rs:555 — windows_clang::projection::annotations::buffer has cognitive complexity 88 (threshold 15). Drivers by points: if/else 31 (59 pts), boolean chains 24, loops 3, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_clang::projection::publication::values (cognitive 80) crates/libs/clang/src/projection/publication.rs:3 — windows_clang::projection::publication::values has cognitive complexity 80 (threshold 15). Drivers by points: if/else 19 (51 pts), match/switch 6 (16 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_clang::resolve::records::groups (cognitive 55) crates/libs/clang/src/resolve/records.rs:3 — windows_clang::resolve::records::groups has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 8 (19 pts), boolean chains 3 (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.
  • windows_clang::resolve::enums::resolve (cognitive 48) crates/libs/clang/src/resolve/enums.rs:21 — windows_clang::resolve::enums::resolve has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 7 (15 pts), boolean chains 6 (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.
  • windows_clang::partial::compact (cognitive 46) crates/libs/clang/src/partial.rs:322 — windows_clang::partial::compact has cognitive complexity 46 (threshold 15). Drivers by points: loops 16 (32 pts), if/else 3 (6 pts), boolean chains 5, match/switch 2 (3 pts) (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.
  • windows_clang::capture::annotations::group (cognitive 39) crates/libs/clang/src/capture/annotations.rs:132 — windows_clang::capture::annotations::group has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 4, loops 2 (3 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.
  • windows_clang::resolve::alias_groups (cognitive 37) crates/libs/clang/src/resolve/mod.rs:216 — windows_clang::resolve::alias_groups has cognitive complexity 37 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 5 (18 pts) (nesting depth added 24). 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.
  • windows_clang::projection::reference_values::expand_type (cognitive 35) crates/libs/clang/src/projection/reference_values.rs:720 — windows_clang::projection::reference_values::expand_type has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 4 (7 pts), boolean chains 5 (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.
  • windows_clang::capture::annotations::association (cognitive 34) crates/libs/clang/src/capture/annotations.rs:250 — windows_clang::capture::annotations::association has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_clang::projection::publication::records (cognitive 33) crates/libs/clang/src/projection/publication.rs:322 — windows_clang::projection::publication::records has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_clang::resolve::records::definitions (cognitive 33) crates/libs/clang/src/resolve/records.rs:135 — windows_clang::resolve::records::definitions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (9 pts), boolean chains 5 (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.
  • windows_clang::projection::annotations::success_condition (cognitive 31) crates/libs/clang/src/projection/annotations.rs:103 — windows_clang::projection::annotations::success_condition has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 9, match/switch 3 (8 pts), loops 3 (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.
  • windows_clang::projection::publication::aliases (cognitive 31) crates/libs/clang/src/projection/publication.rs:558 — windows_clang::projection::publication::aliases has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_clang::projection::enum_annotations::groups (cognitive 30) crates/libs/clang/src/projection/enum_annotations.rs:3 — windows_clang::projection::enum_annotations::groups has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 7 (14 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.
  • windows_clang::projection::publication::enums (cognitive 27) crates/libs/clang/src/projection/publication.rs:417 — windows_clang::projection::publication::enums has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (5 pts), loops 2 (4 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.
  • windows_clang::capture::annotations::read (cognitive 26) crates/libs/clang/src/capture/annotations.rs:41 — windows_clang::capture::annotations::read has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, 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.
  • windows_clang::projection::bitfields::groups (cognitive 25) crates/libs/clang/src/projection/bitfields.rs:21 — windows_clang::projection::bitfields::groups has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (4 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.
  • windows_clang::resolve::values::resolve (cognitive 25) crates/libs/clang/src/resolve/values.rs:3 — windows_clang::resolve::values::resolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (9 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.
  • windows_clang::sal::transport::expression (cognitive 24) crates/libs/clang/src/sal/transport.rs:40 — windows_clang::sal::transport::expression has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (7 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.
  • windows_clang::resolve::validate_observation_attributes (cognitive 23) crates/libs/clang/src/resolve/mod.rs:171 — windows_clang::resolve::validate_observation_attributes has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 1 (3 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • windows_clang::projection::project_partial_with_options (cognitive 22) crates/libs/clang/src/projection/mod.rs:113 — windows_clang::projection::project_partial_with_options has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 2 (8 pts), loops 3 (7 pts), if/else 2 (6 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.
  • windows_clang::projection::annotations::field (cognitive 22) crates/libs/clang/src/projection/annotations.rs:203 — windows_clang::projection::annotations::field has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 4, 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.
  • windows_clang::runtime::macros::discover (cognitive 21) crates/libs/clang/src/runtime/macros.rs:40 — windows_clang::runtime::macros::discover has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 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.
  • + 8 more in this group — see findings.md.
D3 · God Classes · TooManyFunctions · ×23
  • TooManyFunctions: windows::Windows::Win32::sqlucode crates/libs/windows/src/Windows/Win32/sqlucode/mod.rs:3 — TooManyFunctions — 76 free functions. The bar is 30 free functions; this is 46 over it, 2.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::winhvplatform crates/libs/windows/src/Windows/Win32/winhvplatform/mod.rs:4 — TooManyFunctions — 66 free functions. The bar is 30 free functions; this is 36 over it, 2.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::ole2 crates/libs/windows/src/Windows/Win32/ole2/mod.rs:3 — TooManyFunctions — 65 free functions. The bar is 30 free functions; this is 35 over it, 2.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.
  • TooManyFunctions: windows::Windows::Win32::synchapi crates/libs/windows/src/Windows/Win32/synchapi/mod.rs:3 — TooManyFunctions — 60 free functions. The bar is 30 free functions; this is 30 over it, 2.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::aclapi crates/libs/windows/src/Windows/Win32/aclapi/mod.rs:3 — TooManyFunctions — 49 free functions. The bar is 30 free functions; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::sysinfoapi crates/libs/windows/src/Windows/Win32/sysinfoapi/mod.rs:3 — TooManyFunctions — 47 free functions. The bar is 30 free functions; this is 17 over it, 1.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::userenv crates/libs/windows/src/Windows/Win32/userenv/mod.rs:3 — TooManyFunctions — 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47× 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.
  • TooManyFunctions: windows::Windows::Win32::objbase crates/libs/windows/src/Windows/Win32/objbase/mod.rs:3 — TooManyFunctions — 42 free functions. The bar is 30 free functions; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::clfsw32 crates/libs/windows/src/Windows/Win32/clfsw32/mod.rs:3 — TooManyFunctions — 40 free functions. The bar is 30 free functions; 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.
  • TooManyFunctions: windows::Windows::Win32::consoleapi2 crates/libs/windows/src/Windows/Win32/consoleapi2/mod.rs:3 — TooManyFunctions — 39 free functions. The bar is 30 free functions; 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.
  • TooManyFunctions: windows::Windows::Win32::ktmw32 crates/libs/windows/src/Windows/Win32/ktmw32/mod.rs:3 — TooManyFunctions — 39 free functions. The bar is 30 free functions; 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.
  • TooManyFunctions: windows::Windows::Win32::slpublic crates/libs/windows/src/Windows/Win32/slpublic/mod.rs:3 — TooManyFunctions — 38 free functions. The bar is 30 free functions; 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.
  • TooManyFunctions: windows::Windows::Win32::threadpoolapiset crates/libs/windows/src/Windows/Win32/threadpoolapiset/mod.rs:3 — TooManyFunctions — 37 free functions. The bar is 30 free functions; 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.
  • TooManyFunctions: windows::Windows::Win32::winevt crates/libs/windows/src/Windows/Win32/winevt/mod.rs:3 — TooManyFunctions — 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::libloaderapi crates/libs/windows/src/Windows/Win32/libloaderapi/mod.rs:2 — TooManyFunctions — 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::mscat crates/libs/windows/src/Windows/Win32/mscat/mod.rs:3 — TooManyFunctions — 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::winusb crates/libs/windows/src/Windows/Win32/winusb/mod.rs:3 — TooManyFunctions — 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::dpa_dsa crates/libs/windows/src/Windows/Win32/dpa_dsa/mod.rs:2 — TooManyFunctions — 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::ro crates/libs/windows/src/Windows/Win32/ro/mod.rs:3 — TooManyFunctions — 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::rtworkq crates/libs/windows/src/Windows/Win32/rtworkq/mod.rs:3 — TooManyFunctions — 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::consoleapi3 crates/libs/windows/src/Windows/Win32/consoleapi3/mod.rs:2 — TooManyFunctions — 32 free functions. The bar is 30 free functions; 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.
  • TooManyFunctions: windows::Windows::Win32::ddeml crates/libs/windows/src/Windows/Win32/ddeml/mod.rs:3 — TooManyFunctions — 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyFunctions: windows::Windows::Win32::dwmapi crates/libs/windows/src/Windows/Win32/dwmapi/mod.rs:3 — TooManyFunctions — 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D1 · Cyclomatic Complexity · windows_clang · ×19
  • windows_clang::sal::shape (cyclomatic 63) crates/libs/clang/src/sal/mod.rs:787 — windows_clang::sal::shape has cyclomatic complexity 63 (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.
  • windows_clang::capture::read (cyclomatic 62) crates/libs/clang/src/capture/mod.rs:43 — windows_clang::capture::read has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • windows_clang::projection::annotations::buffer (cyclomatic 59) crates/libs/clang/src/projection/annotations.rs:555 — windows_clang::projection::annotations::buffer has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • windows_clang::partial::prune (cyclomatic 42) crates/libs/clang/src/partial.rs:78 — windows_clang::partial::prune has cyclomatic complexity 42 (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.
  • windows_clang::partial::compact (cyclomatic 34) crates/libs/clang/src/partial.rs:322 — windows_clang::partial::compact has cyclomatic complexity 34 (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.
  • windows_clang::projection::publication::values (cyclomatic 31) crates/libs/clang/src/projection/publication.rs:3 — windows_clang::projection::publication::values 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.
  • windows_clang::projection::reference_values::expand_type (cyclomatic 29) crates/libs/clang/src/projection/reference_values.rs:720 — windows_clang::projection::reference_values::expand_type 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.
  • windows_clang::projection::annotations::success_condition (cyclomatic 26) crates/libs/clang/src/projection/annotations.rs:103 — windows_clang::projection::annotations::success_condition has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
  • windows_clang::sal::returned_buffer_shape (cyclomatic 26) crates/libs/clang/src/sal/mod.rs:724 — windows_clang::sal::returned_buffer_shape 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.
  • windows_clang::capture::annotations::association (cyclomatic 23) crates/libs/clang/src/capture/annotations.rs:250 — windows_clang::capture::annotations::association 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.
  • windows_clang::resolve::records::groups (cyclomatic 23) crates/libs/clang/src/resolve/records.rs:3 — windows_clang::resolve::records::groups 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.
  • windows_clang::resolve::enums::resolve (cyclomatic 21) crates/libs/clang/src/resolve/enums.rs:21 — windows_clang::resolve::enums::resolve 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.
  • windows_clang::sal::common_direction (cyclomatic 21) crates/libs/clang/src/sal/mod.rs:623 — windows_clang::sal::common_direction 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. This is NOT this file's highest cyclomatic complexity: windows_clang::sal::rpc_buffer_shape (cyclomatic 24) 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.
  • windows_clang::capture::annotations::group (cyclomatic 19) crates/libs/clang/src/capture/annotations.rs:132 — windows_clang::capture::annotations::group 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.
  • windows_clang::projection::publication::aliases (cyclomatic 19) crates/libs/clang/src/projection/publication.rs:558 — windows_clang::projection::publication::aliases 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.
  • windows_clang::capture::annotations::read (cyclomatic 18) crates/libs/clang/src/capture/annotations.rs:41 — windows_clang::capture::annotations::read 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.
  • windows_clang::resolve::records::definitions (cyclomatic 18) crates/libs/clang/src/resolve/records.rs:135 — windows_clang::resolve::records::definitions 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.
  • windows_clang::runtime::macros::discover (cyclomatic 17) crates/libs/clang/src/runtime/macros.rs:40 — windows_clang::runtime::macros::discover 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.
  • windows_clang::projection::annotations::field (cyclomatic 16) crates/libs/clang/src/projection/annotations.rs:203 — windows_clang::projection::annotations::field 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.
D3 · God Classes · FunctionTooLong · ×18
  • FunctionTooLong: windows_clang::capture::read crates/libs/clang/src/capture/mod.rs:43 — FunctionTooLong — windows_clang::capture::read runs 261 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 161 over it, 2.61× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: tool_win32::run crates/tools/win32/src/main.rs:40 — FunctionTooLong — tool_win32::run runs 243 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 143 over it, 2.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: windows_clang::projection::publication::values crates/libs/clang/src/projection/publication.rs:3 — FunctionTooLong — windows_clang::projection::publication::values runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: windows_clang::projection::annotations::buffer crates/libs/clang/src/projection/annotations.rs:555 — FunctionTooLong — windows_clang::projection::annotations::buffer 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.
  • FunctionTooLong: windows_clang::sal::shape crates/libs/clang/src/sal/mod.rs:787 — FunctionTooLong — windows_clang::sal::shape runs 180 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 80 over it, 1.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: windows_reactor::ir::validate_object crates/libs/reactor/src/ir.rs:260 — FunctionTooLong — windows_reactor::ir::validate_object runs 171 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 71 over it, 1.71× 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: windows_clang::partial::prune crates/libs/clang/src/partial.rs:78 — FunctionTooLong — windows_clang::partial::prune 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.
  • FunctionTooLong: windows_bindgen::types::layout::native_layout crates/libs/bindgen/src/types/layout.rs:15 — FunctionTooLong — windows_bindgen::types::layout::native_layout runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: windows_clang::projection::project_impl crates/libs/clang/src/projection/mod.rs:249 — FunctionTooLong — windows_clang::projection::project_impl runs 127 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 27 over it, 1.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.
  • FunctionTooLong: windows_rdl::formatter::format_seq crates/libs/rdl/src/formatter/mod.rs:13 — FunctionTooLong — windows_rdl::formatter::format_seq runs 127 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 27 over it, 1.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.
  • FunctionTooLong: windows_rdl::writer::struct::write_record crates/libs/rdl/src/writer/struct.rs:12 — FunctionTooLong — windows_rdl::writer::struct::write_record runs 123 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 23 over it, 1.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.
  • FunctionTooLong: tool_win32::wdk::run crates/tools/win32/src/wdk.rs:24 — FunctionTooLong — tool_win32::wdk::run runs 117 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 17 over it, 1.17× 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: windows_reactor::native::app::open_component_window crates/libs/reactor/src/native/app/mod.rs:741 — FunctionTooLong — windows_reactor::native::app::open_component_window runs 116 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 16 over it, 1.16× 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: windows_reactor::native::app::drain_window_requests crates/libs/reactor/src/native/app/mod.rs:941 — FunctionTooLong — windows_reactor::native::app::drain_window_requests runs 116 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 16 over it, 1.16× 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: windows_clang::projection::publication::enums crates/libs/clang/src/projection/publication.rs:417 — FunctionTooLong — windows_clang::projection::publication::enums runs 115 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 15 over it, 1.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: windows_clang::resolve::enums::resolve crates/libs/clang/src/resolve/enums.rs:21 — FunctionTooLong — windows_clang::resolve::enums::resolve runs 113 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 13 over it, 1.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: windows_clang::projection::publication::aliases crates/libs/clang/src/projection/publication.rs:558 — FunctionTooLong — windows_clang::projection::publication::aliases runs 108 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 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: windows_clang::projection::reference_values::expand_type crates/libs/clang/src/projection/reference_values.rs:720 — FunctionTooLong — windows_clang::projection::reference_values::expand_type runs 101 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 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D2 · Cognitive Complexity · Projector · ×14
  • Projector::validate_references (cognitive 72) crates/libs/clang/src/projection/references.rs:448 — Projector::validate_references has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (50 pts), loops 7 (16 pts), boolean chains 6 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Projector::record (cognitive 62) crates/libs/clang/src/projection/records.rs:90 — Projector::record has cognitive complexity 62 (threshold 15). Drivers by points: if/else 33 (53 pts), boolean chains 6, loops 2, 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.
  • Projector::interface (cognitive 60) crates/libs/clang/src/projection/values.rs:676 — Projector::interface has cognitive complexity 60 (threshold 15). Drivers by points: if/else 28 (46 pts), loops 4 (10 pts), boolean chains 4 (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.
  • Projector::validate_value_references (cognitive 55) crates/libs/clang/src/projection/reference_values.rs:6 — Projector::validate_value_references has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 6 (11 pts), boolean chains 4 (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.
  • Projector::written_ty (cognitive 44) crates/libs/clang/src/projection/mod.rs:1293 — Projector::written_ty has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 6, match/switch 1 (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.
  • Projector::validate_reference_record (cognitive 39) crates/libs/clang/src/projection/reference_values.rs:374 — Projector::validate_reference_record has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Projector::ty (cognitive 31) crates/libs/clang/src/projection/mod.rs:1460 — Projector::ty has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Projector::value (cognitive 28) crates/libs/clang/src/projection/values.rs:123 — Projector::value has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 2 (4 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.
  • Projector::type_callback_abis (cognitive 22) crates/libs/clang/src/projection/callbacks.rs:149 — Projector::type_callback_abis has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, match/switch 2 (3 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.
  • Projector::check_value_abi (cognitive 21) crates/libs/clang/src/projection/mod.rs:1106 — Projector::check_value_abi has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Projector::validate_alias_shape (cognitive 21) crates/libs/clang/src/projection/reference_values.rs:256 — Projector::validate_alias_shape has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts), loops 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.
  • Projector::associated_enum (cognitive 20) crates/libs/clang/src/projection/enum_annotations.rs:131 — Projector::associated_enum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (4 pts), loops 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.
  • Projector::parameter_ty (cognitive 17) crates/libs/clang/src/projection/mod.rs:1224 — Projector::parameter_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 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.
  • Projector::function_pointer (cognitive 17) crates/libs/clang/src/projection/mod.rs:1415 — Projector::function_pointer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · windows_bindgen · ×13
  • windows_bindgen::filter_parser::parse_tree (cognitive 34) crates/libs/bindgen/src/filter_parser.rs:37 — windows_bindgen::filter_parser::parse_tree has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (26 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 22). 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.
  • windows_bindgen::compute_event_only_delegates (cognitive 30) crates/libs/bindgen/src/lib.rs:782 — windows_bindgen::compute_event_only_delegates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 4 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_bindgen::filter_parser::resolve_one (cognitive 27) crates/libs/bindgen/src/filter_parser.rs:171 — windows_bindgen::filter_parser::resolve_one has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (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.
  • windows_bindgen::format::replace_outside_strings (cognitive 23) crates/libs/bindgen/src/format.rs:58 — windows_bindgen::format::replace_outside_strings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (10 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.
  • windows_bindgen::method_names::method_def_special_name (cognitive 23) crates/libs/bindgen/src/method_names.rs:62 — windows_bindgen::method_names::method_def_special_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (3 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.
  • windows_bindgen::format::tighten_macro_segment (cognitive 20) crates/libs/bindgen/src/format.rs:196 — windows_bindgen::format::tighten_macro_segment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 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.
  • windows_bindgen::expand_input (cognitive 19) crates/libs/bindgen/src/lib.rs:717 — windows_bindgen::expand_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (expand_path). 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.
  • windows_bindgen::types::layout::native_layout (cognitive 19) crates/libs/bindgen/src/types/layout.rs:15 — windows_bindgen::types::layout::native_layout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (5 pts), loops 2 (4 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.
  • windows_bindgen::cli::read_tokens (cognitive 18) crates/libs/bindgen/src/cli.rs:236 — windows_bindgen::cli::read_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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.
  • windows_bindgen::types::cpp_struct::bitfield_scalar (cognitive 18) crates/libs/bindgen/src/types/cpp_struct.rs:931 — windows_bindgen::types::cpp_struct::bitfield_scalar has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 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.
  • windows_bindgen::cli::bindgen (cognitive 17) crates/libs/bindgen/src/cli.rs:88 — windows_bindgen::cli::bindgen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 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.
  • windows_bindgen::format::find_matching_delim (cognitive 17) crates/libs/bindgen/src/format.rs:167 — windows_bindgen::format::find_matching_delim has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_bindgen::type_map::associated_enums (cognitive 16) crates/libs/bindgen/src/type_map.rs:21 — windows_bindgen::type_map::associated_enums has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Encoder · ×11
  • Encoder::encode_interface (cognitive 131) crates/libs/rdl/src/reader/interface.rs:111 — Encoder::encode_interface has cognitive complexity 131 (threshold 15). Drivers by points: if/else 35 (101 pts), loops 7 (13 pts), match/switch 3 (10 pts), boolean chains 7 (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Encoder::encode_path (cognitive 60) crates/libs/rdl/src/reader/mod.rs:1143 — Encoder::encode_path has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (41 pts), loops 4 (8 pts), boolean chains 6, match/switch 3 (5 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.
  • Encoder::validate_associated_enum_storage (cognitive 52) crates/libs/rdl/src/reader/attribute_ref.rs:799 — Encoder::validate_associated_enum_storage has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 3 (9 pts), match/switch 1 (2 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.
  • Encoder::encode_record (cognitive 50) crates/libs/rdl/src/reader/struct.rs:48 — Encoder::encode_record has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (38 pts), loops 7 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Encoder::find_enum_variant_value (cognitive 34) crates/libs/rdl/src/reader/attribute_ref.rs:360 — Encoder::find_enum_variant_value has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (10 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Encoder::encode_accessors (cognitive 34) crates/libs/rdl/src/reader/interface.rs:547 — Encoder::encode_accessors has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 5 (7 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.
  • Encoder::find_in_reference (cognitive 28) crates/libs/rdl/src/reader/attribute_ref.rs:105 — Encoder::find_in_reference has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (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.
  • Encoder::encode_buffer_extents (cognitive 26) crates/libs/rdl/src/reader/attribute_ref.rs:690 — Encoder::encode_buffer_extents has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Encoder::encode_attr_value (cognitive 20) crates/libs/rdl/src/reader/attribute_ref.rs:267 — Encoder::encode_attr_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 2 (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.
  • Encoder::encode_type_in_attr_ns (cognitive 19) crates/libs/rdl/src/reader/mod.rs:670 — Encoder::encode_type_in_attr_ns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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.
  • Encoder::encode_fn (cognitive 16) crates/libs/rdl/src/reader/fn.rs:49 — Encoder::encode_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · windows_rdl · ×10
  • windows_rdl::formatter::format_seq (cognitive 65) crates/libs/rdl/src/formatter/mod.rs:13 — windows_rdl::formatter::format_seq has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (39 pts), match/switch 5 (14 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 38). Of this number, 62 points are the body's own statements and 3 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.
  • windows_rdl::emit::write_type (cognitive 37) crates/libs/rdl/src/emit.rs:88 — windows_rdl::emit::write_type has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 5 (14 pts), match/switch 2 (3 pts), boolean chains 1 (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.
  • windows_rdl::writer::write_enum_value (cognitive 35) crates/libs/rdl/src/writer/mod.rs:970 — windows_rdl::writer::write_enum_value has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • windows_rdl::expand_input_paths (cognitive 31) crates/libs/rdl/src/lib.rs:256 — windows_rdl::expand_input_paths has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 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.
  • windows_rdl::writer::interface::write_members (cognitive 29) crates/libs/rdl/src/writer/interface.rs:44 — windows_rdl::writer::interface::write_members has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (22 pts), boolean chains 3, match/switch 1 (3 pts), loops 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.
  • windows_rdl::writer::write_custom_attributes_with_names (cognitive 24) crates/libs/rdl/src/writer/mod.rs:842 — windows_rdl::writer::write_custom_attributes_with_names has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7, loops 1 (3 pts), match/switch 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.
  • windows_rdl::writer::struct::write_record (cognitive 24) crates/libs/rdl/src/writer/struct.rs:12 — windows_rdl::writer::struct::write_record has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 8, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • windows_rdl::merge_arch_rdl (cognitive 16) crates/libs/rdl/src/lib.rs:164 — windows_rdl::merge_arch_rdl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_rdl::writer::resolve_filter (cognitive 16) crates/libs/rdl/src/writer/mod.rs:314 — windows_rdl::writer::resolve_filter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_rdl::writer::metadata_underlying_types (cognitive 16) crates/libs/rdl/src/writer/mod.rs:802 — windows_rdl::writer::metadata_underlying_types has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function item inside it that branches (collect). 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 · WinUiAdapter · ×10
  • WinUiAdapter::apply_imperative (cognitive 64) crates/libs/reactor/src/native/winui/adapter.rs:381 — WinUiAdapter::apply_imperative has cognitive complexity 64 (threshold 15). Drivers by points: if/else 19 (41 pts), match/switch 9 (20 pts), boolean chains 3 (nesting depth added 33). 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.
  • WinUiAdapter::reorder (cognitive 45) crates/libs/reactor/src/native/winui/relations.rs:215 — WinUiAdapter::reorder has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 3 (7 pts), match/switch 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.
  • WinUiAdapter::set_menu (cognitive 24) crates/libs/reactor/src/native/winui/attachments.rs:179 — WinUiAdapter::set_menu has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (3 pts), match/switch 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.
  • WinUiAdapter::set_flyout (cognitive 21) crates/libs/reactor/src/native/winui/attachments.rs:72 — WinUiAdapter::set_flyout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 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.
  • WinUiAdapter::set_content_dialog (cognitive 21) crates/libs/reactor/src/native/winui/content_dialog.rs:336 — WinUiAdapter::set_content_dialog has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • WinUiAdapter::apply_handle_property (cognitive 21) crates/libs/reactor/src/native/winui/objects.rs:271 — WinUiAdapter::apply_handle_property has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • WinUiAdapter::apply_mutation (cognitive 18) crates/libs/reactor/src/native/winui/adapter.rs:131 — WinUiAdapter::apply_mutation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 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.
  • WinUiAdapter::raise_live_regions (cognitive 16) crates/libs/reactor/src/native/winui/automation.rs:47 — WinUiAdapter::raise_live_regions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • WinUiAdapter::dispatch_dropped_data (cognitive 16) crates/libs/reactor/src/native/winui/events.rs:48 — WinUiAdapter::dispatch_dropped_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • WinUiAdapter::replace (cognitive 16) crates/libs/reactor/src/native/winui/objects.rs:384 — WinUiAdapter::replace has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D1 · Cyclomatic Complexity · Projector · ×9
  • Projector::record (cyclomatic 35) crates/libs/clang/src/projection/records.rs:90 — Projector::record 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.
  • Projector::ty (cyclomatic 34) crates/libs/clang/src/projection/mod.rs:1460 — Projector::ty 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.
  • Projector::validate_references (cyclomatic 33) crates/libs/clang/src/projection/references.rs:448 — Projector::validate_references 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.
  • Projector::interface (cyclomatic 30) crates/libs/clang/src/projection/values.rs:676 — Projector::interface 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.
  • Projector::written_ty (cyclomatic 26) crates/libs/clang/src/projection/mod.rs:1293 — Projector::written_ty 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.
  • Projector::validate_value_references (cyclomatic 26) crates/libs/clang/src/projection/reference_values.rs:6 — Projector::validate_value_references 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.
  • Projector::validate_reference_record (cyclomatic 24) crates/libs/clang/src/projection/reference_values.rs:374 — Projector::validate_reference_record 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.
  • Projector::check_value_abi (cyclomatic 19) crates/libs/clang/src/projection/mod.rs:1106 — Projector::check_value_abi has cyclomatic complexity 19 (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.
  • Projector::type_callback_abis (cyclomatic 16) crates/libs/clang/src/projection/callbacks.rs:149 — Projector::type_callback_abis 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 · tool_reactor · ×9
  • tool_reactor::generate_declarations (cognitive 146) crates/tools/reactor/src/main.rs:1517 — tool_reactor::generate_declarations has cognitive complexity 146 (threshold 15). Drivers by points: if/else 48 (101 pts), loops 15 (23 pts), match/switch 5 (16 pts), boolean chains 6 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • tool_reactor::generate (cognitive 84) crates/tools/reactor/src/main.rs:1150 — tool_reactor::generate has cognitive complexity 84 (threshold 15). Drivers by points: loops 32 (44 pts), if/else 20 (40 pts) (nesting depth added 32). 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.
  • tool_reactor::normalize_schema (cognitive 82) crates/tools/reactor/src/main.rs:704 — tool_reactor::normalize_schema has cognitive complexity 82 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 15 (28 pts), match/switch 1 (3 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.
  • tool_reactor::native::emit_event (cognitive 66) crates/tools/reactor/src/native.rs:245 — tool_reactor::native::emit_event has cognitive complexity 66 (threshold 15). Drivers by points: if/else 48 (57 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 12). 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.
  • tool_reactor::native::dependency_properties (cognitive 25) crates/tools/reactor/src/native.rs:1340 — tool_reactor::native::dependency_properties has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • tool_reactor::native::emit_create (cognitive 24) crates/tools/reactor/src/native.rs:164 — tool_reactor::native::emit_create has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (11 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • tool_reactor::native::emit_object_structs (cognitive 19) crates/tools/reactor/src/native.rs:74 — tool_reactor::native::emit_object_structs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 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.
  • tool_reactor::native::emit_set_property (cognitive 17) crates/tools/reactor/src/native.rs:1041 — tool_reactor::native::emit_set_property 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.
  • tool_reactor::native::emit_selection_payload (cognitive 16) crates/tools/reactor/src/native.rs:906 — tool_reactor::native::emit_selection_payload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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.
D2 · Cognitive Complexity · Capture · ×8
  • Capture::observation (cognitive 123) crates/libs/clang/src/capture/mod.rs:770 — Capture::observation has cognitive complexity 123 (threshold 15). Drivers by points: if/else 36 (96 pts), loops 4 (13 pts), boolean chains 11, match/switch 1 (3 pts) (nesting depth added 71). 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.
  • Capture::ty (cognitive 34) crates/libs/clang/src/capture/mod.rs:1286 — Capture::ty has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 4 (8 pts), boolean chains 6 (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.
  • Capture::parameter_comments (cognitive 32) crates/libs/clang/src/capture/comments.rs:58 — Capture::parameter_comments has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6, loops 3 (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.
  • Capture::declaration_attributes (cognitive 31) crates/libs/clang/src/capture/mod.rs:1160 — Capture::declaration_attributes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Capture::record (cognitive 18) crates/libs/clang/src/capture/mod.rs:689 — Capture::record has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 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.
  • Capture::constant_observation (cognitive 18) crates/libs/clang/src/capture/values.rs:305 — Capture::constant_observation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • Capture::enum_observation (cognitive 17) crates/libs/clang/src/capture/mod.rs:581 — Capture::enum_observation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 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.
  • Capture::constant_value (cognitive 17) crates/libs/clang/src/capture/values.rs:377 — Capture::constant_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D1 · Cyclomatic Complexity · WinUiAdapter · ×7
  • WinUiAdapter::apply_imperative (cyclomatic 40) crates/libs/reactor/src/native/winui/adapter.rs:381 — WinUiAdapter::apply_imperative 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.
  • WinUiAdapter::apply_mutation (cyclomatic 34) crates/libs/reactor/src/native/winui/adapter.rs:131 — WinUiAdapter::apply_mutation 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.
  • WinUiAdapter::set_flyout (cyclomatic 26) crates/libs/reactor/src/native/winui/attachments.rs:72 — WinUiAdapter::set_flyout 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.
  • WinUiAdapter::apply_handle_property (cyclomatic 17) crates/libs/reactor/src/native/winui/objects.rs:271 — WinUiAdapter::apply_handle_property has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: WinUiAdapter::set_key_accelerators (cyclomatic 27) 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.
  • WinUiAdapter::set_content_dialog (cyclomatic 16) crates/libs/reactor/src/native/winui/content_dialog.rs:336 — WinUiAdapter::set_content_dialog 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.
  • WinUiAdapter::apply_property (cyclomatic 16) crates/libs/reactor/src/native/winui/objects.rs:195 — WinUiAdapter::apply_property has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: WinUiAdapter::set_key_accelerators (cyclomatic 27) 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.
  • WinUiAdapter::reorder (cyclomatic 16) crates/libs/reactor/src/native/winui/relations.rs:215 — WinUiAdapter::reorder 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 · tool_win32 · ×7
  • tool_win32::run (cognitive 61) crates/tools/win32/src/main.rs:40 — tool_win32::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 34 (45 pts), loops 9 (12 pts), boolean chains 4 (nesting depth added 14). 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.
  • tool_win32::add_target_imports (cognitive 27) crates/tools/win32/src/main.rs:610 — tool_win32::add_target_imports has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (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.
  • tool_win32::default_stdcall_imports (cognitive 23) crates/tools/win32/src/main.rs:556 — tool_win32::default_stdcall_imports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 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.
  • tool_win32::native_symbols (cognitive 22) crates/tools/win32/src/main.rs:786 — tool_win32::native_symbols has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 2 (10 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • tool_win32::wdk::validate_additions (cognitive 22) crates/tools/win32/src/wdk.rs:229 — tool_win32::wdk::validate_additions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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.
  • tool_win32::guid_inputs (cognitive 20) crates/tools/win32/src/main.rs:932 — tool_win32::guid_inputs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), match/switch 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.
  • tool_win32::read_sdk_imports (cognitive 18) crates/tools/win32/src/main.rs:843 — tool_win32::read_sdk_imports has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 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.
D2 · Cognitive Complexity · Planner · ×7
  • Planner::reconcile_object (cognitive 28) crates/libs/reactor/src/reconcile/plan.rs:207 — Planner::reconcile_object has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, match/switch 4 (6 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.
  • Planner::reconcile_keyed_many (cognitive 26) crates/libs/reactor/src/reconcile/relations.rs:204 — Planner::reconcile_keyed_many has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 6 (8 pts), match/switch 5 (8 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.
  • Planner::reconcile_positional_many (cognitive 24) crates/libs/reactor/src/reconcile/relations.rs:316 — Planner::reconcile_positional_many has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (6 pts), match/switch 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.
  • Planner::reconcile_relation (cognitive 23) crates/libs/reactor/src/reconcile/relations.rs:123 — Planner::reconcile_relation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 4 (7 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.
  • Planner::reconcile_virtual_items (cognitive 23) crates/libs/reactor/src/reconcile/virtualization.rs:591 — Planner::reconcile_virtual_items has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Planner::retire (cognitive 21) crates/libs/reactor/src/reconcile/retirement.rs:272 — Planner::retire has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • Planner::replace_object (cognitive 16) crates/libs/reactor/src/reconcile/plan.rs:4 — Planner::replace_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Capture · ×6
  • Capture::ty (cyclomatic 55) crates/libs/clang/src/capture/mod.rs:1286 — Capture::ty has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • Capture::observation (cyclomatic 50) crates/libs/clang/src/capture/mod.rs:770 — Capture::observation has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Capture::attribute (cyclomatic 25) crates/libs/clang/src/capture/mod.rs:1058 — Capture::attribute has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
  • Capture::parameter_comments (cyclomatic 23) crates/libs/clang/src/capture/comments.rs:58 — Capture::parameter_comments 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.
  • Capture::declaration_attributes (cyclomatic 19) crates/libs/clang/src/capture/mod.rs:1160 — Capture::declaration_attributes 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.
  • Capture::constant_observation (cyclomatic 16) crates/libs/clang/src/capture/values.rs:305 — Capture::constant_observation 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 · Encoder · ×6
  • Encoder::encode_path (cyclomatic 55) crates/libs/rdl/src/reader/mod.rs:1143 — Encoder::encode_path has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Encoder::encode_interface (cyclomatic 54) crates/libs/rdl/src/reader/interface.rs:111 — Encoder::encode_interface has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Encoder::encode_record (cyclomatic 30) crates/libs/rdl/src/reader/struct.rs:48 — Encoder::encode_record 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.
  • Encoder::encode_value (cyclomatic 23) crates/libs/rdl/src/reader/mod.rs:747 — Encoder::encode_value 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.
  • Encoder::validate_associated_enum_storage (cyclomatic 17) crates/libs/rdl/src/reader/attribute_ref.rs:799 — Encoder::validate_associated_enum_storage 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.
  • Encoder::encode_accessors (cyclomatic 16) crates/libs/rdl/src/reader/interface.rs:547 — Encoder::encode_accessors 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 · Type · ×6
  • Type::from_metadata_type (cyclomatic 37) crates/libs/bindgen/src/types/mod.rs:422 — Type::from_metadata_type has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: Type::write_name (cyclomatic 51) 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.
  • Type::combine_definition_closure (cyclomatic 35) crates/libs/bindgen/src/type_closure.rs:317 — Type::combine_definition_closure has cyclomatic complexity 35 (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.
  • Type::remap (cyclomatic 28) crates/libs/bindgen/src/types/mod.rs:339 — Type::remap 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. This is NOT this file's highest cyclomatic complexity: Type::write_name (cyclomatic 51) 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.
  • Type::combine (cyclomatic 28) crates/libs/bindgen/src/types/mod.rs:1363 — Type::combine 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. This is NOT this file's highest cyclomatic complexity: Type::write_name (cyclomatic 51) 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.
  • Type::combine_sys (cyclomatic 23) crates/libs/bindgen/src/types/mod.rs:185 — Type::combine_sys 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. This is NOT this file's highest cyclomatic complexity: Type::write_name (cyclomatic 51) 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.
  • Type::combine_closure (cyclomatic 21) crates/libs/bindgen/src/type_closure.rs:223 — Type::combine_closure 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.
D5 · Coupling · Off the main sequence · ×6
  • Off the main sequence: windows-metadata — windows-metadata: abstractness 0.06, instability 0.00, distance 0.94 — zone of pain — concrete and depended on by 9 project(s), so it's rigid to change.
  • Off the main sequence: windows-window — windows-window: abstractness 0.00, instability 0.17, distance 0.83 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
  • Off the main sequence: helpers — helpers: abstractness 0.00, instability 0.18, distance 0.82 — zone of pain — concrete and depended on by 9 project(s), so it's rigid to change.
  • Off the main sequence: windows-numerics — windows-numerics: 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: windows-time — windows-time: 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: windows-rdl — windows-rdl: abstractness 0.02, instability 0.18, distance 0.79 — zone of pain — concrete and depended on by 9 project(s), so it's rigid to change.
D1 · Cyclomatic Complexity · tool_reactor · ×5
  • tool_reactor::generate_declarations (cyclomatic 75) crates/tools/reactor/src/main.rs:1517 — tool_reactor::generate_declarations has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • tool_reactor::native::emit_event (cyclomatic 57) crates/tools/reactor/src/native.rs:245 — tool_reactor::native::emit_event has cyclomatic complexity 57 (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.
  • tool_reactor::generate (cyclomatic 48) crates/tools/reactor/src/main.rs:1150 — tool_reactor::generate has cyclomatic complexity 48 (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.
  • tool_reactor::normalize_schema (cyclomatic 41) crates/tools/reactor/src/main.rs:704 — tool_reactor::normalize_schema 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. This is NOT this file's highest cyclomatic complexity: Value::from (cyclomatic 42) 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.
  • tool_reactor::native::dependency_properties (cyclomatic 16) crates/tools/reactor/src/native.rs:1340 — tool_reactor::native::dependency_properties 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 · windows_rdl · ×5
  • windows_rdl::emit::write_type (cyclomatic 44) crates/libs/rdl/src/emit.rs:88 — windows_rdl::emit::write_type has cyclomatic complexity 44 (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.
  • windows_rdl::formatter::format_seq (cyclomatic 42) crates/libs/rdl/src/formatter/mod.rs:13 — windows_rdl::formatter::format_seq has cyclomatic complexity 42 (threshold 15). Of this number, 40 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • windows_rdl::writer::struct::write_record (cyclomatic 19) crates/libs/rdl/src/writer/struct.rs:12 — windows_rdl::writer::struct::write_record 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.
  • windows_rdl::writer::write_custom_attributes_with_names (cyclomatic 17) crates/libs/rdl/src/writer/mod.rs:842 — windows_rdl::writer::write_custom_attributes_with_names 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.
  • windows_rdl::writer::write_enum_value (cyclomatic 16) crates/libs/rdl/src/writer/mod.rs:970 — windows_rdl::writer::write_enum_value 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 · Plan · ×5
  • Plan::new (cognitive 63) crates/libs/clang/src/projection/plan.rs:33 — Plan::new has cognitive complexity 63 (threshold 15). Drivers by points: loops 19 (30 pts), if/else 11 (26 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 28). 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.
  • Plan::primary_names (cognitive 37) crates/libs/clang/src/projection/plan.rs:207 — Plan::primary_names has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 6, loops 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.
  • Plan::callback_names (cognitive 28) crates/libs/clang/src/projection/plan.rs:289 — Plan::callback_names has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (11 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.
  • Plan::validate (cognitive 24) crates/libs/clang/src/projection/plan.rs:468 — Plan::validate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 7, 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.
  • Plan::alias_headers (cognitive 18) crates/libs/clang/src/projection/plan.rs:373 — Plan::alias_headers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), 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 · References · ×4
  • References::bind (cognitive 98) crates/libs/clang/src/projection/references.rs:117 — References::bind has cognitive complexity 98 (threshold 15). Drivers by points: if/else 27 (63 pts), loops 13 (20 pts), match/switch 3 (8 pts), boolean chains 7 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • References::bind_alias_pointee (cognitive 32) crates/libs/clang/src/projection/references.rs:325 — References::bind_alias_pointee has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (4 pts), match/switch 2 (3 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.
  • References::get (cognitive 18) crates/libs/clang/src/projection/references.rs:60 — References::get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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.
  • References::native_interfaces (cognitive 16) crates/libs/clang/src/projection/references.rs:29 — References::native_interfaces 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 · Type · ×4
  • Type::combine_definition_closure (cognitive 63) crates/libs/bindgen/src/type_closure.rs:317 — Type::combine_definition_closure has cognitive complexity 63 (threshold 15). Drivers by points: loops 13 (34 pts), if/else 11 (28 pts), match/switch 1 (nesting depth added 38). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • Type::combine_sys (cognitive 24) crates/libs/bindgen/src/types/mod.rs:185 — Type::combine_sys has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 7 (8 pts), match/switch 2, boolean chains 1 (nesting depth added 7). 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.
  • Type::combine_closure (cognitive 23) crates/libs/bindgen/src/type_closure.rs:223 — Type::combine_closure has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 5 (8 pts), boolean chains 3, match/switch 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.
  • Type::from_metadata_type (cognitive 17) crates/libs/bindgen/src/types/mod.rs:422 — Type::from_metadata_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (5 pts), boolean chains 3 (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.
D2 · Cognitive Complexity · ComponentHost · ×4
  • ComponentHost::drain_step (cognitive 42) crates/libs/reactor/src/component/mod.rs:421 — ComponentHost::drain_step has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 4 (10 pts), boolean chains 3, 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.
  • ComponentHost::expand_declaration (cognitive 29) crates/libs/reactor/src/component/expand.rs:154 — ComponentHost::expand_declaration has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • ComponentHost::plan_virtual_work (cognitive 20) crates/libs/reactor/src/component/virtualization.rs:28 — ComponentHost::plan_virtual_work has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • ComponentHost::resolve_window_publication (cognitive 20) crates/libs/reactor/src/component/window.rs:92 — ComponentHost::resolve_window_publication has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D1 · Cyclomatic Complexity · Plan · ×3
  • Plan::new (cyclomatic 34) crates/libs/clang/src/projection/plan.rs:33 — Plan::new has cyclomatic complexity 34 (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.
  • Plan::primary_names (cyclomatic 22) crates/libs/clang/src/projection/plan.rs:207 — Plan::primary_names 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.
  • Plan::validate (cyclomatic 16) crates/libs/clang/src/projection/plan.rs:468 — Plan::validate 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 · windows_bindgen · ×3
  • windows_bindgen::cli::bindgen (cyclomatic 29) crates/libs/bindgen/src/cli.rs:88 — windows_bindgen::cli::bindgen has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (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.
  • windows_bindgen::types::layout::native_layout (cyclomatic 21) crates/libs/bindgen/src/types/layout.rs:15 — windows_bindgen::types::layout::native_layout 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.
  • windows_bindgen::filter_parser::resolve_one (cyclomatic 17) crates/libs/bindgen/src/filter_parser.rs:171 — windows_bindgen::filter_parser::resolve_one 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 · Planner · ×3
  • Planner::reconcile_object (cyclomatic 25) crates/libs/reactor/src/reconcile/plan.rs:207 — Planner::reconcile_object has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
  • Planner::reconcile_keyed_many (cyclomatic 19) crates/libs/reactor/src/reconcile/relations.rs:204 — Planner::reconcile_keyed_many has cyclomatic complexity 19 (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.
  • Planner::reconcile_virtual_items (cyclomatic 16) crates/libs/reactor/src/reconcile/virtualization.rs:591 — Planner::reconcile_virtual_items 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 · ComponentHost · ×3
  • ComponentHost::drain_step (cyclomatic 23) crates/libs/reactor/src/component/mod.rs:421 — ComponentHost::drain_step 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.
  • ComponentHost::expand_declaration (cyclomatic 17) crates/libs/reactor/src/component/expand.rs:154 — ComponentHost::expand_declaration 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.
  • ComponentHost::resolve_window_publication (cyclomatic 16) crates/libs/reactor/src/component/window.rs:92 — ComponentHost::resolve_window_publication 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 · Method · ×3
  • Method::write (cognitive 181) crates/libs/bindgen/src/types/method.rs:354 — Method::write has cognitive complexity 181 (threshold 15). Drivers by points: if/else 115 (161 pts), boolean chains 15, match/switch 4 (5 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Method::write_abi (cognitive 33) crates/libs/bindgen/src/types/method.rs:280 — Method::write_abi has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23 (32 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.
  • Method::write_upcall (cognitive 18) crates/libs/bindgen/src/types/method.rs:41 — Method::write_upcall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · windows_reactor · ×3
  • windows_reactor::ir::validate_object (cognitive 61) crates/libs/reactor/src/ir.rs:260 — windows_reactor::ir::validate_object has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 5 (10 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_reactor::native::app::drain_window_requests (cognitive 43) crates/libs/reactor/src/native/app/mod.rs:941 — windows_reactor::native::app::drain_window_requests has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (39 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • windows_reactor::native::winui::set_grid_definitions (cognitive 18) crates/libs/reactor/src/native/winui/mod.rs:813 — windows_reactor::native::winui::set_grid_definitions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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.
D2 · Cognitive Complexity · ApplicationState · ×3
  • ApplicationState::render (cognitive 42) crates/libs/reactor/src/native/app/application.rs:113 — ApplicationState::render has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 5, match/switch 1 (3 pts), boolean chains 2 (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.
  • ApplicationState::drain (cognitive 26) crates/libs/reactor/src/native/app/application.rs:299 — ApplicationState::drain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4, 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.
  • ApplicationState::dispatch_icon_event (cognitive 16) crates/libs/reactor/src/native/app/application.rs:250 — ApplicationState::dispatch_icon_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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.
D2 · Cognitive Complexity · CppStruct · ×3
  • CppStruct::write_with_cfg (cognitive 41) crates/libs/bindgen/src/types/cpp_struct.rs:301 — CppStruct::write_with_cfg has cognitive complexity 41 (threshold 15). Drivers by points: if/else 28 (33 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
  • CppStruct::write_bitfield_accessors_for_arch (cognitive 28) crates/libs/bindgen/src/types/cpp_struct.rs:796 — CppStruct::write_bitfield_accessors_for_arch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • CppStruct::write_mixed_layout (cognitive 26) crates/libs/bindgen/src/types/cpp_struct.rs:574 — CppStruct::write_mixed_layout has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (9 pts), boolean chains 3 (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.
D35 · Change Coupling · Change coupling · ×3
  • Change coupling: lib.rs ↔ lib.rs crates/libs/sys/src/lib.rs:1 — `crates/libs/sys/src/lib.rs` and `crates/libs/windows/src/lib.rs` change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `8bc13e58` Remove `improper_ctypes` workaround (#3296); `bca9a76f` Address Rust nightly compiler warnings (#3292); `f766e5ae` Remove unnecessary doc attributes (#3206) — run `git show` on any of them.
  • Change coupling: REDACTED ↔ main.rs crates/libs/windows/src/Windows/Win32/mod.rs:1 — `crates/libs/windows/src/Windows/Win32/mod.rs` and `crates/tools/win32/src/main.rs` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `cc1bf12e` `windows-clang` include PDH status constants (#5084); `f5f7418c` `windows-bindgen` include perflib.h in default metadata (#5051); `c17cc785` `metadata` add `tsvirtualchannels.h` (#4882) — run `git show` on any of them.
  • Change coupling: interface.rs ↔ interface.rs crates/libs/rdl/src/reader/interface.rs:1 — `crates/libs/rdl/src/reader/interface.rs` and `crates/libs/rdl/src/writer/interface.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 — 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 9 shared commits counted here, the most recent 3 are `ba498897` Support preserve-result annotations (#5301); `8d9839a4` feat(rdl): add property and event shorthand syntax for interfaces (#4…; `25089b65` windows-rdl: Add #[guid(u128)] and #[no_guid] pseudo-attributes for i… — run `git show` on any of them.
D1 · Cyclomatic Complexity · Method · ×2
  • Method::write (cyclomatic 98) crates/libs/bindgen/src/types/method.rs:354 — Method::write has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Method::write_abi (cyclomatic 17) crates/libs/bindgen/src/types/method.rs:280 — Method::write_abi 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 · File · ×2
  • File::new (cyclomatic 58) crates/libs/metadata/src/reader/file.rs:18 — File::new has cyclomatic complexity 58 (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.
  • File::Type (cyclomatic 36) crates/libs/metadata/src/writer/file/mod.rs:452 — File::Type has cyclomatic complexity 36 (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 · References · ×2
  • References::bind (cyclomatic 53) crates/libs/clang/src/projection/references.rs:117 — References::bind has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • References::bind_alias_pointee (cyclomatic 16) crates/libs/clang/src/projection/references.rs:325 — References::bind_alias_pointee has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: windows_clang::projection::references::scalar_matches (cyclomatic 17) 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 · tool_win32 · ×2
  • tool_win32::run (cyclomatic 44) crates/tools/win32/src/main.rs:40 — tool_win32::run has cyclomatic complexity 44 (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.
  • tool_win32::add_target_imports (cyclomatic 16) crates/tools/win32/src/main.rs:610 — tool_win32::add_target_imports 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 · RetainedGraph · ×2
  • RetainedGraph::matches_declaration_inner (cyclomatic 38) crates/libs/reactor/src/reconcile/graph.rs:122 — RetainedGraph::matches_declaration_inner has cyclomatic complexity 38 (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.
  • RetainedGraph::apply_observation (cyclomatic 25) crates/libs/reactor/src/reconcile/feedback.rs:233 — RetainedGraph::apply_observation has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · Reader · ×2
  • Reader::from_index (cyclomatic 35) crates/libs/bindgen/src/winmd/reader.rs:57 — Reader::from_index has cyclomatic complexity 35 (threshold 15). Of this number, 30 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Reader::write (cyclomatic 29) crates/libs/rdl/src/reader/mod.rs:157 — Reader::write has cyclomatic complexity 29 (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 · ITextRange_Vtbl · ×2
  • ITextRange_Vtbl::new (cyclomatic 34) crates/libs/windows/src/Windows/Win32/tom/mod.rs:5269 — ITextRange_Vtbl::new has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 33 function items inside it that branch (GetText, GetChar, GetDuplicate, …). 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.
  • ITextRange_Vtbl::new (cyclomatic 26) crates/libs/windows/src/Windows/UI/Text/mod.rs:3111 — ITextRange_Vtbl::new has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 25 function items inside it that branch (Character, CharacterFormat, FormattedText, …). 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 · windows_reactor · ×2
  • windows_reactor::ir::validate_object (cyclomatic 31) crates/libs/reactor/src/ir.rs:260 — windows_reactor::ir::validate_object 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.
  • windows_reactor::native::app::drain_window_requests (cyclomatic 26) crates/libs/reactor/src/native/app/mod.rs:941 — windows_reactor::native::app::drain_window_requests 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 · CppMethod · ×2
  • CppMethod::new (cyclomatic 26) crates/libs/bindgen/src/types/cpp_method.rs:34 — CppMethod::new 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.
  • CppMethod::write_args (cyclomatic 26) crates/libs/bindgen/src/types/cpp_method.rs:563 — CppMethod::write_args 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 · ApplicationState · ×2
  • ApplicationState::render (cyclomatic 21) crates/libs/reactor/src/native/app/application.rs:113 — ApplicationState::render 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.
  • ApplicationState::drain (cyclomatic 20) crates/libs/reactor/src/native/app/application.rs:299 — ApplicationState::drain 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 · IPropertyValue_Vtbl · ×2
  • IPropertyValue_Vtbl::new (cyclomatic 21) crates/libs/reference/src/bindings.rs:73 — IPropertyValue_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (Type, IsNumericScalar, GetUInt8, …). 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.
  • IPropertyValue_Vtbl::new (cyclomatic 21) crates/libs/windows/src/Windows/Foundation/mod.rs:667 — IPropertyValue_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (Type, IsNumericScalar, GetUInt8, …). 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 · Filter · ×2
  • Filter::register_member (cognitive 120) crates/libs/bindgen/src/filter.rs:389 — Filter::register_member has cognitive complexity 120 (threshold 15). Drivers by points: if/else 23 (86 pts), loops 6 (29 pts), match/switch 2 (5 pts) (nesting depth added 89). 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.
  • Filter::from_resolved (cognitive 49) crates/libs/bindgen/src/filter.rs:212 — Filter::from_resolved has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (42 pts), loops 2 (5 pts), match/switch 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 · Reader · ×2
  • Reader::from_index (cognitive 94) crates/libs/bindgen/src/winmd/reader.rs:57 — Reader::from_index has cognitive complexity 94 (threshold 15). Drivers by points: if/else 13 (47 pts), match/switch 5 (25 pts), loops 5 (18 pts), boolean chains 4 (nesting depth added 67). Of this number, 65 points are the body's own statements and 29 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.
  • Reader::write (cognitive 44) crates/libs/rdl/src/reader/mod.rs:157 — Reader::write has cognitive complexity 44 (threshold 15). Drivers by points: loops 11 (25 pts), if/else 5 (14 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 26). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · MetadataResolver · ×2
  • MetadataResolver::load (cognitive 70) crates/tools/reactor-metadata/src/lib.rs:87 — MetadataResolver::load has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 8 (12 pts), match/switch 2 (8 pts), boolean chains 4 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • MetadataResolver::collect_methods_for_class (cognitive 18) crates/tools/reactor-metadata/src/lib.rs:299 — MetadataResolver::collect_methods_for_class has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Class · ×2
  • Class::write (cognitive 66) crates/libs/bindgen/src/types/class.rs:17 — Class::write has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (41 pts), loops 4 (10 pts), boolean chains 9, match/switch 3 (6 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Class::required_interfaces (cognitive 24) crates/libs/bindgen/src/types/class.rs:400 — Class::required_interfaces has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to one function item inside it that branches (walk). 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 · CppMethod · ×2
  • CppMethod::write_args (cognitive 44) crates/libs/bindgen/src/types/cpp_method.rs:563 — CppMethod::write_args has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 2 (5 pts), boolean chains 4, loops 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.
  • CppMethod::new (cognitive 32) crates/libs/bindgen/src/types/cpp_method.rs:34 — CppMethod::new has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 8, loops 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Config · ×2
  • Config::write_package (cognitive 41) crates/libs/bindgen/src/package_writer.rs:104 — Config::write_package has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 9 (13 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.
  • Config::write_namespace (cognitive 20) crates/libs/bindgen/src/paths.rs:65 — Config::write_namespace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (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 · RetainedGraph · ×2
  • RetainedGraph::matches_declaration_inner (cognitive 41) crates/libs/reactor/src/reconcile/graph.rs:122 — RetainedGraph::matches_declaration_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 7 (10 pts), boolean chains 8, loops 3 (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.
  • RetainedGraph::apply_observation (cognitive 30) crates/libs/reactor/src/reconcile/feedback.rs:233 — RetainedGraph::apply_observation has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (9 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.
D2 · Cognitive Complexity · BitfieldBacking · ×2
  • BitfieldBacking::write_typed_accessor (cognitive 40) crates/libs/bindgen/src/types/cpp_struct.rs:1121 — BitfieldBacking::write_typed_accessor has cognitive complexity 40 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 6, loops 3 (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.
  • BitfieldBacking::write_accessor (cognitive 20) crates/libs/bindgen/src/types/cpp_struct.rs:1023 — BitfieldBacking::write_accessor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 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 · windows_metadata · ×2
  • windows_metadata::merge::write_enum_union (cognitive 36) crates/libs/metadata/src/merge/mod.rs:487 — windows_metadata::merge::write_enum_union has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 4 (5 pts), match/switch 1 (3 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.
  • windows_metadata::merge::write_type_arch_merged (cognitive 24) crates/libs/metadata/src/merge/mod.rs:828 — windows_metadata::merge::write_type_arch_merged has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 6 (9 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · ITextRange_Vtbl · ×2
  • ITextRange_Vtbl::new (cognitive 33) crates/libs/windows/src/Windows/Win32/tom/mod.rs:5269 — ITextRange_Vtbl::new has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 33. None of this is in the body itself: all 33 points belong to 33 function items inside it that branch (GetText, GetChar, GetDuplicate, …). 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.
  • ITextRange_Vtbl::new (cognitive 25) crates/libs/windows/src/Windows/UI/Text/mod.rs:3111 — ITextRange_Vtbl::new has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 25. None of this is in the body itself: all 25 points belong to 25 function items inside it that branch (Character, CharacterFormat, FormattedText, …). 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 · File · ×2
  • File::Type (cognitive 27) crates/libs/metadata/src/writer/file/mod.rs:452 — File::Type has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (8 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
  • File::new (cognitive 22) crates/libs/metadata/src/reader/file.rs:18 — File::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 3 (5 pts), loops 2, boolean chains 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.
D2 · Cognitive Complexity · Blob · ×2
  • Blob::read_type_signature (cognitive 22) crates/libs/metadata/src/reader/blob.rs:121 — Blob::read_type_signature has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 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.
  • Blob::read_type_code (cognitive 17) crates/libs/metadata/src/reader/blob.rs:177 — Blob::read_type_code has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), match/switch 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 · IPropertyValue_Vtbl · ×2
  • IPropertyValue_Vtbl::new (cognitive 20) crates/libs/reference/src/bindings.rs:73 — IPropertyValue_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (Type, IsNumericScalar, GetUInt8, …). 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.
  • IPropertyValue_Vtbl::new (cognitive 20) crates/libs/windows/src/Windows/Foundation/mod.rs:667 — IPropertyValue_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (Type, IsNumericScalar, GetUInt8, …). 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.
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
D1 · Cyclomatic Complexity · IUIAutomationElement_Vtbl · ×1
  • IUIAutomationElement_Vtbl::new (cyclomatic 80) crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:3919 — IUIAutomationElement_Vtbl::new has cyclomatic complexity 80 (threshold 15). Most of this is not in the body itself: 1 of the 80 points is its own statement and the rest belongs to 79 function items inside it that branch (GetRuntimeId, FindFirst, FindAll, …). 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 · IADsUser_Vtbl · ×1
  • IADsUser_Vtbl::new (cyclomatic 49) crates/libs/windows/src/Windows/Win32/iads/mod.rs:12859 — IADsUser_Vtbl::new has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to 48 function items inside it that branch (BadLoginAddress, BadLoginCount, LastLogin, …). 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 · Interface · ×1
  • Interface::write (cyclomatic 47) crates/libs/bindgen/src/types/interface.rs:210 — Interface::write has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · IUIAutomation_Vtbl · ×1
  • IUIAutomation_Vtbl::new (cyclomatic 44) crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:648 — IUIAutomation_Vtbl::new has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to 43 function items inside it that branch (CompareElements, CompareRuntimeIds, GetRootElement, …). 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 · IUpdate_Vtbl · ×1
  • IUpdate_Vtbl::new (cyclomatic 43) crates/libs/windows/src/Windows/Win32/wuapi/mod.rs:4107 — IUpdate_Vtbl::new has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 1 of the 43 points is its own statement and the rest belongs to 42 function items inside it that branch (Title, AutoSelectOnWebSites, BundledUpdates, …). 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 · TypeClosure · ×1
  • TypeClosure::build (cyclomatic 40) crates/libs/bindgen/src/type_closure.rs:18 — TypeClosure::build has cyclomatic complexity 40 (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 · CppInterface · ×1
  • CppInterface::write (cyclomatic 38) crates/libs/bindgen/src/types/cpp_interface.rs:136 — CppInterface::write 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 · IXpsOMObjectFactory_Vtbl · ×1
  • IXpsOMObjectFactory_Vtbl::new (cyclomatic 38) crates/libs/windows/src/Windows/Win32/xps/mod.rs:5854 — IXpsOMObjectFactory_Vtbl::new has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 37 function items inside it that branch (CreatePackage, CreatePackageFromFile, CreatePackageFromStream, …). 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 · Writer · ×1
  • Writer::write (cyclomatic 37) crates/libs/rdl/src/writer/mod.rs:141 — Writer::write has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Records · ×1
  • Records::into_stream (cyclomatic 36) crates/libs/metadata/src/writer/file/rec.rs:197 — Records::into_stream has cyclomatic complexity 36 (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 · IDataCollectorSet_Vtbl · ×1
  • IDataCollectorSet_Vtbl::new (cyclomatic 35) crates/libs/windows/src/Windows/Win32/pla/mod.rs:2321 — IDataCollectorSet_Vtbl::new has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 34 function items inside it that branch (DataCollectors, Duration, Description, …). 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 · Filter · ×1
  • Filter::register_member (cyclomatic 34) crates/libs/bindgen/src/filter.rs:389 — Filter::register_member 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 · MetadataResolver · ×1
  • MetadataResolver::load (cyclomatic 34) crates/tools/reactor-metadata/src/lib.rs:87 — MetadataResolver::load 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 · CppConst · ×1
  • CppConst::write_with_enclosing (cyclomatic 33) crates/libs/bindgen/src/types/cpp_const.rs:46 — CppConst::write_with_enclosing 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 · IFileSystemImage_Vtbl · ×1
  • IFileSystemImage_Vtbl::new (cyclomatic 33) crates/libs/windows/src/Windows/Win32/imapi2fs/mod.rs:1029 — IFileSystemImage_Vtbl::new has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 32 function items inside it that branch (Root, SessionStartBlock, FreeMediaBlocks, …). 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 · Blob · ×1
  • Blob::read_type_code (cyclomatic 32) crates/libs/metadata/src/reader/blob.rs:177 — Blob::read_type_code has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · IXMLDOMNode_Vtbl · ×1
  • IXMLDOMNode_Vtbl::new (cyclomatic 32) crates/libs/windows/src/Windows/Win32/msxml/mod.rs:10031 — IXMLDOMNode_Vtbl::new has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 31 function items inside it that branch (nodeName, nodeValue, nodeType, …). 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 · Class · ×1
  • Class::write (cyclomatic 31) crates/libs/bindgen/src/types/class.rs:17 — Class::write 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 · IWebViewControl_Vtbl · ×1
  • IWebViewControl_Vtbl::new (cyclomatic 30) crates/libs/windows/src/Windows/Web/UI/mod.rs:443 — IWebViewControl_Vtbl::new has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 29 function items inside it that branch (Source, DocumentTitle, CanGoBack, …). 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 · IInkPicture_Vtbl · ×1
  • IInkPicture_Vtbl::new (cyclomatic 30) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:5337 — IInkPicture_Vtbl::new has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 29 function items inside it that branch (hWnd, DefaultDrawingAttributes, Renderer, …). 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 · ICoreWindow_Vtbl · ×1
  • ICoreWindow_Vtbl::new (cyclomatic 29) crates/libs/windows/src/Windows/UI/Core/mod.rs:3717 — ICoreWindow_Vtbl::new has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 28 function items inside it that branch (AutomationHostProvider, Bounds, CustomProperties, …). 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 · IX509PrivateKey_Vtbl · ×1
  • IX509PrivateKey_Vtbl::new (cyclomatic 29) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:16543 — IX509PrivateKey_Vtbl::new has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 28 function items inside it that branch (Export, ExportPublicKey, ContainerName, …). 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 · ITextFont_Vtbl · ×1
  • ITextFont_Vtbl::new (cyclomatic 29) crates/libs/windows/src/Windows/Win32/tom/mod.rs:2090 — ITextFont_Vtbl::new has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 28 function items inside it that branch (GetDuplicate, CanChange, IsEqual, …). 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 · windows_window · ×1
  • windows_window::window::wndproc (cyclomatic 28) crates/libs/window/src/window.rs:393 — windows_window::window::wndproc 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 · CppStruct · ×1
  • CppStruct::write_with_cfg (cyclomatic 27) crates/libs/bindgen/src/types/cpp_struct.rs:301 — CppStruct::write_with_cfg 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 · ITextCharacterFormat_Vtbl · ×1
  • ITextCharacterFormat_Vtbl::new (cyclomatic 27) crates/libs/windows/src/Windows/UI/Text/mod.rs:649 — ITextCharacterFormat_Vtbl::new has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 26 function items inside it that branch (AllCaps, BackgroundColor, Bold, …). 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 · IInkOverlay_Vtbl · ×1
  • IInkOverlay_Vtbl::new (cyclomatic 27) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:4161 — IInkOverlay_Vtbl::new has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 26 function items inside it that branch (hWnd, Enabled, DefaultDrawingAttributes, …). 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 · NativeWindow · ×1
  • NativeWindow::apply_visuals (cyclomatic 26) crates/libs/reactor/src/native/winui/window/mod.rs:239 — NativeWindow::apply_visuals 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 · IWICImagingFactory_Vtbl · ×1
  • IWICImagingFactory_Vtbl::new (cyclomatic 26) crates/libs/windows/src/Windows/Win32/wincodec/mod.rs:4021 — IWICImagingFactory_Vtbl::new has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 25 function items inside it that branch (CreateDecoderFromFilename, CreateDecoderFromStream, CreateDecoderFromFileHandle, …). 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 · Config · ×1
  • Config::write_package (cyclomatic 25) crates/libs/bindgen/src/package_writer.rs:104 — Config::write_package 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 · ITextParagraphFormat_Vtbl · ×1
  • ITextParagraphFormat_Vtbl::new (cyclomatic 25) crates/libs/windows/src/Windows/UI/Text/mod.rs:2167 — ITextParagraphFormat_Vtbl::new has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 24 function items inside it that branch (Alignment, FirstLineIndent, KeepTogether, …). 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 · IInkStrokeDisp_Vtbl · ×1
  • IInkStrokeDisp_Vtbl::new (cyclomatic 25) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:8900 — IInkStrokeDisp_Vtbl::new has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 24 function items inside it that branch (ID, BezierPoints, DrawingAttributes, …). 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 · ITextPara_Vtbl · ×1
  • ITextPara_Vtbl::new (cyclomatic 25) crates/libs/windows/src/Windows/Win32/tom/mod.rs:3939 — ITextPara_Vtbl::new has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 24 function items inside it that branch (GetDuplicate, CanChange, IsEqual, …). 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 · BitfieldBacking · ×1
  • BitfieldBacking::write_typed_accessor (cyclomatic 24) crates/libs/bindgen/src/types/cpp_struct.rs:1121 — BitfieldBacking::write_typed_accessor 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.
D1 · Cyclomatic Complexity · Expression · ×1
  • Expression::parse_inner (cyclomatic 24) crates/libs/clang/src/sal/expression.rs:37 — Expression::parse_inner 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 · IImageScannerSourceConfiguration_Vtbl · ×1
  • IImageScannerSourceConfiguration_Vtbl::new (cyclomatic 24) crates/libs/windows/src/Windows/Devices/Scanners/mod.rs:407 — IImageScannerSourceConfiguration_Vtbl::new has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 23 function items inside it that branch (MinScanArea, MaxScanArea, SelectedScanRegion, …). 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 · IXMLDOMDocument_Vtbl · ×1
  • IXMLDOMDocument_Vtbl::new (cyclomatic 24) crates/libs/windows/src/Windows/Win32/msxml/mod.rs:8113 — IXMLDOMDocument_Vtbl::new has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 23 function items inside it that branch (doctype, implementation, documentElement, …). 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 · Merger · ×1
  • Merger::merge (cyclomatic 23) crates/libs/metadata/src/merge/mod.rs:98 — Merger::merge 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 · IDataReader_Vtbl · ×1
  • IDataReader_Vtbl::new (cyclomatic 23) crates/libs/windows/src/Windows/Storage/Streams/mod.rs:1016 — IDataReader_Vtbl::new has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 22 function items inside it that branch (UnconsumedBufferLength, UnicodeEncoding, ByteOrder, …). 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 · IDiscFormat2Data_Vtbl · ×1
  • IDiscFormat2Data_Vtbl::new (cyclomatic 23) crates/libs/windows/src/Windows/Win32/imapi2/mod.rs:1227 — IDiscFormat2Data_Vtbl::new has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 22 function items inside it that branch (Recorder, BufferUnderrunFreeDisabled, PostgapAlreadyInImage, …). 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 · ITextFont2_Vtbl · ×1
  • ITextFont2_Vtbl::new (cyclomatic 23) crates/libs/windows/src/Windows/Win32/tom/mod.rs:3065 — ITextFont2_Vtbl::new has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 22 function items inside it that branch (GetCount, GetAutoLigatures, GetAutospaceAlpha, …). 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 · ITraceDataCollector_Vtbl · ×1
  • ITraceDataCollector_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/pla/mod.rs:5104 — ITraceDataCollector_Vtbl::new has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 21 function items inside it that branch (BufferSize, BuffersLost, BuffersWritten, …). 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 · ITextDocument2_Vtbl · ×1
  • ITextDocument2_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/tom/mod.rs:770 — ITextDocument2_Vtbl::new has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 21 function items inside it that branch (GetCaretType, GetDisplays, GetDocumentFont, …). 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 · IUIAutomationLegacyIAccessiblePattern_Vtbl · ×1
  • IUIAutomationLegacyIAccessiblePattern_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:7424 — IUIAutomationLegacyIAccessiblePattern_Vtbl::new has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 21 function items inside it that branch (CurrentChildId, CurrentName, CurrentValue, …). 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 · IWMPNetwork_Vtbl · ×1
  • IWMPNetwork_Vtbl::new (cyclomatic 22) crates/libs/windows/src/Windows/Win32/wmp/mod.rs:5828 — IWMPNetwork_Vtbl::new has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 21 function items inside it that branch (bandWidth, recoveredPackets, sourceProtocol, …). 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 · IXmlNode_Vtbl · ×1
  • IXmlNode_Vtbl::new (cyclomatic 21) crates/libs/windows/src/Windows/Data/Xml/Dom/mod.rs:1318 — IXmlNode_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (NodeValue, NodeType, NodeName, …). 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 · IDCompositionDevice_Vtbl · ×1
  • IDCompositionDevice_Vtbl::new (cyclomatic 21) crates/libs/windows/src/Windows/Win32/dcomp/mod.rs:1369 — IDCompositionDevice_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (CreateTargetForHwnd, CreateVisual, CreateSurface, …). 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 · ITaskSettings_Vtbl · ×1
  • ITaskSettings_Vtbl::new (cyclomatic 21) crates/libs/windows/src/Windows/Win32/taskschd/mod.rs:6325 — ITaskSettings_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (AllowDemandStart, RestartInterval, RestartCount, …). 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 · ITextRow_Vtbl · ×1
  • ITextRow_Vtbl::new (cyclomatic 21) crates/libs/windows/src/Windows/Win32/tom/mod.rs:6943 — ITextRow_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (GetAlignment, GetCellCount, GetCellCountCache, …). 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 · ISWbemDateTime_Vtbl · ×1
  • ISWbemDateTime_Vtbl::new (cyclomatic 21) crates/libs/windows/src/Windows/Win32/wbemdisp/mod.rs:374 — ISWbemDateTime_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (Value, Year, YearSpecified, …). 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 · IWSManEx_Vtbl · ×1
  • IWSManEx_Vtbl::new (cyclomatic 21) crates/libs/windows/src/Windows/Win32/wsmandisp/mod.rs:809 — IWSManEx_Vtbl::new has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 20 function items inside it that branch (CreateResourceLocator, SessionFlagUTF8, SessionFlagCredUsernamePassword, …). 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 · Snapshot · ×1
  • Snapshot::statistics (cyclomatic 20) crates/libs/clang/src/lib.rs:717 — Snapshot::statistics has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body's own statements and 9 belong to 2 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 · windows_strings · ×1
  • windows_strings::literals::decode_utf8_char (cyclomatic 20) crates/libs/strings/src/literals.rs:77 — windows_strings::literals::decode_utf8_char 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 · windows_sys · ×1
  • windows_sys::core::literals::decode_utf8_char (cyclomatic 20) crates/libs/sys/src/core/literals.rs:42 — windows_sys::core::literals::decode_utf8_char 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 · IX509CertificateRequestPkcs10_Vtbl · ×1
  • IX509CertificateRequestPkcs10_Vtbl::new (cyclomatic 20) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:9366 — IX509CertificateRequestPkcs10_Vtbl::new has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 19 function items inside it that branch (IsSmartCard, TemplateObjectId, PublicKey, …). 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 · IFsrmClassificationManager_Vtbl · ×1
  • IFsrmClassificationManager_Vtbl::new (cyclomatic 20) crates/libs/windows/src/Windows/Win32/fsrmpipeline/mod.rs:314 — IFsrmClassificationManager_Vtbl::new has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 19 function items inside it that branch (ClassificationReportFormats, Logging, ClassificationReportMailTo, …). 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 shape REPEATS in the file: one other method here (IFsrmPropertyBag_Vtbl::new) 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.
D1 · Cyclomatic Complexity · IFsrmPropertyBag_Vtbl · ×1
  • IFsrmPropertyBag_Vtbl::new (cyclomatic 20) crates/libs/windows/src/Windows/Win32/fsrmpipeline/mod.rs:2219 — IFsrmPropertyBag_Vtbl::new has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 19 function items inside it that branch (Name, RelativePath, VolumeName, …). 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 shape REPEATS in the file: one other method here (IFsrmClassificationManager_Vtbl::new) 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.
D1 · Cyclomatic Complexity · IInkCollector_Vtbl · ×1
  • IInkCollector_Vtbl::new (cyclomatic 20) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:932 — IInkCollector_Vtbl::new has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 19 function items inside it that branch (hWnd, Enabled, DefaultDrawingAttributes, …). 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 shape REPEATS in the file: one other method here (IInkDisp_Vtbl::new) 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.
D1 · Cyclomatic Complexity · IInkDisp_Vtbl · ×1
  • IInkDisp_Vtbl::new (cyclomatic 20) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:2361 — IInkDisp_Vtbl::new has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 19 function items inside it that branch (Strokes, ExtendedProperties, Dirty, …). 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 shape REPEATS in the file: one other method here (IInkCollector_Vtbl::new) 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.
D1 · Cyclomatic Complexity · ISpeechVoice_Vtbl · ×1
  • ISpeechVoice_Vtbl::new (cyclomatic 20) crates/libs/windows/src/Windows/Win32/sapi/mod.rs:14728 — ISpeechVoice_Vtbl::new has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 19 function items inside it that branch (Status, Voice, AudioOutput, …). 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 · Bindgen · ×1
  • Bindgen::write (cyclomatic 19) crates/libs/bindgen/src/lib.rs:451 — Bindgen::write 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 · Layout · ×1
  • Layout::to_module (cyclomatic 19) crates/libs/rdl/src/writer/layout.rs:81 — Layout::to_module has cyclomatic complexity 19 (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 · Runtime · ×1
  • Runtime::plan_realize_virtual (cyclomatic 19) crates/libs/reactor/src/reconcile/virtualization.rs:328 — Runtime::plan_realize_virtual 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 · IX509EnrollmentPolicyServer_Vtbl · ×1
  • IX509EnrollmentPolicyServer_Vtbl::new (cyclomatic 19) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:13248 — IX509EnrollmentPolicyServer_Vtbl::new 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 18 function items inside it that branch (GetTemplates, GetCAsForTemplate, GetCAs, …). 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 · IDCompositionDevice2_Vtbl · ×1
  • IDCompositionDevice2_Vtbl::new (cyclomatic 19) crates/libs/windows/src/Windows/Win32/dcomp/mod.rs:1924 — IDCompositionDevice2_Vtbl::new 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 18 function items inside it that branch (CreateVisual, CreateSurfaceFactory, CreateSurface, …). 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 · INetFwRule_Vtbl · ×1
  • INetFwRule_Vtbl::new (cyclomatic 19) crates/libs/windows/src/Windows/Win32/netfw/mod.rs:3433 — INetFwRule_Vtbl::new 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 18 function items inside it that branch (Name, Description, ApplicationName, …). 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 · ISpeechRecognizer_Vtbl · ×1
  • ISpeechRecognizer_Vtbl::new (cyclomatic 19) crates/libs/windows/src/Windows/Win32/sapi/mod.rs:13655 — ISpeechRecognizer_Vtbl::new 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 18 function items inside it that branch (Recognizer, AllowAudioInputFormatChangesOnNextSet, AudioInput, …). 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 · WebViewWindowBuilder · ×1
  • WebViewWindowBuilder::create_with_status (cyclomatic 18) crates/libs/webview/src/window.rs:141 — WebViewWindowBuilder::create_with_status 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 · IStorageFolderQueryOperations_Vtbl · ×1
  • IStorageFolderQueryOperations_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Storage/Search/mod.rs:690 — IStorageFolderQueryOperations_Vtbl::new has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 17 function items inside it that branch (GetIndexedStateAsync, CreateFileQueryOverloadDefault, CreateFileQuery, …). 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 · IX509CertificateRevocationList_Vtbl · ×1
  • IX509CertificateRevocationList_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:10818 — IX509CertificateRevocationList_Vtbl::new has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 17 function items inside it that branch (Issuer, ThisUpdate, NextUpdate, …). 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 · IADsComputer_Vtbl · ×1
  • IADsComputer_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Win32/iads/mod.rs:3224 — IADsComputer_Vtbl::new has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 17 function items inside it that branch (ComputerID, Site, Description, …). 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 · ISchemaType_Vtbl · ×1
  • ISchemaType_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Win32/msxml/mod.rs:5171 — ISchemaType_Vtbl::new has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 17 function items inside it that branch (baseTypes, r#final, variety, …). 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 · ISWbemObject_Vtbl · ×1
  • ISWbemObject_Vtbl::new (cyclomatic 18) crates/libs/windows/src/Windows/Win32/wbemdisp/mod.rs:1880 — ISWbemObject_Vtbl::new has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 17 function items inside it that branch (Put_, Instances_, Subclasses_, …). 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 · UseTree2 · ×1
  • UseTree2::parse (cyclomatic 17) crates/libs/implement/src/lib.rs:315 — UseTree2::parse 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 · IX509CertificateRequestCmc_Vtbl · ×1
  • IX509CertificateRequestCmc_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:8651 — IX509CertificateRequestCmc_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (TemplateObjectId, NullSigned, CryptAttributes, …). 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 · IDWriteFactory_Vtbl · ×1
  • IDWriteFactory_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/dwrite/mod.rs:2207 — IDWriteFactory_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (CreateCustomFontCollection, CreateFontFileReference, CreateCustomFontFileReference, …). 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 · IADsClass_Vtbl · ×1
  • IADsClass_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/iads/mod.rs:2499 — IADsClass_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (PrimaryInterface, CLSID, OID, …). 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 · IDiscFormat2TrackAtOnce_Vtbl · ×1
  • IDiscFormat2TrackAtOnce_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/imapi2/mod.rs:2940 — IDiscFormat2TrackAtOnce_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (Recorder, BufferUnderrunFreeDisabled, NumberOfExistingTracks, …). 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 · IAccessible_Vtbl · ×1
  • IAccessible_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/oleacc/mod.rs:757 — IAccessible_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (accParent, accChildCount, accChild, …). 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 · ISpeechPhraseInfo_Vtbl · ×1
  • ISpeechPhraseInfo_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/sapi/mod.rs:10483 — ISpeechPhraseInfo_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (LanguageId, GrammarId, StartTime, …). 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 · IWMPCore_Vtbl · ×1
  • IWMPCore_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/wmp/mod.rs:1699 — IWMPCore_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (URL, openState, playState, …). 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 shape REPEATS in the file: one other method here (IWMPMedia_Vtbl::new) 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.
D1 · Cyclomatic Complexity · IWMPMedia_Vtbl · ×1
  • IWMPMedia_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/wmp/mod.rs:4487 — IWMPMedia_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (isIdentical, sourceURL, name, …). 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 shape REPEATS in the file: one other method here (IWMPCore_Vtbl::new) 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.
D1 · Cyclomatic Complexity · IXpsOMPath_Vtbl · ×1
  • IXpsOMPath_Vtbl::new (cyclomatic 17) crates/libs/windows/src/Windows/Win32/xps/mod.rs:8495 — IXpsOMPath_Vtbl::new has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 16 function items inside it that branch (GetGeometry, GetGeometryLocal, GetSnapsToPixels, …). 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 · TimeSpan · ×1
  • TimeSpan::fmt (cyclomatic 16) crates/libs/time/src/timespan.rs:300 — TimeSpan::fmt 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 · IOCSPCAConfiguration_Vtbl · ×1
  • IOCSPCAConfiguration_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/certadm/mod.rs:1070 — IOCSPCAConfiguration_Vtbl::new has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 15 function items inside it that branch (Identifier, CACertificate, HashAlgorithm, …). 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 · ICspInformation_Vtbl · ×1
  • ICspInformation_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:3969 — ICspInformation_Vtbl::new has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 15 function items inside it that branch (CspAlgorithms, HasHardwareRandomNumberGenerator, IsHardwareDevice, …). 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 · IVideoWindow_Vtbl · ×1
  • IVideoWindow_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/control/mod.rs:2741 — IVideoWindow_Vtbl::new has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 15 function items inside it that branch (Caption, WindowStyle, WindowStyleEx, …). 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 · IDataCollector_Vtbl · ×1
  • IDataCollector_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/pla/mod.rs:1307 — IDataCollector_Vtbl::new has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 15 function items inside it that branch (DataCollectorSet, DataCollectorType, FileName, …). 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 · IPortableDeviceServiceCapabilities_Vtbl · ×1
  • IPortableDeviceServiceCapabilities_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/portabledeviceapi/mod.rs:2217 — IPortableDeviceServiceCapabilities_Vtbl::new has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 15 function items inside it that branch (GetSupportedMethods, GetSupportedMethodsByFormat, GetMethodAttributes, …). 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 · IUpdateInstaller_Vtbl · ×1
  • IUpdateInstaller_Vtbl::new (cyclomatic 16) crates/libs/windows/src/Windows/Win32/wuapi/mod.rs:7413 — IUpdateInstaller_Vtbl::new has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 15 function items inside it that branch (ClientApplicationID, IsForced, ParentHwnd, …). 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 · TypeClosure · ×1
  • TypeClosure::build (cognitive 131) crates/libs/bindgen/src/type_closure.rs:18 — TypeClosure::build has cognitive complexity 131 (threshold 15). Drivers by points: loops 19 (72 pts), if/else 15 (52 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 93). 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 · Interface · ×1
  • Interface::write (cognitive 119) crates/libs/bindgen/src/types/interface.rs:210 — Interface::write has cognitive complexity 119 (threshold 15). Drivers by points: if/else 31 (76 pts), loops 5 (19 pts), boolean chains 14, match/switch 4 (10 pts) (nesting depth added 65). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · CppInterface · ×1
  • CppInterface::write (cognitive 100) crates/libs/bindgen/src/types/cpp_interface.rs:136 — CppInterface::write has cognitive complexity 100 (threshold 15). Drivers by points: if/else 30 (68 pts), match/switch 7 (17 pts), loops 3 (12 pts), boolean chains 3 (nesting depth added 57). 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 · Writer · ×1
  • Writer::write (cognitive 87) crates/libs/rdl/src/writer/mod.rs:141 — Writer::write has cognitive complexity 87 (threshold 15). Drivers by points: if/else 17 (45 pts), loops 15 (38 pts), boolean chains 3, match/switch 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CppConst · ×1
  • CppConst::write_with_enclosing (cognitive 85) crates/libs/bindgen/src/types/cpp_const.rs:46 — CppConst::write_with_enclosing has cognitive complexity 85 (threshold 15). Drivers by points: if/else 30 (63 pts), match/switch 3 (12 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · IUIAutomationElement_Vtbl · ×1
  • IUIAutomationElement_Vtbl::new (cognitive 79) crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:3919 — IUIAutomationElement_Vtbl::new has cognitive complexity 79 (threshold 15). Drivers by points: match/switch 79. None of this is in the body itself: all 79 points belong to 79 function items inside it that branch (GetRuntimeId, FindFirst, FindAll, …). 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 · Merger · ×1
  • Merger::merge (cognitive 65) crates/libs/metadata/src/merge/mod.rs:98 — Merger::merge has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 11 (29 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 · IADsUser_Vtbl · ×1
  • IADsUser_Vtbl::new (cognitive 48) crates/libs/windows/src/Windows/Win32/iads/mod.rs:12859 — IADsUser_Vtbl::new has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 48. None of this is in the body itself: all 48 points belong to 48 function items inside it that branch (BadLoginAddress, BadLoginCount, LastLogin, …). 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 · TypeMap · ×1
  • TypeMap::filter (cognitive 44) crates/libs/bindgen/src/type_map.rs:75 — TypeMap::filter has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 4 (14 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · windows_window · ×1
  • windows_window::window::wndproc (cognitive 43) crates/libs/window/src/window.rs:393 — windows_window::window::wndproc has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 8, match/switch 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IUIAutomation_Vtbl · ×1
  • IUIAutomation_Vtbl::new (cognitive 43) crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:648 — IUIAutomation_Vtbl::new has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 43. None of this is in the body itself: all 43 points belong to 43 function items inside it that branch (CompareElements, CompareRuntimeIds, GetRootElement, …). 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 · IUpdate_Vtbl · ×1
  • IUpdate_Vtbl::new (cognitive 42) crates/libs/windows/src/Windows/Win32/wuapi/mod.rs:4107 — IUpdate_Vtbl::new has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 42. None of this is in the body itself: all 42 points belong to 42 function items inside it that branch (Title, AutoSelectOnWebSites, BundledUpdates, …). 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 · IXpsOMObjectFactory_Vtbl · ×1
  • IXpsOMObjectFactory_Vtbl::new (cognitive 37) crates/libs/windows/src/Windows/Win32/xps/mod.rs:5854 — IXpsOMObjectFactory_Vtbl::new has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 37. None of this is in the body itself: all 37 points belong to 37 function items inside it that branch (CreatePackage, CreatePackageFromFile, CreatePackageFromStream, …). 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 · Bindgen · ×1
  • Bindgen::write (cognitive 35) crates/libs/bindgen/src/lib.rs:451 — Bindgen::write has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 6 (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.
D2 · Cognitive Complexity · UseTree2 · ×1
  • UseTree2::parse (cognitive 35) crates/libs/implement/src/lib.rs:315 — UseTree2::parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (9 pts), loops 1 (4 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.
D2 · Cognitive Complexity · Records · ×1
  • Records::into_stream (cognitive 35) crates/libs/metadata/src/writer/file/rec.rs:197 — Records::into_stream has cognitive complexity 35 (threshold 15). Drivers by points: loops 24, if/else 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 · IDataCollectorSet_Vtbl · ×1
  • IDataCollectorSet_Vtbl::new (cognitive 34) crates/libs/windows/src/Windows/Win32/pla/mod.rs:2321 — IDataCollectorSet_Vtbl::new has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 34. None of this is in the body itself: all 34 points belong to 34 function items inside it that branch (DataCollectors, Duration, Description, …). 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 · Layout · ×1
  • Layout::to_module (cognitive 33) crates/libs/rdl/src/writer/layout.rs:81 — Layout::to_module has cognitive complexity 33 (threshold 15). Drivers by points: loops 11 (26 pts), if/else 5, 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 · IFileSystemImage_Vtbl · ×1
  • IFileSystemImage_Vtbl::new (cognitive 32) crates/libs/windows/src/Windows/Win32/imapi2fs/mod.rs:1029 — IFileSystemImage_Vtbl::new has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 32. None of this is in the body itself: all 32 points belong to 32 function items inside it that branch (Root, SessionStartBlock, FreeMediaBlocks, …). 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 · NativeWindow · ×1
  • NativeWindow::apply_visuals (cognitive 31) crates/libs/reactor/src/native/winui/window/mod.rs:239 — NativeWindow::apply_visuals has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · TimeSpan · ×1
  • TimeSpan::fmt (cognitive 31) crates/libs/time/src/timespan.rs:300 — TimeSpan::fmt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (12 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IXMLDOMNode_Vtbl · ×1
  • IXMLDOMNode_Vtbl::new (cognitive 31) crates/libs/windows/src/Windows/Win32/msxml/mod.rs:10031 — IXMLDOMNode_Vtbl::new has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 31. None of this is in the body itself: all 31 points belong to 31 function items inside it that branch (nodeName, nodeValue, nodeType, …). 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 · Expression · ×1
  • Expression::parse_inner (cognitive 29) crates/libs/clang/src/sal/expression.rs:37 — Expression::parse_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 6, 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 · IWebViewControl_Vtbl · ×1
  • IWebViewControl_Vtbl::new (cognitive 29) crates/libs/windows/src/Windows/Web/UI/mod.rs:443 — IWebViewControl_Vtbl::new has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 29. None of this is in the body itself: all 29 points belong to 29 function items inside it that branch (Source, DocumentTitle, CanGoBack, …). 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 · IInkPicture_Vtbl · ×1
  • IInkPicture_Vtbl::new (cognitive 29) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:5337 — IInkPicture_Vtbl::new has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 29. None of this is in the body itself: all 29 points belong to 29 function items inside it that branch (hWnd, DefaultDrawingAttributes, Renderer, …). 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 · Runtime · ×1
  • Runtime::plan_realize_virtual (cognitive 28) crates/libs/reactor/src/reconcile/virtualization.rs:328 — Runtime::plan_realize_virtual has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 3, 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 · windows_strings · ×1
  • windows_strings::literals::decode_utf8_char (cognitive 28) crates/libs/strings/src/literals.rs:77 — windows_strings::literals::decode_utf8_char has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5 (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 · windows_sys · ×1
  • windows_sys::core::literals::decode_utf8_char (cognitive 28) crates/libs/sys/src/core/literals.rs:42 — windows_sys::core::literals::decode_utf8_char has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5 (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 · ICoreWindow_Vtbl · ×1
  • ICoreWindow_Vtbl::new (cognitive 28) crates/libs/windows/src/Windows/UI/Core/mod.rs:3717 — ICoreWindow_Vtbl::new has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 28. None of this is in the body itself: all 28 points belong to 28 function items inside it that branch (AutomationHostProvider, Bounds, CustomProperties, …). 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 · IX509PrivateKey_Vtbl · ×1
  • IX509PrivateKey_Vtbl::new (cognitive 28) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:16543 — IX509PrivateKey_Vtbl::new has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 28. None of this is in the body itself: all 28 points belong to 28 function items inside it that branch (Export, ExportPublicKey, ContainerName, …). 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 · ITextFont_Vtbl · ×1
  • ITextFont_Vtbl::new (cognitive 28) crates/libs/windows/src/Windows/Win32/tom/mod.rs:2090 — ITextFont_Vtbl::new has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 28. None of this is in the body itself: all 28 points belong to 28 function items inside it that branch (GetDuplicate, CanChange, IsEqual, …). 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 · ITextCharacterFormat_Vtbl · ×1
  • ITextCharacterFormat_Vtbl::new (cognitive 26) crates/libs/windows/src/Windows/UI/Text/mod.rs:649 — ITextCharacterFormat_Vtbl::new has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 26. None of this is in the body itself: all 26 points belong to 26 function items inside it that branch (AllCaps, BackgroundColor, Bold, …). 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 · IInkOverlay_Vtbl · ×1
  • IInkOverlay_Vtbl::new (cognitive 26) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:4161 — IInkOverlay_Vtbl::new has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 26. None of this is in the body itself: all 26 points belong to 26 function items inside it that branch (hWnd, Enabled, DefaultDrawingAttributes, …). 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 · IWICImagingFactory_Vtbl · ×1
  • IWICImagingFactory_Vtbl::new (cognitive 25) crates/libs/windows/src/Windows/Win32/wincodec/mod.rs:4021 — IWICImagingFactory_Vtbl::new has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 25. None of this is in the body itself: all 25 points belong to 25 function items inside it that branch (CreateDecoderFromFilename, CreateDecoderFromStream, CreateDecoderFromFileHandle, …). 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 · ITextParagraphFormat_Vtbl · ×1
  • ITextParagraphFormat_Vtbl::new (cognitive 24) crates/libs/windows/src/Windows/UI/Text/mod.rs:2167 — ITextParagraphFormat_Vtbl::new has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 24. None of this is in the body itself: all 24 points belong to 24 function items inside it that branch (Alignment, FirstLineIndent, KeepTogether, …). 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 · IInkStrokeDisp_Vtbl · ×1
  • IInkStrokeDisp_Vtbl::new (cognitive 24) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:8900 — IInkStrokeDisp_Vtbl::new has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 24. None of this is in the body itself: all 24 points belong to 24 function items inside it that branch (ID, BezierPoints, DrawingAttributes, …). 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 · ITextPara_Vtbl · ×1
  • ITextPara_Vtbl::new (cognitive 24) crates/libs/windows/src/Windows/Win32/tom/mod.rs:3939 — ITextPara_Vtbl::new has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 24. None of this is in the body itself: all 24 points belong to 24 function items inside it that branch (GetDuplicate, CanChange, IsEqual, …). 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 · IImageScannerSourceConfiguration_Vtbl · ×1
  • IImageScannerSourceConfiguration_Vtbl::new (cognitive 23) crates/libs/windows/src/Windows/Devices/Scanners/mod.rs:407 — IImageScannerSourceConfiguration_Vtbl::new has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 23. None of this is in the body itself: all 23 points belong to 23 function items inside it that branch (MinScanArea, MaxScanArea, SelectedScanRegion, …). 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 · IXMLDOMDocument_Vtbl · ×1
  • IXMLDOMDocument_Vtbl::new (cognitive 23) crates/libs/windows/src/Windows/Win32/msxml/mod.rs:8113 — IXMLDOMDocument_Vtbl::new has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 23. None of this is in the body itself: all 23 points belong to 23 function items inside it that branch (doctype, implementation, documentElement, …). 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 · IDataReader_Vtbl · ×1
  • IDataReader_Vtbl::new (cognitive 22) crates/libs/windows/src/Windows/Storage/Streams/mod.rs:1016 — IDataReader_Vtbl::new has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 22. None of this is in the body itself: all 22 points belong to 22 function items inside it that branch (UnconsumedBufferLength, UnicodeEncoding, ByteOrder, …). 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 · IDiscFormat2Data_Vtbl · ×1
  • IDiscFormat2Data_Vtbl::new (cognitive 22) crates/libs/windows/src/Windows/Win32/imapi2/mod.rs:1227 — IDiscFormat2Data_Vtbl::new has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 22. None of this is in the body itself: all 22 points belong to 22 function items inside it that branch (Recorder, BufferUnderrunFreeDisabled, PostgapAlreadyInImage, …). 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 · ITextFont2_Vtbl · ×1
  • ITextFont2_Vtbl::new (cognitive 22) crates/libs/windows/src/Windows/Win32/tom/mod.rs:3065 — ITextFont2_Vtbl::new has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 22. None of this is in the body itself: all 22 points belong to 22 function items inside it that branch (GetCount, GetAutoLigatures, GetAutospaceAlpha, …). 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 · index.html.run (cognitive 22) · ×1
  • index.html.run (cognitive 22) web/features/index.html:50 — index.html.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), ternaries 2 (4 pts), error handling 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 · Snapshot · ×1
  • Snapshot::statistics (cognitive 21) crates/libs/clang/src/lib.rs:717 — Snapshot::statistics has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (8 pts), if/else 3 (7 pts), match/switch 4 (6 pts) (nesting depth added 7). Of this number, 15 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 · ITraceDataCollector_Vtbl · ×1
  • ITraceDataCollector_Vtbl::new (cognitive 21) crates/libs/windows/src/Windows/Win32/pla/mod.rs:5104 — ITraceDataCollector_Vtbl::new has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 21. None of this is in the body itself: all 21 points belong to 21 function items inside it that branch (BufferSize, BuffersLost, BuffersWritten, …). 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 · ITextDocument2_Vtbl · ×1
  • ITextDocument2_Vtbl::new (cognitive 21) crates/libs/windows/src/Windows/Win32/tom/mod.rs:770 — ITextDocument2_Vtbl::new has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 21. None of this is in the body itself: all 21 points belong to 21 function items inside it that branch (GetCaretType, GetDisplays, GetDocumentFont, …). 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 · IUIAutomationLegacyIAccessiblePattern_Vtbl · ×1
  • IUIAutomationLegacyIAccessiblePattern_Vtbl::new (cognitive 21) crates/libs/windows/src/Windows/Win32/uiautomationclient/mod.rs:7424 — IUIAutomationLegacyIAccessiblePattern_Vtbl::new has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 21. None of this is in the body itself: all 21 points belong to 21 function items inside it that branch (CurrentChildId, CurrentName, CurrentValue, …). 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 · IWMPNetwork_Vtbl · ×1
  • IWMPNetwork_Vtbl::new (cognitive 21) crates/libs/windows/src/Windows/Win32/wmp/mod.rs:5828 — IWMPNetwork_Vtbl::new has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 21. None of this is in the body itself: all 21 points belong to 21 function items inside it that branch (bandWidth, recoveredPackets, sourceProtocol, …). 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 · WebViewWindowBuilder · ×1
  • WebViewWindowBuilder::create_with_status (cognitive 20) crates/libs/webview/src/window.rs:141 — WebViewWindowBuilder::create_with_status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 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.
D2 · Cognitive Complexity · IXmlNode_Vtbl · ×1
  • IXmlNode_Vtbl::new (cognitive 20) crates/libs/windows/src/Windows/Data/Xml/Dom/mod.rs:1318 — IXmlNode_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (NodeValue, NodeType, NodeName, …). 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 · IDCompositionDevice_Vtbl · ×1
  • IDCompositionDevice_Vtbl::new (cognitive 20) crates/libs/windows/src/Windows/Win32/dcomp/mod.rs:1369 — IDCompositionDevice_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (CreateTargetForHwnd, CreateVisual, CreateSurface, …). 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 · ITaskSettings_Vtbl · ×1
  • ITaskSettings_Vtbl::new (cognitive 20) crates/libs/windows/src/Windows/Win32/taskschd/mod.rs:6325 — ITaskSettings_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (AllowDemandStart, RestartInterval, RestartCount, …). 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 · ITextRow_Vtbl · ×1
  • ITextRow_Vtbl::new (cognitive 20) crates/libs/windows/src/Windows/Win32/tom/mod.rs:6943 — ITextRow_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (GetAlignment, GetCellCount, GetCellCountCache, …). 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 · ISWbemDateTime_Vtbl · ×1
  • ISWbemDateTime_Vtbl::new (cognitive 20) crates/libs/windows/src/Windows/Win32/wbemdisp/mod.rs:374 — ISWbemDateTime_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (Value, Year, YearSpecified, …). 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 · IWSManEx_Vtbl · ×1
  • IWSManEx_Vtbl::new (cognitive 20) crates/libs/windows/src/Windows/Win32/wsmandisp/mod.rs:809 — IWSManEx_Vtbl::new has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 20. None of this is in the body itself: all 20 points belong to 20 function items inside it that branch (CreateResourceLocator, SessionFlagUTF8, SessionFlagCredUsernamePassword, …). 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 · Cfg · ×1
  • Cfg::write (cognitive 19) crates/libs/bindgen/src/package_writer.rs:46 — Cfg::write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 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 · Index · ×1
  • Index::new_for_architecture (cognitive 19) crates/libs/metadata/src/reader/index.rs:43 — Index::new_for_architecture has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (6 pts), boolean chains 1 (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.
D2 · Cognitive Complexity · IX509CertificateRequestPkcs10_Vtbl · ×1
  • IX509CertificateRequestPkcs10_Vtbl::new (cognitive 19) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:9366 — IX509CertificateRequestPkcs10_Vtbl::new has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 19. None of this is in the body itself: all 19 points belong to 19 function items inside it that branch (IsSmartCard, TemplateObjectId, PublicKey, …). 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 · IFsrmClassificationManager_Vtbl · ×1
  • IFsrmClassificationManager_Vtbl::new (cognitive 19) crates/libs/windows/src/Windows/Win32/fsrmpipeline/mod.rs:314 — IFsrmClassificationManager_Vtbl::new has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 19. None of this is in the body itself: all 19 points belong to 19 function items inside it that branch (ClassificationReportFormats, Logging, ClassificationReportMailTo, …). 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 shape REPEATS in the file: one other method here (IFsrmPropertyBag_Vtbl::new) 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 · IFsrmPropertyBag_Vtbl · ×1
  • IFsrmPropertyBag_Vtbl::new (cognitive 19) crates/libs/windows/src/Windows/Win32/fsrmpipeline/mod.rs:2219 — IFsrmPropertyBag_Vtbl::new has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 19. None of this is in the body itself: all 19 points belong to 19 function items inside it that branch (Name, RelativePath, VolumeName, …). 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 shape REPEATS in the file: one other method here (IFsrmClassificationManager_Vtbl::new) 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 · IInkCollector_Vtbl · ×1
  • IInkCollector_Vtbl::new (cognitive 19) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:932 — IInkCollector_Vtbl::new has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 19. None of this is in the body itself: all 19 points belong to 19 function items inside it that branch (hWnd, Enabled, DefaultDrawingAttributes, …). 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 shape REPEATS in the file: one other method here (IInkDisp_Vtbl::new) 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 · IInkDisp_Vtbl · ×1
  • IInkDisp_Vtbl::new (cognitive 19) crates/libs/windows/src/Windows/Win32/msinkaut/mod.rs:2361 — IInkDisp_Vtbl::new has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 19. None of this is in the body itself: all 19 points belong to 19 function items inside it that branch (Strokes, ExtendedProperties, Dirty, …). 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 shape REPEATS in the file: one other method here (IInkCollector_Vtbl::new) 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 · ISpeechVoice_Vtbl · ×1
  • ISpeechVoice_Vtbl::new (cognitive 19) crates/libs/windows/src/Windows/Win32/sapi/mod.rs:14728 — ISpeechVoice_Vtbl::new has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 19. None of this is in the body itself: all 19 points belong to 19 function items inside it that branch (Status, Voice, AudioOutput, …). 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 · CppFn · ×1
  • CppFn::write (cognitive 18) crates/libs/bindgen/src/types/cpp_fn.rs:167 — CppFn::write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IX509EnrollmentPolicyServer_Vtbl · ×1
  • IX509EnrollmentPolicyServer_Vtbl::new (cognitive 18) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:13248 — IX509EnrollmentPolicyServer_Vtbl::new has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 18. None of this is in the body itself: all 18 points belong to 18 function items inside it that branch (GetTemplates, GetCAsForTemplate, GetCAs, …). 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 · IDCompositionDevice2_Vtbl · ×1
  • IDCompositionDevice2_Vtbl::new (cognitive 18) crates/libs/windows/src/Windows/Win32/dcomp/mod.rs:1924 — IDCompositionDevice2_Vtbl::new has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 18. None of this is in the body itself: all 18 points belong to 18 function items inside it that branch (CreateVisual, CreateSurfaceFactory, CreateSurface, …). 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 · INetFwRule_Vtbl · ×1
  • INetFwRule_Vtbl::new (cognitive 18) crates/libs/windows/src/Windows/Win32/netfw/mod.rs:3433 — INetFwRule_Vtbl::new has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 18. None of this is in the body itself: all 18 points belong to 18 function items inside it that branch (Name, Description, ApplicationName, …). 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 · ISpeechRecognizer_Vtbl · ×1
  • ISpeechRecognizer_Vtbl::new (cognitive 18) crates/libs/windows/src/Windows/Win32/sapi/mod.rs:13655 — ISpeechRecognizer_Vtbl::new has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 18. None of this is in the body itself: all 18 points belong to 18 function items inside it that branch (Recognizer, AllowAudioInputFormatChangesOnNextSet, AudioInput, …). 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 · IStorageFolderQueryOperations_Vtbl · ×1
  • IStorageFolderQueryOperations_Vtbl::new (cognitive 17) crates/libs/windows/src/Windows/Storage/Search/mod.rs:690 — IStorageFolderQueryOperations_Vtbl::new has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 17. None of this is in the body itself: all 17 points belong to 17 function items inside it that branch (GetIndexedStateAsync, CreateFileQueryOverloadDefault, CreateFileQuery, …). 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 · IX509CertificateRevocationList_Vtbl · ×1
  • IX509CertificateRevocationList_Vtbl::new (cognitive 17) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:10818 — IX509CertificateRevocationList_Vtbl::new has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 17. None of this is in the body itself: all 17 points belong to 17 function items inside it that branch (Issuer, ThisUpdate, NextUpdate, …). 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 · IADsComputer_Vtbl · ×1
  • IADsComputer_Vtbl::new (cognitive 17) crates/libs/windows/src/Windows/Win32/iads/mod.rs:3224 — IADsComputer_Vtbl::new has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 17. None of this is in the body itself: all 17 points belong to 17 function items inside it that branch (ComputerID, Site, Description, …). 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 · ISchemaType_Vtbl · ×1
  • ISchemaType_Vtbl::new (cognitive 17) crates/libs/windows/src/Windows/Win32/msxml/mod.rs:5171 — ISchemaType_Vtbl::new has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 17. None of this is in the body itself: all 17 points belong to 17 function items inside it that branch (baseTypes, r#final, variety, …). 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 · ISWbemObject_Vtbl · ×1
  • ISWbemObject_Vtbl::new (cognitive 17) crates/libs/windows/src/Windows/Win32/wbemdisp/mod.rs:1880 — ISWbemObject_Vtbl::new has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 17. None of this is in the body itself: all 17 points belong to 17 function items inside it that branch (Put_, Instances_, Subclasses_, …). 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 · tool_features · ×1
  • tool_features::load (cognitive 17) crates/tools/features/src/main.rs:62 — tool_features::load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), match/switch 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.
D2 · Cognitive Complexity · Struct · ×1
  • Struct::write (cognitive 16) crates/libs/bindgen/src/types/struct.rs:17 — Struct::write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · IX509CertificateRequestCmc_Vtbl · ×1
  • IX509CertificateRequestCmc_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:8651 — IX509CertificateRequestCmc_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (TemplateObjectId, NullSigned, CryptAttributes, …). 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 · IDWriteFactory_Vtbl · ×1
  • IDWriteFactory_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/dwrite/mod.rs:2207 — IDWriteFactory_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (CreateCustomFontCollection, CreateFontFileReference, CreateCustomFontFileReference, …). 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 · IADsClass_Vtbl · ×1
  • IADsClass_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/iads/mod.rs:2499 — IADsClass_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (PrimaryInterface, CLSID, OID, …). 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 · IDiscFormat2TrackAtOnce_Vtbl · ×1
  • IDiscFormat2TrackAtOnce_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/imapi2/mod.rs:2940 — IDiscFormat2TrackAtOnce_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (Recorder, BufferUnderrunFreeDisabled, NumberOfExistingTracks, …). 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 · IAccessible_Vtbl · ×1
  • IAccessible_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/oleacc/mod.rs:757 — IAccessible_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (accParent, accChildCount, accChild, …). 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 · ISpeechPhraseInfo_Vtbl · ×1
  • ISpeechPhraseInfo_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/sapi/mod.rs:10483 — ISpeechPhraseInfo_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (LanguageId, GrammarId, StartTime, …). 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 · IWMPCore_Vtbl · ×1
  • IWMPCore_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/wmp/mod.rs:1699 — IWMPCore_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (URL, openState, playState, …). 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 shape REPEATS in the file: one other method here (IWMPMedia_Vtbl::new) 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 · IWMPMedia_Vtbl · ×1
  • IWMPMedia_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/wmp/mod.rs:4487 — IWMPMedia_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (isIdentical, sourceURL, name, …). 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 shape REPEATS in the file: one other method here (IWMPCore_Vtbl::new) 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 · IXpsOMPath_Vtbl · ×1
  • IXpsOMPath_Vtbl::new (cognitive 16) crates/libs/windows/src/Windows/Win32/xps/mod.rs:8495 — IXpsOMPath_Vtbl::new has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16. None of this is in the body itself: all 16 points belong to 16 function items inside it that branch (GetGeometry, GetGeometryLocal, GetSnapsToPixels, …). 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 · tool_yml · ×1
  • tool_yml::msrv::yml (cognitive 16) crates/tools/yml/src/msrv.rs:3 — tool_yml::msrv::yml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D5 · Coupling · Unstable project windows-composition · ×1
  • Unstable project windows-composition — windows-composition has instability 0.83 with 1 dependents.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
SC1 · Supply-chain hygiene · NuGet dependencies are not locked · ×1
  • NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
Minor — 118 finding(s)
P10 · Library API & versioning · Implementation type on the public API · ×7
  • Implementation type on the public API crates/libs/clang-sys/src/bindings.rs:584 — 5 public types in `windows_clang_sys.bindings` are marked as implementation by their own namespace, folder or name: `CXCursorSetImpl` (crates/libs/clang-sys/src/bindings.rs:584, name ends in `Impl`), `CXModuleMapDescriptorImpl` (crates/libs/clang-sys/src/bindings.rs:1213, name ends in `Impl`), `CXTargetInfoImpl` (crates/libs/clang-sys/src/bindings.rs:1389, name ends in `Impl`), `CXTranslationUnitImpl` (crates/libs/clang-sys/src/bindings.rs:1421, name ends in `Impl`), `CXVirtualFileOverlayImpl` (crates/libs/clang-sys/src/bindings.rs:1627, name ends in `Impl`). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers.
  • Implementation type on the public API crates/libs/collections/src/bindings.rs:39 — 11 public types in `windows_collections.bindings` are marked as implementation by their own namespace, folder or name: `IIterable_Impl` (crates/libs/collections/src/bindings.rs:39, name ends in `Impl`), `IIterator_Impl` (crates/libs/collections/src/bindings.rs:163, name ends in `Impl`), `IKeyValuePair_Impl` (crates/libs/collections/src/bindings.rs:359, name ends in `Impl`), `IMap_Impl` (crates/libs/collections/src/bindings.rs:577, name ends in `Impl`), `IMapChangedEventArgs_Impl` (crates/libs/collections/src/bindings.rs:838, name ends in `Impl`), `IMapView_Impl` (crates/libs/collections/src/bindings.rs:1025, name ends in `Impl`), `IObservableMap_Impl` (crates/libs/collections/src/bindings.rs:1345, name ends in `Impl`), `IObservableVector_Impl` (crates/libs/collections/src/bindings.rs:1650, name ends in `Impl`), and 3 more. While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers.
  • Implementation type on the public API crates/libs/core/src/as_impl.rs:4 — 1 public type in `windows_core.as_impl` is marked as implementation by its own namespace, folder or name: `AsImpl` (crates/libs/core/src/as_impl.rs:4, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers.
  • Implementation type on the public API crates/libs/core/src/unknown.rs:67 — 1 public type in `windows_core.unknown` is marked as implementation by its own namespace, folder or name: `IUnknownImpl` (crates/libs/core/src/unknown.rs:67, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers.
  • Implementation type on the public API crates/libs/future/src/bindings.rs:849 — 5 public types in `windows_future.bindings` are marked as implementation by their own namespace, folder or name: `IAsyncAction_Impl` (crates/libs/future/src/bindings.rs:849, name ends in `Impl`), `IAsyncActionWithProgress_Impl` (crates/libs/future/src/bindings.rs:1046, name ends in `Impl`), `IAsyncInfo_Impl` (crates/libs/future/src/bindings.rs:1254, name ends in `Impl`), `IAsyncOperation_Impl` (crates/libs/future/src/bindings.rs:1462, name ends in `Impl`), `IAsyncOperationWithProgress_Impl` (crates/libs/future/src/bindings.rs:1703, name ends in `Impl`). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers.
  • Implementation type on the public API crates/libs/metadata/src/reader/tables/mod.rs:56 — 1 public type in `windows_metadata.reader.tables` is marked as implementation by its own namespace, folder or name: `InterfaceImpl` (crates/libs/metadata/src/reader/tables/mod.rs:56, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers.
  • Implementation type on the public API crates/libs/metadata/src/writer/id.rs:17 — 1 public type in `windows_metadata.writer.id` is marked as implementation by its own namespace, folder or name: `InterfaceImpl` (crates/libs/metadata/src/writer/id.rs:17, name ends in `Impl`). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers.
X10 · Duplicated predicate · Duplicated predicate · ×7
  • Duplicated predicate crates/libs/rdl/src/reader/attribute_ref.rs:342 — `attr.name() == "FlagsAttribute" && attr.ctor().parent().namespace() == "System"` appears character-identically in 3 files — crates/libs/rdl/src/reader/attribute_ref.rs, crates/libs/rdl/src/writer/enum.rs, crates/libs/rdl/src/writer/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/libs/rdl/src/reader/attribute_ref.rs:739 — `attr.path().is_ident("null_terminated") || attr.path().is_ident("null_null_terminated")` appears character-identically in 2 files — crates/libs/rdl/src/reader/attribute_ref.rs, crates/libs/rdl/src/reader/param.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/libs/bindgen/src/param.rs:100 — `attribute.namespace() == "Windows.Win32.Metadata" && attribute.name() == "BufferAttribute"` appears character-identically in 2 files — crates/libs/bindgen/src/param.rs, crates/libs/metadata/src/reader/tables/method_param.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/libs/metadata/src/merge/mod.rs:342 — `def.category() == reader::TypeCategory::Class && def.flags().contains(TypeAttributes::WindowsRuntime)` appears character-identically in 2 files — crates/libs/metadata/src/merge/mod.rs, crates/libs/metadata/src/merge/remap.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/libs/rdl/src/reader/attribute_ref.rs:120 — `flags.contains(metadata::FieldAttributes::Public) && !flags.contains(metadata::FieldAttributes::Static) && !flags.contains(metadata::FieldAt…` appears character-identically in 2 files — crates/libs/rdl/src/reader/attribute_ref.rs, crates/libs/rdl/src/writer/attribute.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/libs/clang/src/runtime/mod.rs:312 — `input.macros.is_empty() && input.macro_headers.is_empty()` appears character-identically in 2 files — crates/libs/clang/src/runtime/mod.rs, crates/tools/win32/src/main.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/libs/strings/src/literals.rs:113 — `result <= 0x7ff || (0xd800 <= result && result <= 0xdfff)` appears character-identically in 2 files — crates/libs/strings/src/literals.rs, crates/libs/sys/src/core/literals.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.
D21 · Naming Consistency · `GetMonitorRECT` spells `RECT` where 445 names in the project spell it `Rect` · ×3
  • `GetMonitorRECT` spells `RECT` where 445 names in the project spell it `Rect` crates/libs/windows/src/Windows/Win32/shobjidl_core/mod.rs:4348 — 445 of 448 names in project windows spell the token `Rect` (445 of 448; unit: names in project windows containing `Rect`). Peers: IShareUIOptions_Vtbl.SelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:1865); IShareUIOptions_Vtbl.SetSelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:1866); ShareUIOptions.SelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:2299); ShareUIOptions.SetSelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:2305); IPdfPageRenderOptions_Vtbl.SourceRect (crates/libs/windows/src/Windows/Data/Pdf/mod.rs:68). Rename to `GetMonitorRect`. [rule N6]
  • `GetMonitorRECT` spells `RECT` where 445 names in the project spell it `Rect` crates/libs/windows/src/Windows/Win32/shobjidl_core/mod.rs:4350 — 445 of 448 names in project windows spell the token `Rect` (445 of 448; unit: names in project windows containing `Rect`). Peers: IShareUIOptions_Vtbl.SelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:1865); IShareUIOptions_Vtbl.SetSelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:1866); ShareUIOptions.SelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:2299); ShareUIOptions.SetSelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:2305); IPdfPageRenderOptions_Vtbl.SourceRect (crates/libs/windows/src/Windows/Data/Pdf/mod.rs:68). Rename to `GetMonitorRect`. [rule N6]
  • `GetMonitorRECT` spells `RECT` where 445 names in the project spell it `Rect` crates/libs/windows/src/Windows/Win32/shobjidl_core/mod.rs:4382 — 445 of 448 names in project windows spell the token `Rect` (445 of 448; unit: names in project windows containing `Rect`). Peers: IShareUIOptions_Vtbl.SelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:1865); IShareUIOptions_Vtbl.SetSelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:1866); ShareUIOptions.SelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:2299); ShareUIOptions.SetSelectionRect (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/mod.rs:2305); IPdfPageRenderOptions_Vtbl.SourceRect (crates/libs/windows/src/Windows/Data/Pdf/mod.rs:68). Rename to `GetMonitorRect`. [rule N6]
D21 · Naming Consistency · `dwEmbeddedEAPTypeId` spells `EAP` where 26 names in the project spell it `Eap` · ×2
  • `dwEmbeddedEAPTypeId` spells `EAP` where 26 names in the project spell it `Eap` crates/libs/sys/src/Windows/Win32/mprapi/mod.rs:301 — 26 of 28 names in project windows_sys spell the token `Eap` (26 of 28; unit: names in project windows_sys containing `Eap`). Peers: EAPHOST_IDENTITY_UI_PARAMS.pEapError (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:16); EAPHOST_INTERACTIVE_UI_PARAMS.pEapError (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:27); EAP_METHOD_INFO_ARRAY.pEapMethods (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:146); EAP_METHOD_INFO_ARRAY_EX.pEapMethods (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:153); IKEV2_PROJECTION_INFO.dwEapTypeId (crates/libs/sys/src/Windows/Win32/mprapi/mod.rs:274). Rename to `dwEmbeddedEapTypeId`. [rule N6]
  • `dwEmbeddedEAPTypeId` spells `EAP` where 26 names in the project spell it `Eap` crates/libs/sys/src/Windows/Win32/mprapi/mod.rs:1286 — 26 of 28 names in project windows_sys spell the token `Eap` (26 of 28; unit: names in project windows_sys containing `Eap`). Peers: EAPHOST_IDENTITY_UI_PARAMS.pEapError (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:16); EAPHOST_INTERACTIVE_UI_PARAMS.pEapError (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:27); EAP_METHOD_INFO_ARRAY.pEapMethods (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:146); EAP_METHOD_INFO_ARRAY_EX.pEapMethods (crates/libs/sys/src/Windows/Win32/eaptypes/mod.rs:153); IKEV2_PROJECTION_INFO.dwEapTypeId (crates/libs/sys/src/Windows/Win32/mprapi/mod.rs:274). Rename to `dwEmbeddedEapTypeId`. [rule N6]
D21 · Naming Consistency · `GetClientSessionAndResourceUUIDFn` spells `UUID` where 26 names in the project spell it `Uuid` · ×2
  • `GetClientSessionAndResourceUUIDFn` spells `UUID` where 26 names in the project spell it `Uuid` crates/libs/sys/src/Windows/Win32/rpc/mod.rs:790 — 26 of 28 names in project windows_sys spell the token `Uuid` (26 of 28; unit: names in project windows_sys containing `Uuid`). Peers: AUTHZ_RPC_INIT_INFO_CLIENT.ObjectUuid (crates/libs/sys/src/Windows/Win32/authz/mod.rs:154); BDA_DRM_DRMSTATUS.ulDrmUuidListStringSize (crates/libs/sys/src/Windows/Win32/bdatypes/mod.rs:156); BDA_DRM_DRMSTATUS.argbDrmUuidListString (crates/libs/sys/src/Windows/Win32/bdatypes/mod.rs:157); BTH_LE_GATT_CHARACTERISTIC.CharacteristicUuid (crates/libs/sys/src/Windows/Win32/bthledef/mod.rs:172); BTH_LE_GATT_DESCRIPTOR.DescriptorUuid (crates/libs/sys/src/Windows/Win32/bthledef/mod.rs:223). Rename to `GetClientSessionAndResourceUuidFn`. [rule N6]
  • `GetClientSessionAndResourceUUIDFn` spells `UUID` where 26 names in the project spell it `Uuid` crates/libs/sys/src/Windows/Win32/rpc/mod.rs:804 — 26 of 28 names in project windows_sys spell the token `Uuid` (26 of 28; unit: names in project windows_sys containing `Uuid`). Peers: AUTHZ_RPC_INIT_INFO_CLIENT.ObjectUuid (crates/libs/sys/src/Windows/Win32/authz/mod.rs:154); BDA_DRM_DRMSTATUS.ulDrmUuidListStringSize (crates/libs/sys/src/Windows/Win32/bdatypes/mod.rs:156); BDA_DRM_DRMSTATUS.argbDrmUuidListString (crates/libs/sys/src/Windows/Win32/bdatypes/mod.rs:157); BTH_LE_GATT_CHARACTERISTIC.CharacteristicUuid (crates/libs/sys/src/Windows/Win32/bthledef/mod.rs:172); BTH_LE_GATT_DESCRIPTOR.DescriptorUuid (crates/libs/sys/src/Windows/Win32/bthledef/mod.rs:223). Rename to `GetClientSessionAndResourceUuidFn`. [rule N6]
D21 · Naming Consistency · `InternalHcErrorCount` spells `Hc` where 28 names in the project spell it `HC` · ×2
  • `InternalHcErrorCount` spells `Hc` where 28 names in the project spell it `HC` crates/libs/sys/src/Windows/Win32/usbioctl/mod.rs:57 — 28 of 29 names in project windows_sys spell the token `HC` (28 of 29; unit: names in project windows_sys containing `HC`). Peers: NDIS_INTERFACE_INFORMATION.ifHCInOctets (crates/libs/sys/src/Windows/Win32/ifdef/mod.rs:73); NDIS_INTERFACE_INFORMATION.ifHCInUcastPkts (crates/libs/sys/src/Windows/Win32/ifdef/mod.rs:74); NDIS_INTERFACE_INFORMATION.ifHCInMulticastPkts (crates/libs/sys/src/Windows/Win32/ifdef/mod.rs:75); NDIS_INTERFACE_INFORMATION.ifHCInBroadcastPkts (crates/libs/sys/src/Windows/Win32/ifdef/mod.rs:76); NDIS_INTERFACE_INFORMATION.ifHCOutOctets (crates/libs/sys/src/Windows/Win32/ifdef/mod.rs:77). Rename to `InternalHCErrorCount`. [rule N6]
  • `InternalHcErrorCount` spells `Hc` where 28 names in the project spell it `HC` crates/libs/windows/src/Windows/Win32/usbioctl/mod.rs:57 — 28 of 29 names in project windows spell the token `HC` (28 of 29; unit: names in project windows containing `HC`). Peers: NDIS_INTERFACE_INFORMATION.ifHCInOctets (crates/libs/windows/src/Windows/Win32/ifdef/mod.rs:73); NDIS_INTERFACE_INFORMATION.ifHCInUcastPkts (crates/libs/windows/src/Windows/Win32/ifdef/mod.rs:74); NDIS_INTERFACE_INFORMATION.ifHCInMulticastPkts (crates/libs/windows/src/Windows/Win32/ifdef/mod.rs:75); NDIS_INTERFACE_INFORMATION.ifHCInBroadcastPkts (crates/libs/windows/src/Windows/Win32/ifdef/mod.rs:76); NDIS_INTERFACE_INFORMATION.ifHCOutOctets (crates/libs/windows/src/Windows/Win32/ifdef/mod.rs:77). Rename to `InternalHCErrorCount`. [rule N6]
D21 · Naming Consistency · `ShouldEnableManagingUi` spells `Ui` where 469 names in the project spell it `UI` · ×2
  • `ShouldEnableManagingUi` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:458 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `ShouldEnableManagingUI`. [rule N6]
  • `ShouldEnableManagingUi` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1236 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `ShouldEnableManagingUI`. [rule N6]
D21 · Naming Consistency · `IsESimUiEnabled` spells `Ui` where 469 names in the project spell it `UI` · ×2
  • `IsESimUiEnabled` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:801 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `IsESimUIEnabled`. [rule N6]
  • `IsESimUiEnabled` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1302 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `IsESimUIEnabled`. [rule N6]
D21 · Naming Consistency · `BaseStationPNCode` spells `PN` where 99 names in the project spell it `Pn` · ×2
  • `BaseStationPNCode` spells `PN` where 99 names in the project spell it `Pn` crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1516 — 99 of 101 names in project windows spell the token `Pn` (99 of 101; unit: names in project windows containing `Pn`). Peers: D3DKMDT_SHAREDPRIMARYSURFACEDATA.VidPnSourceId (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:384); D3DKMDT_VIDPN_PRESENT_PATH.VidPnSourceId (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:537); D3DKMDT_VIDPN_PRESENT_PATH.VidPnTargetId (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:538); D3DKMDT_VIDPN_PRESENT_PATH.VidPnTargetColorBasis (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:543); D3DKMDT_VIDPN_PRESENT_PATH.VidPnTargetColorCoeffDynamicRanges (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:544). Rename to `BaseStationPnCode`. [rule N6]
  • `BaseStationPNCode` spells `PN` where 99 names in the project spell it `Pn` crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:2808 — 99 of 101 names in project windows spell the token `Pn` (99 of 101; unit: names in project windows containing `Pn`). Peers: D3DKMDT_SHAREDPRIMARYSURFACEDATA.VidPnSourceId (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:384); D3DKMDT_VIDPN_PRESENT_PATH.VidPnSourceId (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:537); D3DKMDT_VIDPN_PRESENT_PATH.VidPnTargetId (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:538); D3DKMDT_VIDPN_PRESENT_PATH.VidPnTargetColorBasis (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:543); D3DKMDT_VIDPN_PRESENT_PATH.VidPnTargetColorCoeffDynamicRanges (crates/libs/windows/src/Windows/Win32/d3dkmdt/mod.rs:544). Rename to `BaseStationPnCode`. [rule N6]
D21 · Naming Consistency · `dwEmbeddedEAPTypeId` spells `EAP` where 39 names in the project spell it `Eap` · ×2
  • `dwEmbeddedEAPTypeId` spells `EAP` where 39 names in the project spell it `Eap` crates/libs/windows/src/Windows/Win32/mprapi/mod.rs:830 — 39 of 41 names in project windows spell the token `Eap` (39 of 41; unit: names in project windows containing `Eap`). Peers: IVpnNativeProfile_Vtbl.SetEapConfiguration (crates/libs/windows/src/Windows/Networking/Vpn/mod.rs:935); VpnNativeProfile.SetEapConfiguration (crates/libs/windows/src/Windows/Networking/Vpn/mod.rs:3620); EAPHOST_IDENTITY_UI_PARAMS.pEapError (crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:16); EAPHOST_INTERACTIVE_UI_PARAMS.pEapError (crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:27); EAP_METHOD_INFO_ARRAY.pEapMethods (crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:146). Rename to `dwEmbeddedEapTypeId`. [rule N6]
  • `dwEmbeddedEAPTypeId` spells `EAP` where 39 names in the project spell it `Eap` crates/libs/windows/src/Windows/Win32/mprapi/mod.rs:1815 — 39 of 41 names in project windows spell the token `Eap` (39 of 41; unit: names in project windows containing `Eap`). Peers: IVpnNativeProfile_Vtbl.SetEapConfiguration (crates/libs/windows/src/Windows/Networking/Vpn/mod.rs:935); VpnNativeProfile.SetEapConfiguration (crates/libs/windows/src/Windows/Networking/Vpn/mod.rs:3620); EAPHOST_IDENTITY_UI_PARAMS.pEapError (crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:16); EAPHOST_INTERACTIVE_UI_PARAMS.pEapError (crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:27); EAP_METHOD_INFO_ARRAY.pEapMethods (crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:146). Rename to `dwEmbeddedEapTypeId`. [rule N6]
D21 · Naming Consistency · `GetClientSessionAndResourceUUIDFn` spells `UUID` where 60 names in the project spell it `Uuid` · ×2
  • `GetClientSessionAndResourceUUIDFn` spells `UUID` where 60 names in the project spell it `Uuid` crates/libs/windows/src/Windows/Win32/rpc/mod.rs:2667 — 60 of 62 names in project windows spell the token `Uuid` (60 of 62; unit: names in project windows containing `Uuid`). Peers: GattCharacteristic.GetDescriptorsForUuidAsync (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:137); GattCharacteristic.GetDescriptorsForUuidWithCacheModeAsync (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:144); GattCharacteristic.ConvertShortIdToUuid (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:180); GattDescriptor.ConvertShortIdToUuid (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:931); GattDeviceService.GetCharacteristicsForUuidAsync (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:1157). Rename to `GetClientSessionAndResourceUuidFn`. [rule N6]
  • `GetClientSessionAndResourceUUIDFn` spells `UUID` where 60 names in the project spell it `Uuid` crates/libs/windows/src/Windows/Win32/rpc/mod.rs:2681 — 60 of 62 names in project windows spell the token `Uuid` (60 of 62; unit: names in project windows containing `Uuid`). Peers: GattCharacteristic.GetDescriptorsForUuidAsync (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:137); GattCharacteristic.GetDescriptorsForUuidWithCacheModeAsync (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:144); GattCharacteristic.ConvertShortIdToUuid (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:180); GattDescriptor.ConvertShortIdToUuid (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:931); GattDeviceService.GetCharacteristicsForUuidAsync (crates/libs/windows/src/Windows/Devices/Bluetooth/GenericAttributeProfile/mod.rs:1157). Rename to `GetClientSessionAndResourceUuidFn`. [rule N6]
D21 · Naming Consistency · `UndoMinimizeALL` spells `ALL` where 663 names in the project spell it `All` · ×2
  • `UndoMinimizeALL` spells `ALL` where 663 names in the project spell it `All` crates/libs/windows/src/Windows/Win32/shldisp/mod.rs:2360 — 663 of 665 names in project windows spell the token `All` (663 of 665; unit: names in project windows containing `All`). Peers: ActionCatalog.GetAllActions (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:7); IActionCatalog_Vtbl.GetAllActions (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:365); ArrayActionEntity.GetAll (crates/libs/windows/src/Windows/AI/Actions/mod.rs:750); IArrayActionEntity_Vtbl.GetAll (crates/libs/windows/src/Windows/AI/Actions/mod.rs:1324); AppExtensionCatalog.FindAllAsync (crates/libs/windows/src/Windows/ApplicationModel/AppExtensions/mod.rs:99). Rename to `UndoMinimizeAll`. [rule N6]
  • `UndoMinimizeALL` spells `ALL` where 663 names in the project spell it `All` crates/libs/windows/src/Windows/Win32/shldisp/mod.rs:2386 — 663 of 665 names in project windows spell the token `All` (663 of 665; unit: names in project windows containing `All`). Peers: ActionCatalog.GetAllActions (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:7); IActionCatalog_Vtbl.GetAllActions (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:365); ArrayActionEntity.GetAll (crates/libs/windows/src/Windows/AI/Actions/mod.rs:750); IArrayActionEntity_Vtbl.GetAll (crates/libs/windows/src/Windows/AI/Actions/mod.rs:1324); AppExtensionCatalog.FindAllAsync (crates/libs/windows/src/Windows/ApplicationModel/AppExtensions/mod.rs:99). Rename to `UndoMinimizeAll`. [rule N6]
D21 · Naming Consistency · `OnFocusChangeIS` spells `IS` where 881 names in the project spell it `Is` · ×2
  • `OnFocusChangeIS` spells `IS` where 881 names in the project spell it `Is` crates/libs/windows/src/Windows/Win32/shobjidl_core/mod.rs:10446 — 881 of 883 names in project windows spell the token `Is` (881 of 883; unit: names in project windows containing `Is`). Peers: IMcpMessageFilterResponseExperimental_Impl.SetIsAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:148); IMcpMessageFilterResponseExperimental_Vtbl.SetIsAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:214); Appointment.SetIsResponseRequested (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:180); Appointment.SetIsCanceledMeeting (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:243); Appointment.SetIsOrganizedByUser (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:254). Rename to `OnFocusChangeIs`. [rule N6]
  • `OnFocusChangeIS` spells `IS` where 881 names in the project spell it `Is` crates/libs/windows/src/Windows/Win32/shobjidl_core/mod.rs:10449 — 881 of 883 names in project windows spell the token `Is` (881 of 883; unit: names in project windows containing `Is`). Peers: IMcpMessageFilterResponseExperimental_Impl.SetIsAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:148); IMcpMessageFilterResponseExperimental_Vtbl.SetIsAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:214); Appointment.SetIsResponseRequested (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:180); Appointment.SetIsCanceledMeeting (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:243); Appointment.SetIsOrganizedByUser (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:254). Rename to `OnFocusChangeIs`. [rule N6]
D21 · Naming Consistency · `AddDifferencedFilesByLastModifyLSN` spells `LSN` where 25 names in the project spell it `Lsn` · ×2
  • `AddDifferencedFilesByLastModifyLSN` spells `LSN` where 25 names in the project spell it `Lsn` crates/libs/windows/src/Windows/Win32/vswriter/mod.rs:252 — 25 of 27 names in project windows spell the token `Lsn` (25 of 27; unit: names in project windows containing `Lsn`). Peers: clfs$module.ClfsLsnBlockOffset (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:3); clfs$module.ClfsLsnContainer (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:9); clfs$module.ClfsLsnCreate (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:15); clfs$module.ClfsLsnEqual (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:21); clfs$module.ClfsLsnGreater (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:27). Rename to `AddDifferencedFilesByLastModifyLsn`. [rule N6]
  • `AddDifferencedFilesByLastModifyLSN` spells `LSN` where 25 names in the project spell it `Lsn` crates/libs/windows/src/Windows/Win32/vswriter/mod.rs:299 — 25 of 27 names in project windows spell the token `Lsn` (25 of 27; unit: names in project windows containing `Lsn`). Peers: clfs$module.ClfsLsnBlockOffset (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:3); clfs$module.ClfsLsnContainer (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:9); clfs$module.ClfsLsnCreate (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:15); clfs$module.ClfsLsnEqual (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:21); clfs$module.ClfsLsnGreater (crates/libs/windows/src/Windows/Win32/clfs/mod.rs:27). Rename to `AddDifferencedFilesByLastModifyLsn`. [rule N6]
D21 · Naming Consistency · `GetEnableHTTP` spells `HTTP` where 163 names in the project spell it `Http` · ×2
  • `GetEnableHTTP` spells `HTTP` where 163 names in the project spell it `Http` crates/libs/windows/src/Windows/Win32/wmsdkidl/mod.rs:5919 — 163 of 167 names in project windows spell the token `Http` (163 of 167; unit: names in project windows containing `Http`). Peers: ConnectivityManager.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:595); ConnectivityManager.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:601); IConnectivityManagerStatics_Vtbl.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:955); IConnectivityManagerStatics_Vtbl.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:956); ISysStorageProviderHandlerFactory_Impl.GetHttpRequestProvider (crates/libs/windows/src/Windows/System/Implementation/FileExplorer/mod.rs:100). Rename to `GetEnableHttp`. [rule N6]
  • `GetEnableHTTP` spells `HTTP` where 163 names in the project spell it `Http` crates/libs/windows/src/Windows/Win32/wmsdkidl/mod.rs:5973 — 163 of 167 names in project windows spell the token `Http` (163 of 167; unit: names in project windows containing `Http`). Peers: ConnectivityManager.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:595); ConnectivityManager.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:601); IConnectivityManagerStatics_Vtbl.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:955); IConnectivityManagerStatics_Vtbl.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:956); ISysStorageProviderHandlerFactory_Impl.GetHttpRequestProvider (crates/libs/windows/src/Windows/System/Implementation/FileExplorer/mod.rs:100). Rename to `GetEnableHttp`. [rule N6]
D21 · Naming Consistency · `SetEnableHTTP` spells `HTTP` where 163 names in the project spell it `Http` · ×2
  • `SetEnableHTTP` spells `HTTP` where 163 names in the project spell it `Http` crates/libs/windows/src/Windows/Win32/wmsdkidl/mod.rs:5920 — 163 of 167 names in project windows spell the token `Http` (163 of 167; unit: names in project windows containing `Http`). Peers: ConnectivityManager.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:595); ConnectivityManager.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:601); IConnectivityManagerStatics_Vtbl.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:955); IConnectivityManagerStatics_Vtbl.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:956); ISysStorageProviderHandlerFactory_Impl.GetHttpRequestProvider (crates/libs/windows/src/Windows/System/Implementation/FileExplorer/mod.rs:100). Rename to `SetEnableHttp`. [rule N6]
  • `SetEnableHTTP` spells `HTTP` where 163 names in the project spell it `Http` crates/libs/windows/src/Windows/Win32/wmsdkidl/mod.rs:5974 — 163 of 167 names in project windows spell the token `Http` (163 of 167; unit: names in project windows containing `Http`). Peers: ConnectivityManager.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:595); ConnectivityManager.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:601); IConnectivityManagerStatics_Vtbl.AddHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:955); IConnectivityManagerStatics_Vtbl.RemoveHttpRoutePolicy (crates/libs/windows/src/Windows/Networking/Connectivity/mod.rs:956); ISysStorageProviderHandlerFactory_Impl.GetHttpRequestProvider (crates/libs/windows/src/Windows/System/Implementation/FileExplorer/mod.rs:100). Rename to `SetEnableHttp`. [rule N6]
D21 · Naming Consistency · `SessionFlagEnableSPNServerPort` spells `SPN` where 35 names in the project spell it `Spn` · ×2
  • `SessionFlagEnableSPNServerPort` spells `SPN` where 35 names in the project spell it `Spn` crates/libs/windows/src/Windows/Win32/wsmandisp/mod.rs:770 — 35 of 37 names in project windows spell the token `Spn` (35 of 37; unit: names in project windows containing `Spn`). Peers: IKnownCSimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1390); IKnownRuimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1399); IKnownSimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1409); IKnownUSimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1418); IMobileBroadbandDeviceInformation3_Vtbl.SimSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1662). Rename to `SessionFlagEnableSpnServerPort`. [rule N6]
  • `SessionFlagEnableSPNServerPort` spells `SPN` where 35 names in the project spell it `Spn` crates/libs/windows/src/Windows/Win32/wsmandisp/mod.rs:796 — 35 of 37 names in project windows spell the token `Spn` (35 of 37; unit: names in project windows containing `Spn`). Peers: IKnownCSimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1390); IKnownRuimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1399); IKnownSimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1409); IKnownUSimFilePathsStatics_Vtbl.EFSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1418); IMobileBroadbandDeviceInformation3_Vtbl.SimSpn (crates/libs/windows/src/Windows/Networking/NetworkOperators/mod.rs:1662). Rename to `SessionFlagEnableSpnServerPort`. [rule N6]
D21 · Naming Consistency · `GetUiLayer` spells `Ui` where 469 names in the project spell it `UI` · ×2
  • `GetUiLayer` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Win32/xamlom/mod.rs:640 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `GetUILayer`. [rule N6]
  • `GetUiLayer` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Win32/xamlom/mod.rs:654 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `GetUILayer`. [rule N6]
D21 · Naming Consistency · `dwEccCurveNames` spells `Ecc` where 38 names in the project spell it `ECC` · ×1
  • `dwEccCurveNames` spells `Ecc` where 38 names in the project spell it `ECC` crates/libs/sys/src/Windows/Win32/bcrypt/mod.rs:370 — 38 of 40 names in project windows_sys spell the token `ECC` (38 of 40; unit: names in project windows_sys containing `ECC`). Peers: JET_DBINFOMISC2.ulECCFixSuccess (crates/libs/sys/src/Windows/Win32/esent/mod.rs:896); JET_DBINFOMISC2.logtimeECCFixSuccess (crates/libs/sys/src/Windows/Win32/esent/mod.rs:897); JET_DBINFOMISC2.ulECCFixSuccessOld (crates/libs/sys/src/Windows/Win32/esent/mod.rs:898); JET_DBINFOMISC2.ulECCFixFail (crates/libs/sys/src/Windows/Win32/esent/mod.rs:899); JET_DBINFOMISC2.logtimeECCFixFail (crates/libs/sys/src/Windows/Win32/esent/mod.rs:900). Rename to `dwECCCurveNames`. [rule N6]
D21 · Naming Consistency · `pEccCurveNames` spells `Ecc` where 38 names in the project spell it `ECC` · ×1
  • `pEccCurveNames` spells `Ecc` where 38 names in the project spell it `ECC` crates/libs/sys/src/Windows/Win32/bcrypt/mod.rs:371 — 38 of 40 names in project windows_sys spell the token `ECC` (38 of 40; unit: names in project windows_sys containing `ECC`). Peers: JET_DBINFOMISC2.ulECCFixSuccess (crates/libs/sys/src/Windows/Win32/esent/mod.rs:896); JET_DBINFOMISC2.logtimeECCFixSuccess (crates/libs/sys/src/Windows/Win32/esent/mod.rs:897); JET_DBINFOMISC2.ulECCFixSuccessOld (crates/libs/sys/src/Windows/Win32/esent/mod.rs:898); JET_DBINFOMISC2.ulECCFixFail (crates/libs/sys/src/Windows/Win32/esent/mod.rs:899); JET_DBINFOMISC2.logtimeECCFixFail (crates/libs/sys/src/Windows/Win32/esent/mod.rs:900). Rename to `pECCCurveNames`. [rule N6]
D21 · Naming Consistency · `pHDRMetaData` spells `HDR` where 12 names in the project spell it `Hdr` · ×1
  • `pHDRMetaData` spells `HDR` where 12 names in the project spell it `Hdr` crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:4241 — 12 of 13 names in project windows_sys spell the token `Hdr` (12 of 13; unit: names in project windows_sys containing `Hdr`). Peers: MIB_IPMCAST_MFE_STATS_EX_XP.ulInHdrErrors (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:311); MIB_IPSTATS_LH.dwInHdrErrors (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:448); MIB_IPSTATS_W2K.dwInHdrErrors (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:495); QOS_SD_MODE.ObjectHdr (crates/libs/sys/src/Windows/Win32/qos/mod.rs:42); QOS_SHAPING_RATE.ObjectHdr (crates/libs/sys/src/Windows/Win32/qos/mod.rs:49). Rename to `pHdrMetaData`. [rule N6]
D21 · Naming Consistency · `vfLUID` spells `LUID` where 52 names in the project spell it `Luid` · ×1
  • `vfLUID` spells `LUID` where 52 names in the project spell it `Luid` crates/libs/sys/src/Windows/Win32/d3dukmdt/mod.rs:2532 — 52 of 53 names in project windows_sys spell the token `Luid` (52 of 53; unit: names in project windows_sys containing `Luid`). Peers: DXGKMDT_OPM_CREATE_VIDEO_OUTPUT_FOR_TARGET_PARAMETERS.AdapterLuid (crates/libs/sys/src/Windows/Win32/d3dkmdt/mod.rs:1198); D3DKMT_ADAPTERINFO.AdapterLuid (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:477); D3DKMT_CANCEL_PRESENTS.CompSurfaceLuid (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:760); D3DKMT_CHECK_MULTIPLANE_OVERLAY_PLANE.CompSurfaceLuid (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:918); D3DKMT_CHECK_MULTIPLANE_OVERLAY_PLANE2.CompSurfaceLuid (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:928). Rename to `vfLuid`. [rule N6]
D21 · Naming Consistency · `reauthProtoUDP` spells `UDP` where 21 names in the project spell it `Udp` · ×1
  • `reauthProtoUDP` spells `UDP` where 21 names in the project spell it `Udp` crates/libs/sys/src/Windows/Win32/fwpmtypes/mod.rs:1504 — 21 of 22 names in project windows_sys spell the token `Udp` (21 of 22; unit: names in project windows_sys containing `Udp`). Peers: INTERFACE_HARDWARE_TIMESTAMP_CAPABILITIES.PtpV2OverUdpIPv4EventMessageReceive (crates/libs/sys/src/Windows/Win32/iphlpapi/mod.rs:195); INTERFACE_HARDWARE_TIMESTAMP_CAPABILITIES.PtpV2OverUdpIPv4AllMessageReceive (crates/libs/sys/src/Windows/Win32/iphlpapi/mod.rs:196); INTERFACE_HARDWARE_TIMESTAMP_CAPABILITIES.PtpV2OverUdpIPv4EventMessageTransmit (crates/libs/sys/src/Windows/Win32/iphlpapi/mod.rs:197); INTERFACE_HARDWARE_TIMESTAMP_CAPABILITIES.PtpV2OverUdpIPv4AllMessageTransmit (crates/libs/sys/src/Windows/Win32/iphlpapi/mod.rs:198); INTERFACE_HARDWARE_TIMESTAMP_CAPABILITIES.PtpV2OverUdpIPv6EventMessageReceive (crates/libs/sys/src/Windows/Win32/iphlpapi/mod.rs:199). Rename to `reauthProtoUdp`. [rule N6]
D21 · Naming Consistency · `dwForwardNextHopAS` spells `AS` where 22 names in the project spell it `As` · ×1
  • `dwForwardNextHopAS` spells `AS` where 22 names in the project spell it `As` crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:146 — 22 of 23 names in project windows_sys spell the token `As` (22 of 23; unit: names in project windows_sys containing `As`). Peers: D3D11_FEATURE_DATA_D3D9_OPTIONS1.DepthAsTextureWithLessEqualComparisonFilterSupported (crates/libs/sys/src/Windows/Win32/d3d11/mod.rs:1136); D3D11_FEATURE_DATA_D3D9_SHADOW_SUPPORT.SupportsDepthAsTextureWithLessEqualComparisonFilter (crates/libs/sys/src/Windows/Win32/d3d11/mod.rs:1143); IPSEC_SA_BUNDLE0.numSAs (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:414); IPSEC_SA_BUNDLE1.numSAs (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:451); MIB_UNICASTIPADDRESS_ROW.SkipAsSource (crates/libs/sys/src/Windows/Win32/netioapi/mod.rs:840). Rename to `dwForwardNextHopAs`. [rule N6]
D21 · Naming Consistency · `ReservedNT` spells `NT` where 19 names in the project spell it `Nt` · ×1
  • `ReservedNT` spells `NT` where 19 names in the project spell it `Nt` crates/libs/sys/src/Windows/Win32/ksmedia/mod.rs:4751 — 19 of 20 names in project windows_sys spell the token `Nt` (19 of 20; unit: names in project windows_sys containing `Nt`). Peers: D3DKMT_GETSHAREDRESOURCEADAPTERLUID.hNtHandle (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:2662); D3DKMT_OPENKEYEDMUTEXFROMNTHANDLE.hNtHandle (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:3520); D3DKMT_OPENNATIVEFENCEFROMNTHANDLE.hNtHandle (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:3529); D3DKMT_OPENNTHANDLEFROMNAME.hNtHandle (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:3550); D3DKMT_OPENPROTECTEDSESSIONFROMNTHANDLE.hNtHandle (crates/libs/sys/src/Windows/Win32/d3dkmthk/mod.rs:3556). Rename to `ReservedNt`. [rule N6]
D21 · Naming Consistency · `wSARwidth` spells `SA` where 39 names in the project spell it `Sa` · ×1
  • `wSARwidth` spells `SA` where 39 names in the project spell it `Sa` crates/libs/sys/src/Windows/Win32/ksmedia/mod.rs:4850 — 39 of 41 names in project windows_sys spell the token `Sa` (39 of 41; unit: names in project windows_sys containing `Sa`). Peers: FWPM_NET_EVENT_IKEEXT_QM_FAILURE1.mmSaLuid (crates/libs/sys/src/Windows/Win32/fwpmtypes/mod.rs:1106); IPSEC_AGGREGATE_DROP_PACKET_STATISTICS0.receiveOverIncorrectSaInbound (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:21); IPSEC_AGGREGATE_DROP_PACKET_STATISTICS1.receiveOverIncorrectSaInbound (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:35); IPSEC_AGGREGATE_SA_STATISTICS0.pendingSaNegotiations (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:44); IPSEC_PROPOSAL0.numSaTransforms (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:355). Rename to `wSaRwidth`. [rule N6]
D21 · Naming Consistency · `wSARheight` spells `SA` where 39 names in the project spell it `Sa` · ×1
  • `wSARheight` spells `SA` where 39 names in the project spell it `Sa` crates/libs/sys/src/Windows/Win32/ksmedia/mod.rs:4851 — 39 of 41 names in project windows_sys spell the token `Sa` (39 of 41; unit: names in project windows_sys containing `Sa`). Peers: FWPM_NET_EVENT_IKEEXT_QM_FAILURE1.mmSaLuid (crates/libs/sys/src/Windows/Win32/fwpmtypes/mod.rs:1106); IPSEC_AGGREGATE_DROP_PACKET_STATISTICS0.receiveOverIncorrectSaInbound (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:21); IPSEC_AGGREGATE_DROP_PACKET_STATISTICS1.receiveOverIncorrectSaInbound (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:35); IPSEC_AGGREGATE_SA_STATISTICS0.pendingSaNegotiations (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:44); IPSEC_PROPOSAL0.numSaTransforms (crates/libs/sys/src/Windows/Win32/ipsectypes/mod.rs:355). Rename to `wSaRheight`. [rule N6]
D21 · Naming Consistency · `bmSVCCapabilities` spells `SVC` where 20 names in the project spell it `Svc` · ×1
  • `bmSVCCapabilities` spells `SVC` where 20 names in the project spell it `Svc` crates/libs/sys/src/Windows/Win32/ksmedia/mod.rs:4857 — 20 of 21 names in project windows_sys spell the token `Svc` (20 of 21; unit: names in project windows_sys containing `Svc`). Peers: CONVINFO.hszSvcPartner (crates/libs/sys/src/Windows/Win32/ddeml/mod.rs:94); HSZPAIR.hszSvc (crates/libs/sys/src/Windows/Win32/ddeml/mod.rs:192); MONCONVSTRUCT.hszSvc (crates/libs/sys/src/Windows/Win32/ddeml/mod.rs:247); MONLINKSTRUCT.hszSvc (crates/libs/sys/src/Windows/Win32/ddeml/mod.rs:306); SOLE_AUTHENTICATION_INFO.dwAuthnSvc (crates/libs/sys/src/Windows/Win32/objidlbase/mod.rs:208). Rename to `bmSvcCapabilities`. [rule N6]
D21 · Naming Consistency · `lpPrimaryDNSDomain` spells `DNS` where 31 names in the project spell it `Dns` · ×1
  • `lpPrimaryDNSDomain` spells `DNS` where 31 names in the project spell it `Dns` crates/libs/sys/src/Windows/Win32/lmjoin/mod.rs:101 — 31 of 33 names in project windows_sys spell the token `Dns` (31 of 33; unit: names in project windows_sys containing `Dns`). Peers: DSROLE_PRIMARY_DOMAIN_INFO_BASIC.DomainNameDns (crates/libs/sys/src/Windows/Win32/dsrole/mod.rs:20); FIXED_INFO_W2KSP1.CurrentDnsServer (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:11); FIXED_INFO_W2KSP1.EnableDns (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:17); IP_ADAPTER_ADDRESSES_LH.FirstDnsServerAddress (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:50); IP_ADAPTER_ADDRESSES_LH.FirstDnsSuffix (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:79). Rename to `lpPrimaryDnsDomain`. [rule N6]
D21 · Naming Consistency · `pabHMAC` spells `HMAC` where 14 names in the project spell it `Hmac` · ×1
  • `pabHMAC` spells `HMAC` where 14 names in the project spell it `Hmac` crates/libs/sys/src/Windows/Win32/ncrypt/mod.rs:363 — 14 of 15 names in project windows_sys spell the token `Hmac` (14 of 15; unit: names in project windows_sys containing `Hmac`). Peers: EXPERIMENTAL_WEBAUTHN_CTAPCBOR_GET_ASSERTION_REQUEST.pHmacSaltExtension (crates/libs/sys/src/Windows/Win32/webauthn/mod.rs:140); EXPERIMENTAL_WEBAUTHN_CTAPCBOR_GET_ASSERTION_REQUEST.cbHmacSecretSaltValues (crates/libs/sys/src/Windows/Win32/webauthn/mod.rs:141); EXPERIMENTAL_WEBAUTHN_CTAPCBOR_GET_ASSERTION_REQUEST.pbHmacSecretSaltValues (crates/libs/sys/src/Windows/Win32/webauthn/mod.rs:142); EXPERIMENTAL_WEBAUTHN_CTAPCBOR_MAKE_CREDENTIAL_REQUEST.lHmacSecretExt (crates/libs/sys/src/Windows/Win32/webauthn/mod.rs:200); EXPERIMENTAL_WEBAUTHN_CTAPCBOR_MAKE_CREDENTIAL_REQUEST.pHmacSecretMcExtension (crates/libs/sys/src/Windows/Win32/webauthn/mod.rs:201). Rename to `pabHmac`. [rule N6]
D21 · Naming Consistency · `uMinPHYRate` spells `PHY` where 40 names in the project spell it `Phy` · ×1
  • `uMinPHYRate` spells `PHY` where 40 names in the project spell it `Phy` crates/libs/sys/src/Windows/Win32/windot11/mod.rs:1947 — 40 of 42 names in project windows_sys spell the token `Phy` (40 of 42; unit: names in project windows_sys containing `Phy`). Peers: DOT11_ASSOCIATION_COMPLETION_PARAMETERS.uActivePhyListOffset (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:63); DOT11_ASSOCIATION_COMPLETION_PARAMETERS.uActivePhyListSize (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:64); DOT11_BSS_ENTRY.uPhyId (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:304); DOT11_CHANNEL_HINT.Dot11PhyType (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:390); DOT11_EXTSTA_RECV_CONTEXT.uPhyId (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:798). Rename to `uMinPhyRate`. [rule N6]
D21 · Naming Consistency · `dot11PHYType` spells `PHY` where 40 names in the project spell it `Phy` · ×1
  • `dot11PHYType` spells `PHY` where 40 names in the project spell it `Phy` crates/libs/sys/src/Windows/Win32/windot11/mod.rs:2860 — 40 of 42 names in project windows_sys spell the token `Phy` (40 of 42; unit: names in project windows_sys containing `Phy`). Peers: DOT11_ASSOCIATION_COMPLETION_PARAMETERS.uActivePhyListOffset (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:63); DOT11_ASSOCIATION_COMPLETION_PARAMETERS.uActivePhyListSize (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:64); DOT11_BSS_ENTRY.uPhyId (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:304); DOT11_CHANNEL_HINT.Dot11PhyType (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:390); DOT11_EXTSTA_RECV_CONTEXT.uPhyId (crates/libs/sys/src/Windows/Win32/windot11/mod.rs:798). Rename to `dot11PhyType`. [rule N6]
D21 · Naming Consistency · `KeyOrMAC` spells `MAC` where 34 names in the project spell it `Mac` · ×1
  • `KeyOrMAC` spells `MAC` where 34 names in the project spell it `Mac` crates/libs/sys/src/Windows/Win32/winioctl/mod.rs:8222 — 34 of 35 names in project windows_sys spell the token `Mac` (34 of 35; unit: names in project windows_sys containing `Mac`). Peers: BCRYPT_AUTHENTICATED_CIPHER_MODE_INFO.pbMacContext (crates/libs/sys/src/Windows/Win32/bcrypt/mod.rs:153); BCRYPT_AUTHENTICATED_CIPHER_MODE_INFO.cbMacContext (crates/libs/sys/src/Windows/Win32/bcrypt/mod.rs:154); JET_OPENTEMPORARYTABLE.cbVarSegMac (crates/libs/sys/src/Windows/Win32/esent/mod.rs:2358); JET_OPENTEMPORARYTABLE.cbVarSegMac (crates/libs/sys/src/Windows/Win32/esent/mod.rs:2372); JET_OPENTEMPORARYTABLE2.cbVarSegMac (crates/libs/sys/src/Windows/Win32/esent/mod.rs:2386). Rename to `KeyOrMac`. [rule N6]
D21 · Naming Consistency · `DefaultACValue` spells `AC` where 26 names in the project spell it `Ac` · ×1
  • `DefaultACValue` spells `AC` where 26 names in the project spell it `Ac` crates/libs/sys/src/Windows/Win32/winnt/mod.rs:8169 — 26 of 27 names in project windows_sys spell the token `Ac` (26 of 27; unit: names in project windows_sys containing `Ac`). Peers: ACPI_TIME_AND_ALARM_CAPABILITIES.S4AcWakeSupported (crates/libs/sys/src/Windows/Win32/poclass/mod.rs:30); ACPI_TIME_AND_ALARM_CAPABILITIES.S5AcWakeSupported (crates/libs/sys/src/Windows/Win32/poclass/mod.rs:32); GLOBAL_MACHINE_POWER_POLICY.LidOpenWakeAc (crates/libs/sys/src/Windows/Win32/powrprof/mod.rs:205); GLOBAL_USER_POWER_POLICY.PowerButtonAc (crates/libs/sys/src/Windows/Win32/powrprof/mod.rs:221); GLOBAL_USER_POWER_POLICY.SleepButtonAc (crates/libs/sys/src/Windows/Win32/powrprof/mod.rs:223). Rename to `DefaultAcValue`. [rule N6]
D21 · Naming Consistency · `bDSCPToUPMappingConfigured` spells `UP` where 32 names in the project spell it `Up` · ×1
  • `bDSCPToUPMappingConfigured` spells `UP` where 32 names in the project spell it `Up` crates/libs/sys/src/Windows/Win32/wlan/mod.rs:722 — 32 of 34 names in project windows_sys spell the token `Up` (32 of 34; unit: names in project windows_sys containing `Up`). Peers: D3D12_FEATURE_DATA_D3D12_OPTIONS19.PointSamplingAddressesNeverRoundUp (crates/libs/sys/src/Windows/Win32/d3d12/mod.rs:1435); NDIS_INTERFACE_INFORMATION.ifDeviceWakeUpEnable (crates/libs/sys/src/Windows/Win32/ifdef/mod.rs:65); MIB_IPMCAST_MFE.dwUpStrmNgbr (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:238); MIB_IPMCAST_MFE.ulUpTime (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:244); MIB_IPMCAST_MFE_STATS.dwUpStrmNgbr (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:265). Rename to `bDSCPToUpMappingConfigured`. [rule N6]
D21 · Naming Consistency · `bDSCPToUPMappingSupported` spells `UP` where 32 names in the project spell it `Up` · ×1
  • `bDSCPToUPMappingSupported` spells `UP` where 32 names in the project spell it `Up` crates/libs/sys/src/Windows/Win32/wlan/mod.rs:1015 — 32 of 34 names in project windows_sys spell the token `Up` (32 of 34; unit: names in project windows_sys containing `Up`). Peers: D3D12_FEATURE_DATA_D3D12_OPTIONS19.PointSamplingAddressesNeverRoundUp (crates/libs/sys/src/Windows/Win32/d3d12/mod.rs:1435); NDIS_INTERFACE_INFORMATION.ifDeviceWakeUpEnable (crates/libs/sys/src/Windows/Win32/ifdef/mod.rs:65); MIB_IPMCAST_MFE.dwUpStrmNgbr (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:238); MIB_IPMCAST_MFE.ulUpTime (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:244); MIB_IPMCAST_MFE_STATS.dwUpStrmNgbr (crates/libs/sys/src/Windows/Win32/ipmib/mod.rs:265). Rename to `bDSCPToUpMappingSupported`. [rule N6]
D21 · Naming Consistency · `pwszDNSName` spells `DNS` where 31 names in the project spell it `Dns` · ×1
  • `pwszDNSName` spells `DNS` where 31 names in the project spell it `Dns` crates/libs/sys/src/Windows/Win32/wmsdkidl/mod.rs:639 — 31 of 33 names in project windows_sys spell the token `Dns` (31 of 33; unit: names in project windows_sys containing `Dns`). Peers: DSROLE_PRIMARY_DOMAIN_INFO_BASIC.DomainNameDns (crates/libs/sys/src/Windows/Win32/dsrole/mod.rs:20); FIXED_INFO_W2KSP1.CurrentDnsServer (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:11); FIXED_INFO_W2KSP1.EnableDns (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:17); IP_ADAPTER_ADDRESSES_LH.FirstDnsServerAddress (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:50); IP_ADAPTER_ADDRESSES_LH.FirstDnsSuffix (crates/libs/sys/src/Windows/Win32/iptypes/mod.rs:79). Rename to `pwszDnsName`. [rule N6]
D21 · Naming Consistency · `userBITMAP` spells `BITMAP` where 57 names in the project spell it `Bitmap` · ×1
  • `userBITMAP` spells `BITMAP` where 57 names in the project spell it `Bitmap` crates/libs/sys/src/Windows/Win32/wtypes/mod.rs:414 — 57 of 58 names in project windows_sys spell the token `Bitmap` (57 of 58; unit: names in project windows_sys containing `Bitmap`). Peers: IMAGELISTDRAWPARAMS.xBitmap (crates/libs/sys/src/Windows/Win32/commctrl/mod.rs:854); IMAGELISTDRAWPARAMS.yBitmap (crates/libs/sys/src/Windows/Win32/commctrl/mod.rs:855); TBBUTTON.iBitmap (crates/libs/sys/src/Windows/Win32/commctrl/mod.rs:3537); TBBUTTON.iBitmap (crates/libs/sys/src/Windows/Win32/commctrl/mod.rs:3557); TTGETTITLE.uTitleBitmap (crates/libs/sys/src/Windows/Win32/commctrl/mod.rs:4139). Rename to `userBitmap`. [rule N6]
D21 · Naming Consistency · `dwICC` spells `ICC` where 13 names in the project spell it `Icc` · ×1
  • `dwICC` spells `ICC` where 13 names in the project spell it `Icc` crates/libs/windows/src/Windows/Win32/commctrl/mod.rs:1228 — 13 of 14 names in project windows spell the token `Icc` (13 of 14; unit: names in project windows containing `Icc`). Peers: ISmsMessageBase_Impl.SimIccId (crates/libs/windows/src/Windows/Devices/Sms/mod.rs:651); ISmsMessageBase_Vtbl.SimIccId (crates/libs/windows/src/Windows/Devices/Sms/mod.rs:753); SmsAppMessage.SimIccId (crates/libs/windows/src/Windows/Devices/Sms/mod.rs:1350); SmsBroadcastMessage.SimIccId (crates/libs/windows/src/Windows/Devices/Sms/mod.rs:1525); SmsStatusMessage.SimIccId (crates/libs/windows/src/Windows/Devices/Sms/mod.rs:2566). Rename to `dwIcc`. [rule N6]
D21 · Naming Consistency · `dwCrmFlags` spells `Crm` where 45 names in the project spell it `CRM` · ×1
  • `dwCrmFlags` spells `Crm` where 45 names in the project spell it `CRM` crates/libs/windows/src/Windows/Win32/comsvcs/mod.rs:559 — 45 of 46 names in project windows spell the token `CRM` (45 of 46; unit: names in project windows containing `CRM`). Peers: IComCRMEvents_Vtbl.OnCRMRecoveryStart (crates/libs/windows/src/Windows/Win32/comsvcs/mod.rs:1254); IComCRMEvents_Vtbl.OnCRMRecoveryStart (crates/libs/windows/src/Windows/Win32/comsvcs/mod.rs:1256); IComCRMEvents_Vtbl.OnCRMRecoveryDone (crates/libs/windows/src/Windows/Win32/comsvcs/mod.rs:1258); IComCRMEvents_Vtbl.OnCRMRecoveryDone (crates/libs/windows/src/Windows/Win32/comsvcs/mod.rs:1260); IComCRMEvents_Vtbl.OnCRMCheckpoint (crates/libs/windows/src/Windows/Win32/comsvcs/mod.rs:1262). Rename to `dwCRMFlags`. [rule N6]
D21 · Naming Consistency · `CryptXmlSetHMACSecret` spells `HMAC` where 24 names in the project spell it `Hmac` · ×1
  • `CryptXmlSetHMACSecret` spells `HMAC` where 24 names in the project spell it `Hmac` crates/libs/windows/src/Windows/Win32/cryptxml/mod.rs:106 — 24 of 26 names in project windows spell the token `Hmac` (24 of 26; unit: names in project windows containing `Hmac`). Peers: IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacMd5 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1234); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha1 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1235); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha256 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1236); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha384 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1237); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha512 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1238). Rename to `CryptXmlSetHmacSecret`. [rule N6]
D21 · Naming Consistency · `MapNoOverwriteOnDynamicBufferSRV` spells `SRV` where 44 names in the project spell it `Srv` · ×1
  • `MapNoOverwriteOnDynamicBufferSRV` spells `SRV` where 44 names in the project spell it `Srv` crates/libs/windows/src/Windows/Win32/d3d11/mod.rs:1133 — 44 of 45 names in project windows spell the token `Srv` (44 of 45; unit: names in project windows containing `Srv`). Peers: certbcli$module.CertSrvBackupClose (crates/libs/windows/src/Windows/Win32/certbcli/mod.rs:2); certbcli$module.CertSrvBackupEnd (crates/libs/windows/src/Windows/Win32/certbcli/mod.rs:7); certbcli$module.CertSrvBackupFree (crates/libs/windows/src/Windows/Win32/certbcli/mod.rs:12); certbcli$module.CertSrvBackupGetBackupLogs (crates/libs/windows/src/Windows/Win32/certbcli/mod.rs:18); certbcli$module.CertSrvBackupGetBackupLogsW (crates/libs/windows/src/Windows/Win32/certbcli/mod.rs:24). Rename to `MapNoOverwriteOnDynamicBufferSrv`. [rule N6]
D21 · Naming Consistency · `FaultedPrimitiveAPISequenceNumber` spells `API` where 19 names in the project spell it `Api` · ×1
  • `FaultedPrimitiveAPISequenceNumber` spells `API` where 19 names in the project spell it `Api` crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:3113 — 19 of 21 names in project windows spell the token `Api` (19 of 21; unit: names in project windows containing `Api`). Peers: ApiInformation.IsApiContractPresentByMajor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:51); ApiInformation.IsApiContractPresentByMajorAndMinor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:57); ApiInformation.IApiInformationStatics (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:63); IApiInformationStatics_Vtbl.IsApiContractPresentByMajor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:201); IApiInformationStatics_Vtbl.IsApiContractPresentByMajorAndMinor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:202). Rename to `FaultedPrimitiveApiSequenceNumber`. [rule N6]
D21 · Naming Consistency · `CompositionUiCaptureOnly` spells `Ui` where 469 names in the project spell it `UI` · ×1
  • `CompositionUiCaptureOnly` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:5554 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `CompositionUICaptureOnly`. [rule N6]
D21 · Naming Consistency · `NbNULLReference` spells `NULL` where 21 names in the project spell it `Null` · ×1
  • `NbNULLReference` spells `NULL` where 21 names in the project spell it `Null` crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:7609 — 21 of 22 names in project windows spell the token `Null` (21 of 22; unit: names in project windows containing `Null`). Peers: IJsonValueStatics2_Vtbl.CreateNullValue (crates/libs/windows/src/Windows/Data/Json/mod.rs:272); JsonValue.CreateNullValue (crates/libs/windows/src/Windows/Data/Json/mod.rs:881); HidNumericControlDescription.HasNull (crates/libs/windows/src/Windows/Devices/HumanInterfaceDevice/mod.rs:671); IHidNumericControlDescription_Vtbl.HasNull (crates/libs/windows/src/Windows/Devices/HumanInterfaceDevice/mod.rs:936); IX509SignatureInformation_Vtbl.SetNullSigned (crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:18548). Rename to `NbNullReference`. [rule N6]
D21 · Naming Consistency · `dwROP` spells `ROP` where 13 names in the project spell it `Rop` · ×1
  • `dwROP` spells `ROP` where 13 names in the project spell it `Rop` crates/libs/windows/src/Windows/Win32/ddraw/mod.rs:90 — 13 of 14 names in project windows spell the token `Rop` (13 of 14; unit: names in project windows containing `Rop`). Peers: IMAGELISTDRAWPARAMS.dwRop (crates/libs/windows/src/Windows/Win32/commctrl/mod.rs:1213); EMRALPHABLEND.dwRop (crates/libs/windows/src/Windows/Win32/wingdi/mod.rs:4289); EMRBITBLT.dwRop (crates/libs/windows/src/Windows/Win32/wingdi/mod.rs:4328); EMRMASKBLT.dwRop (crates/libs/windows/src/Windows/Win32/wingdi/mod.rs:4636); EMRSTRETCHBLT.dwRop (crates/libs/windows/src/Windows/Win32/wingdi/mod.rs:4969). Rename to `dwRop`. [rule N6]
D21 · Naming Consistency · `cbUiData` spells `Ui` where 469 names in the project spell it `UI` · ×1
  • `cbUiData` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:120 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `cbUIData`. [rule N6]
D21 · Naming Consistency · `pbUiData` spells `Ui` where 469 names in the project spell it `UI` · ×1
  • `pbUiData` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Win32/eaptypes/mod.rs:121 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `pbUIData`. [rule N6]
D21 · Naming Consistency · `HiFiCOLOR` spells `COLOR` where 1036 names in the project spell it `Color` · ×1
  • `HiFiCOLOR` spells `COLOR` where 1036 names in the project spell it `Color` crates/libs/windows/src/Windows/Win32/icm/mod.rs:1019 — 1036 of 1039 names in project windows spell the token `Color` (1036 of 1039; unit: names in project windows containing `Color`). Peers: AppointmentCalendar.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:324); AppointmentCalendar.SetDisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:499); IAppointmentCalendar_Vtbl.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2274); IAppointmentCalendar_Vtbl.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2276); IAppointmentCalendar2_Vtbl.SetDisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2312). Rename to `HiFiColor`. [rule N6]
D21 · Naming Consistency · `LabCOLOR` spells `COLOR` where 1036 names in the project spell it `Color` · ×1
  • `LabCOLOR` spells `COLOR` where 1036 names in the project spell it `Color` crates/libs/windows/src/Windows/Win32/icm/mod.rs:1062 — 1036 of 1039 names in project windows spell the token `Color` (1036 of 1039; unit: names in project windows containing `Color`). Peers: AppointmentCalendar.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:324); AppointmentCalendar.SetDisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:499); IAppointmentCalendar_Vtbl.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2274); IAppointmentCalendar_Vtbl.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2276); IAppointmentCalendar2_Vtbl.SetDisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2312). Rename to `LabColor`. [rule N6]
D21 · Naming Consistency · `YxyCOLOR` spells `COLOR` where 1036 names in the project spell it `Color` · ×1
  • `YxyCOLOR` spells `COLOR` where 1036 names in the project spell it `Color` crates/libs/windows/src/Windows/Win32/icm/mod.rs:1232 — 1036 of 1039 names in project windows spell the token `Color` (1036 of 1039; unit: names in project windows containing `Color`). Peers: AppointmentCalendar.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:324); AppointmentCalendar.SetDisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:499); IAppointmentCalendar_Vtbl.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2274); IAppointmentCalendar_Vtbl.DisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2276); IAppointmentCalendar2_Vtbl.SetDisplayColor (crates/libs/windows/src/Windows/ApplicationModel/Appointments/mod.rs:2312). Rename to `YxyColor`. [rule N6]
D21 · Naming Consistency · `GetRTTAndHopCount` spells `RTT` where 15 names in the project spell it `Rtt` · ×1
  • `GetRTTAndHopCount` spells `RTT` where 15 names in the project spell it `Rtt` crates/libs/windows/src/Windows/Win32/iphlpapi/mod.rs:317 — 15 of 16 names in project windows spell the token `Rtt` (15 of 16; unit: names in project windows containing `Rtt`). Peers: TCP_INFO_v0.MinRttUs (crates/libs/windows/src/Windows/Win32/mstcpip/mod.rs:452); TCP_INFO_v1.MinRttUs (crates/libs/windows/src/Windows/Win32/mstcpip/mod.rs:476); TCP_INFO_v2.MinRttUs (crates/libs/windows/src/Windows/Win32/mstcpip/mod.rs:509); TCP_ESTATS_FINE_RTT_ROD_v0.MaxRtt (crates/libs/windows/src/Windows/Win32/tcpestats/mod.rs:87); TCP_ESTATS_FINE_RTT_ROD_v0.MinRtt (crates/libs/windows/src/Windows/Win32/tcpestats/mod.rs:88). Rename to `GetRttAndHopCount`. [rule N6]
D21 · Naming Consistency · `dwForwardNextHopAS` spells `AS` where 467 names in the project spell it `As` · ×1
  • `dwForwardNextHopAS` spells `AS` where 467 names in the project spell it `As` crates/libs/windows/src/Windows/Win32/ipmib/mod.rs:146 — 467 of 468 names in project windows spell the token `As` (467 of 468; unit: names in project windows containing `As`). Peers: ITensorBoolean_Vtbl.GetAsVectorView (crates/libs/windows/src/Windows/AI/MachineLearning/mod.rs:487); ITensorDouble_Vtbl.GetAsVectorView (crates/libs/windows/src/Windows/AI/MachineLearning/mod.rs:515); ITensorFloat_Vtbl.GetAsVectorView (crates/libs/windows/src/Windows/AI/MachineLearning/mod.rs:551); ITensorFloat16Bit_Vtbl.GetAsVectorView (crates/libs/windows/src/Windows/AI/MachineLearning/mod.rs:558); ITensorInt16Bit_Vtbl.GetAsVectorView (crates/libs/windows/src/Windows/AI/MachineLearning/mod.rs:607). Rename to `dwForwardNextHopAs`. [rule N6]
D21 · Naming Consistency · `numPublicIFLuids` spells `IF` where 136 names in the project spell it `If` · ×1
  • `numPublicIFLuids` spells `IF` where 136 names in the project spell it `If` crates/libs/windows/src/Windows/Win32/ipsectypes/mod.rs:151 — 136 of 140 names in project windows spell the token `If` (136 of 140; unit: names in project windows containing `If`). Peers: IMcpMessageFilterResponseExperimental_Impl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:149); IMcpMessageFilterResponseExperimental_Impl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:150); IMcpMessageFilterResponseExperimental_Vtbl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:215); IMcpMessageFilterResponseExperimental_Vtbl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:216); HttpRequestHeaderCollection.SetIfModifiedSince (crates/libs/windows/src/Windows/Web/Http/Headers/mod.rs:3237). Rename to `numPublicIfLuids`. [rule N6]
D21 · Naming Consistency · `publicIFLuids` spells `IF` where 136 names in the project spell it `If` · ×1
  • `publicIFLuids` spells `IF` where 136 names in the project spell it `If` crates/libs/windows/src/Windows/Win32/ipsectypes/mod.rs:152 — 136 of 140 names in project windows spell the token `If` (136 of 140; unit: names in project windows containing `If`). Peers: IMcpMessageFilterResponseExperimental_Impl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:149); IMcpMessageFilterResponseExperimental_Impl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:150); IMcpMessageFilterResponseExperimental_Vtbl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:215); IMcpMessageFilterResponseExperimental_Vtbl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:216); HttpRequestHeaderCollection.SetIfModifiedSince (crates/libs/windows/src/Windows/Web/Http/Headers/mod.rs:3237). Rename to `publicIfLuids`. [rule N6]
D21 · Naming Consistency · `numInternalIFLuids` spells `IF` where 136 names in the project spell it `If` · ×1
  • `numInternalIFLuids` spells `IF` where 136 names in the project spell it `If` crates/libs/windows/src/Windows/Win32/ipsectypes/mod.rs:153 — 136 of 140 names in project windows spell the token `If` (136 of 140; unit: names in project windows containing `If`). Peers: IMcpMessageFilterResponseExperimental_Impl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:149); IMcpMessageFilterResponseExperimental_Impl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:150); IMcpMessageFilterResponseExperimental_Vtbl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:215); IMcpMessageFilterResponseExperimental_Vtbl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:216); HttpRequestHeaderCollection.SetIfModifiedSince (crates/libs/windows/src/Windows/Web/Http/Headers/mod.rs:3237). Rename to `numInternalIfLuids`. [rule N6]
D21 · Naming Consistency · `internalIFLuids` spells `IF` where 136 names in the project spell it `If` · ×1
  • `internalIFLuids` spells `IF` where 136 names in the project spell it `If` crates/libs/windows/src/Windows/Win32/ipsectypes/mod.rs:154 — 136 of 140 names in project windows spell the token `If` (136 of 140; unit: names in project windows containing `If`). Peers: IMcpMessageFilterResponseExperimental_Impl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:149); IMcpMessageFilterResponseExperimental_Impl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:150); IMcpMessageFilterResponseExperimental_Vtbl.MessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:215); IMcpMessageFilterResponseExperimental_Vtbl.SetMessageIfNotAllowed (crates/libs/windows/src/Windows/AI/Agents/Mcp/mod.rs:216); HttpRequestHeaderCollection.SetIfModifiedSince (crates/libs/windows/src/Windows/Web/Http/Headers/mod.rs:3237). Rename to `internalIfLuids`. [rule N6]
D21 · Naming Consistency · `ReservedNT` spells `NT` where 43 names in the project spell it `Nt` · ×1
  • `ReservedNT` spells `NT` where 43 names in the project spell it `Nt` crates/libs/windows/src/Windows/Win32/ksmedia/mod.rs:4802 — 43 of 44 names in project windows spell the token `Nt` (43 of 44; unit: names in project windows containing `Nt`). Peers: d3dkmthk$module.D3DKMTOpenKeyedMutexFromNtHandle (crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:562); d3dkmthk$module.D3DKMTOpenNativeFenceFromNtHandle (crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:568); d3dkmthk$module.D3DKMTOpenNtHandleFromName (crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:574); d3dkmthk$module.D3DKMTOpenProtectedSessionFromNtHandle (crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:580); d3dkmthk$module.D3DKMTOpenResourceFromNtHandle (crates/libs/windows/src/Windows/Win32/d3dkmthk/mod.rs:598). Rename to `ReservedNt`. [rule N6]
D21 · Naming Consistency · `wSARwidth` spells `SA` where 104 names in the project spell it `Sa` · ×1
  • `wSARwidth` spells `SA` where 104 names in the project spell it `Sa` crates/libs/windows/src/Windows/Win32/ksmedia/mod.rs:4901 — 104 of 106 names in project windows spell the token `Sa` (104 of 106; unit: names in project windows containing `Sa`). Peers: FWPM_NET_EVENT_IKEEXT_QM_FAILURE1.mmSaLuid (crates/libs/windows/src/Windows/Win32/fwpmtypes/mod.rs:1106); fwpmu$module.IPsecSaContextAddInbound0 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:893); fwpmu$module.IPsecSaContextAddInbound1 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:899); fwpmu$module.IPsecSaContextAddOutbound0 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:905); fwpmu$module.IPsecSaContextAddOutbound1 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:911). Rename to `wSaRwidth`. [rule N6]
D21 · Naming Consistency · `wSARheight` spells `SA` where 104 names in the project spell it `Sa` · ×1
  • `wSARheight` spells `SA` where 104 names in the project spell it `Sa` crates/libs/windows/src/Windows/Win32/ksmedia/mod.rs:4902 — 104 of 106 names in project windows spell the token `Sa` (104 of 106; unit: names in project windows containing `Sa`). Peers: FWPM_NET_EVENT_IKEEXT_QM_FAILURE1.mmSaLuid (crates/libs/windows/src/Windows/Win32/fwpmtypes/mod.rs:1106); fwpmu$module.IPsecSaContextAddInbound0 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:893); fwpmu$module.IPsecSaContextAddInbound1 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:899); fwpmu$module.IPsecSaContextAddOutbound0 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:905); fwpmu$module.IPsecSaContextAddOutbound1 (crates/libs/windows/src/Windows/Win32/fwpmu/mod.rs:911). Rename to `wSaRheight`. [rule N6]
D21 · Naming Consistency · `bmSVCCapabilities` spells `SVC` where 21 names in the project spell it `Svc` · ×1
  • `bmSVCCapabilities` spells `SVC` where 21 names in the project spell it `Svc` crates/libs/windows/src/Windows/Win32/ksmedia/mod.rs:4908 — 21 of 22 names in project windows spell the token `Svc` (21 of 22; unit: names in project windows containing `Svc`). Peers: CONVINFO.hszSvcPartner (crates/libs/windows/src/Windows/Win32/ddeml/mod.rs:224); HSZPAIR.hszSvc (crates/libs/windows/src/Windows/Win32/ddeml/mod.rs:322); MONCONVSTRUCT.hszSvc (crates/libs/windows/src/Windows/Win32/ddeml/mod.rs:377); MONLINKSTRUCT.hszSvc (crates/libs/windows/src/Windows/Win32/ddeml/mod.rs:436); FSRTL_UNC_PROVIDER_REGISTRATION_0_0.DomainSvcAware (crates/libs/windows/src/Windows/Win32/ntifs/mod.rs:2922). Rename to `bmSvcCapabilities`. [rule N6]
D21 · Naming Consistency · `pabHMAC` spells `HMAC` where 24 names in the project spell it `Hmac` · ×1
  • `pabHMAC` spells `HMAC` where 24 names in the project spell it `Hmac` crates/libs/windows/src/Windows/Win32/ncrypt/mod.rs:550 — 24 of 26 names in project windows spell the token `Hmac` (24 of 26; unit: names in project windows containing `Hmac`). Peers: IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacMd5 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1234); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha1 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1235); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha256 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1236); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha384 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1237); IKeyDerivationAlgorithmNamesStatics_Vtbl.Sp800108CtrHmacSha512 (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1238). Rename to `pabHmac`. [rule N6]
D21 · Naming Consistency · `InvalidBusMSR` spells `MSR` where 39 names in the project spell it `Msr` · ×1
  • `InvalidBusMSR` spells `MSR` where 39 names in the project spell it `Msr` crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:14873 — 39 of 40 names in project windows spell the token `Msr` (39 of 40; unit: names in project windows containing `Msr`). Peers: IDebugDataSpaces_Vtbl.ReadMsr (crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:14618); IDebugDataSpaces_Vtbl.ReadMsr (crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:14620); IDebugDataSpaces_Vtbl.WriteMsr (crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:14622); IDebugDataSpaces_Vtbl.WriteMsr (crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:14624); IDebugDataSpaces_Impl.ReadMsr (crates/libs/windows/src/Windows/Win32/dbgeng/mod.rs:14659). Rename to `InvalidBusMsr`. [rule N6]
D21 · Naming Consistency · `ExceptionRIP` spells `RIP` where 18 names in the project spell it `Rip` · ×1
  • `ExceptionRIP` spells `RIP` where 18 names in the project spell it `Rip` crates/libs/windows/src/Windows/Win32/ntenclv/mod.rs:135 — 18 of 19 names in project windows spell the token `Rip` (18 of 19; unit: names in project windows containing `Rip`). Peers: KTRAP_FRAME_3.LastBranchToRip (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3224); KTRAP_FRAME_3.LastBranchFromRip (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3225); KTRAP_FRAME_3.LastExceptionToRip (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3226); KTRAP_FRAME_3.LastExceptionFromRip (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3227); WHV_X64_PENDING_SVM_NESTED_EXIT_EVENT2_0.NextRip (crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:5915). Rename to `ExceptionRip`. [rule N6]
D21 · Naming Consistency · `DefaultAcpTableInfo` spells `Acp` where 17 names in the project spell it `ACP` · ×1
  • `DefaultAcpTableInfo` spells `Acp` where 17 names in the project spell it `ACP` crates/libs/windows/src/Windows/Win32/ntnls/mod.rs:44 — 17 of 18 names in project windows spell the token `ACP` (17 of 18; unit: names in project windows containing `ACP`). Peers: ITfContextOwner_Vtbl.GetACPFromPoint (crates/libs/windows/src/Windows/Win32/msctf/mod.rs:2837); ITfContextOwner_Vtbl.GetACPFromPoint (crates/libs/windows/src/Windows/Win32/msctf/mod.rs:2839); ITfContextOwner_Impl.GetACPFromPoint (crates/libs/windows/src/Windows/Win32/msctf/mod.rs:2864); ITextStoreACP_Vtbl.GetEndACP (crates/libs/windows/src/Windows/Win32/textstor/mod.rs:409); ITextStoreACP_Vtbl.GetEndACP (crates/libs/windows/src/Windows/Win32/textstor/mod.rs:411). Rename to `DefaultACPTableInfo`. [rule N6]
D21 · Naming Consistency · `SetupDiGetINFClassA` spells `INF` where 61 names in the project spell it `Inf` · ×1
  • `SetupDiGetINFClassA` spells `INF` where 61 names in the project spell it `Inf` crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:1071 — 61 of 63 names in project windows spell the token `Inf` (61 of 63; unit: names in project windows containing `Inf`). Peers: D3D10_SHADER_DEBUG_OUTPUTVAR.bInfPossible (crates/libs/windows/src/Windows/Win32/d3d10/mod.rs:1798); setupapi$module.SetupCloseInfFile (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:142); setupapi$module.SetupConfigureWmiFromInfSectionA (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:165); setupapi$module.SetupConfigureWmiFromInfSectionW (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:174); setupapi$module.SetupCopyOEMInfA (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:209). Rename to `SetupDiGetInfClassA`. [rule N6]
D21 · Naming Consistency · `SetupDiGetINFClassW` spells `INF` where 61 names in the project spell it `Inf` · ×1
  • `SetupDiGetINFClassW` spells `INF` where 61 names in the project spell it `Inf` crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:1080 — 61 of 63 names in project windows spell the token `Inf` (61 of 63; unit: names in project windows containing `Inf`). Peers: D3D10_SHADER_DEBUG_OUTPUTVAR.bInfPossible (crates/libs/windows/src/Windows/Win32/d3d10/mod.rs:1798); setupapi$module.SetupCloseInfFile (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:142); setupapi$module.SetupConfigureWmiFromInfSectionA (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:165); setupapi$module.SetupConfigureWmiFromInfSectionW (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:174); setupapi$module.SetupCopyOEMInfA (crates/libs/windows/src/Windows/Win32/setupapi/mod.rs:209). Rename to `SetupDiGetInfClassW`. [rule N6]
D21 · Naming Consistency · `_pautoSS` spells `SS` where 32 names in the project spell it `Ss` · ×1
  • `_pautoSS` spells `SS` where 32 names in the project spell it `Ss` crates/libs/windows/src/Windows/Win32/shdeprecated/mod.rs:12 — 32 of 33 names in project windows spell the token `Ss` (32 of 33; unit: names in project windows containing `Ss`). Peers: KTRAP_FRAME_6_0.SegSs (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3331); KTRAP_FRAME_6_1.SegSsRsvdZ1 (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3346); KTRAP_FRAME_6_1.FredSegSs (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3370); KTRAP_FRAME_6_1_0_1.SegSsRsvdZ4 (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3422); KTRAP_FRAME_6_1_0_1.SegSsRsvdZ3 (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:3446). Rename to `_pautoSs`. [rule N6]
D21 · Naming Consistency · `SHMapPIDLToSystemImageListIndex` spells `PIDL` where 12 names in the project spell it `Pidl` · ×1
  • `SHMapPIDLToSystemImageListIndex` spells `PIDL` where 12 names in the project spell it `Pidl` crates/libs/windows/src/Windows/Win32/shlobj_core/mod.rs:823 — 12 of 13 names in project windows spell the token `Pidl` (12 of 13; unit: names in project windows containing `Pidl`). Peers: IBrowserService_Vtbl.NavigateToPidl (crates/libs/windows/src/Windows/Win32/shdeprecated/mod.rs:274); IBrowserService_Vtbl.NavigateToPidl (crates/libs/windows/src/Windows/Win32/shdeprecated/mod.rs:276); IBrowserService_Vtbl.GetPidl (crates/libs/windows/src/Windows/Win32/shdeprecated/mod.rs:295); IBrowserService_Vtbl.GetPidl (crates/libs/windows/src/Windows/Win32/shdeprecated/mod.rs:297); IBrowserService_Impl.NavigateToPidl (crates/libs/windows/src/Windows/Win32/shdeprecated/mod.rs:349). Rename to `SHMapPidlToSystemImageListIndex`. [rule N6]
D21 · Naming Consistency · `pszUiDll` spells `Ui` where 469 names in the project spell it `UI` · ×1
  • `pszUiDll` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Win32/sti/mod.rs:805 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `pszUIDll`. [rule N6]
D21 · Naming Consistency · `CodecAPIEventData` spells `API` where 19 names in the project spell it `Api` · ×1
  • `CodecAPIEventData` spells `API` where 19 names in the project spell it `Api` crates/libs/windows/src/Windows/Win32/strmif/mod.rs:352 — 19 of 21 names in project windows spell the token `Api` (19 of 21; unit: names in project windows containing `Api`). Peers: ApiInformation.IsApiContractPresentByMajor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:51); ApiInformation.IsApiContractPresentByMajorAndMinor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:57); ApiInformation.IApiInformationStatics (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:63); IApiInformationStatics_Vtbl.IsApiContractPresentByMajor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:201); IApiInformationStatics_Vtbl.IsApiContractPresentByMajorAndMinor (crates/libs/windows/src/Windows/Foundation/Metadata/mod.rs:202). Rename to `CodecApiEventData`. [rule N6]
D21 · Naming Consistency · `MaxCaCwnd` spells `Ca` where 65 names in the project spell it `CA` · ×1
  • `MaxCaCwnd` spells `Ca` where 65 names in the project spell it `CA` crates/libs/windows/src/Windows/Win32/tcpestats/mod.rs:221 — 65 of 66 names in project windows spell the token `CA` (65 of 66; unit: names in project windows containing `CA`). Peers: BDA_ISDBCAS_EMG_REQ.bCABroadcasterGroupId (crates/libs/windows/src/Windows/Win32/bdatypes/mod.rs:349); ICertAdmin2_Vtbl.GetCAProperty (crates/libs/windows/src/Windows/Win32/certadm/mod.rs:367); ICertAdmin2_Vtbl.GetCAProperty (crates/libs/windows/src/Windows/Win32/certadm/mod.rs:369); ICertAdmin2_Vtbl.SetCAProperty (crates/libs/windows/src/Windows/Win32/certadm/mod.rs:371); ICertAdmin2_Vtbl.SetCAProperty (crates/libs/windows/src/Windows/Win32/certadm/mod.rs:373). Rename to `MaxCACwnd`. [rule N6]
D21 · Naming Consistency · `CryptCreateKeyIdentifierFromCSP` spells `CSP` where 28 names in the project spell it `Csp` · ×1
  • `CryptCreateKeyIdentifierFromCSP` spells `CSP` where 28 names in the project spell it `Csp` REDACTED:854 — 28 of 29 names in project windows spell the token `Csp` (28 of 29; unit: names in project windows containing `Csp`). Peers: ICspInformation_Vtbl.LegacyCsp (crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:3941); ICspInformation_Vtbl.LegacyCsp (crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:3943); ICspInformation_Vtbl.GetCspStatusFromOperations (crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:3945); ICspInformation_Impl.LegacyCsp (crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:3964); ICspInformation_Impl.GetCspStatusFromOperations (crates/libs/windows/src/Windows/Win32/certenroll/mod.rs:3965). Rename to `CryptCreateKeyIdentifierFromCsp`. [rule N6]
D21 · Naming Consistency · `uMinPHYRate` spells `PHY` where 115 names in the project spell it `Phy` · ×1
  • `uMinPHYRate` spells `PHY` where 115 names in the project spell it `Phy` crates/libs/windows/src/Windows/Win32/windot11/mod.rs:1947 — 115 of 117 names in project windows spell the token `Phy` (115 of 117; unit: names in project windows containing `Phy`). Peers: BluetoothLEAdvertisementPublisherTrigger.PrimaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1106); BluetoothLEAdvertisementPublisherTrigger.SetPrimaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1114); BluetoothLEAdvertisementPublisherTrigger.SecondaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1119); BluetoothLEAdvertisementPublisherTrigger.SetSecondaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1127); BluetoothLEAdvertisementWatcherTrigger.UseUncoded1MPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1221). Rename to `uMinPhyRate`. [rule N6]
D21 · Naming Consistency · `dot11PHYType` spells `PHY` where 115 names in the project spell it `Phy` · ×1
  • `dot11PHYType` spells `PHY` where 115 names in the project spell it `Phy` crates/libs/windows/src/Windows/Win32/windot11/mod.rs:2860 — 115 of 117 names in project windows spell the token `Phy` (115 of 117; unit: names in project windows containing `Phy`). Peers: BluetoothLEAdvertisementPublisherTrigger.PrimaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1106); BluetoothLEAdvertisementPublisherTrigger.SetPrimaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1114); BluetoothLEAdvertisementPublisherTrigger.SecondaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1119); BluetoothLEAdvertisementPublisherTrigger.SetSecondaryPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1127); BluetoothLEAdvertisementWatcherTrigger.UseUncoded1MPhy (crates/libs/windows/src/Windows/ApplicationModel/Background/mod.rs:1221). Rename to `dot11PhyType`. [rule N6]
D21 · Naming Consistency · `SsbsRw` spells `Rw` where 34 names in the project spell it `RW` · ×1
  • `SsbsRw` spells `Rw` where 34 names in the project spell it `RW` crates/libs/windows/src/Windows/Win32/winhvplatformdefs/mod.rs:823 — 34 of 35 names in project windows spell the token `RW` (34 of 35; unit: names in project windows containing `RW`). Peers: IRawCDImageCreator_Vtbl.AddSubcodeRWGenerator (crates/libs/windows/src/Windows/Win32/imapi2/mod.rs:5229); IRawCDImageCreator_Vtbl.AddSubcodeRWGenerator (crates/libs/windows/src/Windows/Win32/imapi2/mod.rs:5231); IRawCDImageCreator_Impl.AddSubcodeRWGenerator (crates/libs/windows/src/Windows/Win32/imapi2/mod.rs:5287); AER_BRIDGE_DESCRIPTOR_FLAGS_0.UncorrectableErrorMaskRW (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:604); AER_BRIDGE_DESCRIPTOR_FLAGS_0.UncorrectableErrorSeverityRW (crates/libs/windows/src/Windows/Win32/ntddk/mod.rs:610). Rename to `SsbsRW`. [rule N6]
D21 · Naming Consistency · `KeyOrMAC` spells `MAC` where 36 names in the project spell it `Mac` · ×1
  • `KeyOrMAC` spells `MAC` where 36 names in the project spell it `Mac` crates/libs/windows/src/Windows/Win32/winioctl/mod.rs:8606 — 36 of 37 names in project windows spell the token `Mac` (36 of 37; unit: names in project windows containing `Mac`). Peers: MacAlgorithmNames.IMacAlgorithmNamesStatics (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1737); MacAlgorithmProvider.IMacAlgorithmProviderStatics (crates/libs/windows/src/Windows/Security/Cryptography/Core/mod.rs:1789); BCRYPT_AUTHENTICATED_CIPHER_MODE_INFO.pbMacContext (crates/libs/windows/src/Windows/Win32/bcrypt/mod.rs:451); BCRYPT_AUTHENTICATED_CIPHER_MODE_INFO.cbMacContext (crates/libs/windows/src/Windows/Win32/bcrypt/mod.rs:452); JET_OPENTEMPORARYTABLE.cbVarSegMac (crates/libs/windows/src/Windows/Win32/esent/mod.rs:3680). Rename to `KeyOrMac`. [rule N6]
D21 · Naming Consistency · `BlockUiAccess` spells `Ui` where 469 names in the project spell it `UI` · ×1
  • `BlockUiAccess` spells `Ui` where 469 names in the project spell it `UI` crates/libs/windows/src/Windows/Win32/winnt/mod.rs:13216 — 469 of 480 names in project windows spell the token `UI` (469 of 480; unit: names in project windows containing `UI`). Peers: ActionDefinition.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:122); IActionDefinition2_Vtbl.DisplaysUI (crates/libs/windows/src/Windows/AI/Actions/Hosting/mod.rs:405); CachedFileUpdaterActivatedEventArgs.CachedFileUpdaterUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:523); ContactPickerActivatedEventArgs.ContactPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:984); FileOpenPickerActivatedEventArgs.FileOpenPickerUI (crates/libs/windows/src/Windows/ApplicationModel/Activation/mod.rs:1482). Rename to `BlockUIAccess`. [rule N6]
D21 · Naming Consistency · `pwszMIMEType` spells `MIME` where 31 names in the project spell it `Mime` · ×1
  • `pwszMIMEType` spells `MIME` where 31 names in the project spell it `Mime` crates/libs/windows/src/Windows/Win32/wmsdkidl/mod.rs:10185 — 31 of 32 names in project windows spell the token `Mime` (31 of 32; unit: names in project windows containing `Mime`). Peers: ChatMessageAttachment.SetMimeType (crates/libs/windows/src/Windows/ApplicationModel/Chat/mod.rs:683); IChatMessageAttachment_Vtbl.SetMimeType (crates/libs/windows/src/Windows/ApplicationModel/Chat/mod.rs:2156); EmailAttachment.SetMimeType (crates/libs/windows/src/Windows/ApplicationModel/Email/mod.rs:114); IEmailAttachment2_Vtbl.SetMimeType (crates/libs/windows/src/Windows/ApplicationModel/Email/mod.rs:3432); IIppAttributeValue_Vtbl.GetMimeMediaTypeArray (crates/libs/windows/src/Windows/Devices/Printers/mod.rs:56). Rename to `pwszMimeType`. [rule N6]
D21 · Naming Consistency · `userBITMAP` spells `BITMAP` where 419 names in the project spell it `Bitmap` · ×1
  • `userBITMAP` spells `BITMAP` where 419 names in the project spell it `Bitmap` crates/libs/windows/src/Windows/Win32/wtypes/mod.rs:414 — 419 of 420 names in project windows spell the token `Bitmap` (419 of 420; unit: names in project windows containing `Bitmap`). Peers: CoreDragOperation.SetDragUIContentFromSoftwareBitmap (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/DragDrop/Core/mod.rs:119); CoreDragOperation.SetDragUIContentFromSoftwareBitmapWithAnchorPoint (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/DragDrop/Core/mod.rs:126); CoreDragUIOverride.SetContentFromSoftwareBitmap (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/DragDrop/Core/mod.rs:225); CoreDragUIOverride.SetContentFromSoftwareBitmapWithAnchorPoint (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/DragDrop/Core/mod.rs:232); ICoreDragOperation_Vtbl.SetDragUIContentFromSoftwareBitmap (crates/libs/windows/src/Windows/ApplicationModel/DataTransfer/DragDrop/Core/mod.rs:356). Rename to `userBitmap`. [rule N6]
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.
P3 · Security & performance tooling · Dependabot does not watch nuget · ×1
  • Dependabot does not watch nuget REDACTED:2 — `REDACTED` schedules updates, but no `package-ecosystem` entry covers `nuget`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the `updates:` list.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
X7 · Silent fallback defaults · Silent fallback default on Err · ×1
  • Silent fallback default on Err crates/samples/reactor/calculator/src/main.rs:30 — `current` turns every `Err` into `0.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.
X9 · Subsumed condition operand · Subsumed condition operand · ×1
  • Subsumed condition operand crates/tests/libs/clang/tests/primary.rs:123 — `error.contains("Bridge")` can never decide this `&&` — every value satisfying `error.contains("OtherBridge")` also satisfies `error.contains("Bridge")`, so the `&&` chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.

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/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-bedcd18d31b84cb9882ec14886262171/history.json --exit-code 0 --source .0—
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/canine-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 .3artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnone (dependency manifest found, not scanned for vulnerabilities here)—none (dependency manifest found, not scanned for vulnerabilities here): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).0—
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
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.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.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 Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-01944f15cf224142bb714f28fccc20660artifacts/raw/osv-scanner.json

Run 01a1daf2-34b8-7717-bbf7-4ce675e9e4b6 · 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